检索结果-内蒙古大学图书馆

SEED-VII: A Multimodal Dataset of Six Basic Emotions with Continuous Labels for Emotion Recognition

IEEE Transactions on Affective computing 2024年第2期16卷 969-985页

作者： Jiang, Wei-Bang Liu, Xuan-Hao Zheng, Wei-Long Lu, Bao-Liang Shanghai Jiao Tong University Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Brain Science and Technology Research Center Shanghai200240 China

Recognizing emotions from physiological signals is a topic that has garnered widespread interest, and research continues to develop novel techniques for perceiving emotions. However, the emergence of deep learning has highlighted the need for comprehensive and high-quality emotional datasets that enable the accurate decoding of human emotions. To systematically explore human emotions, we develop a multimodal dataset consisting of six basic (happiness, sadness, fear, disgust, surprise, and anger) emotions and the neutral emotion, named SEED-VII. This multimodal dataset includes electroencephalography (EEG) and eye movement signals. The seven emotions in SEED-VII are elicited by 80 different videos and fully investigated with continuous labels that indicate the intensity levels of the corresponding emotions. Additionally, we propose a novel Multimodal Adaptive Emotion Transformer (MAET), that can flexibly process both unimodal and multimodal inputs. Adversarial training is utilized in the MAET to mitigate subject discrepancies, which enhances domain generalization. Our extensive experiments, encompassing both subject-dependent and cross-subject conditions, demonstrate the superior performance of the MAET in terms of handling various inputs. Continuous labels are used to filter the data with high emotional intensity, and this strategy is proven to be effective for attaining improved emotion recognition performance. Furthermore, complementary properties between the EEG signals and eye movements and stable neural patterns of the seven emotions are observed. © 2010-2012 IEEE.

关键词： Eye movements

来源：评论

学校读者我要写书评

暂无评论

Plant Disease Detection in Precision Agriculture: Deep Learning Approaches 2

Plant Disease Detection in Precision Agriculture: Deep Learn...

引用

2nd International Conference on Intelligent Data Communication Technologies and Internet of Things, IDCIoT 2024

作者： Dey, Puja Mahmud, Tanjim Nahar, Sultana Rokeya Hossain, Mohammad Shahadat Andersson, Karl University of Chittagong Department of Computer Science and Engineering Chittagong4331 Bangladesh Rangamati Science and Technology University Department of Computer Science and Engineering Rangamati4500 Bangladesh Department of Computer Science and Engineering Dhaka1212 Bangladesh Luleå University of Technology Pervasive and Mobile Computing Laboratory Luleå97187 Sweden

ISBN: (纸本)9798350327533

Plants affect economy, agriculture industry and climate of any country. Therefore it is very important to take care of plants. Like human being, plants are also infected by various disease that are resulted from virus, bacteria, and fungi. It is necessary to identify these diseases in time and cure them immediately to counteract the destruction of whole plant. In recent times, deep learning networks have attained tremendous improvement in classifying image and detecting object. Therefore, in our research, some pre-Trained Convolution Neural Networks (AlexNet, VGG16, VGG19) have been utilised along with transfer learning for detecting plant diseases. First of all, pre-processing technique has been applied to improve image quality and increase the accuracy. After the training process, testing has been done for validating the results. To train these models, PlantVillage dataset has been used which contains both diseased and healthy leaves. 80% data has been utilised in training step and other 20% has been used in testing. In this research, precision, recall and f1-score are also computed besides the accuracy. Using AlexNet, VGG16, and VGG19 96.63%, 95.05%, and 95.22% testing accuracy have been achieved respectively. As we can see that among all models the modified AlexNet performed best and got 96.63% as accuracy, 92 % as precision, 91 % as recall, and 91 % as f1-score. © 2024 IEEE.

关键词： Deep Learning Fully Connected Histogram equalization Pooling RELU

来源：评论

学校读者我要写书评

暂无评论

On some properties of the bibasic Humbert hypergeometric functions Ξ_(1) and Ξ_(2)

引用

Applied Mathematics(A Journal of Chinese Universities) 2023年第4期38卷 614-630页

作者： CAI Qing-bo Ghazi S.Khammash Shimaa I.Moustafa Ayman Shehata Provincial Key Laboratory of Data-Intensive Computing Key Laboratory of Intelligent Computing and Information ProcessingSchool of Mathematics and Computer ScienceQuanzhou Normal UniversityQuanzhou 362000China Department of Mathematics Al-Aqsa UniversityGazaGaza StripPalestine Department of Mathematics Faculty of ScienceAssiut UniversityAssiut 71516Egypt Department of Mathematics Unaizah College of Science and ArtsUnaizah 56264Qassim UniversityBuraydah 52571QassimSaudi Arabia

