Wednesday, April 25, 2018
   
Text Size
Login

Forthcoming Articles

These articles have been peer-reviewed and accepted for publication in JICT, but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the JICT standard. Additionally, titles, authors, abstracts and keywords may change before publication.


HYBRID CAT SWARM OPTIMIZATION AND SIMULATED ANNEALING FOR DYNAMIC TASK SCHEDULING ON CLOUD COMPUTING ENVIRONMENT
Danlami Gabi, Abdul Samad Ismail, Anazida Zainal, Zalmiyah Zakaria & Ahmad Al-Khasawneh

NEW KEY EXPANSION FUNCTION OF RIJNDAEL 128-BIT RESISTANCE TO THE RELATED-KEY ATTACKS
Hassan Mansour Hussien, Zaiton Muda, and Sharifah Md Yasin

A FORMALIZATION OF USE CASE SCENARIO INTO VDM++ FORMAL SPECIFICATION
Swee Yin Wong, Edwin Mit & Jonathan Sidi

KNOWLEDGE INTEGRATION AMONG FLOOD DISASTER MANAGEMENT TEAM: LESSONS FROM THE KEMAMAN DISTRICT
Nor Hidayati Zakaria, Mohammad Nazir Ahmad, Mohd Saiful Anuar Mohd Noor & Mazida Ahmad

VIBRANT SEARCH MECHANISM FOR NUMERICAL OPTIMIZATION FUNCTIONS
Moh’d Khaled Yousef Shambour

PROPOSITION OF A NEW ONTOLOGY-BASED P2P SYSTEM FOR SEMANTIC INTEGRATION OF HETEROGENEOUS DATA SOURCES
Naïma Souâd Ougouti, Hafida Belbachir & Youssef Amghar

DEFINING AND PRIORITIZING SOFTWARE REQUIREMENT USING GIBIS AND AHP METHOD
Falahah



HYBRID CAT SWARM OPTIMIZATION AND SIMULATED ANNEALING FOR DYNAMIC TASK SCHEDULING ON CLOUD COMPUTING ENVIRONMENT
1&2Danlami Gabi, 1Abdul Samad Ismail, 1Anazida Zainal, 1Zalmiyah Zakaria &  3Ahmad Al-Khasawneh
1Department of Computer Science, Faculty of Computing, Universiti Teknologi, Malaysia,81310 Skudai, Johor, Malaysia
1&2Department of Computer Science, Faculty of Science, Kebbi State University of Science and Technology, Aliero, Nigeria
3Department of Computer and Information Systems, Faculty of Prince Al-Hussein bin Abdullah II of Information Technology, Hashemite University, Jordan, Zarqa
gabsonley@gmail.com; abdsamad@utm.my; anazida@gmail.com; zalmiyah@utm.my; akhasawneh@hu.edu.jo

ABSTRACT
The unpredictable number of task arriving at cloud datacentre and rescaling of virtual processing elements can affect the provisioning of better Quality of Service (QoS) expectations during task scheduling in cloud computing environment. Existing authors have contributed several task scheduling algorithms to provide better QoS expectations at the expense of scalability. Dynamic task scheduling algorithm that can adjust to long-time changes and continue facilitating the provisioning of better QoS are necessary for cloud computing environment. In this study, a Cloud Scalable Multi-Objective Cat Swarm Optimization (CSO) based Simulated Annealing (SA) (CSM-CSOSA) algorithm is proposed. In the proposed method, the orthogonal Taguchi approach is used to enhance the SA which is incorporated into the local search of the proposed CSM-CSOSA algorithm for scalability performance. A multi-objective QoS model based on execution time and execution cost criteria is presented to evaluate the effectiveness of the proposed algorithm on CloudSim tool with two different datasets. Quantitative analysis of the algorithm is carried out with metrics of execution time, execution cost, QoS and performance improvement rate percentage. Where the scalability analysis of the proposed algorithm using Isospeed-efficiency scalability metric is also reported.  The results of the experiment show that the proposed CSM-CSOSA outperformed Multi-Objective Genetic Algorithm (MOGA), Multi-Objective Ant Colony (MOSACO) and Multi-Objective Particle Swarm Optimization (MOPSO) by returning minimum execution time and execution cost as well as better scalability acceptance rate of 0.4811−0.8990 respectively.  The proposed algorithm is therefore recommended for large task scheduling for cloud computing environment.

Keywords: Cloud computing, multi-objective optimization, task scheduling, cat swarm optimization, simulated annealing.



