首页 > 最新文献

Cognitive Computation and Systems最新文献

英文 中文
Evolving usability heuristics for visualising Augmented Reality/Mixed Reality applications using cognitive model of information processing and fuzzy analytical hierarchy process 利用信息处理认知模型和模糊分析层次过程,开发可视化增强现实/混合现实应用的可用性启发式方法
IF 1.2 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-06-19 DOI: 10.1049/ccs2.12109
T. V. Sumithra, Leena Ragha, Arpit Vaishya, Rishi Desai

The pace of technological advancement is accelerating, and one of the latest developments is the emergence of Augmented Reality (AR) and Mixed Reality (MR) glasses as an extension of smartphones. The key to success lies in innovative research and technology that can reach a wide audience. To ensure a positive user experience, AR/MR glasses must offer interfaces that are easy to use, memorable, and leave a lasting impression. While Nielsen's heuristics are widely accepted as the standard for usability, it is clear that non-traditional applications require a rethinking of these heuristics to best suit their unique needs. A fresh usability heuristic for augmented and MR applications is designed by combining and modifying the existing models, such as Nielsen's 10 heuristics, Technology Acceptance Model, and Software Usability Measurement Inventory. The resulting framework incorporates 21 main heuristics and 60 sub heuristics. The 21 main heuristics are further grouped into the Norman's cognitive theory model based on the three levels of processing. The industry experts evaluated and validated the usability framework and established a higher level of effectiveness in identifying more usability problems compared with Nielsen's heuristics.

