Norfaradilla Wahid

Indoor Navigation Using A* Algorithm

This paper introduced an indoor navigation application that helps junior students in Faculty of Computer Science and Information Technology (FSKTM) to find their classroom location. This project implements the A* (pronounced A Star) path finding algorithm to calculate the shortest path for users. Users can choose to view the floor plan of the building or start navigation. Users can choose their starting point from the list and set their destination to start navigation. The application is then calculate the shortest path for users by implement the A* algorithm. The route path will show on the floor plan after calculation done. Thus, users will find this project is easy to use and time saving.

XSDyM: An XML graphical conceptual model for static and dynamic constraints

Abstract Data modelling is not only important to visualise the structural schema of data, but also to show the intended integrity constraints. In this paper, we propose a modelling approach called XML Static Dynamic Modelling (XSDyM). While a text-based schema definition is often the most common method used to describe XML, graphical modelling is more accepted as it is capable of visualising the schema definition more effectively for the reader. Conveying the dynamic constraints on XML graphical model requires a special treatment as the constraints basically comprehend the state transitions. It is important for an XML modelling to keep the basis as precise as possible to satisfy the nature of XML and at the same time be able to represent the constraints in an effective way. Using the XML tree-based modelling as the basis of the work, we proposed our own approach to convey the state transitions of the constraints, where it is inspired from the well-known state diagram and adopt some useful features of ORM modelling. We evaluate the correctness of our proposed modelling using a model which involves the checking of model transformations between the modelling and the equivalent XML schema languages.

Single Transition Constraint for XML Update Validation

In this paper, we propose a checking algorithm for dynamic constraint validation during XML updates. Our algorithm is targeted at single transition constraint, which is affected by single node updating. To the best of our knowledge, almost all constraints that have been preserved in the previous XML updates works are for static constraints. On the other hand, dynamic constraints restrict the transition of data from a current state into a new state. The operations that can affect these constraints involve node replacement, value of element and attribute replacement, and insert-delete pairing operations of nodes and their values. We propose a lightweight XML file to store only required data for the validation, i.e. states that need to be changed are extracted from XQuery and original XML documents. For experimentation purposes, we apply the algorithm in Java platform with the support of Schematron for the dynamic constraint and BaseX for parsing XQuery statements. The analysis shows our algorithm performs in cubic growth while still in polynomial efficiency. Nevertheless, our proposed dynamic constraint file is not minimal enough if the query involves indirect states transitions caused by sub queries. We would like to continue and extend the work with more types of dynamic constraint.

XML semantic constraint validation for XML updates: A survey

XML databases are commonly used for representing data with more complex structures than traditional relational data. Like in any data model, it is very important to ensure that the contents of the database always valid even after any attempt of updates. XML Updates validation is a process of checking the correctness of XML documents, in terms of satisfying their constraints, after updates operations. The validation can be generally categorized into structural and semantic validation. The first validation is to ensure that all XML nodes in the documents conform to structural information in its associated schema. Meanwhile, the second validation checks the integrity constraints of the documents, and it involve various factors such as the functional dependencies, domain constraint, inheritance, etc. In this paper, we provide a preliminary survey of semantic validation w.r.t XML Updates. The work of validation usually applied either upon any attempt of updates or in a scheduled period. We compare the output gain by works in terms of operation of update, the composition, types of constraint, etc. It shows that even though there are abundant of studies in this area, not much work has investigated a complete semantic validation of different semantic constraints. The constraints are still strongly dependent on structural information of documents and lied only on the data access tier of application architecture.

Code Clone Detection Using String Based Tree Matching Technique

Code cloning have been an issue in these few years as the number of available web application and stand alone software increase nowadays. The major consequences of cloning is that it would risk the maintenance process as there are many duplicated codes in the systems that practically increase the complexity of the system. There are many code clone detection techniques that can be found nowadays which generally can be group into string based, token based. tree based and semantic based. The aim of this project is to find out the possibility of using a technique of ontology mapping technique to solve the problem, but we are not using the real ontology for the clone detection. It has been prove that there is the possibility as it manages to detect clone code. In this thesis the clone detection is using two layers of detection: i.e. structural similarity and string based similarity. The structural similarity is by using subgraph miner where it capable to get the similar subtree between different files. And then we extract all elements of that particular subtree and treat the elements as a string. Two strings from different files then applied with similarity metric to know whether it is a clone pair. From the experimental result we found that the system is language independent but the result is good in precision but not so good recall. It is also capable to detect two main types of clone. i.e identical clones and similar clones.