The main object of this paper is to deduce the bibasic Humbert functions Ξ_(1) and Ξ_(2)Some interesting results and elementary summations technique that was successfully employed,q-recursion,q-derivatives relations,the q-differential recursion relations,the q-integral representations for Ξ_(1) and Ξ_(2)are *** summation formula derives a list of p-analogues of transformation formulas for bibasic Humbert functions that have been studied,also some hypergeometric functions properties of some new interesting special cases have been given.

关键词： q-calculus bibasic Humbert hypergeometric functions q-derivative

来源：评论

学校读者我要写书评

暂无评论

A Gradient-Guided Evolutionary Approach to Training Deep Neural Networks

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2022年第9期33卷 4861-4875页

作者： Yang, Shangshang Tian, Ye He, Cheng Zhang, Xingyi Tan, Kay Chen Jin, Yaochu Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Anhui University Hefei China Department of Computer Science and Engineering Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Southern University of Science and Technology Shenzhen China Department of Computing The Hong Kong Polytechnic University Hong Kong SAR Department of Computer Science University of Surrey Guildford U.K

It has been widely recognized that the efficient training of neural networks (NNs) is crucial to classification performance. While a series of gradient-based approaches have been extensively developed, they are criticized for the ease of trapping into local optima and sensitivity to hyperparameters. Due to the high robustness and wide applicability, evolutionary algorithms (EAs) have been regarded as a promising alternative for training NNs in recent years. However, EAs suffer from the curse of dimensionality and are inefficient in training deep NNs (DNNs). By inheriting the advantages of both the gradient-based approaches and EAs, this article proposes a gradient-guided evolutionary approach to train DNNs. The proposed approach suggests a novel genetic operator to optimize the weights in the search space, where the search direction is determined by the gradient of weights. Moreover, the network sparsity is considered in the proposed approach, which highly reduces the network complexity and alleviates overfitting. Experimental results on single-layer NNs, deep-layer NNs, recurrent NNs, and convolutional NNs (CNNs) demonstrate the effectiveness of the proposed approach. In short, this work not only introduces a novel approach for training DNNs but also enhances the performance of EAs in solving large-scale optimization problems.

关键词： Artificial neural networks Training Optimization Search problems Scalability Complexity theory Genetic algorithms Deep neural networks (DNNs) evolutionary algorithm (EA) genetic operator gradient descent sparsity

来源：评论

学校读者我要写书评

暂无评论

An Opposition-Based Learning Archerfish Hunting Optimizer for Global Optimization 6

An Opposition-Based Learning Archerfish Hunting Optimizer fo...

引用

6th International Conference on Advanced Aspects of software Engineering, ICAASE 2024

作者： Ferhat, Aridj Zitouni, Farouq Limanc, Abdelhadi Lakbichi, Rihab Harous, Saad Department of Computer Science and Information Technology Laboratory of Artificial Intelligence and Information Technology Kasdi Merbah University Ouargla Algeria College of Computing and Informatics Department of Computer Science University of Sharjah Sharjah United Arab Emirates

ISBN: (纸本)9798331522810

This paper introduces OBL-AHO, an enhanced Archerfish Hunting Optimizer (AHO) variant that integrates Opposition-Based Learning (OBL) to improve AHO's exploratory capabilities. By leveraging opposite solutions alongside newly generated ones, OBL-AHO broadens the search space, effectively reducing the risk of local optima entrapment-A common challenge in metaheuristic algorithms. The performance of OBL-AHO is rigorously compared with the original AHO and several prominent Metaheuristic Algorithms (MAs), including TLBO (Teaching-Learning-Based Optimization), PSO (Particle Swarm Optimization), GWO (Grey Wolf Optimizer), OOBO (OnE-To-One Based Optimizer), SSA (Salp Swarm Algorithm). Evaluations were conducted using test functions taken from CEC 2022, and the outcomes were statistically analyzed using the Friedman test. The findings demonstrate that OBL-AHO significantly improves exploration while maintaining competitive exploitation relative to its opponents. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of Four Metaheuristic Algorithms for Estimating Parameters in Solar Photovoltaic Models 6

Comparative Analysis of Four Metaheuristic Algorithms for Es...

引用

6th International Conference on Advanced Aspects of software Engineering, ICAASE 2024

