首页 > 最新文献

2021 International Conference on Computing, Computational Modelling and Applications (ICCMA)最新文献

英文 中文
Improved Botnet Attack Detection Using Principal Component Analysis and Ensemble Voting Algorithm 基于主成分分析和集成投票算法的改进僵尸网络攻击检测
S. Oppong, E. Baah, Mathias Agbeko, Justice Nueteh Terkper
In recent times especially in the field of cloud computing, one of the most radical forms and threatening key issue of cyber-attacks has to do with botnets. Botnets with their flexible and dynamic nature together with a botmaster, mastermind their operations, change their codes, and update the bots daily in order to prevent the present detection methods. Despite high-profile efforts to tackle botnets, the number of botnets and infected systems only continues to grow. Early detection and analysis of these increasing number of botnet attack greatly impact the operational activities of any internet-related organization. Machine learning algorithms have played a key role in the detections and analysis of botnet infected packets in attacks such as DDoS attacks. This study, using Principal Component Analysis and an ensemble voting classifier improves the detection of botnet attacks. The results showed increased performance in terms of running time, accuracy, precision, and false-positive.
近年来,特别是在云计算领域,僵尸网络是网络攻击最激进的形式之一,也是最具威胁性的关键问题之一。僵尸网络具有灵活和动态的性质,与僵尸管理员一起,策划他们的操作,改变他们的代码,并每天更新机器人,以防止现有的检测方法。尽管解决僵尸网络的努力备受瞩目,但僵尸网络和受感染系统的数量只会继续增长。早期发现和分析这些越来越多的僵尸网络攻击对任何与互联网相关的组织的运营活动都有很大的影响。机器学习算法在DDoS攻击等僵尸网络感染数据包的检测和分析中发挥了关键作用。本研究使用主成分分析和集成投票分类器改进了僵尸网络攻击的检测。结果显示,在运行时间、准确性、精密度和误报方面,性能有所提高。
{"title":"Improved Botnet Attack Detection Using Principal Component Analysis and Ensemble Voting Algorithm","authors":"S. Oppong, E. Baah, Mathias Agbeko, Justice Nueteh Terkper","doi":"10.1109/ICCMA53594.2021.00014","DOIUrl":"https://doi.org/10.1109/ICCMA53594.2021.00014","url":null,"abstract":"In recent times especially in the field of cloud computing, one of the most radical forms and threatening key issue of cyber-attacks has to do with botnets. Botnets with their flexible and dynamic nature together with a botmaster, mastermind their operations, change their codes, and update the bots daily in order to prevent the present detection methods. Despite high-profile efforts to tackle botnets, the number of botnets and infected systems only continues to grow. Early detection and analysis of these increasing number of botnet attack greatly impact the operational activities of any internet-related organization. Machine learning algorithms have played a key role in the detections and analysis of botnet infected packets in attacks such as DDoS attacks. This study, using Principal Component Analysis and an ensemble voting classifier improves the detection of botnet attacks. The results showed increased performance in terms of running time, accuracy, precision, and false-positive.","PeriodicalId":131082,"journal":{"name":"2021 International Conference on Computing, Computational Modelling and Applications (ICCMA)","volume":"32 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114038995","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
Potential of Applying kNN with Soft Walltime to Improve Scheduling Performance 应用kNN和软壁时间提高调度性能的潜力
Thanh Hoang Le Hai, Loc La Hoang, N. Thoai
Utilizing performance is one of the most important and difficult tasks on High-Performance Computing (HPC) systems. In order to balance between simplicity and efficiency, many HPC systems are exploiting First-Come-First-Served schedulers with backfilling policies. Previous researches demonstrated the benefits of walltime approximation approaches on backfilling improvement. However, applying predicted values might affect scheduling guarantees due to the risk of early job termination caused by underestimation. The recent soft walltime feature from OpenPBS has eliminated this concern by restricting system-generated walltime only for the scheduling step.In this work, we present our simple k-nearest neighbors approach to improve the performance of the conservative backfilling algorithm. The inaccurate user estimate of a job is refined using the historic data about its most similar jobs. Then, we exploit this correction safely with the soft walltime scheme and perform simulations on real scheduling logs. Our simulation results highlight that even our simple setup can help to correct user estimates significantly. Moreover, the scheduling performance is also improved on some appropriate conditions.
利用性能是高性能计算(HPC)系统中最重要也是最困难的任务之一。为了在简单性和效率之间取得平衡,许多HPC系统正在利用带有回填策略的先到先得调度程序。以往的研究证明了壁时近似方法在改善回填方面的好处。然而,应用预测值可能会影响调度保证,因为低估会导致作业提前终止的风险。OpenPBS最近的软超时特性通过限制系统仅为调度步骤生成的超时,消除了这个问题。在这项工作中,我们提出了一个简单的k近邻方法来提高保守回填算法的性能。使用最相似作业的历史数据来改进用户对作业的不准确估计。然后,我们利用软超时方案安全地利用这种修正,并在真实调度日志上进行仿真。我们的模拟结果强调,即使我们的简单设置也可以显著地帮助纠正用户估计。此外,在适当的条件下,还可以提高调度性能。
{"title":"Potential of Applying kNN with Soft Walltime to Improve Scheduling Performance","authors":"Thanh Hoang Le Hai, Loc La Hoang, N. Thoai","doi":"10.1109/ICCMA53594.2021.00009","DOIUrl":"https://doi.org/10.1109/ICCMA53594.2021.00009","url":null,"abstract":"Utilizing performance is one of the most important and difficult tasks on High-Performance Computing (HPC) systems. In order to balance between simplicity and efficiency, many HPC systems are exploiting First-Come-First-Served schedulers with backfilling policies. Previous researches demonstrated the benefits of walltime approximation approaches on backfilling improvement. However, applying predicted values might affect scheduling guarantees due to the risk of early job termination caused by underestimation. The recent soft walltime feature from OpenPBS has eliminated this concern by restricting system-generated walltime only for the scheduling step.In this work, we present our simple k-nearest neighbors approach to improve the performance of the conservative backfilling algorithm. The inaccurate user estimate of a job is refined using the historic data about its most similar jobs. Then, we exploit this correction safely with the soft walltime scheme and perform simulations on real scheduling logs. Our simulation results highlight that even our simple setup can help to correct user estimates significantly. Moreover, the scheduling performance is also improved on some appropriate conditions.","PeriodicalId":131082,"journal":{"name":"2021 International Conference on Computing, Computational Modelling and Applications (ICCMA)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126204718","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
Can machines Communicate? 机器能交流吗?
Sanskar Jethi, A. Choudhary, Yash Gupta
We have seen significant advancements in Machine Learning and Artificial Intelligence in the 21st century. It has enabled a new technology where we can have a human-like conversation with the machines. Now, computers are much more than just being advanced calculators. Judging to check if a computer can only think will be a major understatement to the modern computer’s ability. Analogous to a human, it is not enough to only be intelligent, a human needs to communicate well to be perceived as “intelligent”. In this paper, we will create a test to judge if a machine can communicate.
21世纪,我们见证了机器学习和人工智能的重大进步。它促成了一项新技术,我们可以与机器进行类似人类的对话。现在,计算机不仅仅是高级计算器。判断一台计算机是否只会思考将是对现代计算机能力的严重低估。与人类类似,仅仅聪明是不够的,人类需要良好的沟通才能被认为是“聪明的”。在本文中,我们将创建一个测试来判断机器是否可以通信。
{"title":"Can machines Communicate?","authors":"Sanskar Jethi, A. Choudhary, Yash Gupta","doi":"10.1109/ICCMA53594.2021.00024","DOIUrl":"https://doi.org/10.1109/ICCMA53594.2021.00024","url":null,"abstract":"We have seen significant advancements in Machine Learning and Artificial Intelligence in the 21st century. It has enabled a new technology where we can have a human-like conversation with the machines. Now, computers are much more than just being advanced calculators. Judging to check if a computer can only think will be a major understatement to the modern computer’s ability. Analogous to a human, it is not enough to only be intelligent, a human needs to communicate well to be perceived as “intelligent”. In this paper, we will create a test to judge if a machine can communicate.","PeriodicalId":131082,"journal":{"name":"2021 International Conference on Computing, Computational Modelling and Applications (ICCMA)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128030338","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
Using Machine Learning to Predict Students’ Academic Performance During Covid-19 利用机器学习预测新冠肺炎期间学生的学习成绩
D. K. Dake, D. Essel, Justice Edem Agbodaze
COVID-19 pandemic has affected various sectors of the global economy including the abrupt closure of schools in March 2020 in Ghana. This sudden closure has led to a revamp in online teaching and learning across most institutions with learners submitting their assignments and taking their assessments on various learning management systems while at home.In this study, we used classification algorithms to investigate features and predict the academic performance of students during the pandemic. We collected data from students in the Department of ICT Education of the University of Education, Winneba during the COVID-19 period using carefully selected attributes that could affect their exams score. The results detailed dominant attributes that affected students’ performance with Random Forest, Random Tree, Naïve Bayes and J48 Decision Tree algorithms further analysed for accuracy, confusion matrix and the ROC Curve. After detailed analysis, we observed that the accuracy of a classifier alone is not indicative enough of its performance.
2019冠状病毒病大流行影响了全球经济的各个部门,包括2020年3月加纳的学校突然关闭。这种突然的关闭导致了大多数机构在线教学和学习的改革,学习者在家里提交作业并在各种学习管理系统上进行评估。在这项研究中,我们使用分类算法来调查特征并预测学生在大流行期间的学习成绩。我们收集了Winneba教育大学信息通信技术教育系学生在COVID-19期间的数据,使用了精心挑选的可能影响他们考试成绩的属性。结果详细描述了随机森林、随机树、Naïve贝叶斯和J48决策树算法影响学生成绩的主导属性,并进一步分析了准确率、混淆矩阵和ROC曲线。经过详细的分析,我们观察到分类器本身的准确性不足以表明其性能。
{"title":"Using Machine Learning to Predict Students’ Academic Performance During Covid-19","authors":"D. K. Dake, D. Essel, Justice Edem Agbodaze","doi":"10.1109/ICCMA53594.2021.00010","DOIUrl":"https://doi.org/10.1109/ICCMA53594.2021.00010","url":null,"abstract":"COVID-19 pandemic has affected various sectors of the global economy including the abrupt closure of schools in March 2020 in Ghana. This sudden closure has led to a revamp in online teaching and learning across most institutions with learners submitting their assignments and taking their assessments on various learning management systems while at home.In this study, we used classification algorithms to investigate features and predict the academic performance of students during the pandemic. We collected data from students in the Department of ICT Education of the University of Education, Winneba during the COVID-19 period using carefully selected attributes that could affect their exams score. The results detailed dominant attributes that affected students’ performance with Random Forest, Random Tree, Naïve Bayes and J48 Decision Tree algorithms further analysed for accuracy, confusion matrix and the ROC Curve. After detailed analysis, we observed that the accuracy of a classifier alone is not indicative enough of its performance.","PeriodicalId":131082,"journal":{"name":"2021 International Conference on Computing, Computational Modelling and Applications (ICCMA)","volume":"479 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115876261","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}
引用次数: 5
“Great in, great out” is the new “garbage in, garbage out”: subsampling from data with no response variable using various approaches, including unsupervised learning “大量输入,大量输出”是新的“垃圾输入,垃圾输出”:使用各种方法(包括无监督学习)从没有响应变量的数据中进行子采样
Lubomír Štěpánek, Filip Habarta, I. Malá, L. Marek
When having more initial data than needed, an appropriate selection of a subpopulation from the given dataset, i. e. subsampling, follows, usually intending to ensure all categorical variables’ levels are nearly equally covered and all numerical variables are all well balanced. If a response variable in the original data is missing, popular propensity scoring cannot be performed.This study addresses the subsampling with the missing response variable about to be collected later, using a COVID-19 dataset (N = 698) with 18 variables of interest, reduced to a subdataset (n = 400). The quality of subpopulation selecting was measured using the minimization of a sum of squares of each variable’s category frequency and averaged over all variables.An exhaustive method selecting all possible combinations of n = 400 observations from initial N = 698 observations was used as a benchmark. Choosing the subsample from a random set of them that minimized the metric returned similar results as a “forward” subselection reducing the original dataset an observation-by-observation per each step by permanently lowering the metric. Finally, k-means clustering (with a random number of clusters) of the original dataset’s observations and choosing a subsample from each cluster, proportionally to its size, also lowered the metric compared to the random subsampling.All four latter approaches showed better results than single random subsampling, considering the metric minimization. However, while the exhaustive sampling is very greedy and time-consuming, the forward one-by-one reducing the original dataset, picking up the subsample minimizing the metric, and subsampling the clusters, are feasible for selecting a well-balanced subdataset, ready for ongoing response variable collecting.
当初始数据多于所需时,从给定数据集中适当选择子总体,即子抽样,通常旨在确保所有分类变量的水平几乎均匀覆盖,所有数值变量都很好地平衡。如果原始数据中的响应变量缺失,则无法执行流行倾向评分。本研究使用包含18个感兴趣变量的COVID-19数据集(N = 698)简化为子数据集(N = 400),解决了稍后将收集的缺失响应变量的子抽样问题。亚群体选择的质量使用每个变量类别频率的平方和的最小化来测量,并对所有变量进行平均。采用穷举法从初始n = 698个观测值中选择n = 400个观测值的所有可能组合作为基准。从随机集合中选择最小化度量的子样本,返回的结果与“向前”子样本相似,通过永久降低度量,每一步逐个观察地减少原始数据集。最后,对原始数据集的观察结果进行k-means聚类(随机数量的聚类),并从每个聚类中按比例选择一个子样本,与随机子抽样相比,也降低了度量。考虑到度量最小化,后四种方法都比单次随机抽样显示更好的结果。然而,尽管穷举抽样是非常贪婪和耗时的,但对于选择一个平衡良好的子数据集,为持续的响应变量收集做好准备,前向逐一减少原始数据集,提取子样本最小化度量,并对聚类进行子抽样是可行的。
{"title":"“Great in, great out” is the new “garbage in, garbage out”: subsampling from data with no response variable using various approaches, including unsupervised learning","authors":"Lubomír Štěpánek, Filip Habarta, I. Malá, L. Marek","doi":"10.1109/ICCMA53594.2021.00028","DOIUrl":"https://doi.org/10.1109/ICCMA53594.2021.00028","url":null,"abstract":"When having more initial data than needed, an appropriate selection of a subpopulation from the given dataset, i. e. subsampling, follows, usually intending to ensure all categorical variables’ levels are nearly equally covered and all numerical variables are all well balanced. If a response variable in the original data is missing, popular propensity scoring cannot be performed.This study addresses the subsampling with the missing response variable about to be collected later, using a COVID-19 dataset (N = 698) with 18 variables of interest, reduced to a subdataset (n = 400). The quality of subpopulation selecting was measured using the minimization of a sum of squares of each variable’s category frequency and averaged over all variables.An exhaustive method selecting all possible combinations of n = 400 observations from initial N = 698 observations was used as a benchmark. Choosing the subsample from a random set of them that minimized the metric returned similar results as a “forward” subselection reducing the original dataset an observation-by-observation per each step by permanently lowering the metric. Finally, k-means clustering (with a random number of clusters) of the original dataset’s observations and choosing a subsample from each cluster, proportionally to its size, also lowered the metric compared to the random subsampling.All four latter approaches showed better results than single random subsampling, considering the metric minimization. However, while the exhaustive sampling is very greedy and time-consuming, the forward one-by-one reducing the original dataset, picking up the subsample minimizing the metric, and subsampling the clusters, are feasible for selecting a well-balanced subdataset, ready for ongoing response variable collecting.","PeriodicalId":131082,"journal":{"name":"2021 International Conference on Computing, Computational Modelling and Applications (ICCMA)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133125008","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
[Copyright notice] (版权)
{"title":"[Copyright notice]","authors":"","doi":"10.1109/iccma53594.2021.00003","DOIUrl":"https://doi.org/10.1109/iccma53594.2021.00003","url":null,"abstract":"","PeriodicalId":131082,"journal":{"name":"2021 International Conference on Computing, Computational Modelling and Applications (ICCMA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129804725","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
A Cryptographic Tamper Detection Approach for Storage and Preservation of Forensic Digital Data Based on SHA 384 Hash Function 基于SHA 384哈希函数的法医数字数据存储与保存密码篡改检测方法
Isaac Baffour Senkyire, Q. Kester
The current age permits for legal, official, sensitive, and confidential documents to be exchanged using digital channels among stakeholders. In this digital age, new advances in technology are tremendously vital creating more sophisticated and intelligent tools in areas like informatics, electronics, and telecommunication. In the wake of these new advances, any individual can digitize any kind of document, and modern computing tools can alter all these using computational drawing tools, such as GIMP or Paint Shop Pro, without causing any distortions hence, tampered documents can be presented with the same quality as the original documents. Documents tampered, when used or distributed illegally can cause economic, political, legal and moral damages to individuals and organizations. In this paper, we propose to detect the tampering of documents using SHA-384 hash function..
目前的年龄允许在利益相关者之间使用数字渠道交换法律、官方、敏感和机密文件。在这个数字时代,技术的新进步非常重要,在信息学、电子和电信等领域创造了更复杂、更智能的工具。随着这些新的进步,任何人都可以数字化任何类型的文件,现代计算工具可以使用计算绘图工具(如GIMP或Paint Shop Pro)更改所有这些文件,而不会造成任何扭曲,因此,篡改的文件可以以与原始文件相同的质量呈现。非法使用或分发被篡改的文件会对个人和组织造成经济、政治、法律和道德上的损害。在本文中,我们提出使用SHA-384哈希函数来检测文档的篡改。
{"title":"A Cryptographic Tamper Detection Approach for Storage and Preservation of Forensic Digital Data Based on SHA 384 Hash Function","authors":"Isaac Baffour Senkyire, Q. Kester","doi":"10.1109/ICCMA53594.2021.00033","DOIUrl":"https://doi.org/10.1109/ICCMA53594.2021.00033","url":null,"abstract":"The current age permits for legal, official, sensitive, and confidential documents to be exchanged using digital channels among stakeholders. In this digital age, new advances in technology are tremendously vital creating more sophisticated and intelligent tools in areas like informatics, electronics, and telecommunication. In the wake of these new advances, any individual can digitize any kind of document, and modern computing tools can alter all these using computational drawing tools, such as GIMP or Paint Shop Pro, without causing any distortions hence, tampered documents can be presented with the same quality as the original documents. Documents tampered, when used or distributed illegally can cause economic, political, legal and moral damages to individuals and organizations. In this paper, we propose to detect the tampering of documents using SHA-384 hash function..","PeriodicalId":131082,"journal":{"name":"2021 International Conference on Computing, Computational Modelling and Applications (ICCMA)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130780422","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
An Android Application for Clinical Diagnosis Using NLP and Fuzzy Logic 基于NLP和模糊逻辑的Android临床诊断应用
Samuel Afoakwa, Crentsil Kwayie, Joseph Owusu
The application of natural language processing (NLP) methods to designing conversational frameworks for health diagnosis improves patients’ access to medical information. An Android application based on fuzzy logic rules and fuzzy inference was created in this research. In Ghana, the service assesses the symptoms of diseases. The android application is built with the Support Vector Machine learning technique, with the aim of improving the model’s accuracy and performance. Natural Language Processing is often used by the machine to achieve the conversational style of asking the users for their symptoms. People can spend less time in hospitals and get low-cost or free care by using this technique, which is mainly used in Ghana’s rural areas.
自然语言处理(NLP)方法在健康诊断会话框架设计中的应用,提高了患者对医疗信息的获取。本研究开发了一个基于模糊逻辑规则和模糊推理的Android应用程序。在加纳,该服务评估疾病的症状。android应用程序使用支持向量机器学习技术构建,旨在提高模型的准确性和性能。机器通常使用自然语言处理来实现询问用户症状的会话风格。通过使用这种主要在加纳农村地区使用的技术,人们可以减少在医院的时间,并获得低成本或免费的护理。
{"title":"An Android Application for Clinical Diagnosis Using NLP and Fuzzy Logic","authors":"Samuel Afoakwa, Crentsil Kwayie, Joseph Owusu","doi":"10.1109/ICCMA53594.2021.00015","DOIUrl":"https://doi.org/10.1109/ICCMA53594.2021.00015","url":null,"abstract":"The application of natural language processing (NLP) methods to designing conversational frameworks for health diagnosis improves patients’ access to medical information. An Android application based on fuzzy logic rules and fuzzy inference was created in this research. In Ghana, the service assesses the symptoms of diseases. The android application is built with the Support Vector Machine learning technique, with the aim of improving the model’s accuracy and performance. Natural Language Processing is often used by the machine to achieve the conversational style of asking the users for their symptoms. People can spend less time in hospitals and get low-cost or free care by using this technique, which is mainly used in Ghana’s rural areas.","PeriodicalId":131082,"journal":{"name":"2021 International Conference on Computing, Computational Modelling and Applications (ICCMA)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132258058","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
Sustainable Waste Management Practices in a Higher Education Institution of Ghana 加纳高等教育机构的可持续废物管理实践
Nana Agyeman-Prempeh, P. Acheampong, Emmanuel Freeman, Eric Ekobor-Ackah Mochiah, R. Abubakar, Louis David Jnr. Annor
This paper seeks to assess a sustainable waste management practices in a higher education institution of Ghana. The driving force for this research is the increase in the volumes of daily waste on university campuses as a result of increasing number of students’ enrolment and other university events and services. The mixed method approach was used for this study. A total sample of 214 students from Ghana Communication Technology University (GCTU) was used for the study. The research aimed at collating the requisite information from students from Level 100 to the graduate level on their assessments on solid waste management practices at GCTU. Findings from the studies revealed that the various types of solid waste generated by most students was paper which was not surprising in a school setting, followed by plastics waste and then organic waste. It was also discovered that students’ perception and awareness of solid waste management practices at GCTU was good and commendable. Recommendations was directed to all stakeholders for need to adopt a zero-waste concept. Thus, a recommendation was made towards an establishment of a policy to aid in protecting the environment to enhance a serene environment for teaching and learning.
本文旨在评估加纳高等教育机构的可持续废物管理实践。这项研究的驱动力是由于学生入学人数的增加以及其他大学活动和服务的增加,大学校园里的日常垃圾数量也在增加。本研究采用混合方法。本研究使用了来自加纳通信技术大学(GCTU)的214名学生作为样本。这项研究的目的是整理从100级到研究生级的学生提供的关于他们对GCTU固体废物管理做法的评价的必要资料。研究结果显示,大多数学生产生的各种固体废物是纸张,这在学校环境中并不奇怪,其次是塑料废物,然后是有机废物。此外,我们亦发现学生对广东ctu固废管理措施的认知和认识是良好的,值得表扬。向所有利益攸关方提出了需要采用零废物概念的建议。因此,建议制订一项政策,以协助保护环境,为教学创造一个宁静的环境。
{"title":"Sustainable Waste Management Practices in a Higher Education Institution of Ghana","authors":"Nana Agyeman-Prempeh, P. Acheampong, Emmanuel Freeman, Eric Ekobor-Ackah Mochiah, R. Abubakar, Louis David Jnr. Annor","doi":"10.1109/ICCMA53594.2021.00031","DOIUrl":"https://doi.org/10.1109/ICCMA53594.2021.00031","url":null,"abstract":"This paper seeks to assess a sustainable waste management practices in a higher education institution of Ghana. The driving force for this research is the increase in the volumes of daily waste on university campuses as a result of increasing number of students’ enrolment and other university events and services. The mixed method approach was used for this study. A total sample of 214 students from Ghana Communication Technology University (GCTU) was used for the study. The research aimed at collating the requisite information from students from Level 100 to the graduate level on their assessments on solid waste management practices at GCTU. Findings from the studies revealed that the various types of solid waste generated by most students was paper which was not surprising in a school setting, followed by plastics waste and then organic waste. It was also discovered that students’ perception and awareness of solid waste management practices at GCTU was good and commendable. Recommendations was directed to all stakeholders for need to adopt a zero-waste concept. Thus, a recommendation was made towards an establishment of a policy to aid in protecting the environment to enhance a serene environment for teaching and learning.","PeriodicalId":131082,"journal":{"name":"2021 International Conference on Computing, Computational Modelling and Applications (ICCMA)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127785531","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
An Enhanced approach of the K-means clustering for Anomaly-based intrusion detection systems* 基于异常的入侵检测系统中k -均值聚类的改进方法*
Meriem Kherbache, D. Espès, Kamal Amroun
The development of an anomaly-based Intrusion Detection System (IDS) is of primary importance in networks because it reinforces security. Unlike supervised methods, unsupervised methods are not widely used although they are fast and efficient. In this paper, we propose an unsupervised approach based on the K-means method to show the efficacy of these models over the supervised methods. The proposed model improves the K-means method using the Caliniski Harabasz indicator to find the appropriate number of clusters required for clustering by computing the intra-cluster to inter-cluster ratio. Above all, the proposed model is applied to two datasets, the well-known NSL-KDD and the newest CICIDS2017. The experimental results show that the proposed model exceeds largely the traditional K-means method. Additionally, it is also very efficient both in detection and time consuming compared to the SVM classifier that is a supervised classifier.
基于异常的入侵检测系统(IDS)的开发对网络安全具有重要意义。与有监督方法不同,无监督方法虽然快速有效,但应用并不广泛。在本文中,我们提出了一种基于K-means方法的无监督方法,以显示这些模型相对于有监督方法的有效性。该模型利用Caliniski Harabasz指标对K-means方法进行了改进,通过计算聚类内与聚类间的比值,找到聚类所需的合适簇数。最重要的是,该模型应用于两个数据集,即著名的NSL-KDD和最新的CICIDS2017。实验结果表明,该模型在很大程度上优于传统的K-means方法。此外,与监督分类器SVM相比,它在检测和耗时方面也非常高效。
{"title":"An Enhanced approach of the K-means clustering for Anomaly-based intrusion detection systems*","authors":"Meriem Kherbache, D. Espès, Kamal Amroun","doi":"10.1109/ICCMA53594.2021.00021","DOIUrl":"https://doi.org/10.1109/ICCMA53594.2021.00021","url":null,"abstract":"The development of an anomaly-based Intrusion Detection System (IDS) is of primary importance in networks because it reinforces security. Unlike supervised methods, unsupervised methods are not widely used although they are fast and efficient. In this paper, we propose an unsupervised approach based on the K-means method to show the efficacy of these models over the supervised methods. The proposed model improves the K-means method using the Caliniski Harabasz indicator to find the appropriate number of clusters required for clustering by computing the intra-cluster to inter-cluster ratio. Above all, the proposed model is applied to two datasets, the well-known NSL-KDD and the newest CICIDS2017. The experimental results show that the proposed model exceeds largely the traditional K-means method. Additionally, it is also very efficient both in detection and time consuming compared to the SVM classifier that is a supervised classifier.","PeriodicalId":131082,"journal":{"name":"2021 International Conference on Computing, Computational Modelling and Applications (ICCMA)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126747145","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
期刊
2021 International Conference on Computing, Computational Modelling and Applications (ICCMA)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1