Proceedings of the 2020 9th International Conference on Software and Computer Applications最新文献

筛选
英文 中文
A False Negative Cost Minimization Ensemble Methods for Customer Churn Analysis 客户流失分析的假负成本最小化集成方法
Wong Keng Tuck, Chien-Le Goh, Ng Hu
{"title":"A False Negative Cost Minimization Ensemble Methods for Customer Churn Analysis","authors":"Wong Keng Tuck, Chien-Le Goh, Ng Hu","doi":"10.1145/3384544.3384551","DOIUrl":"https://doi.org/10.1145/3384544.3384551","url":null,"abstract":"The primary objective of this research is to develop hybrid decision tree induction methods based on the decision tree C4.5 algorithm and ensemble methods, taking into account cost-sensitivity for the purpose of minimizing either misclassification cost, false negative cost or false positive cost. This paper proposed two cost-sensitive learning methods by modifying the model weight of AdaBoost.M1 for churn analysis in the telecommunication industry. Method 1 applies the ratio of false negative cost over true negative cost to make the weight of false negative heavier than the weight of false positive. While Method 2 combines error rate weighting with false negative cost weighting in order to let examples have heavier weight values for future training in the next learning cycle. The proposed methods have been evaluated with a series of experiments to prove its ability to reduce either false negative cost or misclassification costs. Microsoft Azure Machine Learning Telco Customer Churn and IBM Watson Studio Telecommunication Customer Churn datasets, which include the cost value for each instance, are used for the experiments. The proposed Method 1 able to obtain the lowest false negative cost comparing with the original AdaBoost.M1.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129328078","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Adopting Jaya Algorithm for Team Formation Problem 采用Jaya算法求解队形问题
Md. Abdul Kader, K. Z. Zamli
{"title":"Adopting Jaya Algorithm for Team Formation Problem","authors":"Md. Abdul Kader, K. Z. Zamli","doi":"10.1145/3384544.3384593","DOIUrl":"https://doi.org/10.1145/3384544.3384593","url":null,"abstract":"This paper presents a simple and mighty metaheuristic algorithm, Jaya, which is applied to solve the team formation (TF) problem and it is a very fundamental problem in many databases and expert collaboration networks or web applications. The Jaya does not need any distinctive parameters that require comprehensive tuning, which is usually troublesome and inefficient. Among several optimization methods, Jaya is chosen for TFP because of its simplicity and it always avoids the worst solutions and moving towards the global best solution. This victorious nature makes Jaya Algorithm more powerful and significant as compared to any other contemporary optimization algorithms. To evaluate the efficiency of the Jaya Algorithm (JA) against another metaheuristic algorithm, Sine-Cosine Algorithm (SCA), both algorithms are tested and assessed for the TF problem solution using an ACM dataset containing experts and their skills. The experimental results validate the improved performance of the optimization solutions and the potential of JA with fast convergence for solving TF problems which are better than SCA.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115796665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A Malware Detection Framework Based on Forensic and Unsupervised Machine Learning Methodologies 基于取证和无监督机器学习方法的恶意软件检测框架
A. Irfan, A. Ariffin, M. N. Mahrin, Syahid Anuar
{"title":"A Malware Detection Framework Based on Forensic and Unsupervised Machine Learning Methodologies","authors":"A. Irfan, A. Ariffin, M. N. Mahrin, Syahid Anuar","doi":"10.1145/3384544.3384556","DOIUrl":"https://doi.org/10.1145/3384544.3384556","url":null,"abstract":"The detection of malware intrusion requires the identification of its signature. However, it is a complex task due to the malware sophisticated ability to evade security mechanisms deployed by cybersecurity practitioners. Evasion is possible due to malware authors changing the malware signature using metamorphism or polymorphism tactics. Currently, it is necessary to formulate a malware detection method focusing on dynamic and automated malware analysis. Malware Indicator of Compromise (IOC) data analysis with machine learning can be used as a technique to obtain the malware signatures. This technical approach is practical as cyber-attacks using malware with new or changed signature are pandemic and remain undetected, therefore, a framework is needed to overcome this situation. Thus, this research proposed a malware detection framework based on forensic and unsupervised machine learning methodologies. The framework is experimented and proven in detecting malware by referring to the signature derived from the analysis. Furthermore, the framework can provide guidelines for cybersecurity practitioners to conduct threat hunting within their IT systems.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132830380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Service Learning in Application Development Course: A Case Study of a Rural Community Engagement 应用开发课程中的服务学习:以农村社区参与为例
S. Sulaiman, Siti Julia Mohd Shahrol, A. Samad
{"title":"Service Learning in Application Development Course: A Case Study of a Rural Community Engagement","authors":"S. Sulaiman, Siti Julia Mohd Shahrol, A. Samad","doi":"10.1145/3384544.3384601","DOIUrl":"https://doi.org/10.1145/3384544.3384601","url":null,"abstract":"Service learning aims to expose students mainly at tertiary studies to engage with the local communities under the selected registered courses. It enables students to apply the assigned projects at the chosen community. Thus, they can learn and solve real problems. This paper reports the service-learning component that is integrated with a four-credit Application Development course for the third-year students of Semester 1, Session 2019/2020 under Bachelor of Computer Science (Software Engineering) programme at School of Computing, Universiti Teknologi Malaysia. The students were attached to a rural community project known as Centre for Advancement in Rural Education Informatics (iCARE) during the one-semester study. The students were assigned to solve the issues in mastering English among rural learners by developing either a mobile application or an augmented reality application in a team of three students. The materials were provided by the English teacher who acts as the key stakeholder to represent the rural schools in Southeast Johor region under the Southeast Johor Development Authority (KEJORA). The study shows good impacts among both the university students and the rural students selected under the study.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131396581","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A Novel Method of Distortionless Correlation Function after STAP for BOC 一种用于BOC的STAP后无失真相关函数的新方法
Zukun Lu, Feiqiang Chen, Honglei Lin, Yifan Sun, Yuchen Xie
{"title":"A Novel Method of Distortionless Correlation Function after STAP for BOC","authors":"Zukun Lu, Feiqiang Chen, Honglei Lin, Yifan Sun, Yuchen Xie","doi":"10.1145/3384544.3384591","DOIUrl":"https://doi.org/10.1145/3384544.3384591","url":null,"abstract":"Binary offset carrier (BOC), which is a new modulation and has an additional subcarrier compared with the binary phase shift carrier (BPSK), has superior performance on anti-jamming, anti-multipath, and other aspects in global navigation satellite system (GNSS). However, antenna array, which is equipped with space-time adaptive processor (STAP), could break the correlation function of BOC and make the correlation function distortion. In this letter, we analyze the fundamental reason of the distortion correlation function, and we propose a novel method which can preserve the integrity of correlation function. The proposed method is effective for BOC, which is demonstrated by theory analysis and simulation experiment.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133155086","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
DDoSify DDoSify
A. Singh, R. Jaiswal
{"title":"DDoSify","authors":"A. Singh, R. Jaiswal","doi":"10.1145/3384544.3384602","DOIUrl":"https://doi.org/10.1145/3384544.3384602","url":null,"abstract":"Network Function Virtualization (NFV) provides numerous advantages over the conventional network through the implementation of different network functions over Virtual Machine (VM). For greater flexibility, it reduces capital and operating expenditure. Nonetheless, due to various forms of cyber attacks such as Distributed Denial of Service (DDoS) attack, these advantages come at the price of the inherent weakness of the network. The increased number of layers in NFV makes it more feasible for an attacker to carry out a DDoS attack. This research suggests a new paradigm to mitigate the impact of DDoS attacks on NFV. Typically, when it detects the DDoS attack on the application layer, DDoSify performs server migration and IP spoofing. DDoSify's effectiveness was tested by calculating processing time during load migration and IP spoofing.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126743581","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
An Improved Gas Efficient Library for Securing IoT Smart Contracts Against Arithmetic Vulnerabilities 一种改进的燃气效率库,用于保护物联网智能合约免受算术漏洞的侵害
J. Khor, Mansur Aliyu Masama, M. Sidorov, WeiChung Leong, JiaJun Lim
{"title":"An Improved Gas Efficient Library for Securing IoT Smart Contracts Against Arithmetic Vulnerabilities","authors":"J. Khor, Mansur Aliyu Masama, M. Sidorov, WeiChung Leong, JiaJun Lim","doi":"10.1145/3384544.3384577","DOIUrl":"https://doi.org/10.1145/3384544.3384577","url":null,"abstract":"Public blockchains targeting Internet of Things (IoT) are gaining more traction every day with majority of them being built on top of the Ethereum infrastructure. However, a growing number of these blockchains introduces security issues. There are 525 entries already in the Common Vulnerabilities and Exposure database related to Ethereum smart contracts. 479 of them are related to arithmetic errors, which include integer overflow or underflow. This paper, thus, concentrates on analyzing arithmetic vulnerabilities found in existing public blockchains targeted at IoT applications. Furthermore, the performance in terms of security and gas cost of smart contracts is analyzed with and without SafeMath library. In addition, an improved SafeMath library is proposed that has better arithmetic coverage and requires lower gas consumption. Four security tools are used to analyze the arithmetic protection of the improved SafeMath library. The results show that the improved SafeMath library is able to cover 4 more arithmetic operations compared to the original one by using only two common conditions checks and is capable of saving 26 units of gas, which is a significant amount in the long run.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116324175","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Real Time Face Recognition on an Edge Computing Device 基于边缘计算设备的实时人脸识别
Samarth Gupta
{"title":"Real Time Face Recognition on an Edge Computing Device","authors":"Samarth Gupta","doi":"10.1145/3384544.3384567","DOIUrl":"https://doi.org/10.1145/3384544.3384567","url":null,"abstract":"Face recognition systems have vast applications in surveillance systems and human-computer interactions. Different approaches such as Principal Component Analysis, Fisher linear discriminant analysis, Convolutional Neural Networks (CNN) have been commonly used for face recognition. However, in the recent times, CNN's have shown quite promising results in various face recognition systems. But, deep learning based CNNs have many limitations such as they require extensive training data, have excessively high computational and cooling requirements, and lack flexibility in deployment. Fields such as robotics and embedded systems that deploy face recognition systems have significantly less power on board and limited heat dissipation capacity. Therefore, it becomes difficult to deploy deep learning models on them but edge computing based devices like the Intel Neural Stick bridge this gap as they have certain advantages. In this paper, we review different applications of face recognition systems and various algorithms used for face recognition. We then elaborate the limitations of deep learning based face recognition systems and examine how edge-computing devices can solve these problems. We then present a flowchart to deploy a CNN based face recognition model on an edge-computing device.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116607728","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Wikidata based Location Entity Linking 基于维基数据的位置实体链接
Fathima Shanaz, R. Ragel
{"title":"Wikidata based Location Entity Linking","authors":"Fathima Shanaz, R. Ragel","doi":"10.1145/3384544.3384592","DOIUrl":"https://doi.org/10.1145/3384544.3384592","url":null,"abstract":"Online news reading has become general among people and suggesting relevant news articles to readers is a non-trivial task. News recommender systems (NRS) are built to provide appropriate stories to readers based on their interest. News articles usually contain mentions of persons, locations and other named entities which are excellent resources for making sense of readers' news interest. However, entity mentions are often ambiguous. It can make readers retrieve stories that are not relevant to them, impacting the performance of NRS. Entity linking (EL) is a task to extract mentions in documents, and then link them to their corresponding entities in a knowledge base (KB). This task is challenging due to name variations, high ambiguity of entity mentions and incompleteness of the KB. Several approaches have been proposed to tackle these challenges. However, current systems do not focus on improving the performance of EL on location entity mentions which are identified as far more informative entities in news article for user interest profiling. The goal of this paper is to present the design of location entity linking algorithms based on Wikidata KB. We propose new approaches to candidate entity generation and candidate entity ranking of the location EL task. We extensively evaluate the performance of our EL algorithms over a manually annotated AIDA-CoNLL testb news corpus. Experimental results show that our location EL method achieves top-1 precision of 95.58% which is much higher than the state-of-the-art results obtained on the same dataset by collective EL methods.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130723486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Framework for Automated Reengineering of BPMN Models by Excluding Inefficient Activities 排除低效率活动的BPMN模型自动再造框架
Rimsha Khan, F. Azam, B. Maqbool, Muhammad Waseem Anwar
{"title":"A Framework for Automated Reengineering of BPMN Models by Excluding Inefficient Activities","authors":"Rimsha Khan, F. Azam, B. Maqbool, Muhammad Waseem Anwar","doi":"10.1145/3384544.3384549","DOIUrl":"https://doi.org/10.1145/3384544.3384549","url":null,"abstract":"Business Process Reengineering (BPR), originally floated in the early 1990s, is gaining importance in industry and academia. BPR helps the organization rethink their work rationally by redesigning their current processes and resource consumption. Due to the high rate of software evolution, there is a need to run legacy systems on a new computing platform. BPMN models are subject to erroneous or unnecessary activities that are taking too many resources. Such process models are leading to additional cost and effort. Re-engineering help in improving the legacy system or in this context a set of legacy processes to perform better than before. This work presents a framework for automatic reengineering of a BPMN by identifying activities that are taking too much time and resources but are insignificant to the business process. An extensive literature review has led to the extraction of three important parameters based on which the business process activities can be evaluated as necessary or unnecessary i.e. time, resources and priority of an activity. The proposed model has been validated using a case study on the Claim Management System. This work shall be beneficial for the research community and developers targeting construction of a BPR tool","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129923632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信