作者： Lakbichi, Rihab Zitouni, Farouq Limane, Abdelhadi Ferhat, Aridj Harous, Saad Department of Computer Science and Information Technology Laboratory of Artificial Intelligence and Information Technology Kasdi Merbah University Ouargla Algeria College of Computing and Informatics University of Sharjah Department of Computer Science Sharjah United Arab Emirates

ISBN: (纸本)9798331522810

In the last decade, Metaheuristic Algorithms (MAs) have been widely employed to estimate parameters in photovoltaic (PV) models to maximize solar energy efficiency. This paper presents a comparative study of the performance of four novel and efficient MAs applied to solve the parameter extraction problem in three ubiquitous PV models: The Single-Diode Model (SDM), the Double-Diode Model (DDM), and the Photovoltaic Module Model (PMM). The primary objective of this study is to evaluate and compare the efficiency of these MAs and identify the most effective one based on the Root Mean Square Error (RMSE) between the simulated and the actual data. This work compares the performance of the Red-Tailed Hawk Optimizer (RTH), the One-To-One Based Optimizer (OOBO), the Sand Cat Swarm Optimization (SCSO), and the Archerfish Hunting Optimizer (AHO). The numerical results demonstrate that RTH significantly outperforms its counterparts in estimating parameters for the examined models. This exceptional performance underscores RTH's efficiency and effectiveness as a powerful tool for parameter estimation in PV models. Given these promising results, RTH stands out as a preferred method and holds the potential for further refinement and enhancement in the future. © 2024 IEEE.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

Polylogarithmic Approximations for Robust s-t Path 51

Polylogarithmic Approximations for Robust s-t Path

引用

51st International Colloquium on Automata, Languages, and Programming, ICALP 2024

作者： Li, Shi Xu, Chenyang Zhang, Ruilong Department of Computer Science and Technology Nanjing University Jiangsu China Shanghai Key Laboratory of Trustworthy Computing East China Normal University China Department of Computer Science City University of Hong Kong Hong Kong

ISBN: (纸本)9783959773225

The paper revisits the Robust s-t Path problem, one of the most fundamental problems in robust optimization. In the problem, we are given a directed graph with n vertices and k distinct cost functions (scenarios) defined over edges, and aim to choose an s-t path such that the total cost of the path is always provable no matter which scenario is realized. Viewing each cost function as an agent, our goal is to find a fair s-t path, which minimizes the maximum cost among all agents. The problem is NP-hard to approximate within a factor of o(log k) unless NP ⊆ DTIME(npoly logn), and the best-known approximation ratio is Oe(√n), which is based on the natural flow linear program. A longstanding open question is whether we can achieve a polylogarithmic approximation for the problem;it remains open even if a quasi-polynomial running time is allowed. Our main result is a O(log n log k) approximation for the Robust s-t Path problem in quasipolynomial time, solving the open question in the quasi-polynomial time regime. The algorithm is built on a novel linear program formulation for a decision-tree-type structure, which enables us to overcome the Ω(√n) integrality gap for the natural flow LP. Furthermore, we show that for graphs with bounded treewidth, the quasi-polynomial running time can be improved to a polynomial. We hope our techniques can offer new insights into this problem and other related problems in robust optimization. © Shi Li, Chenyang Xu, and Ruilong Zhang.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Digital Twins and Cyber-Physical Systems:A New Frontier in computer Modeling

引用

computer Modeling in Engineering & sciences 2025年第4期143卷 51-113页

作者： Vidyalakshmi G S Gopikrishnan Wadii Boulila Anis Koubaa Gautam Srivastava Department of Computer Science and Engineering SRM University APAmaravati522240India School of Computer Science and Engineering VIT-AP UniversityAmaravathi522240India Robotics and Internet-of-Things Laboratory Prince Sultan UniversityRiyadh12435Saudi Arabia Department of Math and Computer Science Brandon UniversityBrandonMB R7A6A9Canada Research Centre for Interneural Computing China Medical UniversityTaichung40402Taiwan

