首页 > 最新文献

International Journal of Intelligent Computing and Cybernetics最新文献

英文 中文
Urban traffic flow management on large scale using an improved ACO for a road transportation system 基于改进蚁群算法的大规模城市交通流管理
IF 4.3 Q3 COMPUTER SCIENCE, CYBERNETICS Pub Date : 2023-06-26 DOI: 10.1108/ijicc-02-2023-0020
Somia Boubedra, C. Tolba, P. Manzoni, Djamila Beddiar, Y. Zennir
PurposeWith the demographic increase, especially in big cities, heavy traffic, traffic congestion, road accidents and augmented pollution levels hamper transportation networks. Finding the optimal routes in urban scenarios is very challenging since it should consider reducing traffic jams, optimizing travel time, decreasing fuel consumption and reducing pollution levels accordingly. In this regard, the authors propose an enhanced approach based on the Ant Colony algorithm that allows vehicle drivers to search for optimal routes in urban areas from different perspectives, such as shortness and rapidness.Design/methodology/approachAn improved ant colony algorithm (ACO) is used to calculate the optimal routes in an urban road network by adopting an elitism strategy, a random search approach and a flexible pheromone deposit-evaporate mechanism. In addition, the authors make a trade-off between route length, travel time and congestion level.FindingsExperimental tests show that the routes found using the proposed algorithm improved the quality of the results by 30% in comparison with the ACO algorithm. In addition, the authors maintain a level of accuracy between 0.9 and 0.95. Therefore, the overall cost of the found solutions decreased from 67 to 40. In addition, the experimental results demonstrate that the authors’ improved algorithm outperforms not only the original ACO algorithm but also popular meta-heuristic algorithms such as the genetic algorithm (GA) and particle swarm optimization (PSO) in terms of reducing travel costs and improving overall fitness value.Originality/valueThe proposed improvements to the ACO to search for optimal paths for urban roads include incorporating multiple factors, such as travel length, time and congestion level, into the route selection process. Furthermore, random search, elitism strategy and flexible pheromone updating rules are proposed to consider the dynamic changes in road network conditions and make the proposed approach more relevant and effective. These enhancements contribute to the originality of the authors’ work, and they have the potential to advance the field of traffic routing.
随着人口的增长,尤其是在大城市,交通拥挤、交通拥堵、道路事故和污染水平的提高阻碍了交通网络。在城市场景中找到最佳路线是非常具有挑战性的,因为它应该考虑减少交通堵塞,优化旅行时间,减少燃料消耗和减少污染水平。在这方面,作者提出了一种基于蚁群算法的增强方法,允许车辆驾驶员从不同的角度(如短和快)搜索城市地区的最佳路线。设计/方法/方法采用一种改进的蚁群算法(蚁群算法),采用精英策略、随机搜索方法和灵活的信息素沉淀-蒸发机制来计算城市道路网络中的最优路线。此外,作者还在路线长度、行驶时间和拥堵程度之间进行了权衡。实验结果表明,与蚁群算法相比,该算法所寻路结果的质量提高了30%。此外,作者保持了0.9到0.95之间的精度水平。因此,所找到的解决办法的总费用从67减少到40。此外,实验结果表明,改进算法在降低出行成本和提高整体适应度值方面,不仅优于原蚁群算法,而且优于遗传算法(GA)和粒子群优化(PSO)等常用的元启发式算法。建议对蚁群算法进行改进,以寻找城市道路的最佳路径,包括在路线选择过程中纳入多种因素,如行程长度、时间和拥堵程度。在此基础上,采用随机搜索、精英策略和灵活信息素更新规则来考虑路网条件的动态变化,使所提方法更具相关性和有效性。这些改进有助于作者工作的原创性,并有可能推动交通路由领域的发展。
{"title":"Urban traffic flow management on large scale using an improved ACO for a road transportation system","authors":"Somia Boubedra, C. Tolba, P. Manzoni, Djamila Beddiar, Y. Zennir","doi":"10.1108/ijicc-02-2023-0020","DOIUrl":"https://doi.org/10.1108/ijicc-02-2023-0020","url":null,"abstract":"PurposeWith the demographic increase, especially in big cities, heavy traffic, traffic congestion, road accidents and augmented pollution levels hamper transportation networks. Finding the optimal routes in urban scenarios is very challenging since it should consider reducing traffic jams, optimizing travel time, decreasing fuel consumption and reducing pollution levels accordingly. In this regard, the authors propose an enhanced approach based on the Ant Colony algorithm that allows vehicle drivers to search for optimal routes in urban areas from different perspectives, such as shortness and rapidness.Design/methodology/approachAn improved ant colony algorithm (ACO) is used to calculate the optimal routes in an urban road network by adopting an elitism strategy, a random search approach and a flexible pheromone deposit-evaporate mechanism. In addition, the authors make a trade-off between route length, travel time and congestion level.FindingsExperimental tests show that the routes found using the proposed algorithm improved the quality of the results by 30% in comparison with the ACO algorithm. In addition, the authors maintain a level of accuracy between 0.9 and 0.95. Therefore, the overall cost of the found solutions decreased from 67 to 40. In addition, the experimental results demonstrate that the authors’ improved algorithm outperforms not only the original ACO algorithm but also popular meta-heuristic algorithms such as the genetic algorithm (GA) and particle swarm optimization (PSO) in terms of reducing travel costs and improving overall fitness value.Originality/valueThe proposed improvements to the ACO to search for optimal paths for urban roads include incorporating multiple factors, such as travel length, time and congestion level, into the route selection process. Furthermore, random search, elitism strategy and flexible pheromone updating rules are proposed to consider the dynamic changes in road network conditions and make the proposed approach more relevant and effective. These enhancements contribute to the originality of the authors’ work, and they have the potential to advance the field of traffic routing.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":" ","pages":""},"PeriodicalIF":4.3,"publicationDate":"2023-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44387467","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
Steel surface defect classification approach using an All-optical Neuron-based SNN with attention mechanism 基于注意机制的全光神经元SNN钢表面缺陷分类方法
IF 4.3 Q3 COMPUTER SCIENCE, CYBERNETICS Pub Date : 2023-06-15 DOI: 10.1108/ijicc-02-2023-0034
Liang Gong, Hang Dong, Xin Cheng, Zhenghui Ge, Liangchao Guo
PurposeThe purpose of this study is to propose a new method for the end-to-end classification of steel surface defects.Design/methodology/approachThis study proposes an AM-AoN-SNN algorithm, which combines an attention mechanism (AM) with an All-optical Neuron-based spiking neural network (AoN-SNN). The AM enhances network learning and extracts defective features, while the AoN-SNN predicts both the labels of the defects and the final labels of the images. Compared to the conventional Leaky-Integrated and Fire SNN, the AoN-SNN has improved the activation of neurons.FindingsThe experimental findings on Northeast University (NEU)-CLS demonstrate that the proposed neural network detection approach outperforms other methods. Furthermore, the network’s effectiveness was tested, and the results indicate that the proposed method can achieve high detection accuracy and strong anti-interference capabilities while maintaining a basic structure.Originality/valueThis study introduces a novel approach to classifying steel surface defects using a combination of a shallow AoN-SNN and a hybrid AM with different network architectures. The proposed method is the first study of SNN networks applied to this task.
目的本研究的目的是提出一种新的钢表面缺陷端到端分类方法。设计/方法论/方法本研究提出了一种AM-AoN-SNN算法,该算法将注意力机制(AM)与基于全光神经元的尖峰神经网络(AoN-SNN)相结合。AM增强了网络学习并提取缺陷特征,而AoN SNN预测缺陷的标签和图像的最终标签。与传统的Leaky Integrated和Fire SNN相比,AoN SNN改善了神经元的激活。结果在东北大学CLS上的实验结果表明,所提出的神经网络检测方法优于其他方法。此外,对网络的有效性进行了测试,结果表明,该方法在保持基本结构的同时,可以实现较高的检测精度和较强的抗干扰能力。独创性/价值本研究介绍了一种新的方法来分类钢表面缺陷,该方法使用浅AoN SNN和具有不同网络架构的混合AM相结合。所提出的方法是首次将SNN网络应用于该任务的研究。
{"title":"Steel surface defect classification approach using an All-optical Neuron-based SNN with attention mechanism","authors":"Liang Gong, Hang Dong, Xin Cheng, Zhenghui Ge, Liangchao Guo","doi":"10.1108/ijicc-02-2023-0034","DOIUrl":"https://doi.org/10.1108/ijicc-02-2023-0034","url":null,"abstract":"PurposeThe purpose of this study is to propose a new method for the end-to-end classification of steel surface defects.Design/methodology/approachThis study proposes an AM-AoN-SNN algorithm, which combines an attention mechanism (AM) with an All-optical Neuron-based spiking neural network (AoN-SNN). The AM enhances network learning and extracts defective features, while the AoN-SNN predicts both the labels of the defects and the final labels of the images. Compared to the conventional Leaky-Integrated and Fire SNN, the AoN-SNN has improved the activation of neurons.FindingsThe experimental findings on Northeast University (NEU)-CLS demonstrate that the proposed neural network detection approach outperforms other methods. Furthermore, the network’s effectiveness was tested, and the results indicate that the proposed method can achieve high detection accuracy and strong anti-interference capabilities while maintaining a basic structure.Originality/valueThis study introduces a novel approach to classifying steel surface defects using a combination of a shallow AoN-SNN and a hybrid AM with different network architectures. The proposed method is the first study of SNN networks applied to this task.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":" ","pages":""},"PeriodicalIF":4.3,"publicationDate":"2023-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45012670","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
Sampling for snapshot compressive imaging 快照压缩成像的采样
IF 4.3 Q3 COMPUTER SCIENCE, CYBERNETICS Pub Date : 2023-06-13 DOI: 10.34133/icomputing.0038
Minghao Hu, Zong-Jhe Wu, Qian Huang, Xin Yuan, D. Brady
{"title":"Sampling for snapshot compressive imaging","authors":"Minghao Hu, Zong-Jhe Wu, Qian Huang, Xin Yuan, D. Brady","doi":"10.34133/icomputing.0038","DOIUrl":"https://doi.org/10.34133/icomputing.0038","url":null,"abstract":"","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":"47 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2023-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85845716","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
Compiler Technologies in Deep Learning Co-Design: A Survey 深度学习协同设计中的编译器技术综述
IF 4.3 Q3 COMPUTER SCIENCE, CYBERNETICS Pub Date : 2023-05-31 DOI: 10.34133/icomputing.0040
Hongbin Zhang, Mingjie Xing, Y. Wu, Chen Zhao
{"title":"Compiler Technologies in Deep Learning Co-Design: A Survey","authors":"Hongbin Zhang, Mingjie Xing, Y. Wu, Chen Zhao","doi":"10.34133/icomputing.0040","DOIUrl":"https://doi.org/10.34133/icomputing.0040","url":null,"abstract":"","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":"40 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2023-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90203978","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
Why are consumers dissatisfied? A text mining approach on Sri Lankan mobile banking apps 消费者为什么不满意?斯里兰卡移动银行应用程序的文本挖掘方法
IF 4.3 Q3 COMPUTER SCIENCE, CYBERNETICS Pub Date : 2023-05-24 DOI: 10.1108/ijicc-02-2023-0027
Maas Sherina Sally
PurposeThe motivation of this study is to identify whether the overall rating of a banking app actually reflects the customer opinion and to find the causes for reduced ratings. Thus, these causes lead to the dissatisfaction of customers. Additionally, these insights reflect the overall rating of the app and it is a source of information to the executive management to contemplate on their services and take timely and effective decisions to improve their mobile app.Design/methodology/approachThis research was conducted on ten reputed Sri Lankan mobile banking apps to analyze the textual opinions of the customers. Data were collected from the Google Play Store considering the higher Android consumers in Sri Lanka. Each review was automatically classified into a relevant sentiment (positive, negative or neutral). These classified reviews were examined along with its rating to identify any discrepancies. The trends of the positive and negative reviews of each app were observed separately along with time. Topic modeling techniques were used to identify the causes of such behavior.FindingsAlthough banks expect to perpetuate good customer reviews all the time, there were aberrant negative trends observed during certain time ranges. The results revealed that unstable versions after recent updates, bad customer service, erroneous functional and nonfunctional features are the root causes toward the dissatisfaction of the customers.Originality/valueNo previous study has been done on the textual reviews of Sri Lankan mobile banking apps. Most studies had considered analyzing the reviews of the app on the entire period of its usage, whereas this research finds the trends where negative reviews surpass the positive reviews and analyze the causes of such behavior.
本研究的动机是确定银行应用程序的整体评级是否真正反映了客户的意见,并找到评级降低的原因。因此,这些原因导致客户的不满。此外,这些见解反映了应用程序的整体评级,它是执行管理层考虑其服务并采取及时有效决策以改进其移动应用程序的信息来源。设计/方法/方法本研究是对十个著名的斯里兰卡移动银行应用程序进行的,以分析客户的文本意见。考虑到斯里兰卡较高的Android用户,我们从b谷歌Play Store收集数据。每条评论都会被自动分类为相关的情绪(积极、消极或中性)。这些分类评论与其评级一起进行了检查,以确定是否存在差异。随着时间的推移,我们分别观察了每款应用的正面评价和负面评价的趋势。主题建模技术用于确定此类行为的原因。尽管银行希望一直保持良好的客户评价,但在某些时间范围内,也观察到异常的负面趋势。结果表明,最近更新后的版本不稳定,糟糕的客户服务,错误的功能和非功能特性是导致客户不满意的根本原因。原创性/价值之前的研究已经对斯里兰卡移动银行应用程序的文本审查进行了研究。大多数研究考虑的是分析应用在整个使用期间的评论,而本研究发现了负面评论超过正面评论的趋势,并分析了这种行为的原因。
{"title":"Why are consumers dissatisfied? A text mining approach on Sri Lankan mobile banking apps","authors":"Maas Sherina Sally","doi":"10.1108/ijicc-02-2023-0027","DOIUrl":"https://doi.org/10.1108/ijicc-02-2023-0027","url":null,"abstract":"PurposeThe motivation of this study is to identify whether the overall rating of a banking app actually reflects the customer opinion and to find the causes for reduced ratings. Thus, these causes lead to the dissatisfaction of customers. Additionally, these insights reflect the overall rating of the app and it is a source of information to the executive management to contemplate on their services and take timely and effective decisions to improve their mobile app.Design/methodology/approachThis research was conducted on ten reputed Sri Lankan mobile banking apps to analyze the textual opinions of the customers. Data were collected from the Google Play Store considering the higher Android consumers in Sri Lanka. Each review was automatically classified into a relevant sentiment (positive, negative or neutral). These classified reviews were examined along with its rating to identify any discrepancies. The trends of the positive and negative reviews of each app were observed separately along with time. Topic modeling techniques were used to identify the causes of such behavior.FindingsAlthough banks expect to perpetuate good customer reviews all the time, there were aberrant negative trends observed during certain time ranges. The results revealed that unstable versions after recent updates, bad customer service, erroneous functional and nonfunctional features are the root causes toward the dissatisfaction of the customers.Originality/valueNo previous study has been done on the textual reviews of Sri Lankan mobile banking apps. Most studies had considered analyzing the reviews of the app on the entire period of its usage, whereas this research finds the trends where negative reviews surpass the positive reviews and analyze the causes of such behavior.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":" ","pages":""},"PeriodicalIF":4.3,"publicationDate":"2023-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44631394","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
Efficiency decomposition in three-stage network with fuzzy desirable and undesirable output and fuzzy input in data envelopment analysis 数据包络分析中具有模糊期望输出和模糊输入的三阶段网络的效率分解
IF 4.3 Q3 COMPUTER SCIENCE, CYBERNETICS Pub Date : 2023-04-14 DOI: 10.1108/ijicc-12-2022-0306
Fatima Saeedi Aval Noughabia, N. Malekmohammadi, F. Hosseinzadeh lotfi, S. Razavyan
PurposeThe purpose of this paper is to improve the recent models for the evaluation of the efficiency of decision making units (DMUs) comprising a network structure with undesirable intermediate measures and fuzzy data.Design/methodology/approachIn this paper a three-stage network structure model with desirable and undesirable data is presented and is solved as linear triangular fuzzy planning problems.FindingsA new three stage network data envelopment analysis (DEA) model is established to evaluate the efficiency of industries with undesirable and desirable indicators in fuzzy environment.Practical implicationsThe implication of this study is to evaluate the furniture services and the chipboard industries of wood lumber as a three-stage process.Originality/valueIn some cases, DMUs include two or multi-stage process (series or parallel) operating with a structure called a network DEA. Also, in the real world problems, the data are often presented imprecisely. Additionally, the intermediate measures under the real-world conditions include desirable and undesirable data. These mentioned indexes show the value of the proposed model.
目的本文的目的是改进最近的决策单元(DMU)效率评估模型,该模型包括具有不期望的中间测度和模糊数据的网络结构。设计/方法/途径本文提出了一个包含期望和不期望数据的三阶段网络结构模型,并将其求解为线性三角形模糊规划问题。建立了一个新的三阶段网络数据包络分析(DEA)模型,用于在模糊环境中评估具有不期望和期望指标的行业的效率。实际意义本研究的意义是将木材作为一个三阶段过程来评估家具服务和刨花板行业。独创性/价值在某些情况下,DMU包括两个或多阶段过程(串联或并联),使用一种称为网络DEA的结构进行操作。此外,在现实世界中的问题中,数据的呈现往往不准确。此外,真实世界条件下的中间测量包括期望的和不期望的数据。这些指标表明了所提出的模型的价值。
{"title":"Efficiency decomposition in three-stage network with fuzzy desirable and undesirable output and fuzzy input in data envelopment analysis","authors":"Fatima Saeedi Aval Noughabia, N. Malekmohammadi, F. Hosseinzadeh lotfi, S. Razavyan","doi":"10.1108/ijicc-12-2022-0306","DOIUrl":"https://doi.org/10.1108/ijicc-12-2022-0306","url":null,"abstract":"PurposeThe purpose of this paper is to improve the recent models for the evaluation of the efficiency of decision making units (DMUs) comprising a network structure with undesirable intermediate measures and fuzzy data.Design/methodology/approachIn this paper a three-stage network structure model with desirable and undesirable data is presented and is solved as linear triangular fuzzy planning problems.FindingsA new three stage network data envelopment analysis (DEA) model is established to evaluate the efficiency of industries with undesirable and desirable indicators in fuzzy environment.Practical implicationsThe implication of this study is to evaluate the furniture services and the chipboard industries of wood lumber as a three-stage process.Originality/valueIn some cases, DMUs include two or multi-stage process (series or parallel) operating with a structure called a network DEA. Also, in the real world problems, the data are often presented imprecisely. Additionally, the intermediate measures under the real-world conditions include desirable and undesirable data. These mentioned indexes show the value of the proposed model.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":" ","pages":""},"PeriodicalIF":4.3,"publicationDate":"2023-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49464418","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
Integrating symbol similarities with knowledge graph embedding for entity alignment: an unsupervised framework 集成符号相似度与知识图嵌入的实体对齐:一个无监督框架
IF 4.3 Q3 COMPUTER SCIENCE, CYBERNETICS Pub Date : 2023-04-04 DOI: 10.34133/icomputing.0021
Tingting Jiang, Chenyang Bu, Yi Zhu, Xin Wu
{"title":"Integrating symbol similarities with knowledge graph embedding for entity alignment: an unsupervised framework","authors":"Tingting Jiang, Chenyang Bu, Yi Zhu, Xin Wu","doi":"10.34133/icomputing.0021","DOIUrl":"https://doi.org/10.34133/icomputing.0021","url":null,"abstract":"","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":"122 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2023-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90869081","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
Deep learning for SDN-enabled campus networks: proposed solutions, challenges and future directions 支持SDN的校园网络的深度学习:拟议的解决方案、挑战和未来方向
IF 4.3 Q3 COMPUTER SCIENCE, CYBERNETICS Pub Date : 2023-03-30 DOI: 10.1108/ijicc-12-2022-0312
W. Chanhemo, M. H. Mohsini, Mohamedi M. Mjahidi, Florence Rashidi
PurposeThis study explores challenges facing the applicability of deep learning (DL) in software-defined networks (SDN) based campus networks. The study intensively explains the automation problem that exists in traditional campus networks and how SDN and DL can provide mitigating solutions. It further highlights some challenges which need to be addressed in order to successfully implement SDN and DL in campus networks to make them better than traditional networks.Design/methodology/approachThe study uses a systematic literature review. Studies on DL relevant to campus networks have been presented for different use cases. Their limitations are given out for further research.FindingsFollowing the analysis of the selected studies, it showed that the availability of specific training datasets for campus networks, SDN and DL interfacing and integration in production networks are key issues that must be addressed to successfully deploy DL in SDN-enabled campus networks.Originality/valueThis study reports on challenges associated with implementation of SDN and DL models in campus networks. It contributes towards further thinking and architecting of proposed SDN-based DL solutions for campus networks. It highlights that single problem-based solutions are harder to implement and unlikely to be adopted in production networks.
目的本研究探讨了深度学习(DL)在基于软件定义网络(SDN)的校园网络中的适用性所面临的挑战。该研究深入解释了传统校园网络中存在的自动化问题,以及SDN和DL如何提供缓解方案。它进一步强调了一些需要解决的挑战,以便在校园网络中成功实现SDN和DL,使其优于传统网络。设计/方法论/方法本研究采用了系统的文献综述。已经针对不同的用例介绍了与校园网络相关的DL研究。给出了它们的局限性以供进一步研究。发现根据对所选研究的分析,它表明,校园网络的特定训练数据集的可用性、SDN和DL接口以及生产网络中的集成是必须解决的关键问题,才能在启用SDN的校园网络中成功部署DL。原创性/价值本研究报告了在校园网络中实施SDN和DL模型的相关挑战。它有助于进一步思考和构建所提出的基于SDN的校园网络DL解决方案。它强调,基于单一问题的解决方案更难实施,也不太可能在生产网络中采用。
{"title":"Deep learning for SDN-enabled campus networks: proposed solutions, challenges and future directions","authors":"W. Chanhemo, M. H. Mohsini, Mohamedi M. Mjahidi, Florence Rashidi","doi":"10.1108/ijicc-12-2022-0312","DOIUrl":"https://doi.org/10.1108/ijicc-12-2022-0312","url":null,"abstract":"PurposeThis study explores challenges facing the applicability of deep learning (DL) in software-defined networks (SDN) based campus networks. The study intensively explains the automation problem that exists in traditional campus networks and how SDN and DL can provide mitigating solutions. It further highlights some challenges which need to be addressed in order to successfully implement SDN and DL in campus networks to make them better than traditional networks.Design/methodology/approachThe study uses a systematic literature review. Studies on DL relevant to campus networks have been presented for different use cases. Their limitations are given out for further research.FindingsFollowing the analysis of the selected studies, it showed that the availability of specific training datasets for campus networks, SDN and DL interfacing and integration in production networks are key issues that must be addressed to successfully deploy DL in SDN-enabled campus networks.Originality/valueThis study reports on challenges associated with implementation of SDN and DL models in campus networks. It contributes towards further thinking and architecting of proposed SDN-based DL solutions for campus networks. It highlights that single problem-based solutions are harder to implement and unlikely to be adopted in production networks.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":" ","pages":""},"PeriodicalIF":4.3,"publicationDate":"2023-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46471677","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
CD-GAN: Commonsense-driven Generative Adversarial Network with Hierarchical Refinement for Text-to-Image Synthesis CD-GAN:用于文本到图像合成的具有层次细化的常识驱动生成对抗网络
IF 4.3 Q3 COMPUTER SCIENCE, CYBERNETICS Pub Date : 2023-01-20 DOI: 10.34133/icomputing.0017
Guokai Zhang, Ning Xu, C. Yan, Bolun Zheng, Yulong Duan, Bo Lv, Anjin Liu
{"title":"CD-GAN: Commonsense-driven Generative Adversarial Network with Hierarchical Refinement for Text-to-Image Synthesis","authors":"Guokai Zhang, Ning Xu, C. Yan, Bolun Zheng, Yulong Duan, Bo Lv, Anjin Liu","doi":"10.34133/icomputing.0017","DOIUrl":"https://doi.org/10.34133/icomputing.0017","url":null,"abstract":"","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":"150 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2023-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75097099","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
Review on Algorithm Design in Electronic Noses: Challenges, Status, and Trends 电子鼻算法设计综述:挑战、现状与趋势
IF 4.3 Q3 COMPUTER SCIENCE, CYBERNETICS Pub Date : 2023-01-20 DOI: 10.34133/icomputing.0012
Taoping Liu, L. Guo, Mou Wang, Chen Su, Di Wang, Hao Dong, Jingdong Chen, Weiwei Wu
{"title":"Review on Algorithm Design in Electronic Noses: Challenges, Status, and Trends","authors":"Taoping Liu, L. Guo, Mou Wang, Chen Su, Di Wang, Hao Dong, Jingdong Chen, Weiwei Wu","doi":"10.34133/icomputing.0012","DOIUrl":"https://doi.org/10.34133/icomputing.0012","url":null,"abstract":"","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":"57 6","pages":""},"PeriodicalIF":4.3,"publicationDate":"2023-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72482904","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
期刊
International Journal of Intelligent Computing and Cybernetics
全部 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