首页 > 最新文献

2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)最新文献

英文 中文
Analysis of Resource Usage Management Plan for Federated Learning in Hybrid Cloud 混合云中联邦学习的资源使用管理方案分析
Sangwon Oh, Hyeju Shin, Minsoo Hahn, Jinsul Kim
With the emergence of a flexible mix of private and public clouds based on business requirements, the need for a system that supports application deployment to a variety of cloud environments has emerged. In particular, it is necessary to secure the security of data in applications based on federated learning and to monitor resource usage in the cloud. This paper seeks ways to monitor and manage cloud resource usage according to various hyperparameters when conducting federated learning in a hybrid cloud environment. In a Docker-based cloud environment, we present an improved method for using efficient cloud resources while controlling the metric and resource usage trend of the federated learning model according to the imbalance of the data set.
随着基于业务需求的私有云和公共云的灵活组合的出现,对支持将应用程序部署到各种云环境的系统的需求已经出现。特别是,有必要确保基于联邦学习的应用程序中的数据安全性,并监控云中的资源使用情况。本文寻求在混合云环境中进行联邦学习时,根据各种超参数监控和管理云资源使用情况的方法。在基于docker的云环境中,我们提出了一种改进的方法,在有效利用云资源的同时,根据数据集的不平衡性控制联邦学习模型的度量和资源使用趋势。
{"title":"Analysis of Resource Usage Management Plan for Federated Learning in Hybrid Cloud","authors":"Sangwon Oh, Hyeju Shin, Minsoo Hahn, Jinsul Kim","doi":"10.1109/ICAIIC57133.2023.10067124","DOIUrl":"https://doi.org/10.1109/ICAIIC57133.2023.10067124","url":null,"abstract":"With the emergence of a flexible mix of private and public clouds based on business requirements, the need for a system that supports application deployment to a variety of cloud environments has emerged. In particular, it is necessary to secure the security of data in applications based on federated learning and to monitor resource usage in the cloud. This paper seeks ways to monitor and manage cloud resource usage according to various hyperparameters when conducting federated learning in a hybrid cloud environment. In a Docker-based cloud environment, we present an improved method for using efficient cloud resources while controlling the metric and resource usage trend of the federated learning model according to the imbalance of the data set.","PeriodicalId":105769,"journal":{"name":"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125011630","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
Dimensionality reduction as a non-cooperative game 作为非合作博弈的维数缩减
H. Honda, Phuong Dinh, Pham Thu Thao, Yuho Tabata, Bui Duc Anh
A novel non-cooperative game theory-based approach for dimensionality reduction is proposed. We regard the sample elements in a higher-dimensional space as players in a game each of which has its strategy. A set of these strategies was implemented as an embedding of dimensionality reduction, which maps the sample elements into lower-dimensional spaces. Based on the theory of non-cooperative $N$-player games, we show the existence of Nash equilibria. We also provide an algorithm that yields Nash equilibrium based on the theory of nonlinear functional analysis.
提出了一种新的基于非合作博弈理论的降维方法。我们将高维空间中的样本元素视为游戏中的玩家,每个玩家都有自己的策略。一组这些策略被实现为嵌入的降维,将样本元素映射到低维空间。基于非合作N人博弈理论,证明了纳什均衡的存在性。我们还提供了一种基于非线性泛函分析理论的纳什均衡算法。
{"title":"Dimensionality reduction as a non-cooperative game","authors":"H. Honda, Phuong Dinh, Pham Thu Thao, Yuho Tabata, Bui Duc Anh","doi":"10.1109/ICAIIC57133.2023.10067075","DOIUrl":"https://doi.org/10.1109/ICAIIC57133.2023.10067075","url":null,"abstract":"A novel non-cooperative game theory-based approach for dimensionality reduction is proposed. We regard the sample elements in a higher-dimensional space as players in a game each of which has its strategy. A set of these strategies was implemented as an embedding of dimensionality reduction, which maps the sample elements into lower-dimensional spaces. Based on the theory of non-cooperative $N$-player games, we show the existence of Nash equilibria. We also provide an algorithm that yields Nash equilibrium based on the theory of nonlinear functional analysis.","PeriodicalId":105769,"journal":{"name":"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123414365","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
Crossover Methods Comparison in Flood Evacuation Route Optimization 洪水疏散路线优化中的交叉方法比较
M. Nur, Hazriani, N. K. Nur
This study aims to implement the genetic algorithm by testing the appropriate crossover methods in order to obtain optimal disaster evacuation routes based three main indicators, namely travel time, possible transportation mode, and affected road conditions. The research phase begins with establishing a flood-affected area scenario consisting of the victim's initial location, evacuation location, routing areas, affected road conditions, distance, as well as travel time. The genetic algorithm is applied by representing the genes and chromosomes based on the available data, generating the initial population and calculating the fitness value. At the stage of determining the parent in forming a new individual, roulette wheel selection is used. For the crossover method to produce new individuals, there are 3 methods tested namely single-point, two-point and uniform crossover. The new formed individuals are then mutated with a probability level of 0.1. The last stage is to form a new population by sorting individuals with the highest fitness value. These processes took place with an iteration limit of 1000. Based on the results of the implementation and tests conducted, the uniform crossover method has the most optimal results with accuracy 90% and highest fitness value of 0.896. Meanwhile, the two others methods two-point and single-point have extremely lower accuracy which are 70% and 60% respectively. This result confirmed the statement of previous research which convinced that the uniform crossover is the most effective crossover method.
本研究旨在基于出行时间、可能的交通方式和受影响的路况三个主要指标,通过测试合适的交叉方法来实现遗传算法,以获得最优的灾害疏散路线。研究阶段首先建立一个受洪水影响的地区情景,包括受害者的初始位置、疏散位置、路线区域、受影响的道路状况、距离以及旅行时间。采用遗传算法,根据可用数据表示基因和染色体,生成初始种群并计算适应度值。在确定形成新个体的亲本阶段,采用轮盘选择。对于交叉产生新个体的方法,测试了三种方法,即单点交叉、两点交叉和均匀交叉。新形成的个体以0.1的概率发生突变。最后一个阶段是通过对适应度值最高的个体进行分类,形成一个新的种群。这些过程以1000次的迭代限制进行。根据实施结果和测试结果,均匀交叉方法的结果最优,准确率为90%,适应度最高为0.896。另外两种方法,两点法和单点法的精度都非常低,分别为70%和60%。这一结果证实了以往研究的结论,即均匀交叉是最有效的交叉方法。
{"title":"Crossover Methods Comparison in Flood Evacuation Route Optimization","authors":"M. Nur, Hazriani, N. K. Nur","doi":"10.1109/ICAIIC57133.2023.10067101","DOIUrl":"https://doi.org/10.1109/ICAIIC57133.2023.10067101","url":null,"abstract":"This study aims to implement the genetic algorithm by testing the appropriate crossover methods in order to obtain optimal disaster evacuation routes based three main indicators, namely travel time, possible transportation mode, and affected road conditions. The research phase begins with establishing a flood-affected area scenario consisting of the victim's initial location, evacuation location, routing areas, affected road conditions, distance, as well as travel time. The genetic algorithm is applied by representing the genes and chromosomes based on the available data, generating the initial population and calculating the fitness value. At the stage of determining the parent in forming a new individual, roulette wheel selection is used. For the crossover method to produce new individuals, there are 3 methods tested namely single-point, two-point and uniform crossover. The new formed individuals are then mutated with a probability level of 0.1. The last stage is to form a new population by sorting individuals with the highest fitness value. These processes took place with an iteration limit of 1000. Based on the results of the implementation and tests conducted, the uniform crossover method has the most optimal results with accuracy 90% and highest fitness value of 0.896. Meanwhile, the two others methods two-point and single-point have extremely lower accuracy which are 70% and 60% respectively. This result confirmed the statement of previous research which convinced that the uniform crossover is the most effective crossover method.","PeriodicalId":105769,"journal":{"name":"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127659054","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 Review on AI-Driven Aerial Access Networks: Challenges and Open Research Issues 人工智能驱动的空中接入网络综述:挑战与开放研究问题
D. Lakew, Anh-Tien Tran, Arooj Masood, Nhu-Ngoc Dao, Sungrae Cho
Aerial access networks (AANs) consisting of low altitude platforms (LAPs) and high altitude platforms (HAPs) have been considered as emerging wireless networking technologies to enhance both the capacity and coverage of future wireless networks, especially in remote and hard to reach areas with lack of terrestrial base stations. However, the limited onboard resources and high dynamicity of the network make challenging to optimally manage both the communication and computation resources for an efficient aerial networking infrastructure. On the other hand, artificial intelligence (AI), especially reinforcement learning- and deep reinforcement learning-based networking, are attracting significant attention to capture the network dynamicity and long-term resource management performance, recently. Thus, in this paper, we first provide a taxonomy of AI-driven aerial access networks and then, present a review and discussion on the state-of-the-art researches on AI-driven AANs from the communication and computation perspective. Moreover, we identify existing research challenges and provide future research direction for further investigations.
由低空平台(lap)和高空平台(HAPs)组成的空中接入网络(AANs)被认为是新兴的无线网络技术,可以增强未来无线网络的容量和覆盖范围,特别是在缺乏地面基站的偏远和难以到达的地区。然而,有限的机载资源和网络的高动态性使得优化管理通信和计算资源以实现高效的空中网络基础设施具有挑战性。另一方面,人工智能(AI),特别是基于强化学习和深度强化学习的网络,最近引起了人们对网络动态和长期资源管理性能的关注。因此,本文首先对人工智能驱动的空中接入网络进行了分类,然后从通信和计算的角度对人工智能驱动的空中接入网络的研究现状进行了回顾和讨论。此外,我们还指出了现有的研究挑战,并为进一步的研究提供了未来的研究方向。
{"title":"A Review on AI-Driven Aerial Access Networks: Challenges and Open Research Issues","authors":"D. Lakew, Anh-Tien Tran, Arooj Masood, Nhu-Ngoc Dao, Sungrae Cho","doi":"10.1109/ICAIIC57133.2023.10067056","DOIUrl":"https://doi.org/10.1109/ICAIIC57133.2023.10067056","url":null,"abstract":"Aerial access networks (AANs) consisting of low altitude platforms (LAPs) and high altitude platforms (HAPs) have been considered as emerging wireless networking technologies to enhance both the capacity and coverage of future wireless networks, especially in remote and hard to reach areas with lack of terrestrial base stations. However, the limited onboard resources and high dynamicity of the network make challenging to optimally manage both the communication and computation resources for an efficient aerial networking infrastructure. On the other hand, artificial intelligence (AI), especially reinforcement learning- and deep reinforcement learning-based networking, are attracting significant attention to capture the network dynamicity and long-term resource management performance, recently. Thus, in this paper, we first provide a taxonomy of AI-driven aerial access networks and then, present a review and discussion on the state-of-the-art researches on AI-driven AANs from the communication and computation perspective. Moreover, we identify existing research challenges and provide future research direction for further investigations.","PeriodicalId":105769,"journal":{"name":"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127891959","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 Performance Efficient Approach of Global Training in Federated Learning 联邦学习中高效的全局训练方法
D. M. S. Bhatti, Haewoon Nam
Federated learning is a novel approach of training the global model on the server by utilizing the personal data of the end users while data privacy is preserved. The users called clients are required to perform the local training using their local datasets and forward those trained local models to the server, in which the local models are aggregated to update the global model. This process of global training is carried out for several rounds until the convergence. Practically, the clients' data is non-independent and identically distributed (Non-IID). Hence, the updated local model of each client may vary from every other client due to heterogeneity among them. Hence, the process of aggregating the diversified local models of clients has a huge impact on the performance of global training. This article proposes a performance efficient aggregation approach for federated learning, which considers the data heterogeneity among clients before aggregating the received local models. The proposed approach is compared with the conventional federated learning methods, and it achieves improved performance.
联邦学习是一种在保护数据隐私的情况下利用最终用户的个人数据在服务器上训练全局模型的新方法。称为客户端的用户需要使用其本地数据集执行本地训练,并将这些训练好的本地模型转发给服务器,在服务器中聚合本地模型以更新全局模型。这一全球训练过程进行了几轮,直到汇合。实际上,客户端的数据是非独立和同分布的(Non-IID)。因此,由于客户机之间的异构性,每个客户机更新后的本地模型可能与其他客户机不同。因此,整合客户多样化的本地模式的过程对全球培训的绩效有着巨大的影响。本文提出了一种性能高效的联邦学习聚合方法,该方法在聚合接收到的本地模型之前考虑了客户端之间的数据异质性。该方法与传统的联邦学习方法进行了比较,取得了较好的效果。
{"title":"A Performance Efficient Approach of Global Training in Federated Learning","authors":"D. M. S. Bhatti, Haewoon Nam","doi":"10.1109/ICAIIC57133.2023.10066985","DOIUrl":"https://doi.org/10.1109/ICAIIC57133.2023.10066985","url":null,"abstract":"Federated learning is a novel approach of training the global model on the server by utilizing the personal data of the end users while data privacy is preserved. The users called clients are required to perform the local training using their local datasets and forward those trained local models to the server, in which the local models are aggregated to update the global model. This process of global training is carried out for several rounds until the convergence. Practically, the clients' data is non-independent and identically distributed (Non-IID). Hence, the updated local model of each client may vary from every other client due to heterogeneity among them. Hence, the process of aggregating the diversified local models of clients has a huge impact on the performance of global training. This article proposes a performance efficient aggregation approach for federated learning, which considers the data heterogeneity among clients before aggregating the received local models. The proposed approach is compared with the conventional federated learning methods, and it achieves improved performance.","PeriodicalId":105769,"journal":{"name":"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121142592","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
Tree-Based Ensemble Models and Algorithms for Classification 基于树的集成模型和分类算法
J. Tsiligaridis
An ensemble method is viewed as a compound model. The purpose of such a model is to achieve better predictive performance. The attempt is to tune predictions to observations by decreasing model variance, and bias. First the work focuses at the presentation of the Projective Decision Tree Algorithm (PA), a sort of Decision Tree (DT) based on purity and using the criterion of next node (CNN). Secondly, two sets of algorithms that provide improvement of the predictive performance are developed the first set of the Tree-Based Ensemble models of bagging and boosting types and the second set of known individual algorithms. The accuracy performance of the two sets with comparison is examined. Promising results based on accuracy of the proposed models are obtained.
集成方法被看作是一个复合模型。这种模型的目的是为了获得更好的预测性能。试图通过减少模型方差和偏差来调整预测结果。首先,本文重点介绍了一种基于纯度并使用下一节点(CNN)准则的决策树(DT)——投影决策树算法(PA)。其次,开发了两组改进预测性能的算法:第一组基于树的套袋和提升类型集成模型和第二组已知的单个算法。通过对比,检验了两组算法的精度性能。基于所提模型的精度,得到了令人满意的结果。
{"title":"Tree-Based Ensemble Models and Algorithms for Classification","authors":"J. Tsiligaridis","doi":"10.1109/ICAIIC57133.2023.10067006","DOIUrl":"https://doi.org/10.1109/ICAIIC57133.2023.10067006","url":null,"abstract":"An ensemble method is viewed as a compound model. The purpose of such a model is to achieve better predictive performance. The attempt is to tune predictions to observations by decreasing model variance, and bias. First the work focuses at the presentation of the Projective Decision Tree Algorithm (PA), a sort of Decision Tree (DT) based on purity and using the criterion of next node (CNN). Secondly, two sets of algorithms that provide improvement of the predictive performance are developed the first set of the Tree-Based Ensemble models of bagging and boosting types and the second set of known individual algorithms. The accuracy performance of the two sets with comparison is examined. Promising results based on accuracy of the proposed models are obtained.","PeriodicalId":105769,"journal":{"name":"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115964431","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
Differential Image-based Fast and Compatible Convolutional Layers for Multi-core Processors 基于差分图像的多核处理器快速兼容卷积层
Sunghoon Hong, Dae-Geun Park
Convolutional neural networks with powerful visual image analysis for artificial intelligence are gaining popularity in many research fields, leading to the development of various high-performance algorithms for convolution operators present in these networks. One of these approaches is implemented with general matrix multiplication (GEMM) using the well-known im2col transform for fast convolution operations. In this paper, we propose a multi-core processor-based convolution technique for high-speed convolutional neural networks (CNNs) using differential images. The proposed method improves the convolutional layer's response speed by reducing the computational complexity and using multi-thread technology. In addition, the proposed algorithm has the advantage of being compatible with all types of CNNs. We use the darknet network to evaluate the convolutional layer's performance and show the best performance of the proposed algorithm when using 4-thread parallel processing.
卷积神经网络具有强大的人工智能视觉图像分析能力,在许多研究领域越来越受欢迎,导致了这些网络中各种高性能卷积算子算法的发展。其中一种方法是使用通用矩阵乘法(GEMM)实现的,使用著名的im2col变换进行快速卷积操作。在本文中,我们提出了一种基于多核处理器的卷积技术,用于高速卷积神经网络(cnn)的差分图像。该方法通过降低计算复杂度和采用多线程技术提高了卷积层的响应速度。此外,该算法还具有兼容所有类型cnn的优点。我们使用暗网网络来评估卷积层的性能,并在使用4线程并行处理时显示了所提出算法的最佳性能。
{"title":"Differential Image-based Fast and Compatible Convolutional Layers for Multi-core Processors","authors":"Sunghoon Hong, Dae-Geun Park","doi":"10.1109/ICAIIC57133.2023.10066972","DOIUrl":"https://doi.org/10.1109/ICAIIC57133.2023.10066972","url":null,"abstract":"Convolutional neural networks with powerful visual image analysis for artificial intelligence are gaining popularity in many research fields, leading to the development of various high-performance algorithms for convolution operators present in these networks. One of these approaches is implemented with general matrix multiplication (GEMM) using the well-known im2col transform for fast convolution operations. In this paper, we propose a multi-core processor-based convolution technique for high-speed convolutional neural networks (CNNs) using differential images. The proposed method improves the convolutional layer's response speed by reducing the computational complexity and using multi-thread technology. In addition, the proposed algorithm has the advantage of being compatible with all types of CNNs. We use the darknet network to evaluate the convolutional layer's performance and show the best performance of the proposed algorithm when using 4-thread parallel processing.","PeriodicalId":105769,"journal":{"name":"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126403266","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
Early Product Cost Estimation by Intelligent Machine Learning Algorithms 基于智能机器学习算法的早期产品成本估算
R. Lackes, J. Sengewald
Predicting the total manufacturing costs of a new product early in its development is an obstacle for many businesses, especially when selecting between different product designs and their cost implications. Typically, material costs comprise a large part of total manufacturing costs, and therefore obtaining an early estimate of material costs can help businesses in predicting the total manufacturing costs more accurately. At the early stage of product development, with many imponderables and frequent design modifications, it would be impractical to obtain quotations from suppliers. We, therefore, developed a two-stage machine learning scheme estimating the material cost to guide alternative product design choices that yield a lower total manufacturing cost. Our innovative two-stage technique for cost estimation is meant to overcome this issue. In this paper, we demonstrate that neural networks, a prevalent technique in the literature, can be enhanced by adding the concept of modularity to the estimation of the pricing of technical components already during the design process of a new product.
对许多企业来说,在新产品开发的早期预测其总制造成本是一个障碍,尤其是在选择不同的产品设计及其成本影响时。通常,材料成本占总制造成本的很大一部分,因此获得材料成本的早期估计可以帮助企业更准确地预测总制造成本。在产品开发的早期阶段,有许多不可估量的因素和频繁的设计修改,从供应商那里获得报价是不切实际的。因此,我们开发了一个估算材料成本的两阶段机器学习方案,以指导产生较低总制造成本的替代产品设计选择。我们创新的两阶段成本估算技术就是为了克服这个问题。在本文中,我们证明了神经网络,一种在文献中流行的技术,可以通过在新产品的设计过程中将模块化的概念添加到技术组件的定价估计中来增强。
{"title":"Early Product Cost Estimation by Intelligent Machine Learning Algorithms","authors":"R. Lackes, J. Sengewald","doi":"10.1109/ICAIIC57133.2023.10067092","DOIUrl":"https://doi.org/10.1109/ICAIIC57133.2023.10067092","url":null,"abstract":"Predicting the total manufacturing costs of a new product early in its development is an obstacle for many businesses, especially when selecting between different product designs and their cost implications. Typically, material costs comprise a large part of total manufacturing costs, and therefore obtaining an early estimate of material costs can help businesses in predicting the total manufacturing costs more accurately. At the early stage of product development, with many imponderables and frequent design modifications, it would be impractical to obtain quotations from suppliers. We, therefore, developed a two-stage machine learning scheme estimating the material cost to guide alternative product design choices that yield a lower total manufacturing cost. Our innovative two-stage technique for cost estimation is meant to overcome this issue. In this paper, we demonstrate that neural networks, a prevalent technique in the literature, can be enhanced by adding the concept of modularity to the estimation of the pricing of technical components already during the design process of a new product.","PeriodicalId":105769,"journal":{"name":"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126404925","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
Recent Studies on Deep Reinforcement Learning in RIS-UAV Communication Networks RIS-UAV通信网络中深度强化学习研究进展
Tri-Hai Nguyen, Heejae Park, Laihyuk Park
Unmanned aerial vehicle (UAV) and reconfigurable intelligent surface (RIS) technologies have recently been identified as enablers for future wireless networks. Deep reinforcement learning (DRL) is also a potential technique for optimizing performance in dynamic and complex networking environments. In this paper, we examine the state-of-the-art studies on DRL utilization in RIS-UAV communication systems concerning their objectives, optimization parameters, deployment scenarios, and DRL methods. In addition, we emphasize research challenges and directions that can be addressed to improve RIS-UAV networks.
无人机(UAV)和可重构智能表面(RIS)技术最近被确定为未来无线网络的推动者。深度强化学习(DRL)也是一种在动态和复杂网络环境中优化性能的潜在技术。在本文中,我们研究了RIS-UAV通信系统中DRL利用的最新研究,包括其目标、优化参数、部署场景和DRL方法。此外,我们强调了改进RIS-UAV网络可以解决的研究挑战和方向。
{"title":"Recent Studies on Deep Reinforcement Learning in RIS-UAV Communication Networks","authors":"Tri-Hai Nguyen, Heejae Park, Laihyuk Park","doi":"10.1109/ICAIIC57133.2023.10067052","DOIUrl":"https://doi.org/10.1109/ICAIIC57133.2023.10067052","url":null,"abstract":"Unmanned aerial vehicle (UAV) and reconfigurable intelligent surface (RIS) technologies have recently been identified as enablers for future wireless networks. Deep reinforcement learning (DRL) is also a potential technique for optimizing performance in dynamic and complex networking environments. In this paper, we examine the state-of-the-art studies on DRL utilization in RIS-UAV communication systems concerning their objectives, optimization parameters, deployment scenarios, and DRL methods. In addition, we emphasize research challenges and directions that can be addressed to improve RIS-UAV networks.","PeriodicalId":105769,"journal":{"name":"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129394519","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
Clustering of Photoplethysmography Data Signals for Developing Noise Filters 用于开发噪声滤波器的光体积脉搏波数据信号聚类
Rifqi Abdillah, R. Sarno, T. Amri, Faris Atoil Haq, K. R. Sungkono, Dwi Sunaryono
This paper aims to evaluate Photoplethysmography signals taken using fingertip pulse waves on human fingers which are generally not all in good condition. In common devices, the data obtained does not only contain photoplethysmography signals, but some noise also contaminates it. Noise is an unwanted ripple-shaped signal existing in signal transmission. Noise will interfere the desired quality of the received signal and ultimately change the information contained in the signal. This situation requires improvements to the photoplethysmography signal to make the signals are in the best condition so machine learning produces a more optimal output. Noise filters cannot be done with the same treatment because noise level in each data is different and must have different filter weights. This paper proposes a method to filter noise based on the level of noise in the signal. The approach taken in this study uses two stages, clustering and noise filtering. The first approach is clustering using the K-means clustering method by utilizing the coefficient of variation and slope features to group signals based on their noise level. The second approach uses exponential filtering, which performs by weighting the filter based on the cluster so that the data have different adjustments ratio of the level of smoothing. The result of the signal-to-noise ratio on Non-filtered Data is 181.49. Signal to noise ratio on the Constant Weighted Filter is 183.79 and increases to 187.48 after using the Clustered and Weighted Filter method.
本文的目的是评估利用指尖脉冲波在人类手指上获得的光体积脉搏波信号,这些信号通常不是都处于良好状态。在普通设备中,获得的数据不仅包含光容积脉搏波信号,而且还会受到一些噪声的污染。噪声是信号传输中存在的一种不需要的波纹状信号。噪声会干扰接收信号的预期质量,并最终改变信号中包含的信息。这种情况需要对光电容积脉搏波信号进行改进,使信号处于最佳状态,以便机器学习产生更优的输出。由于每个数据中的噪声水平不同,因此必须具有不同的滤波器权重,因此不能使用相同的处理方法进行噪声滤波器。本文提出了一种基于信号中噪声电平的噪声滤波方法。本研究采用的方法分为两个阶段,聚类和噪声滤波。第一种方法是使用K-means聚类方法,利用变异系数和斜率特征根据噪声水平对信号进行分组。第二种方法使用指数滤波,该方法通过基于聚类对滤波器进行加权来执行,从而使数据具有不同的平滑程度的调整比率。非滤波数据的信噪比结果为181.49。恒加权滤波器的信噪比为183.79,采用聚类加权滤波方法后,信噪比增加到187.48。
{"title":"Clustering of Photoplethysmography Data Signals for Developing Noise Filters","authors":"Rifqi Abdillah, R. Sarno, T. Amri, Faris Atoil Haq, K. R. Sungkono, Dwi Sunaryono","doi":"10.1109/ICAIIC57133.2023.10066966","DOIUrl":"https://doi.org/10.1109/ICAIIC57133.2023.10066966","url":null,"abstract":"This paper aims to evaluate Photoplethysmography signals taken using fingertip pulse waves on human fingers which are generally not all in good condition. In common devices, the data obtained does not only contain photoplethysmography signals, but some noise also contaminates it. Noise is an unwanted ripple-shaped signal existing in signal transmission. Noise will interfere the desired quality of the received signal and ultimately change the information contained in the signal. This situation requires improvements to the photoplethysmography signal to make the signals are in the best condition so machine learning produces a more optimal output. Noise filters cannot be done with the same treatment because noise level in each data is different and must have different filter weights. This paper proposes a method to filter noise based on the level of noise in the signal. The approach taken in this study uses two stages, clustering and noise filtering. The first approach is clustering using the K-means clustering method by utilizing the coefficient of variation and slope features to group signals based on their noise level. The second approach uses exponential filtering, which performs by weighting the filter based on the cluster so that the data have different adjustments ratio of the level of smoothing. The result of the signal-to-noise ratio on Non-filtered Data is 181.49. Signal to noise ratio on the Constant Weighted Filter is 183.79 and increases to 187.48 after using the Clustered and Weighted Filter method.","PeriodicalId":105769,"journal":{"name":"2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131133705","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
期刊
2023 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)
全部 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