NEW KEY EXPANSION FUNCTION OF RIJNDAEL 128-BIT RESISTANCE TO THE RELATED-KEY ATTACKS
Hassan Mansour Hussien, Zaiton Muda, and Sharifah Md Yasin
Computer Science Department,
Faculty of Computer Science and Information Technology,
Universiti Putra Malaysia
hassanalobady@gmail.com; zaitonm@upm.edu.my: ifah@upm.edu.my

ABSTRACT
In most block ciphers, a master key of special length is manipulated to create round sub-keys. This manipulation is known as the key schedule. A strong key schedule means that a cipher will be more resistant to various forms of attacks especially in related-key model attacks. Rijndael is the most common block cipher which adopted by the National Institute of Standards and Technology (NIST), USA in 2001 as an Advance Encryption Standard (AES). Some cryptanalysis studies revealed that a security weakness of Rijndael is its vulnerability to related-key differential attack and the related-key boomerang attack. This is mainly due to the lack of nonlinearity in the key schedule of Rijndael. Constructing a key schedule that is both efficient and provably secure has been an open problem for a long time. This article presents a method to improve the key schedule of Rijndael 128-bit in order to make it resist to the related-key differential and boomerang attacks. Two statistical tests, the Frequency test and the Strict Avalanche Criterion (SAC) test are used to evaluate the bit confusion and the bit diffusion properties, respectively. The results show that the proposed key expansion function has excellent statistical properties and agrees with the concept of Shannon's diffusion and confusion bits. To evaluate the resistance of the proposed approach to the related-key differential and boomerang attacks, the MILP-based approach is used. The proposed approach is also resistant against these two attacks found in the original Rijndael. These results prove that the proposed approach performs better than the original Rijndael key expansion function and that of previous research.

Keywords: Confusion, diffusion, key expansion function, related-key attacks, Rijndael.


 
A FORMALIZATION OF USE CASE SCENARIO INTO VDM++ FORMAL SPECIFICATION
Swee Yin Wong, Edwin Mit & Jonathan Sidi
Faculty Computer Science and Information Technology
Universiti Malaysia Sarawak
cyinwsy@gmail.com;edwin@unimas.my;jonathan@unimas.my

ABSTRACT
An economic and reliable software model can be achieved through the integration of easy and economic object model with formal specification. However, natural language used in use case scenario is being recognized as inconsistent, incomplete, and inherently ambiguous. The ambiguity of natural language causes the incorrect analysis and design model. In order to deal with the ambiguous use case scenario and produce an economic and reliable software model; this paper aims to present the formalization of use case scenario into one of the formal specification languages that is VDM++ formal specification. Yet, there are syntax and semantic formalism gaps between them. This paper presents a software architecture which integrates a set of mapping rules, a set of restriction rules, and a use case template for formalizing use case into the VDM++ formal specification. Formal validation is done on the generated VDM++ formal specification via VDM++ support tool. A prototype has been developed to prove the whole architecture concept. The major outcome are the refinement of template, restriction rules and mapping rules which have been defined, at the same time, an algorithm of the prototype which have been also developed in order to produce correct VDM++ formal specification. This paper also presents the evaluation and discussion of the mapping rules, the restriction rules, and the use case template.

Keywords: Formal specification, mapping rules, restriction rules, use case scenario, VDM++



KNOWLEDGE INTEGRATION AMONG FLOOD DISASTER MANAGEMENT TEAM: LESSONS FROM THE KEMAMAN DISTRICT
Nor Hidayati Zakaria, Mohammad Nazir Ahmad, Mohd Saiful Anuar Mohd Noor & Mazida Ahmad
Faculty of Computing, Universiti Teknologi Malaysia, Malaysia
Institute of Visual Informatics, Universiti Kebangsaan Malaysia, Malaysia
Kemaman District Office, Terengganu, Malaysia
School of Computing, Universiti Utara Malaysia, Malaysia
hidayati@utm.my; mnazirivi@ukm.edu.my; mazida@uum.edu.my


ABSTRACT
Although flooding is a common disaster event in Malaysia, issues such as information and knowledge integration still have yet to be resolved. Flood management operations seem to be handled in an ad-hoc manner comprising issues such as; miscommunication; lack of common understanding during coordination practices; and lack of smooth mutual agreement among flood management agencies. This paper discusses the flood knowledge integration measures that have been applied by the flood management team for Kemaman District, Terengganu, Malaysia. The Kemaman District was announced to be the first district to achieve a Gold Standard award for flood disaster management. Thus, this study comprises a qualitative research method using a variety of techniques. These include a case study approach performed by interviewing key informants as well as studying archival documents. In addition, site visits were made to flood location areas in order to better understand the district’s flood management team’s achievement. The result of knowledge integration practice in preliminary, actual and post-flood phases is discussed in this research. This study shows the importance of knowledge integration as a successful factor for the district’s flood management plan.