Protecting Cumulative Node Constraint during XML Update

In this paper, we propose a method of preserving cumulative node constraints, which are derived from business rules such as policies during XML update. To handle the constraints, we treat the collection of nodes as objects that have to be preserved. For any triggered update query, the query will be processed into a query object. And then, we use an object distance algorithm to carry out a validation process to compare the constraint object and the query object. To support the experimentation, we utilize Schematron as the language to convey the constraints. Lastly, we show evaluation of our algorithm on different sizes of data and analyse the performance of the algorithm in terms of the validation quality.

Improving Consumers’ Value and Satisfaction Towards Recreational Facilities Through Apps

Consumers’ value and satisfaction is an important issue that must be address by any service provider as well as product makers. As society rapidly developed, the demand to fulfill people’s satisfaction is increasing in all life-centered activities. For example, people are putting demands for quality outdoor activities within their limited quantity of time which constrained by their work requisition, etc. In this paper, we show that consumer’s satisfaction can be improved by up to 40% as compared to the result from the pre-survey by the help of technological support, i.e., mobile apps. We support the study by introducing ZoomApp, i.e., a navigational apps for Malacca Zoo to see its effectiveness for the visitors in accessing the facilities as well as every important points in the zoo.

Analysis of Naïve Bayes Algorithm for Email Spam Filtering across Multiple Datasets

E-mail spam continues to become a problem on the Internet. Spammed e-mail may contain many copies of the same message, commercial advertisement or other irrelevant posts like pornographic content. In previous research, different filtering techniques are used to detect these e-mails such as using Random Forest, Naive Bayesian, Support Vector Machine (SVM) and Neutral Network. In this research, we test Naive Bayes algorithm for e-mail spam filtering on two datasets and test its performance, i.e., Spam Data and SPAMBASE datasets [8]. The performance of the datasets is evaluated based on their accuracy, recall, precision and F-measure. Our research use WEKA tool for the evaluation of Naive Bayes algorithm for e-mail spam filtering on both datasets. The result shows that the type of email and the number of instances of the dataset has an influence towards the performance of Naive Bayes.

Android-Based smart langkawi tourism

Langkawi is one of the most popular tourist destinations in Malaysia, with over 2.5 million tourists visit the island per year. To explore the entire treasure and uniqueness of the island through the easiest way and shortest time, an android-based application is specially built based on the tourism information about Langkawi. Smart Langkawi Tourism is a free download application available in PlayStore and AppStore for Android and IOS users who want to know more about Langkawi or plan to travel to the beautiful island. The application helps tourists in planning their travel itinerary systematically. The auto schedule planner function provides suggestions on trip ideas to users based on their duration of whole trip and preferred activities. As directions and maps are important for tourists to reach destinations, the application incorporates all functions required by tourists to have a restful, worry-free vacation. Besides, the application is also equipped with complete information about Langkawi which includes recommended hotspots, maps and suggestion of activities. Since not all smart phone users can afford a premium data plan with Internet connection at all times, this application also provides offline information and maps to smoothen the whole running of trip. The waterfall model is chosen because it is a highly organised approach which requires documentation with clear project objectives and stable project requirements. The unit of Information Technology of KDTC (Kedah Digital Transformation Centre) has been given the opportunity to enhance the functionality of the application and thus delivering a huge advantage to tourists who use it. Eventually, this project is seen to contribute to the rapid growth of Langkawi tourism industry.

Preserving Dynamic XML Keys

XML has becoming more popular in the recent years especially as a promising data format, e.g., in the web data. In conjunction with that, preserving XML constraints w.r.t. also becoming more important especially for the XML Update, as the requirements to have a data that is always valid with regards to any updates are compulsory. This paper will describe the XML key, particularly to introduce the constraint in the dynamic point of view. At the end of the paper, we will show a method to express the constraint for XML as well as the proposed algorithm for XML Update Validation.