Cyber-Physical Systems(CPS)represent an integration of computational and physical elements,revolutionizing industries by enabling real-time monitoring,control,and optimization.A complementary technology,Digital Twin(DT),acts as a virtual replica of physical assets or processes,facilitating better decision making through simulations and predictive *** and DT underpin the evolution of Industry 4.0 by bridging the physical and digital *** survey explores their synergy,highlighting how DT enriches CPS with dynamic modeling,realtime data integration,and advanced simulation *** layered architecture of DTs within CPS is examined,showcasing the enabling technologies and tools vital for seamless *** study addresses key challenges in CPS modeling,such as concurrency and communication,and underscores the importance of DT in overcoming these *** in various sectors are analyzed,including smart manufacturing,healthcare,and urban planning,emphasizing the transformative potential of CPS-DT *** addition,the review identifies gaps in existing methodologies and proposes future research directions to develop comprehensive,scalable,and secure CPSDT *** synthesizing insights fromthe current literature and presenting a taxonomy of CPS and DT,this survey serves as a foundational reference for academics and *** findings stress the need for unified frameworks that align CPS and DT with emerging technologies,fostering innovation and efficiency in the digital transformation era.

关键词： Cyber physical systems digital twin efficiency Industry 4.0 robustness and intelligence

来源：评论

学校读者我要写书评

暂无评论

A Blockchain-Based Framework for Secure Storage and Sharing of Resumes

引用

computers, Materials & Continua 2022年第9期72卷 5395-5413页

作者： Huanrong Tang Changlin Hu Tianming Liu Jianquan Ouyang Key Laboratory of Intelligent Computing and Information Processing Ministry of EducationComputer Science College of Xiangtan UniversityXiangtanHunan ProvinceChina Department of Computer Science The University of GeorgiaAthensGeorgiaUSA

In response to problems in the centralized storage of personal resumes on third-party recruitment platforms,such as inadequate privacy protection,inability of individuals to accurately authorize downloads,and inability to determine who downloaded the resume and when,this study proposes a blockchain-based framework for secure storage and sharing of *** can employ an authorized access mechanism to protect their privacy *** proposed framework uses smart contracts,interplanetary file system,symmetric encryption,and digital signatures to protect,verify,and share *** keys are split and stored in multiple depositories through secret-sharing technology to improve the security of these *** key escrow incentives are implemented using smart contracts to automatically verify the correctness of keys and encourage the active participation of honest key escrow *** framework combines blockchain and searchable symmetric encryption technology to realize multikeyword search using inverted indexing and Bloom filters and verify search results on the *** search service fees are charged through *** after the search results are verified can the search service provider obtain the search fee,thus ensuring fair and efficient search for encrypted *** framework is decentralized,secure,and tamper-evident,and achieves controlled sharing while protecting personal privacy and information security.

关键词： Resume blockchain interplanetary file system secret sharing searchable encryption

来源：评论

学校读者我要写书评

暂无评论

Enhanced Fake News Detection through the Fusion of Deep Learning and Repeat Vector Representations 2

Enhanced Fake News Detection through the Fusion of Deep Lear...

引用

2nd International Conference on Intelligent Data Communication Technologies and Internet of Things, IDCIoT 2024

作者： Mahmud, Tanjim Hasan, Imran Aziz, Mohammad Tarek Rahman, Taohidur Hossain, Mohammad Shahadat Andersson, Karl Rangamati Science and Technology University Department of Computer Science and Engineering Rangamati4500 Bangladesh University of Chittagong Department of Computer Science and Engineering Chittagong4331 Bangladesh Pervasive and Mobile Computing Laboratory Luleå University of Technology Luleå97187 Sweden

ISBN: (纸本)9798350327533

The rapid dissemination of information across social networks, online news portals, and digital platforms has given rise to a pervasive issue - fake news. This misinformation, deliberately propagated by groups with ulterior motives, has the potential to divert societies in alarming directions. In a digital landscape inundated with millions of daily stories, distinguishing fact from fabrication has become a formidable challenge, casting a dark cloud of uncertainty over the information age. In response to this critical issue, this paper presents an innovative approach for enhanced fake news detection through the fusion of deep learning and Repeat Vector representations. In an era where individuals of all ages increasingly rely on online news sources, the dissemination of misinformation has become an alarming norm. It is a challenge to discern deceptive narratives that aim to sow discord and create undue *** confront this challenge head-on, we propose a deep neural network model that combines Convolutional Neural Network (CNN) and Long Short-Term Memory (LSTM) architectures using the Repeat Vector method. This hybrid model excels in deciphering complex patterns within 1D data, effectively tackling the menace of fake news. Our rigorous evaluation demonstrates that our proposed model outperforms contemporary methods, achieving an impressive validation accuracy of up to 98.94% on our *** a world increasingly plagued by misinformation, our approach represents a significant stride toward safeguarding the integrity of information in the digital age. © 2024 IEEE.

关键词： Autoencoder Technique Convolutional Neural Network Deep Learning Long Short-Term Memory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：