首页 > 最新文献

EAI Endorsed Transactions on Scalable Information Systems最新文献

英文 中文
An approach to financial information analysis by the Brazilian Federal Police 巴西联邦警察对金融信息分析的方法
IF 1.3 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-05-18 DOI: 10.4108/eetsis.vi.3360
Renato Kettner Filho, D. D. J. D. Macedo
INTRODUCTION: One of the tasks performed by the Federal Police is the verification and cross-referencing of data contained in Financial Intelligence Reports (FIRs) produced and forwarded by the Financial Activities Control Council (COAF) - an activity in which, among the police involved, the absence of a standard system of execution. OBJECTIVES: The present work aims to present a study on the form currently in use within the scope of the Federal Police Station regarding the analysis of FIRs from the COAF, then presenting a methodology suggestion, aiming to speed up the process. Regarding open sources, the objective is to carry out a survey of possible complementary repositories not yet used and to expose ways of implementing queries. METHODS: Pointing out the workflow currently used (displaying it in graphic form) as well as identifying the data sources consulted (open sources and closed sources) during the process, CONCLUSION: understanding how the FIR analysis system is currently carried out, identifying possible aspects for improvement, and suggesting a methodology to be used, indicating for this the use of files in a specific format (.CSV), exclusion of queries in similar repositories (System “A”) and, mainly, the automation of part of the procedure (with the use of the RIBOT prototype software).
简介:联邦警察执行的任务之一是核查和交叉引用由金融活动控制委员会(COAF)制作和转发的金融情报报告(FIRs)中包含的数据-在参与这项活动的警察中,缺乏标准的执行系统。目的:本工作旨在对联邦警察局范围内目前使用的表格进行研究,以分析来自COAF的first,然后提出一项方法建议,旨在加快这一进程。关于开放源代码,目标是对尚未使用的可能的补充存储库进行调查,并公开实现查询的方法。方法:指出目前使用的工作流程(以图形形式显示),并确定在此过程中参考的数据源(开放源和封闭源)。了解FIR分析系统目前是如何进行的,确定可能需要改进的方面,并建议使用一种方法,指出使用特定格式的文件(. csv),排除类似存储库中的查询(系统“a”),主要是部分程序的自动化(使用RIBOT原型软件)。
{"title":"An approach to financial information analysis by the Brazilian Federal Police","authors":"Renato Kettner Filho, D. D. J. D. Macedo","doi":"10.4108/eetsis.vi.3360","DOIUrl":"https://doi.org/10.4108/eetsis.vi.3360","url":null,"abstract":"INTRODUCTION: One of the tasks performed by the Federal Police is the verification and cross-referencing of data contained in Financial Intelligence Reports (FIRs) produced and forwarded by the Financial Activities Control Council (COAF) - an activity in which, among the police involved, the absence of a standard system of execution. \u0000OBJECTIVES: The present work aims to present a study on the form currently in use within the scope of the Federal Police Station regarding the analysis of FIRs from the COAF, then presenting a methodology suggestion, aiming to speed up the process. Regarding open sources, the objective is to carry out a survey of possible complementary repositories not yet used and to expose ways of implementing queries. \u0000METHODS: Pointing out the workflow currently used (displaying it in graphic form) as well as identifying the data sources consulted (open sources and closed sources) during the process, \u0000CONCLUSION: understanding how the FIR analysis system is currently carried out, identifying possible aspects for improvement, and suggesting a methodology to be used, indicating for this the use of files in a specific format (.CSV), exclusion of queries in similar repositories (System “A”) and, mainly, the automation of part of the procedure (with the use of the RIBOT prototype software).","PeriodicalId":43034,"journal":{"name":"EAI Endorsed Transactions on Scalable Information Systems","volume":"97 1","pages":"e21"},"PeriodicalIF":1.3,"publicationDate":"2023-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80171461","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
Predicting Breast Cancer with Ensemble Methods on Cloud 基于云的集合方法预测乳腺癌
IF 1.3 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-03-29 DOI: 10.4108/eetcasa.v8i2.2788
Au Pham, T. Tran, Phuc Tran, H. Huynh
There are many dangerous diseases and high mortality rates for women (including breast cancer). If the disease is detected early, correctly diagnosed and treated at the right time, the likelihood of illness and death is reduced. Previous disease prediction models have mainly focused on methods for building individual models. However, these predictive models do not yet have high accuracy and high generalization performance. In this paper, we focus on combining these individual models together to create a combined model, which is more generalizable than the individual models. Three ensemble techniques used in the experiment are: Bagging; Boosting and Stacking (Stacking include three models: Gradient Boost, Random Forest, Logistic Regression) to deploy and apply to breast cancer prediction problem. The experimental results show the combined model with the ensemble methods based on the Breast Cancer Wisconsin dataset; this combined model has a higher predictive performance than the commonly used individual prediction models.
妇女罹患许多危险疾病,死亡率很高(包括乳腺癌)。如果及早发现疾病,在正确的时间进行正确诊断和治疗,患病和死亡的可能性就会降低。以前的疾病预测模型主要集中在建立个体模型的方法上。然而,这些预测模型还没有达到较高的准确率和泛化性能。在本文中,我们将重点放在将这些单独的模型组合在一起以创建一个组合模型上,该组合模型比单个模型更具通用性。实验中采用的三种组合技术是:套袋;Boosting和Stacking (Stacking包括梯度Boost、随机森林、逻辑回归三种模型)部署并应用于乳腺癌预测问题。实验结果表明,该模型与基于乳腺癌威斯康星州数据集的集成方法相结合;该组合模型比常用的单个预测模型具有更高的预测性能。
{"title":"Predicting Breast Cancer with Ensemble Methods on Cloud","authors":"Au Pham, T. Tran, Phuc Tran, H. Huynh","doi":"10.4108/eetcasa.v8i2.2788","DOIUrl":"https://doi.org/10.4108/eetcasa.v8i2.2788","url":null,"abstract":"There are many dangerous diseases and high mortality rates for women (including breast cancer). If the disease is detected early, correctly diagnosed and treated at the right time, the likelihood of illness and death is reduced. Previous disease prediction models have mainly focused on methods for building individual models. However, these predictive models do not yet have high accuracy and high generalization performance. In this paper, we focus on combining these individual models together to create a combined model, which is more generalizable than the individual models. Three ensemble techniques used in the experiment are: Bagging; Boosting and Stacking (Stacking include three models: Gradient Boost, Random Forest, Logistic Regression) to deploy and apply to breast cancer prediction problem. The experimental results show the combined model with the ensemble methods based on the Breast Cancer Wisconsin dataset; this combined model has a higher predictive performance than the commonly used individual prediction models.","PeriodicalId":43034,"journal":{"name":"EAI Endorsed Transactions on Scalable Information Systems","volume":"57 1","pages":"e1"},"PeriodicalIF":1.3,"publicationDate":"2023-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85959472","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
Towards Happy Housework: Scenario-Based Experience Design for a Household Cleaning Robotic System 走向快乐家务:基于场景的家庭清洁机器人系统体验设计
IF 1.3 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-01-31 DOI: 10.4108/eetsis.v10i3.2950
Yichen Lu, Zheng Liao
INTRODUCTION: In the interwoven trend of the experience economy and advanced information technology, user experience becomes the substantial value of an interactive system. As one of the early innovations of a smart home, the current design of household cleaning robots is still driven by technology with a focus on pragmatic quality rather than the experiential value of a robotic system.OBJECTIVES: This paper aims to uplift the design vision of a cleaning robot from an automatic household appliance towards a meaningful robotic system engaging users in happy housework.METHODS: Theoretically, experience design and scenario-based design methods were combined into a specific design framework for domestic cleaning robotic systems. Based on the user study and technology trend analysis, we first set three experience goals (immersion, trust, and inspiration) to drive the design process, then chose 3D point cloud and AI recognition as backup technologies and afterwards extracted three main design scenarios (scanning and mapping, intelligent cleaning, and live control).RESULTS: The design features multi-view switching, a combination of animation rendering and real scene, fixed-point cleaning, map management, lens control and flexible remote, and shooting modes are proposed. Seventy-one participants evaluated the concept with online AttrakDiff questionnaires. The results indicate the targeted experience is fulfilled in the design concept.CONCLUSION: By integrating experience design and scenario-based design methods with technology trend analysis, designers can envision experiential scenarios of meaningful life and potentially expand the design opportunity space of interactive systems.
导读:在体验经济与先进信息技术交织的趋势下,用户体验成为交互系统的实质价值。作为智能家居的早期创新之一,目前的家居清洁机器人设计仍然是由技术驱动的,关注的是实用质量,而不是机器人系统的体验价值。目的:本文旨在将清洁机器人的设计愿景从自动家用电器提升到一个有意义的机器人系统,让用户参与快乐的家务劳动。方法:从理论上将体验设计和基于场景的设计方法相结合,形成家用清洁机器人系统的具体设计框架。基于用户研究和技术趋势分析,我们首先设定了三个体验目标(沉浸、信任和灵感)来驱动设计过程,然后选择了3D点云和AI识别作为备份技术,随后提取了三个主要的设计场景(扫描测绘、智能清洁、实时控制)。结果:设计具有多视角切换、动画渲染与实景结合、定点清洗、地图管理、镜头控制与灵活遥控等特点,并提出了拍摄模式。71名参与者通过在线AttrakDiff问卷对这一概念进行了评估。结果表明,在设计理念中实现了目标体验。结论:通过将体验设计和基于场景的设计方法与技术趋势分析相结合,设计师可以设想有意义生活的体验场景,并有可能扩大交互系统的设计机会空间。
{"title":"Towards Happy Housework: Scenario-Based Experience Design for a Household Cleaning Robotic System","authors":"Yichen Lu, Zheng Liao","doi":"10.4108/eetsis.v10i3.2950","DOIUrl":"https://doi.org/10.4108/eetsis.v10i3.2950","url":null,"abstract":"INTRODUCTION: In the interwoven trend of the experience economy and advanced information technology, user experience becomes the substantial value of an interactive system. As one of the early innovations of a smart home, the current design of household cleaning robots is still driven by technology with a focus on pragmatic quality rather than the experiential value of a robotic system.OBJECTIVES: This paper aims to uplift the design vision of a cleaning robot from an automatic household appliance towards a meaningful robotic system engaging users in happy housework.METHODS: Theoretically, experience design and scenario-based design methods were combined into a specific design framework for domestic cleaning robotic systems. Based on the user study and technology trend analysis, we first set three experience goals (immersion, trust, and inspiration) to drive the design process, then chose 3D point cloud and AI recognition as backup technologies and afterwards extracted three main design scenarios (scanning and mapping, intelligent cleaning, and live control).RESULTS: The design features multi-view switching, a combination of animation rendering and real scene, fixed-point cleaning, map management, lens control and flexible remote, and shooting modes are proposed. Seventy-one participants evaluated the concept with online AttrakDiff questionnaires. The results indicate the targeted experience is fulfilled in the design concept.CONCLUSION: By integrating experience design and scenario-based design methods with technology trend analysis, designers can envision experiential scenarios of meaningful life and potentially expand the design opportunity space of interactive systems.","PeriodicalId":43034,"journal":{"name":"EAI Endorsed Transactions on Scalable Information Systems","volume":"18 1","pages":"e12"},"PeriodicalIF":1.3,"publicationDate":"2023-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76587110","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
Data Transmission of Digital Grid Assisted by Intelligent Relaying 智能中继辅助数字电网的数据传输
IF 1.3 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-01-17 DOI: 10.4108/eetsis.v10i3.2823
Shuangbai He, C. Yang, Yuda Li, Binyun Xie, Jiaqi Zhao
In this paper, we study the relaying and cache aided digital grid data transmission, where the relaying may be equipped by caching or not, depending on specific applications. For both cases, we evaluate the impact of relaying and caching on the system performance of digital grid data transmission through theoretical derivation. To this end, an analytical expression on the outage probability is firstly derived for the data transmission. We then provide an asymptotic expression on the system outage probability. Finally, some simulation results are provided to verify the correctness of the derived analysis on the system performance, and show the impact of relaying and caching on the data transmission of digital grid system. In particular, the usage of caching at the relaying can help strengthen the data transmission performance of the considered system effectively. The results in this paper could provide some reference to the development of wireless transmission and scalable information systems.
在本文中,我们研究了中继和缓存辅助的数字电网数据传输,其中中继可以配备缓存或不配备缓存,这取决于具体的应用。对于这两种情况,我们通过理论推导来评估中继和缓存对数字网格数据传输系统性能的影响。为此,首先推导了数据传输中断概率的解析表达式。然后给出了系统中断概率的渐近表达式。最后,给出了仿真结果,验证了导出分析对系统性能的正确性,并展示了中继和缓存对数字电网系统数据传输的影响。特别是,在中继中使用缓存可以帮助有效地增强所考虑的系统的数据传输性能。本文的研究结果可为无线传输和可扩展信息系统的发展提供一定的参考。
{"title":"Data Transmission of Digital Grid Assisted by Intelligent Relaying","authors":"Shuangbai He, C. Yang, Yuda Li, Binyun Xie, Jiaqi Zhao","doi":"10.4108/eetsis.v10i3.2823","DOIUrl":"https://doi.org/10.4108/eetsis.v10i3.2823","url":null,"abstract":"In this paper, we study the relaying and cache aided digital grid data transmission, where the relaying may be equipped by caching or not, depending on specific applications. For both cases, we evaluate the impact of relaying and caching on the system performance of digital grid data transmission through theoretical derivation. To this end, an analytical expression on the outage probability is firstly derived for the data transmission. We then provide an asymptotic expression on the system outage probability. Finally, some simulation results are provided to verify the correctness of the derived analysis on the system performance, and show the impact of relaying and caching on the data transmission of digital grid system. In particular, the usage of caching at the relaying can help strengthen the data transmission performance of the considered system effectively. The results in this paper could provide some reference to the development of wireless transmission and scalable information systems.","PeriodicalId":43034,"journal":{"name":"EAI Endorsed Transactions on Scalable Information Systems","volume":"16 1","pages":"e11"},"PeriodicalIF":1.3,"publicationDate":"2023-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74511146","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
Google Maps Data Analysis of Clothing Brands in South Punjab, Pakistan 谷歌地图数据分析的服装品牌在南旁遮普,巴基斯坦
IF 1.3 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-01-13 DOI: 10.4108/eetsis.v10i3.2677
Muḥammad Aḥmad, Kazim Jawad, Muhammad Bux Alvi, M. Alvi
The Internet is a popular and first-hand source of data about products and services. Before buying a product, people try to gain quick insight by scanning through online reviews about a targeted product. However, searching for a product, collecting all the relevant information, and reaching a decision is a tedious task that needs to be automated. Such composed decision-assisting text data analysis systems are not conveniently available worldwide. Such systems are a dream for major cities of South Punjab, such as Bahawalpur, Multan, and Rahimyar khan. This scenario creates a gap that needs to be filled. In this work, the popularity of clothing brands in three cities of south Punjab has been assessed by analysing the brand's popularity using sentiment analysis by prioritizing brands based on organic feedback from their potential customers. This study uses a combination of quantitative and qualitative research to examine online reviews from Google Maps. The task is accomplished by applying machine learning techniques, Logistic Regression (LR), and Support Vector Machine (SVM), on Google Maps reviews data using the n-gram feature extraction approach. The SVM algorithm proved to be better than others with the uni-bi-trigram features extraction method, achieving an average of 80.93% accuracy.
互联网是关于产品和服务的流行的第一手数据来源。在购买产品之前,人们试图通过浏览关于目标产品的在线评论来快速获得洞察力。然而,搜索产品、收集所有相关信息并做出决定是一项乏味的任务,需要自动化。这种组合决策辅助文本数据分析系统在世界范围内并不方便。这样的系统是旁遮普南部主要城市的梦想,如巴哈瓦尔布尔、木尔坦和拉希米亚尔汗。这种情况造成了一个需要填补的空白。在这项工作中,服装品牌在旁遮普南部的三个城市的受欢迎程度进行了评估,通过使用情感分析分析品牌的受欢迎程度,根据潜在客户的有机反馈对品牌进行优先排序。本研究采用定量和定性研究相结合的方法来研究谷歌Maps的在线评论。这项任务是通过应用机器学习技术、逻辑回归(LR)和支持向量机(SVM)来完成的,谷歌地图使用n-gram特征提取方法来审查数据。在单双三元特征提取方法中,SVM算法优于其他算法,平均准确率达到80.93%。
{"title":"Google Maps Data Analysis of Clothing Brands in South Punjab, Pakistan","authors":"Muḥammad Aḥmad, Kazim Jawad, Muhammad Bux Alvi, M. Alvi","doi":"10.4108/eetsis.v10i3.2677","DOIUrl":"https://doi.org/10.4108/eetsis.v10i3.2677","url":null,"abstract":"The Internet is a popular and first-hand source of data about products and services. Before buying a product, people try to gain quick insight by scanning through online reviews about a targeted product. However, searching for a product, collecting all the relevant information, and reaching a decision is a tedious task that needs to be automated. Such composed decision-assisting text data analysis systems are not conveniently available worldwide. Such systems are a dream for major cities of South Punjab, such as Bahawalpur, Multan, and Rahimyar khan. This scenario creates a gap that needs to be filled. In this work, the popularity of clothing brands in three cities of south Punjab has been assessed by analysing the brand's popularity using sentiment analysis by prioritizing brands based on organic feedback from their potential customers. This study uses a combination of quantitative and qualitative research to examine online reviews from Google Maps. The task is accomplished by applying machine learning techniques, Logistic Regression (LR), and Support Vector Machine (SVM), on Google Maps reviews data using the n-gram feature extraction approach. The SVM algorithm proved to be better than others with the uni-bi-trigram features extraction method, achieving an average of 80.93% accuracy.","PeriodicalId":43034,"journal":{"name":"EAI Endorsed Transactions on Scalable Information Systems","volume":"17 1","pages":"e10"},"PeriodicalIF":1.3,"publicationDate":"2023-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72875436","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 Novel Approach for Prediction of Gestational Diabetes based on Clinical Signs and Risk Factors 基于临床体征和危险因素预测妊娠期糖尿病的新方法
IF 1.3 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-01-11 DOI: 10.4108/eetsis.v10i3.2697
S. Reddy, Mahesh Gadiraju, N. Preethi, V.V.R.Maheswara Rao, Researc H Article
Gestational diabetes mellitus occurs due to high glucose levels in the blood. Pregnant women are affected by this type of diabetes. A blood test is to be performed to identify diabetes. The Oral Glucose Tolerance Test (OGTT) is a blood test performed between the 24th and 28th week of pregnancy that is necessary to identify and overcome the side effects of GDM. The main objective of this work is to train a model by utilizing the training data, evaluate the trained model using the test data, and compare existing machine learning algorithms with a Gradient boosting machine (GBM) to achieve a better model for the effective prediction of gestational diabetes. In this work, the analysis was done with a few existing algorithms and the Extreme learning machine and Gradient boosting techniques. The k-fold cross-validation technique is applied with values of k as 3, 5, and 10 to obtain better performance. The existing algorithms implemented are the Naive Bayes classifier, Support Vector Machine, K-Nearest Neighbour, ID3, CART and J48. The proposed algorithms are Gradient boosting and ELM. These algorithms are implemented in R programming. The metrics like accuracy, kappa statistic, sensitivity/Recall, specificity, precision, f-measure and AUC are used to compare all the algorithms. GBM has obtained better performance than existing algorithms. Then finally, GBM is compared with the other proposed robust Machine Learning algorithm, namely the Extreme learning machine, and the GBM performed better. So, It is recommended to use a gradient-boosting algorithm to predict gestational diabetes effectively. 
妊娠期糖尿病的发生是由于血液中的葡萄糖水平过高。孕妇易患这种糖尿病。要通过验血来确诊糖尿病。口服葡萄糖耐量试验(OGTT)是在妊娠24周至28周之间进行的血液检查,是识别和克服GDM副作用所必需的。本工作的主要目的是利用训练数据训练模型,使用测试数据对训练模型进行评估,并将现有的机器学习算法与梯度增强机(Gradient boosting machine, GBM)进行比较,以获得更好的模型来有效预测妊娠糖尿病。在这项工作中,分析了一些现有的算法和极限学习机和梯度增强技术。采用k-fold交叉验证技术,k值分别为3、5和10,以获得更好的性能。现有实现的算法有朴素贝叶斯分类器、支持向量机、k近邻、ID3、CART和J48。提出了梯度增强和ELM算法。这些算法是用R编程实现的。准确度、kappa统计量、灵敏度/召回率、特异性、精度、f-measure和AUC等指标用于比较所有算法。与现有算法相比,该算法获得了更好的性能。最后,将GBM算法与另一种鲁棒机器学习算法(Extreme Learning Machine)进行比较,结果表明GBM算法具有更好的性能。因此,建议采用梯度增强算法有效预测妊娠期糖尿病。
{"title":"A Novel Approach for Prediction of Gestational Diabetes based on Clinical Signs and Risk Factors","authors":"S. Reddy, Mahesh Gadiraju, N. Preethi, V.V.R.Maheswara Rao, Researc H Article","doi":"10.4108/eetsis.v10i3.2697","DOIUrl":"https://doi.org/10.4108/eetsis.v10i3.2697","url":null,"abstract":"Gestational diabetes mellitus occurs due to high glucose levels in the blood. Pregnant women are affected by this type of diabetes. A blood test is to be performed to identify diabetes. The Oral Glucose Tolerance Test (OGTT) is a blood test performed between the 24th and 28th week of pregnancy that is necessary to identify and overcome the side effects of GDM. The main objective of this work is to train a model by utilizing the training data, evaluate the trained model using the test data, and compare existing machine learning algorithms with a Gradient boosting machine (GBM) to achieve a better model for the effective prediction of gestational diabetes. In this work, the analysis was done with a few existing algorithms and the Extreme learning machine and Gradient boosting techniques. The k-fold cross-validation technique is applied with values of k as 3, 5, and 10 to obtain better performance. The existing algorithms implemented are the Naive Bayes classifier, Support Vector Machine, K-Nearest Neighbour, ID3, CART and J48. The proposed algorithms are Gradient boosting and ELM. These algorithms are implemented in R programming. The metrics like accuracy, kappa statistic, sensitivity/Recall, specificity, precision, f-measure and AUC are used to compare all the algorithms. GBM has obtained better performance than existing algorithms. Then finally, GBM is compared with the other proposed robust Machine Learning algorithm, namely the Extreme learning machine, and the GBM performed better. So, It is recommended to use a gradient-boosting algorithm to predict gestational diabetes effectively.\u0000 ","PeriodicalId":43034,"journal":{"name":"EAI Endorsed Transactions on Scalable Information Systems","volume":"4 11","pages":"e8"},"PeriodicalIF":1.3,"publicationDate":"2023-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72367793","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
Secure Data Processing Technology of Distribution Network OPGW Line with Edge Computing 基于边缘计算的配电网OPGW线路安全数据处理技术
IF 1.3 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-01-11 DOI: 10.4108/eetsis.v10i3.2837
Ying Zeng, Zhongmiao Kang, Zhan Shi
Promoted by information technology and scalable information systems, the network design and communication method of optical fiber composite overhead ground wire (OPGW) have been in great progress recently. As the overhead transmission line has strict requirements on the outer diameter and weight of OPGW, it is of vital importance to perform the physical-layer secure data processing for the distribution network OPGW line with edge computing. To this end, we examine a physical-layer secure distribution network OPGW with edge computing in this article, where there exists one transmitter S, one receiver D, one authorized legitimate monitor LM, and an interfering node I. To better analyze the system performance, we firstly give the definition of the system outage probability, based on the secure data rate. Then, we evaluate the system performance for the distribution network OPGW, by deriving analytical outage probability of secure data processing, to facilitate the system performance evaluation of secure data processing in the entire SNR regime. Finally, we demonstrate some simulation results to validate the analytical results on the physical-layer secure distribution network OPGW line with edge computing.
在信息技术和可扩展信息系统的推动下,近年来光纤复合架空地线(OPGW)的网络设计和通信方式有了很大的发展。由于架空输电线路对OPGW的外径和重量有严格的要求,利用边缘计算对配电网OPGW线路进行物理层安全数据处理至关重要。为此,本文研究了一个具有边缘计算的物理层安全配电网络OPGW,其中存在一个发送器S,一个接收器D,一个授权的合法监视器LM和一个干扰节点i。为了更好地分析系统性能,我们首先给出了基于安全数据速率的系统中断概率的定义。然后,通过推导安全数据处理的分析中断概率,对配电网OPGW的系统性能进行了评估,以便于在整个信噪比范围内对安全数据处理的系统性能进行评估。最后,我们用边缘计算在物理层安全配电网OPGW线路上进行了仿真,验证了分析结果。
{"title":"Secure Data Processing Technology of Distribution Network OPGW Line with Edge Computing","authors":"Ying Zeng, Zhongmiao Kang, Zhan Shi","doi":"10.4108/eetsis.v10i3.2837","DOIUrl":"https://doi.org/10.4108/eetsis.v10i3.2837","url":null,"abstract":"Promoted by information technology and scalable information systems, the network design and communication method of optical fiber composite overhead ground wire (OPGW) have been in great progress recently. As the overhead transmission line has strict requirements on the outer diameter and weight of OPGW, it is of vital importance to perform the physical-layer secure data processing for the distribution network OPGW line with edge computing. To this end, we examine a physical-layer secure distribution network OPGW with edge computing in this article, where there exists one transmitter S, one receiver D, one authorized legitimate monitor LM, and an interfering node I. To better analyze the system performance, we firstly give the definition of the system outage probability, based on the secure data rate. Then, we evaluate the system performance for the distribution network OPGW, by deriving analytical outage probability of secure data processing, to facilitate the system performance evaluation of secure data processing in the entire SNR regime. Finally, we demonstrate some simulation results to validate the analytical results on the physical-layer secure distribution network OPGW line with edge computing.","PeriodicalId":43034,"journal":{"name":"EAI Endorsed Transactions on Scalable Information Systems","volume":"1 1","pages":"e7"},"PeriodicalIF":1.3,"publicationDate":"2023-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89575860","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 Technique for Cluster Head Selection in Wireless Sensor Networks Using African Vultures Optimization Algorithm 基于非洲秃鹫优化算法的无线传感器网络簇头选择技术
IF 1.3 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-01-11 DOI: 10.4108/eetsis.v10i3.2680
Vipan Kusla, Gurbinder Singh Brar
INTRODUCTION: Wireless Sensor Network (WSN) has caught the interest of researchers due to the rising popularity of Internet of things(IOT) based smart products and services. In challenging environmental conditions, WSN employs a large number of nodes with limited battery power to sense and transmit data to the base station(BS). Direct data transmission to the BS uses a lot of energy in these circumstances. Selecting the CH in a clustered WSN is considered to be an NP-hard problem.OBJECTIVES: The objective of this work to provide an effective cluster head selection method that minimize the overall network energy consumption, improved throughput with the main goal of enhanced network lifetime.METHODS: In this work, a meta heuristic based cluster head selection technique is proposed that has shown an edge over the other state of the art techniques. Cluster compactness, intra-cluster distance, and residual energy are taken into account while choosing CH using multi-objective function. Once the CHs have been identified, data transfer from the CHs to the base station begins. The residual energy of the nodes is finally updated during the data transmission begins.RESULTS: An analysis of the results has been performed based on average energy consumption, total energy consumption, network lifetime and throughput using two different WSN scenarios. Also, a comparison of the performance has been made other techniques namely Artificial Bee Colony (ABC), Ant Colony Optimization (ACO), Atom Search Optimization (ASO), Gorilla Troop Optimization (GTO), Harmony Search (HS), Wild Horse Optimization (WHO), Particle Swarm Optimization (PSO), Firefly Algorithm (FA) and Biogeography Based Optimization (BBO). The findings show that AVOA's first node dies at round 1391 in Scenario-1 and round 1342 in Scenario-2 which is due to lower energy consumption by the sensor nodes thus increasing lifespan of the WSN network.CONCLUSION: As per the findings, the proposed technique outperforms ABC, ACO, ASO, GTO, HS, WHO, PSO, FA, and BBO in terms of performance evaluation parameters and boosting the reliability of networks over the other state of art techniques.
导言:由于基于物联网(IOT)的智能产品和服务的日益普及,无线传感器网络(WSN)引起了研究人员的兴趣。在具有挑战性的环境条件下,WSN采用大量节点和有限的电池电量来感知和传输数据到基站(BS)。在这种情况下,直接将数据传输到BS会消耗大量的能量。在聚类WSN中选择CH被认为是一个np困难问题。目标:本工作的目标是提供一种有效的簇头选择方法,使整体网络能耗最小化,提高吞吐量,主要目标是增强网络生命周期。方法:在这项工作中,提出了一种基于元启发式的簇头选择技术,该技术比其他先进技术具有优势。利用多目标函数选择CH时,考虑了簇紧密度、簇内距离和剩余能量。一旦识别出通信中心,就开始从通信中心向基站传输数据。在数据传输开始时,节点的剩余能量最终被更新。结果:对使用两种不同WSN场景的平均能耗、总能耗、网络寿命和吞吐量进行了结果分析。并对人工蜂群(ABC)、蚁群优化(ACO)、原子搜索优化(ASO)、大猩猩群体优化(GTO)、和谐搜索(HS)、野马优化(WHO)、粒子群优化(PSO)、萤火虫算法(FA)和基于生物地理的优化(BBO)等算法的性能进行了比较。研究结果表明,在场景1中,AVOA的第一个节点在1391轮死亡,在场景2中是1342轮死亡,这是由于传感器节点的能量消耗较低,从而增加了WSN网络的寿命。结论:根据研究结果,该技术在性能评估参数方面优于ABC, ACO, ASO, GTO, HS, WHO, PSO, FA和BBO,并且比其他最先进的技术提高了网络的可靠性。
{"title":"A Technique for Cluster Head Selection in Wireless Sensor Networks Using African Vultures Optimization Algorithm","authors":"Vipan Kusla, Gurbinder Singh Brar","doi":"10.4108/eetsis.v10i3.2680","DOIUrl":"https://doi.org/10.4108/eetsis.v10i3.2680","url":null,"abstract":"INTRODUCTION: Wireless Sensor Network (WSN) has caught the interest of researchers due to the rising popularity of Internet of things(IOT) based smart products and services. In challenging environmental conditions, WSN employs a large number of nodes with limited battery power to sense and transmit data to the base station(BS). Direct data transmission to the BS uses a lot of energy in these circumstances. Selecting the CH in a clustered WSN is considered to be an NP-hard problem.\u0000OBJECTIVES: The objective of this work to provide an effective cluster head selection method that minimize the overall network energy consumption, improved throughput with the main goal of enhanced network lifetime.\u0000METHODS: In this work, a meta heuristic based cluster head selection technique is proposed that has shown an edge over the other state of the art techniques. Cluster compactness, intra-cluster distance, and residual energy are taken into account while choosing CH using multi-objective function. Once the CHs have been identified, data transfer from the CHs to the base station begins. The residual energy of the nodes is finally updated during the data transmission begins.\u0000RESULTS: An analysis of the results has been performed based on average energy consumption, total energy consumption, network lifetime and throughput using two different WSN scenarios. Also, a comparison of the performance has been made other techniques namely Artificial Bee Colony (ABC), Ant Colony Optimization (ACO), Atom Search Optimization (ASO), Gorilla Troop Optimization (GTO), Harmony Search (HS), Wild Horse Optimization (WHO), Particle Swarm Optimization (PSO), Firefly Algorithm (FA) and Biogeography Based Optimization (BBO). The findings show that AVOA's first node dies at round 1391 in Scenario-1 and round 1342 in Scenario-2 which is due to lower energy consumption by the sensor nodes thus increasing lifespan of the WSN network.\u0000CONCLUSION: As per the findings, the proposed technique outperforms ABC, ACO, ASO, GTO, HS, WHO, PSO, FA, and BBO in terms of performance evaluation parameters and boosting the reliability of networks over the other state of art techniques.","PeriodicalId":43034,"journal":{"name":"EAI Endorsed Transactions on Scalable Information Systems","volume":"38 1","pages":"e9"},"PeriodicalIF":1.3,"publicationDate":"2023-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76029568","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
Matrix Completion via Successive Low-rank Matrix Approximation 通过逐次低秩矩阵逼近的矩阵补全
IF 1.3 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-01-04 DOI: 10.4108/eetsis.v10i3.2878
Jin Wang, Z. Mo
In this paper, a successive low-rank matrix approximation algorithm is presented for the matrix completion (MC) based on hard thresholding method, which approximate the optimal low-rank matrix from rank-one matrix step by step. The algorithm enables the distance between the matrix with the observed elements and the projection on low-rank manifold to be minimum. The optimal low-rank matrix with observed elements is obtained when the distance is zero. In theory, convergence and convergent error of the new algorithm are analyzed in detail. Furthermore, some numerical experiments show that the algorithm is more effective in CPU time and precision than the orthogonal rank-one matrix pursuit(OR1MP) algorithm and the augmented Lagrange multiplier (ALM) method when the sampling rate is low.
本文提出了一种基于硬阈值法的矩阵补全的逐次低秩矩阵逼近算法,该算法从秩一矩阵逐次逼近最优低秩矩阵。该算法使矩阵与观测元素之间的距离与低秩流形上的投影之间的距离最小。当距离为零时,得到具有观测元素的最优低秩矩阵。从理论上详细分析了新算法的收敛性和收敛误差。数值实验表明,当采样率较低时,该算法在CPU时间和精度上都优于正交秩一矩阵追踪(OR1MP)算法和增广拉格朗日乘子(ALM)方法。
{"title":"Matrix Completion via Successive Low-rank Matrix Approximation","authors":"Jin Wang, Z. Mo","doi":"10.4108/eetsis.v10i3.2878","DOIUrl":"https://doi.org/10.4108/eetsis.v10i3.2878","url":null,"abstract":"In this paper, a successive low-rank matrix approximation algorithm is presented for the matrix completion (MC) based on hard thresholding method, which approximate the optimal low-rank matrix from rank-one matrix step by step. The algorithm enables the distance between the matrix with the observed elements and the projection on low-rank manifold to be minimum. The optimal low-rank matrix with observed elements is obtained when the distance is zero. In theory, convergence and convergent error of the new algorithm are analyzed in detail. Furthermore, some numerical experiments show that the algorithm is more effective in CPU time and precision than the orthogonal rank-one matrix pursuit(OR1MP) algorithm and the augmented Lagrange multiplier (ALM) method when the sampling rate is low.","PeriodicalId":43034,"journal":{"name":"EAI Endorsed Transactions on Scalable Information Systems","volume":"260 1","pages":"e6"},"PeriodicalIF":1.3,"publicationDate":"2023-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77185995","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
Online Document Transmission and Recognition of Digital Power Grid with Knowledge Graph 基于知识图谱的数字电网在线文档传输与识别
IF 1.3 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-01-04 DOI: 10.4108/eetsis.v10i3.2831
Yuzhong Zhou, Zhèng-Hóng Lin, Liang-Jung Tu, Qiansu Lv
Inspired by the ever-developing information technology and scalable information systems, digital smart grid networks with knowledge graph have been widely applied in many practical scenarios, where the online document transmission and recognition plays an important role in wireless environments. In this article, we investigate the online document transmission and recognition of digital power grid with knowledge graph. In particular, we jointly consider the impact of online transmission and recognition based on computing, where the wireless transmission channels and computing capability are randomly varying. For the considered system, we investigate the system performance by deriving the analytical expression of outage probability, defined by the transmission and recognition latency. Finally, we provide some results to verify the proposed studies, and show that the wireless transmission and computing capability both impose a significant impact on the online document transmission and recognition of digital power grid networks.
随着信息技术的不断发展和信息系统的不断扩展,具有知识图谱的数字智能电网在许多实际场景中得到了广泛的应用,其中无线环境下的在线文档传输和识别起着重要的作用。本文研究了基于知识图谱的数字电网在线文档传输与识别。特别是,我们共同考虑了基于计算的在线传输和识别的影响,其中无线传输信道和计算能力是随机变化的。对于所考虑的系统,我们通过推导由传输和识别延迟定义的中断概率的解析表达式来研究系统性能。最后,我们提供了一些结果来验证所提出的研究,并表明无线传输和计算能力对数字电网网络的在线文档传输和识别都有重要影响。
{"title":"Online Document Transmission and Recognition of Digital Power Grid with Knowledge Graph","authors":"Yuzhong Zhou, Zhèng-Hóng Lin, Liang-Jung Tu, Qiansu Lv","doi":"10.4108/eetsis.v10i3.2831","DOIUrl":"https://doi.org/10.4108/eetsis.v10i3.2831","url":null,"abstract":"Inspired by the ever-developing information technology and scalable information systems, digital smart grid networks with knowledge graph have been widely applied in many practical scenarios, where the online document transmission and recognition plays an important role in wireless environments. In this article, we investigate the online document transmission and recognition of digital power grid with knowledge graph. In particular, we jointly consider the impact of online transmission and recognition based on computing, where the wireless transmission channels and computing capability are randomly varying. For the considered system, we investigate the system performance by deriving the analytical expression of outage probability, defined by the transmission and recognition latency. Finally, we provide some results to verify the proposed studies, and show that the wireless transmission and computing capability both impose a significant impact on the online document transmission and recognition of digital power grid networks.","PeriodicalId":43034,"journal":{"name":"EAI Endorsed Transactions on Scalable Information Systems","volume":"31 1","pages":"e5"},"PeriodicalIF":1.3,"publicationDate":"2023-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90823690","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
期刊
EAI Endorsed Transactions on Scalable Information Systems
全部 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