Keywords: Disaster management, flood disaster, flood management, knowledge.



VIBRANT SEARCH MECHANISM FOR NUMERICAL OPTIMIZATION FUNCTIONS
Moh’d Khaled Yousef Shambour
The Custodian of the Two Holy Mosques Institute for Hajj and Umrah Research 
Umm Al-Qura University, Makkah, Saudi Arabia
myshambour@uqu.edu.sa

ABSTRACT
The search strategies of optimization algorithms are significantly affected by the size of search space. This paper investigated a new heuristic technique to enhance the algorithm’s search abilities through focusing on certain search spaces during algorithm iterations. A heuristic search mechanism is employed with the ability to scan the entire space before determining the desired segment of the search space in order to begin the process. The proposed method randomly updates the desired segment by monitoring the algorithm search performance on different search space divisions. Harmony search algorithm (HSA) was used to experiment the effectiveness of the proposed technique. Several types of benchmark optimization functions were used to examine the performance of this mechanism, then the results were compared with two variants of HSA, in addition to the classic version of HSA. The exploration results show the ability of the proposed technique to orient the search mechanism towards the desired segments during algorithm iterations.  The experimental results demonstrate that the proposed technique achieves the best results in 80% and 33.3% of total experimental cases for shifted and non-shifted functions in 30 problem dimensions, whereas 100% and 25% of the best results are reported for shifted and non-shifted functions in 100 problem dimensions.

Keywords: Optimization algorithms, search space, heuristic search, benchmark functions, harmony search algorithm.



PROPOSITION OF A NEW ONTOLOGY-BASED P2P SYSTEM FOR SEMANTIC INTEGRATION OF HETEROGENEOUS DATA SOURCES
Naïma Souâd Ougouti, Hafida Belbachir & Youssef Amghar
Université des sciences et de la technologie d' Oran-Mohamed Boudiaf (USTO-MB)
LIRIS UMR 5205, Insa of Lyon,
s_ougouti@yahoo.fr; h_belbach@yahoo.fr; youssef.amghar@insa-lyon.fr

ABSTRACT
Nowadays, semantic web offers new opportunities to multi-sources integration field  and many approaches like P2P systems are revisited taking into account the new requirements. In this paper, we present our P2P heterogeneous and distributed data integration system. It is a Super-Peer system, where peers are regrouped by type of data (relational, image, text,..) around a super-peer which contains a domain ontology.  Peers data sources are exported in a common format in the form of a semantically rich ontology.  Schemas reconciliation is done by matching domain and local ontologies by the use of a similarity function whose contribution is based on the direct and indirect semantic neighborhood. Queries are described using ontologies, then routed towards relevant peers thanks to a semantic topology built on top of the existing physical one.

Keywords: Data integration , peer-to-peer networks,  ontologies,  semantic web.



DEFINING AND PRIORITIZING SOFTWARE REQUIREMENT USING GIBIS AND AHP METHOD
Falahah
Informatics Department 
Widyatama University, Indonesia
falahah@widyatama.ac.id

ABSTRACT
Requirement engineering is an important process in a software development project. During the process, two significant activities determine the success of software development: requirement definition and requirement prioritization. Through these processes, we can set the scope of the software product and the limitation of the product features for each released version. Defining and prioritizing requirements can be performed using the same approach. gIBIS (graphical Issue-Based Information System) is the proposed approach for the design rationale to describe the reasoning process for the solution that is chosen in order to answer problems or issues. The graphical representation of the reasoning process using gIBIS can be supported by a tool such as the Compendium (Shum, Sierhuis, Park, & Brown, 2010). This paper proposes the implementation of the gIBIS approach in defining software requirements by assigning a score for each alternative and selecting the highest score as a solution. The approach is combined with the AHP (Analytical Hierarchical Process) method to set the priority. As a result, we can determine the software requirements and rank the requirements based on its priority. The criteria that are used in setting the priority include cost, risk, difficulty, and stability. The proposed approach (combining of gIBIS with AHP) is demonstrated with a case study of prioritizing requirements for the website development of "IndoSoccerSchool". The result shows that the proposed approach can help us generate a list of requirements and give them a score based on priority; and the list can give a reference for developing the software based on credible priorities and then it can manage the software release.

Keywords: Requirement engineering, gIBIS, AHP, priority.

Universiti Utara Malaysia Press
 Universiti Utara Malaysia, 06010 UUM Sintok
Kedah Darul Aman, MALAYSIA
Phone: +604-928 4816, Fax : +604-928 4792

All Right Reserved. Copyright © 2010, Universiti Utara Malaysia Press