技术进步的步伐正在加快,最新的发展之一是作为智能手机延伸的增强现实(AR)和混合现实(MR)眼镜的出现。成功的关键在于创新的研究和技术,并能覆盖广泛的受众。为确保良好的用户体验,AR/MR 眼镜必须提供易于使用、令人难忘并留下深刻印象的界面。虽然尼尔森的启发式方法被广泛接受为可用性的标准,但非传统应用显然需要重新思考这些启发式方法,以最好地满足其独特的需求。通过对尼尔森的 10 个启发式方法、技术接受度模型和软件可用性测量清单等现有模型进行组合和修改,我们为增强和磁共振应用设计了一个全新的可用性启发式方法。由此产生的框架包含 21 个主要启发式和 60 个子启发式。这 21 种主要启发式又根据诺曼认知理论的三个处理层次进一步归类。业内专家对可用性框架进行了评估和验证,认为与尼尔森的启发式方法相比,可用性框架能更有效地发现更多可用性问题。
{"title":"Evolving usability heuristics for visualising Augmented Reality/Mixed Reality applications using cognitive model of information processing and fuzzy analytical hierarchy process","authors":"T. V. Sumithra,&nbsp;Leena Ragha,&nbsp;Arpit Vaishya,&nbsp;Rishi Desai","doi":"10.1049/ccs2.12109","DOIUrl":"https://doi.org/10.1049/ccs2.12109","url":null,"abstract":"<p>The pace of technological advancement is accelerating, and one of the latest developments is the emergence of Augmented Reality (AR) and Mixed Reality (MR) glasses as an extension of smartphones. The key to success lies in innovative research and technology that can reach a wide audience. To ensure a positive user experience, AR/MR glasses must offer interfaces that are easy to use, memorable, and leave a lasting impression. While Nielsen's heuristics are widely accepted as the standard for usability, it is clear that non-traditional applications require a rethinking of these heuristics to best suit their unique needs. A fresh usability heuristic for augmented and MR applications is designed by combining and modifying the existing models, such as Nielsen's 10 heuristics, Technology Acceptance Model, and Software Usability Measurement Inventory. The resulting framework incorporates 21 main heuristics and 60 sub heuristics. The 21 main heuristics are further grouped into the Norman's cognitive theory model based on the three levels of processing. The industry experts evaluated and validated the usability framework and established a higher level of effectiveness in identifying more usability problems compared with Nielsen's heuristics.</p>","PeriodicalId":33652,"journal":{"name":"Cognitive Computation and Systems","volume":"6 1-3","pages":"26-35"},"PeriodicalIF":1.2,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/ccs2.12109","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142273149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Emotion classification with multi-modal physiological signals using multi-attention-based neural network 利用多注意神经网络对多模态生理信号进行情绪分类
IF 1.2 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-06-18 DOI: 10.1049/ccs2.12107
Chengsheng Zou, Zhen Deng, Bingwei He, Maosong Yan, Jie Wu, Zhaoju Zhu

The ability to effectively classify human emotion states is critically important for human-computer or human-robot interactions. However, emotion classification with physiological signals is still a challenging problem due to the diversity of emotion expression and the characteristic differences in different modal signals. A novel learning-based network architecture is presented that can exploit four-modal physiological signals, electrocardiogram, electrodermal activity, electromyography, and blood volume pulse, and make a classification of emotion states. It features two kinds of attention modules, feature-level, and semantic-level, which drive the network to focus on the information-rich features by mimicking the human attention mechanism. The feature-level attention module encodes the rich information of each physiological signal. While the semantic-level attention module captures the semantic dependencies among modals. The performance of the designed network is evaluated with the open-source Wearable Stress and Affect Detection dataset. The developed emotion classification system achieves an accuracy of 83.88%. Results demonstrated that the proposed network could effectively process four-modal physiological signals and achieve high accuracy of emotion classification.

对人类情绪状态进行有效分类的能力对于人机交互或人机交互至关重要。然而,由于情绪表达的多样性和不同模态信号的特征差异,利用生理信号进行情绪分类仍然是一个具有挑战性的问题。本文提出了一种新颖的基于学习的网络架构,可利用心电图、皮电活动、肌电图和血容量脉搏四种模态生理信号进行情绪状态分类。它具有两种注意模块,即特征级和语义级,通过模仿人类的注意机制来驱动网络关注信息丰富的特征。特征级注意力模块对每个生理信号的丰富信息进行编码。而语义级注意模块则捕捉模态之间的语义依赖关系。我们利用开源的可穿戴压力和情感检测数据集对所设计网络的性能进行了评估。所开发的情绪分类系统达到了 83.88% 的准确率。结果表明,所提出的网络可以有效地处理四模态生理信号,并实现较高的情绪分类准确率。
{"title":"Emotion classification with multi-modal physiological signals using multi-attention-based neural network","authors":"Chengsheng Zou,&nbsp;Zhen Deng,&nbsp;Bingwei He,&nbsp;Maosong Yan,&nbsp;Jie Wu,&nbsp;Zhaoju Zhu","doi":"10.1049/ccs2.12107","DOIUrl":"https://doi.org/10.1049/ccs2.12107","url":null,"abstract":"<p>The ability to effectively classify human emotion states is critically important for human-computer or human-robot interactions. However, emotion classification with physiological signals is still a challenging problem due to the diversity of emotion expression and the characteristic differences in different modal signals. A novel learning-based network architecture is presented that can exploit four-modal physiological signals, electrocardiogram, electrodermal activity, electromyography, and blood volume pulse, and make a classification of emotion states. It features two kinds of attention modules, feature-level, and semantic-level, which drive the network to focus on the information-rich features by mimicking the human attention mechanism. The feature-level attention module encodes the rich information of each physiological signal. While the semantic-level attention module captures the semantic dependencies among modals. The performance of the designed network is evaluated with the open-source Wearable Stress and Affect Detection dataset. The developed emotion classification system achieves an accuracy of 83.88%. Results demonstrated that the proposed network could effectively process four-modal physiological signals and achieve high accuracy of emotion classification.</p>","PeriodicalId":33652,"journal":{"name":"Cognitive Computation and Systems","volume":"6 1-3","pages":"1-11"},"PeriodicalIF":1.2,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/ccs2.12107","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142272995","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Research on the design and simulation of immersive VR considering peer-to-peer streaming media live broadcasting algorithm
IF 1.2 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-03-03 DOI: 10.1049/ccs2.12100
Hu Jin, Rong Zheng

The utilisation of P2P tech in streaming media live broadcasting algorithm can effectively link the nodes in the endpoint and accelerate the establishment of efficient transmission channels between nodes, so as to ensure the data feasibility of video live broadcasting of terminal nodes. The simulation system of immersive virtual reality tech provides intelligent interactive experience and design framework. Its integration with P2P network streaming media live broadcast can bring users a stronger sense of experience, interaction and substitution, and provide high-quality streaming media live broadcast service. On account of this, the authors first analyse the principle and utilisation of peer-to-peer network tech, then study the streaming media live broadcast algorithm considering peer-to-peer network and the design of P2P-based streaming media live broadcast algorithm, and finally give the immersive virtual reality simulation of P2P-based streaming media live broadcast scheduling algorithm.

{"title":"Research on the design and simulation of immersive VR considering peer-to-peer streaming media live broadcasting algorithm","authors":"Hu Jin,&nbsp;Rong Zheng","doi":"10.1049/ccs2.12100","DOIUrl":"https://doi.org/10.1049/ccs2.12100","url":null,"abstract":"<p>The utilisation of P2P tech in streaming media live broadcasting algorithm can effectively link the nodes in the endpoint and accelerate the establishment of efficient transmission channels between nodes, so as to ensure the data feasibility of video live broadcasting of terminal nodes. The simulation system of immersive virtual reality tech provides intelligent interactive experience and design framework. Its integration with P2P network streaming media live broadcast can bring users a stronger sense of experience, interaction and substitution, and provide high-quality streaming media live broadcast service. On account of this, the authors first analyse the principle and utilisation of peer-to-peer network tech, then study the streaming media live broadcast algorithm considering peer-to-peer network and the design of P2P-based streaming media live broadcast algorithm, and finally give the immersive virtual reality simulation of P2P-based streaming media live broadcast scheduling algorithm.</p>","PeriodicalId":33652,"journal":{"name":"Cognitive Computation and Systems","volume":"6 4","pages":"65-73"},"PeriodicalIF":1.2,"publicationDate":"2024-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/ccs2.12100","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143248432","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimisation of deep neural network model using Reptile meta learning approach 利用 Reptile 元学习方法优化深度神经网络模型
Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-12-15 DOI: 10.1049/ccs2.12096
Uday Kulkarni, Meena S M, Raghavendra A Hallyal, Prasanna H Sulibhavi, Sunil V. G, Shankru Guggari, Akshay R. Shanbhag
The artificial intelligence (AI) within the last decade has experienced a rapid development and has attained power to simulate human‐thinking in various situations. When the deep neural networks (DNNs) are trained with huge dataset and high computational resources it can bring out great outcomes. But the learning process of DNN is very much complicated and time‐consuming. In various circumstances, where there is a data‐scarcity, the algorithms are not capable of learning tasks at a faster rate and perform nearer to that of human intelligence. With advancements in deep meta‐learning in several research studies, this problem has been dealt. Meta‐learning has outspread range of applications where the meta‐data (data about data) of the either tasks, data or the models which were previously trained can be employed to optimise the learning. So in order to get an insight of all existing meta‐learning approaches for DNN model optimisation, the authors performed survey introducing different meta‐learning techniques and also the current optimisation‐based approaches, their merits and open challenges. In this research, the Reptile meta‐learning algorithm was chosen for the experiment. As Reptile uses first‐order derivatives during optimisation process, hence making it feasible to solve optimisation problems. The authors achieved a 5% increase in accuracy with the proposed version of Reptile meta‐learning algorithm.
人工智能(AI)在过去十年中经历了飞速发展,已经具备了在各种情况下模拟人类思维的能力。当深度神经网络(DNN)在巨大的数据集和高计算资源的支持下进行训练时,它能带来巨大的成果。但 DNN 的学习过程非常复杂且耗时。在数据稀缺的各种情况下,算法无法以更快的速度学习任务,其表现也无法接近人类智能。随着深度元学习在多项研究中取得进展,这一问题已经得到解决。元学习的应用范围很广,可以利用任务、数据或以前训练过的模型的元数据(关于数据的数据)来优化学习。因此,为了深入了解用于 DNN 模型优化的所有现有元学习方法,作者进行了调查,介绍了不同的元学习技术以及当前基于优化的方法、它们的优点和面临的挑战。本研究选择 Reptile 元学习算法进行实验。由于 Reptile 在优化过程中使用一阶导数,因此使其在解决优化问题时具有可行性。作者提出的 Reptile 元学习算法版本的准确率提高了 5%。
{"title":"Optimisation of deep neural network model using Reptile meta learning approach","authors":"Uday Kulkarni, Meena S M, Raghavendra A Hallyal, Prasanna H Sulibhavi, Sunil V. G, Shankru Guggari, Akshay R. Shanbhag","doi":"10.1049/ccs2.12096","DOIUrl":"https://doi.org/10.1049/ccs2.12096","url":null,"abstract":"The artificial intelligence (AI) within the last decade has experienced a rapid development and has attained power to simulate human‐thinking in various situations. When the deep neural networks (DNNs) are trained with huge dataset and high computational resources it can bring out great outcomes. But the learning process of DNN is very much complicated and time‐consuming. In various circumstances, where there is a data‐scarcity, the algorithms are not capable of learning tasks at a faster rate and perform nearer to that of human intelligence. With advancements in deep meta‐learning in several research studies, this problem has been dealt. Meta‐learning has outspread range of applications where the meta‐data (data about data) of the either tasks, data or the models which were previously trained can be employed to optimise the learning. So in order to get an insight of all existing meta‐learning approaches for DNN model optimisation, the authors performed survey introducing different meta‐learning techniques and also the current optimisation‐based approaches, their merits and open challenges. In this research, the Reptile meta‐learning algorithm was chosen for the experiment. As Reptile uses first‐order derivatives during optimisation process, hence making it feasible to solve optimisation problems. The authors achieved a 5% increase in accuracy with the proposed version of Reptile meta‐learning algorithm.","PeriodicalId":33652,"journal":{"name":"Cognitive Computation and Systems","volume":"34 10","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138997706","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
Cauchy DMP: Improving 3C industrial assembly quality with the Cauchy kernel and singular value decomposition 考奇 DMP:利用考奇核和奇异值分解提高 3C 工业装配质量
Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-12-10 DOI: 10.1049/ccs2.12097
Meng Liu, Wenbo Zhu, Lufeng Luo, Qinghua Lu, Weichang Yeh, Yunzhi Zhang

Although Dynamic Movement Primitives (DMP) is an effective tool for robotic arm trajectory generalisation, the application of DMP in the 3C (Computer, Communication, Consumer Electronics) industry still faces challenges such as low precision and high-time consumption. To address this problem, we propose a novel Cauchy DMP framework. The main improvements and advantages of Cauchy DMP, compared to the original DMP, are (1) since the Cauchy distribution has a simpler model and wider shape, using the Cauchy distribution instead of the Gaussian distribution in the original DMP reduces the complexity of the algorithm and saves time. (2) Singular Value Decomposition (SVD) can effectively model the error. To reduce the interference of the rounding and human error on the trajectory, SVD can be used to obtain the weight of each basis function. The proposed Cauchy DMP framework combines the above two points and is validated on a real UR5 robotic arm. The results show that Cauchy DMP retains the learnability of the original DMP and has the advantages of short time consumption and low error rate.

尽管动态运动原语(DMP)是机械臂轨迹泛化的有效工具,但DMP在3C(计算机、通信、消费电子)行业中的应用仍然面临精度低、耗时高等挑战。为了解决这个问题,我们提出了一个新的柯西DMP框架。与原始DMP相比,柯西DMP的主要改进和优点是:(1)由于柯西分布模型更简单,形状更宽,在原始DMP中使用柯西分布代替高斯分布,降低了算法的复杂性,节省了时间。(2)奇异值分解(SVD)可以有效地对误差进行建模。为了减少舍入和人为误差对轨迹的干扰,可以使用奇异值分解来获得每个基函数的权值。提出的Cauchy DMP框架结合了上述两点,并在真实的UR5机械臂上进行了验证。结果表明,柯西DMP保留了原始DMP的可学习性,并且具有耗时短、错误率低的优点。
{"title":"Cauchy DMP: Improving 3C industrial assembly quality with the Cauchy kernel and singular value decomposition","authors":"Meng Liu,&nbsp;Wenbo Zhu,&nbsp;Lufeng Luo,&nbsp;Qinghua Lu,&nbsp;Weichang Yeh,&nbsp;Yunzhi Zhang","doi":"10.1049/ccs2.12097","DOIUrl":"https://doi.org/10.1049/ccs2.12097","url":null,"abstract":"<p>Although <b>D</b>ynamic <b>M</b>ovement <b>P</b>rimitives (DMP) is an effective tool for robotic arm trajectory generalisation, the application of DMP in the 3C (Computer, Communication, Consumer Electronics) industry still faces challenges such as low precision and high-time consumption. To address this problem, we propose a novel Cauchy DMP framework. The main improvements and advantages of Cauchy DMP, compared to the original DMP, are (1) since the Cauchy distribution has a simpler model and wider shape, using the Cauchy distribution instead of the Gaussian distribution in the original DMP reduces the complexity of the algorithm and saves time. (2) <b>S</b>ingular <b>V</b>alue <b>D</b>ecomposition (SVD) can effectively model the error. To reduce the interference of the rounding and human error on the trajectory, SVD can be used to obtain the weight of each basis function. The proposed Cauchy DMP framework combines the above two points and is validated on a real UR5 robotic arm. The results show that Cauchy DMP retains the learnability of the original DMP and has the advantages of short time consumption and low error rate.</p>","PeriodicalId":33652,"journal":{"name":"Cognitive Computation and Systems","volume":"5 4","pages":"288-299"},"PeriodicalIF":0.0,"publicationDate":"2023-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/ccs2.12097","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138634158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A path planning algorithm fusion of obstacle avoidance and memory functions 融合避障和记忆功能的路径规划算法
Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-12-08 DOI: 10.1049/ccs2.12098
Qingchun Zheng, Shubo Li, Peihao Zhu, Wenpeng Ma, Yanlu Wang

In this study, to address the issues of sluggish convergence and poor learning efficiency at the initial stages of training, the authors improve and optimise the Deep Deterministic Policy Gradient (DDPG) algorithm. First, inspired by the Artificial Potential Field method, the selection strategy of DDPG has been improved to accelerate the convergence speed during the early stages of training and reduce the time it takes for the mobile robot to reach the target point. Then, optimising the neural network structure of the DDPG algorithm based on the Long Short-Term Memory accelerates the algorithm's convergence speed in complex dynamic scenes. Static and dynamic scene simulation experiments of mobile robots are carried out in ROS. Test findings demonstrate that the Artificial Potential Field method-Long Short Term Memory Deep Deterministic Policy Gradient (APF-LSTM DDPG) algorithm converges significantly faster in complex dynamic scenes. The success rate is improved by 7.3% and 3.6% in contrast to the DDPG and LSTM-DDPG algorithms. Finally, the usefulness of the method provided in this study is similarly demonstrated in real situations using real mobile robot platforms, laying the foundation for the path planning of mobile robots in complex changing conditions.

在本研究中,为了解决训练初始阶段收敛缓慢和学习效率差的问题,作者改进和优化了深度确定性策略梯度(Deep Deterministic Policy Gradient, DDPG)算法。首先,受人工势场法的启发,改进了DDPG的选择策略,加快了训练前期的收敛速度,缩短了移动机器人到达目标点的时间。然后,基于长短期记忆对DDPG算法的神经网络结构进行优化,加快了算法在复杂动态场景中的收敛速度。在ROS中对移动机器人进行了静态和动态场景仿真实验。实验结果表明,人工势场法-长短期记忆深度确定性策略梯度(APF - LSTM DDPG)算法在复杂动态场景下的收敛速度明显加快。与DDPG和LSTM - DDPG算法相比,成功率分别提高了7.3%和3.6%。最后,利用真实的移动机器人平台在实际情况中同样证明了本文方法的有效性,为复杂变化条件下移动机器人的路径规划奠定了基础。
{"title":"A path planning algorithm fusion of obstacle avoidance and memory functions","authors":"Qingchun Zheng,&nbsp;Shubo Li,&nbsp;Peihao Zhu,&nbsp;Wenpeng Ma,&nbsp;Yanlu Wang","doi":"10.1049/ccs2.12098","DOIUrl":"10.1049/ccs2.12098","url":null,"abstract":"<p>In this study, to address the issues of sluggish convergence and poor learning efficiency at the initial stages of training, the authors improve and optimise the Deep Deterministic Policy Gradient (DDPG) algorithm. First, inspired by the Artificial Potential Field method, the selection strategy of DDPG has been improved to accelerate the convergence speed during the early stages of training and reduce the time it takes for the mobile robot to reach the target point. Then, optimising the neural network structure of the DDPG algorithm based on the Long Short-Term Memory accelerates the algorithm's convergence speed in complex dynamic scenes. Static and dynamic scene simulation experiments of mobile robots are carried out in ROS. Test findings demonstrate that the Artificial Potential Field method-Long Short Term Memory Deep Deterministic Policy Gradient (APF-LSTM DDPG) algorithm converges significantly faster in complex dynamic scenes. The success rate is improved by 7.3% and 3.6% in contrast to the DDPG and LSTM-DDPG algorithms. Finally, the usefulness of the method provided in this study is similarly demonstrated in real situations using real mobile robot platforms, laying the foundation for the path planning of mobile robots in complex changing conditions.</p>","PeriodicalId":33652,"journal":{"name":"Cognitive Computation and Systems","volume":"5 4","pages":"300-313"},"PeriodicalIF":0.0,"publicationDate":"2023-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/ccs2.12098","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138588800","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Recurrent ALBERT for recommendation: A hybrid architecture for accurate and lightweight restaurant recommendations 用于推荐的循环 ALBERT:准确、轻量级餐厅推荐的混合架构
Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-11-02 DOI: 10.1049/ccs2.12090
Ashfia Jannat Keya, Sayefa Arafah Arpona, Muhammad Mohsin Kabir, Muhammad Firoz Mridha

The online recommendation system has benefited the traditional restaurant business economically. However, finding the best restaurant during rush time and visiting new places is tough. This objective is addressed through a restaurant recommendation approach, which impacts the human decision-making method. With the help of collaborative filtering, some user-based recommendation systems were designed to generate the best recommendation based on user choices. Thus, a user preferences-based method is presented using A Lite Bidirectional Encoder Representations from Transformers and Simple Recurrent Unit to suggest restaurants based on user preferences. Here, a publicly available dataset from Kaggle called Kzomato is used with 9552 samples and 21 features. And the system obtained an F1-score, precision, and recall of 86%, which will save time and provide the best recommendation based on user preferences easily.

在线推荐系统为传统餐饮企业带来了经济效益。然而,在高峰时间找到最好的餐厅和参观新的地方是很困难的。这一目标是通过餐馆推荐方法来解决的,这影响了人类的决策方法。在协同过滤的基础上,设计了基于用户的推荐系统,根据用户的选择生成最佳推荐。因此,本文提出了一种基于用户偏好的方法,使用来自变压器和简单循环单元的life双向编码器表示来根据用户偏好推荐餐馆。在这里,使用了来自Kaggle的一个名为Kzomato的公开可用数据集,其中包含9552个样本和21个特征。该系统获得了86%的f1分、准确率和召回率,节省了时间,可以轻松地根据用户偏好提供最佳推荐。
{"title":"Recurrent ALBERT for recommendation: A hybrid architecture for accurate and lightweight restaurant recommendations","authors":"Ashfia Jannat Keya,&nbsp;Sayefa Arafah Arpona,&nbsp;Muhammad Mohsin Kabir,&nbsp;Muhammad Firoz Mridha","doi":"10.1049/ccs2.12090","DOIUrl":"10.1049/ccs2.12090","url":null,"abstract":"<p>The online recommendation system has benefited the traditional restaurant business economically. However, finding the best restaurant during rush time and visiting new places is tough. This objective is addressed through a restaurant recommendation approach, which impacts the human decision-making method. With the help of collaborative filtering, some user-based recommendation systems were designed to generate the best recommendation based on user choices. Thus, a user preferences-based method is presented using A Lite Bidirectional Encoder Representations from Transformers and Simple Recurrent Unit to suggest restaurants based on user preferences. Here, a publicly available dataset from Kaggle called Kzomato is used with 9552 samples and 21 features. And the system obtained an F1-score, precision, and recall of 86%, which will save time and provide the best recommendation based on user preferences easily.</p>","PeriodicalId":33652,"journal":{"name":"Cognitive Computation and Systems","volume":"5 4","pages":"265-279"},"PeriodicalIF":0.0,"publicationDate":"2023-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/ccs2.12090","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135973103","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Ground-based cloud recognition method based on an improved DeepLabV3+ model 基于改进的 DeepLabV3+ 模型的地基云识别方法
Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-10-27 DOI: 10.1049/ccs2.12091
Yue Liang, Quanbo Ge

An improved method for recognising clouds on the ground map is proposed incorporating the DeepLabV3+ model to solve three issues. Firstly, an image preprocessing module is developed to enrich image quality, particularly at night, as clouds can appear to be too blurry to distinguish. Secondly, the CBAM attention mechanism is applied to safeguard texture and boundary information, ensuring the depiction of cirrus edges is not lost. Finally, the feature extraction network can be optimised to enhance the model and decrease its computational complexity. In comparison to the original model, the accuracy of the proposed method increased by 10.89%, resulting in an overall accuracy of 94.18%. Furthermore, the MIoU has improved from 66.02% to 79.31%. The number of parameters was reduced by 51.45% to 13.4 M. Of the various cloud types, the improvement in cirrus is particularly striking, with the MIoU increasing from 1.78% to 56.01%.

结合DeepLabV3+模型,提出了一种改进的地面地图云识别方法,解决了三个问题。首先,开发了图像预处理模块来丰富图像质量,特别是在夜间,因为云可能看起来太模糊而无法区分。其次,利用CBAM注意机制保护纹理和边界信息,保证卷云边缘的描述不丢失;最后,对特征提取网络进行优化,增强模型,降低计算复杂度。与原模型相比,本文方法的准确率提高了10.89%,总体准确率达到94.18%。MIoU从66.02%提高到79.31%。参数个数减少了51.45%,为13.4 m。在各种云种中,卷云的改善尤为显著,MIoU从1.78%增加到56.01%。
{"title":"Ground-based cloud recognition method based on an improved DeepLabV3+ model","authors":"Yue Liang,&nbsp;Quanbo Ge","doi":"10.1049/ccs2.12091","DOIUrl":"10.1049/ccs2.12091","url":null,"abstract":"<p>An improved method for recognising clouds on the ground map is proposed incorporating the DeepLabV3+ model to solve three issues. Firstly, an image preprocessing module is developed to enrich image quality, particularly at night, as clouds can appear to be too blurry to distinguish. Secondly, the CBAM attention mechanism is applied to safeguard texture and boundary information, ensuring the depiction of cirrus edges is not lost. Finally, the feature extraction network can be optimised to enhance the model and decrease its computational complexity. In comparison to the original model, the accuracy of the proposed method increased by 10.89%, resulting in an overall accuracy of 94.18%. Furthermore, the MIoU has improved from 66.02% to 79.31%. The number of parameters was reduced by 51.45% to 13.4 M. Of the various cloud types, the improvement in cirrus is particularly striking, with the MIoU increasing from 1.78% to 56.01%.</p>","PeriodicalId":33652,"journal":{"name":"Cognitive Computation and Systems","volume":"5 4","pages":"280-287"},"PeriodicalIF":0.0,"publicationDate":"2023-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/ccs2.12091","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136311907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An effective fault tolerance aware scheduling using hybrid horse herd optimisation-reptile search optimisation approach for a cloud computing environment 云计算环境下一种有效的容错感知调度方法
Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-10-10 DOI: 10.1049/ccs2.12094
Manoj Kumar Malik, Hitesh Joshi, Abhishek Swaroop

IT services can be requested via cloud computing, a model based on services as well as the Internet. It includes all computer systems resources from hardware components to software platforms and software applications in a distributed environment. Scheduling is a key step in processing tasks using remote resources. Serious issues have been brought forward, including the ineffective use of resources and task execution failure. The concurrent provision of fault tolerance and resource optimisation is achallenging task. In the context of cloud computing, this research offers a brand-new job scheduling and fault-tolerant system. Tasks submitted by users are taken as an input for the proposed method. Several virtual machines (VM) are initially arranged for scheduling work and execution process. Initially, Horse Herd Optimisation is employed here to allocate the job based on key factors such as deadline and user budget. Once the jobs are assigned to each VM, then each job's deadline is confirmed and transferred to VM which has sufficient capacity. Here, the Reptile Search Optimisation technique is applied to identify the VM error. Any VM that does not have enough capacity is the one that has a problem. When a fault is found, a fault-tolerant process is instantly started. A replication-based fault-tolerant mechanism is used in this manuscript. The proposed approach is tested with several metrics which attains better performance like 80 s response time, turnaround time of 32 s, 17% resource utilisation and a success rate of 92%. Thus the designed model is the best choice for fault-tolerant aware task scheduling.

可以通过云计算(一种基于服务和互联网的模型)请求IT服务。它包括分布式环境中从硬件组件到软件平台和软件应用程序的所有计算机系统资源。调度是使用远程资源处理任务的关键步骤。已经提出了严重的问题,包括资源的无效使用和任务执行失败。同时提供容错和资源优化是一项艰巨的任务。在云计算的背景下,本研究提供了一个全新的作业调度和容错系统。用户提交的任务被视为所提出方法的输入。几个虚拟机(VM)最初被安排用于调度工作和执行过程。最初,Horse Herd Optimization是根据截止日期和用户预算等关键因素来分配工作的。一旦作业被分配给每个VM,那么每个作业的截止日期就会被确认并转移到具有足够容量的VM。在这里,爬行搜索优化技术被应用于识别VM错误。任何没有足够容量的虚拟机都会出现问题。当发现故障时,会立即启动容错过程。本文采用了一种基于复制的容错机制。所提出的方法用几个指标进行了测试,这些指标获得了更好的性能,如80秒的响应时间、32秒的周转时间、17%的资源利用率和92%的成功率。因此,所设计的模型是容错感知任务调度的最佳选择。
{"title":"An effective fault tolerance aware scheduling using hybrid horse herd optimisation-reptile search optimisation approach for a cloud computing environment","authors":"Manoj Kumar Malik,&nbsp;Hitesh Joshi,&nbsp;Abhishek Swaroop","doi":"10.1049/ccs2.12094","DOIUrl":"https://doi.org/10.1049/ccs2.12094","url":null,"abstract":"<p>IT services can be requested via cloud computing, a model based on services as well as the Internet. It includes all computer systems resources from hardware components to software platforms and software applications in a distributed environment. Scheduling is a key step in processing tasks using remote resources. Serious issues have been brought forward, including the ineffective use of resources and task execution failure. The concurrent provision of fault tolerance and resource optimisation is achallenging task. In the context of cloud computing, this research offers a brand-new job scheduling and fault-tolerant system. Tasks submitted by users are taken as an input for the proposed method. Several virtual machines (VM) are initially arranged for scheduling work and execution process. Initially, Horse Herd Optimisation is employed here to allocate the job based on key factors such as deadline and user budget. Once the jobs are assigned to each VM, then each job's deadline is confirmed and transferred to VM which has sufficient capacity. Here, the Reptile Search Optimisation technique is applied to identify the VM error. Any VM that does not have enough capacity is the one that has a problem. When a fault is found, a fault-tolerant process is instantly started. A replication-based fault-tolerant mechanism is used in this manuscript. The proposed approach is tested with several metrics which attains better performance like 80 s response time, turnaround time of 32 s, 17% resource utilisation and a success rate of 92%. Thus the designed model is the best choice for fault-tolerant aware task scheduling.</p>","PeriodicalId":33652,"journal":{"name":"Cognitive Computation and Systems","volume":"5 3","pages":"231-242"},"PeriodicalIF":0.0,"publicationDate":"2023-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/ccs2.12094","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50148197","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Localisation of facts compensator using reptile search algorithm for enhancing power system security under multi-contingency conditions 基于爬行搜索算法的facts补偿器局部化增强多突发条件下电力系统的安全性
Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-10-07 DOI: 10.1049/ccs2.12089
Sumit Ramswami Punam, Sunil Kumar

Due to the improvement in power demand usage, the system causes more stress. Suitable placement of FACTS is introduced to improve power flows, stability, and power system security. An advanced optimal method has been introduced to resolve optimal power flow under various conditions. Five varied FACTS devices were positioned inside the power system to improve system safety at the least cost. Selecting the suitable location and size of FACTS device enabling high security and less cost was proposed using RSA. The objective functions were mitigated based on the RSA's inspiration to improve system security. The placement of the FACTS compensator was based on objective functions like LOSI, voltage deviation, real power loss, investment cost, sensitivity index, fuel costs, and constraints. The proposed model was validated under three conditions, namely generator outage, line outage, and both outage in IEEE 118 and IEEE 30 bus-systems. In the IEEE 30 bus system, TCSC provides better security of 1.4 severity at normal conditions and 1.3 severity in contingency conditions. In the IEEE 118 bus system, UPFC has less severity of 2.4 at normal conditions, and STATCOM has the least severity of 3 at contingency conditions. The proposed model provides enhanced security in all circumstances and reduces overall costs.

由于电力需求使用率的提高,该系统造成了更大的压力。引入了合适的FACTS布局,以改善电力流、稳定性和电力系统安全性。介绍了一种求解各种条件下最优潮流的先进优化方法。五种不同的FACTS设备被放置在电力系统内,以最低的成本提高系统安全性。提出了使用RSA来选择合适的FACTS设备的位置和大小,从而实现高安全性和低成本。基于RSA改进系统安全性的灵感,目标函数得到了缓解。FACTS补偿器的布置基于LOSI、电压偏差、实际功率损耗、投资成本、灵敏度指数、燃料成本和约束等目标函数。所提出的模型在三种条件下进行了验证,即发电机停运、线路停运以及IEEE 118和IEEE 30总线系统中的两种停运。在IEEE 30总线系统中,TCSC在正常条件下提供了1.4的严重性,在意外情况下提供了1.3的严重性。在IEEE 118总线系统中,UPFC在正常条件下的严重性较低,为2.4,而STATCOM在应急条件下的最不严重,为3。所提出的模型在所有情况下都提供了增强的安全性,并降低了总体成本。
{"title":"Localisation of facts compensator using reptile search algorithm for enhancing power system security under multi-contingency conditions","authors":"Sumit Ramswami Punam,&nbsp;Sunil Kumar","doi":"10.1049/ccs2.12089","DOIUrl":"https://doi.org/10.1049/ccs2.12089","url":null,"abstract":"<p>Due to the improvement in power demand usage, the system causes more stress. Suitable placement of FACTS is introduced to improve power flows, stability, and power system security. An advanced optimal method has been introduced to resolve optimal power flow under various conditions. Five varied FACTS devices were positioned inside the power system to improve system safety at the least cost. Selecting the suitable location and size of FACTS device enabling high security and less cost was proposed using RSA. The objective functions were mitigated based on the RSA's inspiration to improve system security. The placement of the FACTS compensator was based on objective functions like LOSI, voltage deviation, real power loss, investment cost, sensitivity index, fuel costs, and constraints. The proposed model was validated under three conditions, namely generator outage, line outage, and both outage in IEEE 118 and IEEE 30 bus-systems. In the IEEE 30 bus system, TCSC provides better security of 1.4 severity at normal conditions and 1.3 severity in contingency conditions. In the IEEE 118 bus system, UPFC has less severity of 2.4 at normal conditions, and STATCOM has the least severity of 3 at contingency conditions. The proposed model provides enhanced security in all circumstances and reduces overall costs.</p>","PeriodicalId":33652,"journal":{"name":"Cognitive Computation and Systems","volume":"5 3","pages":"195-217"},"PeriodicalIF":0.0,"publicationDate":"2023-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/ccs2.12089","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50134796","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Cognitive Computation and 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