Malaysian Journal of Computer Science最新文献_第9页

LEVERAGING NEURAL NETWORK PHRASE EMBEDDING MODEL FOR QUERY REFORMULATION IN AD-HOC BIOMEDICAL INFORMATION RETRIEVAL 利用神经网络短语嵌入模型进行自组织生物医学信息检索中的查询重构

IF 0.6 4区计算机科学

Malaysian Journal of Computer Science Pub Date : 2021-04-30 DOI: 10.22452/mjcs.vol34no2.2

Bhopale P. Bhopale, Ashish Tiwari

{"title":"LEVERAGING NEURAL NETWORK PHRASE EMBEDDING MODEL FOR QUERY REFORMULATION IN AD-HOC BIOMEDICAL INFORMATION RETRIEVAL","authors":"Bhopale P. Bhopale, Ashish Tiwari","doi":"10.22452/mjcs.vol34no2.2","DOIUrl":"https://doi.org/10.22452/mjcs.vol34no2.2","url":null,"abstract":"This study presents a spark enhanced neural network phrase embedding model to leverage query representation for relevant biomedical literature retrieval. Information retrieval for clinical decision support demands high precision. In recent years, word embeddings have been evolved as a solution to such requirements. It represents vocabulary words in low-dimensional vectors in the context of their similar words; however, it is inadequate to deal with semantic phrases or multi-word units. Learning vector embeddings for phrases by maintaining word meanings is a challenging task. This study proposes a scalable phrase embedding technique to embed multi-word units into vector representations using a state-of-the-art word embedding technique, keeping both word and phrase in the same vectors space. It will enhance the effectiveness and efficiency of query language models by expanding unseen query terms and phrases for the semantically associated query terms. Embedding vectors are evaluated via a query expansion technique for ad-hoc retrieval task over two benchmark corpora viz. TREC-CDS 2014 collection with 733,138 PubMed articles and OHSUMED corpus having 348,566 articles collected from a Medline database. The results show that the proposed technique has significantly outperformed other state-of-the-art retrieval techniques","PeriodicalId":49894,"journal":{"name":"Malaysian Journal of Computer Science","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2021-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45037793","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

SOCIAL MEDIA ANALYTICS USING SENTIMENT AND CONTENT ANALYSES ON THE 2018 MALAYSIA’S GENERAL ELECTION 对2018年马来西亚大选进行情绪和内容分析的社交媒体分析

IF 0.6 4区计算机科学

Malaysian Journal of Computer Science Pub Date : 2021-04-30 DOI: 10.22452/mjcs.vol34no2.3

Vimala Balakrishnan, Mohammed Kaity, Hajar Abdul Rahim, Nazari Ismail

{"title":"SOCIAL MEDIA ANALYTICS USING SENTIMENT AND CONTENT ANALYSES ON THE 2018 MALAYSIA’S GENERAL ELECTION","authors":"Vimala Balakrishnan, Mohammed Kaity, Hajar Abdul Rahim, Nazari Ismail","doi":"10.22452/mjcs.vol34no2.3","DOIUrl":"https://doi.org/10.22452/mjcs.vol34no2.3","url":null,"abstract":"This study analysed the political use of Twitter during the 2018 Malaysian General Election (GE14), using sentiment and content analyses to examine the patterns in online communication among urban Malaysians. Specifically, Naive Bayes, Support Vector Machine and Random Forest were used for sentiment analysis for the English tweets, with the results compared against two vectorization approaches. Content analysis involving human experts was used for the Malay tweets. Top trending hashtags were used to fetch tweets from April 15, 2018 to May 14, 2018, resulting in a curated corpus of 190 224 tweets. Naïve Bayes used along with Word2Vec outperformed all the other models with an accuracy of 63.7%, 66.8% and 64.9% for pre-GE14, GE14 and post-GE14, respectively. Generally, results indicate the majority of the sentiments to be positive in nature, followed by negative and neutral during pre-GE14, GE14 day and post-GE14 for the English speakers. Though similar sentiments were observed for the Malay speakers, the majority of their sentiments on election day were negative (i.e. 42%) as opposed to the English speakers (i.e. 31%).","PeriodicalId":49894,"journal":{"name":"Malaysian Journal of Computer Science","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2021-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48439985","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

COMPREHENSION OF LINKED LIST DIAGRAMS: THE EFFECTS ON CODE WRITING SKILLS 对链表图的理解:对代码编写技能的影响

IF 0.6 4区计算机科学

Malaysian Journal of Computer Science Pub Date : 2021-04-30 DOI: 10.22452/mjcs.vol34no2.5

U. Obaidellah, Aznul Qalid Md Sabri, Erma Rahayu Mohd Faizal, Yin Kia Chiam

{"title":"COMPREHENSION OF LINKED LIST DIAGRAMS: THE EFFECTS ON CODE WRITING SKILLS","authors":"U. Obaidellah, Aznul Qalid Md Sabri, Erma Rahayu Mohd Faizal, Yin Kia Chiam","doi":"10.22452/mjcs.vol34no2.5","DOIUrl":"https://doi.org/10.22452/mjcs.vol34no2.5","url":null,"abstract":"The use of graphics has a tendency to aid reasoning in program solving by improving novice programmers’ ability to read and write code. This study extends existing work in computer programming on the use of diagrammatic representation for students undertaking the fundamental data structure course (CS2) in Malaysia. Students were tested on comprehension of diagrams followed by the composition of code with respect to the linked list topic. The data was assessed using the inter-rater agreement test and showed a high degree of consistent ratings. Results showed a moderate correlation between students’ ability to analyze list operations in the form of notation and performance on code writing. Students assessed the diagrams differently according to the complexity level. The result can be generalized to conclude that the use of diagrams alone may not fully support reasoning and program solving. However, some types of diagrams are potentially more effective to support code composition and more emphasis should be given to evaluating the effectiveness of diagrams in organizing cues to facilitate novice programmers in program solving. Further investigation on a combination of activities related to comprehension of diagrams, including code reading and explanation prior to code writing, is recommended.","PeriodicalId":49894,"journal":{"name":"Malaysian Journal of Computer Science","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2021-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44732200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

FUZZY ADAPTIVE WHALE OPTIMIZATION ALGORITHM FOR NUMERIC OPTIMIZATION 模糊自适应鲸鱼优化算法的数值优化

IF 0.6 4区计算机科学

Malaysian Journal of Computer Science Pub Date : 2021-04-30 DOI: 10.22452/mjcs.vol34no2.4

Ersin Kaya, Alper Kılıç, Ismail Babaoglu, A. Babalık

{"title":"FUZZY ADAPTIVE WHALE OPTIMIZATION ALGORITHM FOR NUMERIC OPTIMIZATION","authors":"Ersin Kaya, Alper Kılıç, Ismail Babaoglu, A. Babalık","doi":"10.22452/mjcs.vol34no2.4","DOIUrl":"https://doi.org/10.22452/mjcs.vol34no2.4","url":null,"abstract":"Meta-heuristic approaches are used as a powerful tool for solving numeric optimization problems. Since these problems are deeply concerned with their diversified characteristics, investigation of the utilization of algorithms is significant for the researchers. Whale optimization algorithm (WOA) is one of the novel meta-heuristic algorithms employed for solving numeric optimization problems. WOA deals with exploitation and exploration of the search space in three stages, and in every stage, all dimensions of the candidate solutions are updated. The drawback of this update scheme is to lead the convergence of the algorithm to stack. Some known meta-heuristic approaches treat this issue by updating one or a predetermined number of dimensions in their update scheme. To improve the exploitation behavior of WOA, a fuzzy logic controller (FLC) based adaptive WOA (FAWOA) is suggested in this study. An FLC realizes the update scheme of WOA, and the proposed FLC determines the rate of the change in terms of dimension. The suggested FAWOA is evaluated using 23 well-known benchmark problems and compared with some other meta-heuristic approaches. Considering the benchmark problems, FAWOA achieves best results on 11 problem and only differential evaluation algorithm achieve best results on 10 problems. The rest of the algorithms couldn’t achieve the best results on not more than 5 problems. Besides, according to the Friedman and average ranking tests, FAWOA is the first ranked algorithm for solving the benchmark problems. Evaluation results show that the suggested FAWOA approach outperforms the other algorithms as well as the WOA in most of the benchmark problems.","PeriodicalId":49894,"journal":{"name":"Malaysian Journal of Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2021-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68662629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

SEMI-FRAGILE WATERMARKING SCHEME FOR RELATIONAL DATABASE TAMPER DETECTION 用于关系数据库篡改检测的半脆弱水印方案

IF 0.6 4区计算机科学

Malaysian Journal of Computer Science Pub Date : 2021-01-31 DOI: 10.22452/mjcs.vol34no1.1

Saeed Arif Shah, Imran Ali Khan, Syed Zaki Hassan Kazmi, Fariza Hanum Binti Md Nasaruddin

{"title":"SEMI-FRAGILE WATERMARKING SCHEME FOR RELATIONAL DATABASE TAMPER DETECTION","authors":"Saeed Arif Shah, Imran Ali Khan, Syed Zaki Hassan Kazmi, Fariza Hanum Binti Md Nasaruddin","doi":"10.22452/mjcs.vol34no1.1","DOIUrl":"https://doi.org/10.22452/mjcs.vol34no1.1","url":null,"abstract":"Most of data over the Internet today is hosted on outsourced third-party servers which are not trusted. Sometimes data is to be distributed to other organizations or individuals for pre-agreed use. In both of these scenarios data is susceptible to malicious tampering so there is a need for some mechanism to verify database integrity. Moreover, the authentication process should be able to differentiate between valid updates and malicious modifications. In this paper, we present a novel semi-fragile watermarking scheme for relational database integrity verification. Besides detection and localization of database tampering, the proposed scheme allows modifications to the data that need periodic updates, without requiring re-watermarking. Watermark embedding is distortion free, as it is done by adjusting the text case of selected data values resulting in retention of semantic meaning of data. Additionally, group-based embedding ensures the localization of tampering up to group level. We implemented a proof of concept application of our watermarking technique. Theoretical analysis and experiments show that even a single value modification can be detected with very high probability besides detection of attacks like tuple insertion and tuple deletion.","PeriodicalId":49894,"journal":{"name":"Malaysian Journal of Computer Science","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2021-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44176465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

CAN MUSIC LIKES IN FACEBOOK DETERMINE YOUR PERSONALITY? FACEBOOK上的音乐点赞能决定你的个性吗？

IF 0.6 4区计算机科学

Malaysian Journal of Computer Science Pub Date : 2021-01-31 DOI: 10.22452/mjcs.vol34no1.4

Kala Devi Managuran, Kasturi Dewi Varathan, Mohammad Ali Derhem Al-Garadi

引用次数: 1

IMPROVED ANTLION OPTIMIZATION ALGORITHM FOR QUADRATIC ASSIGNMENT PROBLEM 二次分配问题的改进antlion优化算法

IF 0.6 4区计算机科学

Malaysian Journal of Computer Science Pub Date : 2021-01-31 DOI: 10.22452/mjcs.vol34no1.3

Haydar Kiliç, Ugur Y Yuzgec

{"title":"IMPROVED ANTLION OPTIMIZATION ALGORITHM FOR QUADRATIC ASSIGNMENT PROBLEM","authors":"Haydar Kiliç, Ugur Y Yuzgec","doi":"10.22452/mjcs.vol34no1.3","DOIUrl":"https://doi.org/10.22452/mjcs.vol34no1.3","url":null,"abstract":"The Antlion Optimization (ALO) algorithm is a meta-heuristic optimization algorithm based on the hunting of ants by antlions. The basic inadequacy of this algorithm is that it has long run time because of the random walk model used for the ant's movement. We improved some mechanisms in ALO algorithm, such as ants' random walking, reproduction, sliding ants towards antlion, elitism, and selection procedure. This proposed algorithm is called Improved Antlion Optimization (IALO) algorithm. To show the performance of the proposed IALO algorithm, we used different measurement metrics, such as mean best, standard deviation, optimality, accuracy, CPU time, and number of function evaluations (NFE). The proposed IALO algorithm was tested for different benchmark test functions taken from the literature. There are no studies regarding time analysis of ALO algorithm found in the literature. This study firstly aims to demonstrate the success of the proposed IALO algorithm especially in runtime analysis. Secondly, the IALO algorithm was also applied to the Quadratic Assignment Problem (QAP) known as a difficult combinatorial optimization problem. In QAP tests, the performance of the IALO algorithm was compared with the performances of the classic ALO algorithm and 14 well-known and recent meta-heuristic algorithms. The results of the benchmark test functions show that IALO algorithm is able to provide very competitive results in terms of mean best/standard deviation, optimality, accuracy, CPU time and NFE metrics. The CPU time results prove that IALO algorithm is faster than the classic ALO algorithm. As a result of the QAP tests, the proposed IALO algorithm has the best performance according to the mean cost, worst cost and standard deviation. The source codes of QAP with the proposed IALO algorithm are publicly available at https://github.com/uguryuzgec/QAP-with-IALO.","PeriodicalId":49894,"journal":{"name":"Malaysian Journal of Computer Science","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2021-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45761129","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

GLOBAL SOFTWARE DEVELOPMENT: A REVIEW OF ITS PRACTICES 全球软件开发实践综述

IF 0.6 4区计算机科学

Malaysian Journal of Computer Science Pub Date : 2021-01-31 DOI: 10.22452/mjcs.vol34no1.5

Naveed Ali, R. Lai

{"title":"GLOBAL SOFTWARE DEVELOPMENT: A REVIEW OF ITS PRACTICES","authors":"Naveed Ali, R. Lai","doi":"10.22452/mjcs.vol34no1.5","DOIUrl":"https://doi.org/10.22452/mjcs.vol34no1.5","url":null,"abstract":"Global Software Development (GSD) is multi-site software development with software teams scattered across different places around the world. To gain the benefits of the lower cost of software development and access to international talents, many organizations are using GSD. However, earlier studies reported that achieving these benefits can be difficult and GSD involves risks. This paper presents a systematic review of GSD and aim to provide the findings about the current practices, benefits, associated risks, and difficulties associated with it.The review was conducted in accordance with the systematic review procedures and processes defined by Kitchenham. By following these guidelines, six digital libraries to gather information on the prevalent trends and practices in GSD were searched. The outcomes presented in this study are based on 204 studies, published in peer-reviewed conferences and journals. Our findings will enable readers to understand the current practices, benefits, risks and difficulties associated with GSD. As a result, they can form realistic expectations before making a decision to engage in GSD or not, and formulate better pre-contract and post-contract planning in order to increase the chances of project success. A merit of this paper as compared to previous survey papers on GSD is that it reports the issues related to cultural diversity, requirements engineering and software architecture.","PeriodicalId":49894,"journal":{"name":"Malaysian Journal of Computer Science","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2021-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43867093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

AN APPROACH AND A TOOL FOR MERGING A SET OF MODELS IN PAIRWISE WAY 一种以成对方式合并一组模型的方法和工具

IF 0.6 4区计算机科学

Malaysian Journal of Computer Science Pub Date : 2021-01-31 DOI: 10.22452/mjcs.vol34no1.2

Mohammed Boubakir, A. Chaoui

{"title":"AN APPROACH AND A TOOL FOR MERGING A SET OF MODELS IN PAIRWISE WAY","authors":"Mohammed Boubakir, A. Chaoui","doi":"10.22452/mjcs.vol34no1.2","DOIUrl":"https://doi.org/10.22452/mjcs.vol34no1.2","url":null,"abstract":"Model merging addresses the problem of combining information from a set of models into a single one. This task is considered to be an important step in various software engineering practices. When many (more than two) models need to be merged, the most practiced technique is to perform the merge in a pairwise way, without considering the order of merging. The problem with this technique is that the resulting quality is not guaranteed because it is influenced by such an order. In this paper, we propose a pairwise approach for model merging aiming to provide better results by taking into account the order of merging. This approach proposes to combine models in an iterative process until obtaining only one model. At each iteration, we first compare each pair of models in order to measure the similarity between them and to identify the correspondences between their component elements. This is performed using two heuristic-based operators respectively named compare and match. After that, we identify the most similar pairs of models and merge them using a proposed operator. We have implemented our approach as tool support called 3M and evaluated it on a set of case studies.","PeriodicalId":49894,"journal":{"name":"Malaysian Journal of Computer Science","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2021-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42910914","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

AREA BASED EFFICIENT AND FLEXIBLE DEMAND SIDE MANAGEMENT TO REDUCE POWER AND ENERGY USING EVOLUTIONARY ALGORITHMS 基于区域的高效灵活的需求侧管理，使用进化算法减少电力和能源

IF 0.6 4区计算机科学

Malaysian Journal of Computer Science Pub Date : 2020-11-27 DOI: 10.22452/mjcs.sp2020no1.5

K. S. Kumar, B. P. Esther, V. Indrgandhi, S. Sudhakar, Logesh Ravi, V. Subramaniyaswamy

{"title":"AREA BASED EFFICIENT AND FLEXIBLE DEMAND SIDE MANAGEMENT TO REDUCE POWER AND ENERGY USING EVOLUTIONARY ALGORITHMS","authors":"K. S. Kumar, B. P. Esther, V. Indrgandhi, S. Sudhakar, Logesh Ravi, V. Subramaniyaswamy","doi":"10.22452/mjcs.sp2020no1.5","DOIUrl":"https://doi.org/10.22452/mjcs.sp2020no1.5","url":null,"abstract":"Evolutionary algorithms are stochastic that reflects the biological evolution to reach optimal solutions to optimization problems where mathematical techniques may fail. Demand Side Management (DSM) are designed to reduce electricity consumption or to shift the consumption from peak to off – peak hours depending on consumers’ lifestyle and behaviour. DSM is a flexible consumer driven activity in which the consumer has voluntarily changed his energy usage pattern during peak demand so to maintain the reliability and stability of power system and the performance of an electrical grid. In this aspect we have explored the impact of an efficient and flexible DSM which can reduce the power demand and energy in different areas like rural, urban and villa there by utilizing the device power rating and its activation time. The defined problem was solved with evolutionary based – genetic (GA), particle swarm (PSO) and differential evolution (DE) optimization algorithms. Simulation results show the better outcome in terms of power demand and energy reduction and the results are compared to know the better performing algorithm as on applied to DSM.","PeriodicalId":49894,"journal":{"name":"Malaysian Journal of Computer Science","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2020-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49222627","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0