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

IEEE Journal of Selected Areas in Sensors 2024年 1卷 49-59页

作者： Shitharth Selvarajan Hariprasath Manoharan Adil O. Khadidos Alaa O. Khadidos School of Built Environment Engineering and Computing Leeds Beckett University Leeds U.K. Department of Electronics and Communication Engineering Panimalar Engineering College Chennai India Department of Information Technology Faculty of Computing and Information Technology King Abdulaziz University Jeddah Saudi Arabia Department of Information Systems Faculty of Computing and Information Technology King Abdulaziz University Jeddah Saudi Arabia Center of Research Excellence in Artificial Intelligence and Data Science King Abdulaziz University Jeddah Saudi Arabia

In this article, machine learning methods are used to assess how well wireless sensor networks transmit and receive radar signals. Measurements are done with labeled and unlabeled datasets where output functions are modified in relation to transmitted input in order to test the transceiver of radar signals. The main contribution in the proposed method is to focus on the possibility of choosing a free space model that transmits the radar signals in wireless sensor networks without any interruptions. Hence, for such type of transmissions, reference time period is selected in order to perform radar signal classification, and at the same time, separation of unnecessary interruptions is reduced using clustering procedures. Since the radar signals can be monitored with automatic transmission techniques, the outcomes are combined with supervised, unsupervised, and reinforcement learning models to increase the effect of transmissions. Therefore, the objective functions are designed with three scenarios where reinforcement learning proves to provide adequate connections for radar signals to all wireless sensor networks at reduced error of 0.3%. In addition, with reinforcement learning, the distance of radar signal transmission is maximized to a level greater than 75% at minimized noise ratio of 0.8%.

关键词： Radar Wireless sensor networks Sensors Spaceborne radar Security Radar measurements Mathematical models

来源：评论

学校读者我要写书评

暂无评论

Enhanced prairie dog optimization with Levy flight and dynamic opposition-based learning for global optimization and engineering design problems

引用

Neural computing and Applications 2024年第19期36卷 11137-11170页

作者： Biswas, Saptadeep Shaikh, Azharuddin Ezugwu, Absalom El-Shamir Greeff, Japie Mirjalili, Seyedali Bera, Uttam Kumar Abualigah, Laith Department of Mathematics National Institute of Technology Agartala Tripura Agartala India Unit for Data Science and Computing North-West University 11 Hoffman Street Potchefstroom2520 South Africa Faculty of Natural and Agricultural Sciences School of Computer Science and Information Systems North-West University Vanderbijlpark South Africa Centre for Artificial Intelligence Research and Optimization Torrens University Australia Fortitude Valley BrisbaneQLD4006 Australia Research Center University of Tabuk Tabuk71491 Saudi Arabia Computer Science Department Al al-Bayt University Mafraq25113 Jordan Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman19328 Jordan Applied Science Research Center Applied Science Private University Amman11931 Jordan Department of Electrical and Computer Engineering Lebanese American University Byblos13-5053 Lebanon School of Engineering and Technology Sunway University Malaysia Petaling Jaya27500 Malaysia College of Engineering Yuan Ze University Taoyuan32003 Taiwan MEU Research Unit Middle East University Amman11831 Jordan

This study proposes a new prairie dog optimization algorithm version called EPDO. This new version aims to address the issues of premature convergence and slow convergence that were observed in the original PDO algorithm. To improve performance, several modifications are introduced in EPDO. First, a dynamic opposite learning strategy is employed to increase the diversity of the population and prevent premature convergence. This strategy helps the algorithm avoid falling into local optima and promotes global optimization. Additionally, the Lévy dynamic random walk technique is utilized in EPDO. This modified Lévy flight with random walk reduces the algorithm’s running time for the test function’s ideal value, accelerating its convergence. The proposed approach is evaluated using 33 benchmark problems from CEC 2017 and compared against seven other comparative techniques: GWO, MFO, ALO, WOA, DA, SCA, and RSA. Numerical results demonstrate that EPDO produces good outcomes and performs well in solving benchmark problems. To further validate the results and assess reliability, the authors employ average rank tests, the measurement of alternatives, and ranking according to the compromise solution (MARCOS) method, as well as a convergence report of EPDO and other algorithms. Furthermore, the effectiveness of the EPDO algorithm is demonstrated by applying it to five design problems. The results indicate that EPDO achieves impressive outcomes and proves its capability to address practical issues. The algorithm performs well in solving benchmark and practical design problems, as supported by the numerical results and validation methods used in the study. © The Author(s) 2024.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Meta-Transfer Learning Based Cross-Domain Gesture Recognition Using WiFi Channel State Information

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Dai, Penglin Zhou, Junfei Ma, Jialong Zhang, Hao Wu, Xiao Southwest Jiaotong University School of Computing and Artificial Intelligence Chengdu611756 China Ministry of Education Engineering Research Center of Sustainable Urban Intelligent Transportation China Tangshan Institute of Southwest Jiaotong University Tangshan063000 China Chongqing University of Posts and Telecommunications College of Computer Science and Technology Key Laboratory of Data Engineering and Visual Computing Chongqing400065 China

Gesture recognition plays a crucial role in a wide range of consumer electronics applications, including human-computer interaction and virtual reality, by enabling the identification and interpretation of human gestures. In recent times, WiFi-based gesture recognition has garnered significant attention due to its privacy protection and unobtrusive nature. However, this approach heavily depends on neural network-based models and is notably influenced by environmental conditions, such as specific location and orientation. To address these environmental impacts, we propose a network framework that leverages transfer learning and meta-learning. The primary focus is on utilizing transfer learning to train a convolutional neural network (ResNet) for feature extraction, enabling the extraction of domain-independent features specifically related to gestures, rather than being influenced by environmental factors. Additionally, we employ the meta-learning algorithm MAML to train the fully connected network for gesture classification. Following training, a small set of samples can be utilized for rapid adaptation to diverse domains, maintaining high accuracy across different domains to achieve cross-domain gesture recognition. Our performance evaluation is based on the Widar 3.0 dataset, encompassing both in-domain and cross-domain scenarios. The simulation results demonstrate that our proposed algorithm surpasses Widar3.0 and WiGRUNT by approximately 7.9% and 1.12% in gesture recognition accuracy across all scenarios. © 2025 IEEE.

关键词： Wi-Fi

来源：评论

学校读者我要写书评

暂无评论

Semantic and Emotional Dual Channel for Emotion Recognition in Conversation

引用

IEEE Transactions on Affective computing 2025年

作者： Yang, Zhenyu Zhang, Zhibo Cheng, Yuhu Zhang, Tong Wang, Xuesong Jinan250353 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250353 China China University of Mining and Technology Engineering Research Center of Intelligent Control for Underground Space Ministry of Education Xuzhou Key Laboratory of Artificial Intelligence and Big Data School of Information and Control Engineering Xuzhou221116 China South China University of Technology Guangdong Provincial Key Laboratory of Computational Intelligence and Cyberspace Information School of Computer Science and Engineering Guangzhou510006 China Pazhou Lab Guangzhou510335 China Engineering Research Center Ministry of Education on Health Intelligent Perception and Paralleled Digital-Human Guangzhou China

Emotion recognition in conversation (ERC) aims at accurately identifying emotional states expressed in conversational content. Existing ERC methods, although relying on semantic understanding, often encounter challenges when confronted with incomplete or misleading semantic information. In addition, when dealing with the interaction between emotional and semantic information, existing methods are often difficult to effectively distinguish the complex relationship between the two, which affects the accuracy of emotion recognition. To address the problems of semantic misdirection and emotional cross-talk encountered by traditional models when confronted with complex conversational data, we propose a semantic and emotional dual channel (SEDC) strategy for emotion recognition in conversations to process emotional and semantic information independently. Under this strategy, emotion information provides an auxiliary recognition function when the semantics are unclear or lacking, enhancing the accuracy of the model. Our model consists of two modules: the emotion processing module accurately captures the emotional features of each utterance through contrastive learning, and then constructs a dialogue emotion propagation map to simulate the emotional information conveyed in the dialogue;the semantic processing module combines an external knowledge base to enhance the semantic expression of the dialogue through knowledge enhancement strategies. This divide-and-conquer approach allows us to more deeply analyze the emotional and semantic dimensions of complex dialogues. Experimental results on the IEMOCAP, EmoryNLP, MELD, and DailyDialog datasets show that our approach significantly outperforms existing techniques and effectively improves the accuracy of dialogue emotion recognition. Our code is available at https://***/r/SEDC-FCF1. © 2010-2012 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

LightDAG: A Low-latency DAG-based BFT Consensus through Lightweight Broadcast

LightDAG: A Low-latency DAG-based BFT Consensus through Ligh...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Xiaohai Dai Guanxiong Wang Jiang Xiao Zhengxuan Guo Rui Hao Xia Xie Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China School of Computer Science and Artificial Intelligence Wuhan University of Technology China School of Computer Science and Technology Hainan University China

ISBN: (数字)9798350387117

ISBN: (纸本)9798350387124

To improve the throughput of Byzantine Fault Tolerance (BFT) consensus protocols, the Directed Acyclic Graph (DAG) topology has been introduced to parallel data processing, leading to the development of DAG-based BFT consensus. However, existing DAG-based works heavily rely on Reliable Broadcast (RBC) protocols for block broadcasting, which introduces significant latency due to the three communication steps involved in each RBC. For instance, DAGRider, a representative DAG-based protocol, exhibits the best latency of 12 steps, considerably higher than non-DAG protocols like PBFT, which only requires 3 steps. To tackle this issue, we propose LightDAG, which replaces RBC with lightweight broadcasting protocols such as Consistent Broadcast (CBC) and Plain Broadcast (PBC). Since CBC and PBC can be implemented in two and one communication steps, respectively, LightDAG achieves low *** our proposal, we present two variants of LightDAG, namely LightDAG1 and LightDAG2, each providing a trade-off between the best latency and the expected worst latency. In LightDAG1, every block is broadcast using CBC, which exhibits a best latency of 5 steps and an expected worst latency of 14 steps. Since CBC cannot guarantee the totality property, we design a block retrieval mechanism in LightDAG1 to assist replicas in retrieving missing blocks. LightDAG2 utilizes a combination of PBC and CBC for block broadcasting, resulting in the best latency of 4 steps and an expected worst latency of 12(t+1) steps, where t represents the number of actual Byzantine replicas. Since a Byzantine replica may equivocate through PBC, LightDAG2 prohibits blocks from directly referencing contradictory blocks. To ensure liveness, we propose a mechanism to identify and exclude Byzantine replicas if they engage in equivocation attacks. Extensive experiments have been conducted to evaluate LightDAG, and the results demonstrate its feasibility and efficiency.

关键词： Fault tolerance Distributed processing Directed acyclic graph Fault tolerant systems Broadcasting Throughput data processing

来源：评论

学校读者我要写书评

暂无评论

Synergistic Deep Graph Clustering Network

arXiv

引用

arXiv 2024年

作者： Wu, Benyu Ding, Shifei Xu, Xiao Guo, Lili Ding, Ling Wu, Xindong The School of Computer Science and Technology China University of Mining and Technology Xuzhou221116 China The Mine Digitization Engineering Research Center of Ministry of Education Xuzhou221116 China The College of Intelligence and Computing Tianjin University Tianjin300350 China Hefei University of Technology 230009 China

Employing graph neural networks (GNNs) to learn cohesive and discriminative node representations for clustering has shown promising results in deep graph clustering. However, existing methods disregard the reciprocal relationship between representation learning and structure augmentation. This study suggests that enhancing embedding and structure synergistically becomes imperative for GNNs to unleash their potential in deep graph clustering. A reliable structure promotes obtaining more cohesive node representations, while high-quality node representations can guide the augmentation of the structure, enhancing structural reliability in return. Moreover, the generalization ability of existing GNNs-based models is relatively poor. While they perform well on graphs with high homogeneity, they perform poorly on graphs with low homogeneity. To this end, we propose a graph clustering framework named Synergistic Deep Graph Clustering Network (SynC). In our approach, we design a Transform Input Graph Auto-Encoder (TIGAE) to obtain high-quality embeddings for guiding structure augmentation. Then, we re-capture neighborhood representations on the augmented graph to obtain clustering-friendly embeddings and conduct self-supervised clustering. Notably, representation learning and structure augmentation share weights, significantly reducing the number of model parameters. Additionally, we introduce a structure fine-tuning strategy to improve the model's generalization. Extensive experiments on benchmark datasets demonstrate the superiority and effectiveness of our method. The code is released at GitHub and Code Ocean. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Incorporating edge sharpening and covariance attention for named entity recognition

引用

Neurocomputing 2025年 643卷

作者： Yang, Caiwei Chen, Yanping Yu, Shuai Huang, Ruizhang Qin, Yongbin Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Guizhou University Guizhou Guiyang550025 China State Key Laboratory of Public Big Data Guizhou university Guizhou Guiyang550025 China College of Computer Science and Technology Guizhou University Guiyang550025 China

Named Entity Recognition (NER) is a key application in the field of Artificial intelligence and Natural Language Processing, which automatically identifies and categorizes entities in text by intelligent algorithms. In NER, all spans of a sentence can be organized into a two-dimensional representation. The semantic plane has the advantage to represent the semantic structure of a sentence and to learn the interaction between spans. One of an important phenomenon of this representation is that neighboring elements of the semantic plane are spans denoted to overlapped subsequences in a sentence. Because they share the same contextual features and semantic dependencies, it is difficult to distinguish true entities from the backgrounds. Therefore, refining span representations and building the semantic dependency between spans is helpful for the entity recognition task. In this paper, we propose an Edge Sharpening and Covariance Attention (ES&CA) model to support recognizing named entities from the semantic plane representation. The edge sharpening (ES) module adopts a differential convolution to sharpen the semantic gradients in the semantic plane, which has the ability to gather semantic information from neighborhoods. In the covariance attention (CA) module, the covariance between spans are applied to weight the attention of spans relevant to task-relevant learning objective. Establishing semantic relationships across spans is a highly successful approach. The ES&CA model is assessed on five public datasets for nested and flattened named entity recognition. The evaluation results demonstrate the effectiveness of our strategy in distinguishing entity spans from the backgrounds, hence significantly enhancing the final performance. © 2025 Elsevier B.V.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Multi-Channel Hypergraph Convolution Group Recommendation with Member Information Enhancement 25

Multi-Channel Hypergraph Convolution Group Recommendation wi...

引用

25th IEEE International Conferences on High Performance computing and Communications, 9th International Conference on data Science and Systems, 21st IEEE International Conference on Smart City and 9th IEEE International Conference on Dependability in Sensor, Cloud and Big data Systems and Applications, HPCC/DSS/SmartCity/DependSys 2023

作者： Chen, Tianhao Gao, Qian Fan, Jun Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Shandong Jinan250014 China Qilu University of Technology Shandong Academy of Sciences Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Shandong Jinan250353 China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Shandong Jinan250014 China China Telecom Digital Intelligence Techonology Co Ltd Shandong Jinan250101 China

ISBN: (纸本)9798350330014

Group recommendation involves comprehensively considering various aspects, including members and items, to predict the overall interests of a group and recommend suitable items through a recommendation system. With the rapid evolution of the Internet, online group activities have become increasingly prevalent, making group recommendation a highly discussed topic within the realm of recommendation systems. However, current research in group recommendation still confronts the following challenges. Firstly, a predominant portion of group recommendation research focuses solely on aggregating group-level information, neglecting the valuable contribution of higher-order member-level insights to group recommendation. Moreover, some aggregation strategies overly prioritize fairness, thereby disregarding common real-world patterns. Secondly, previous studies have primarily relied on aggregating individual member interests to establish group preferences, lacking a holistic consideration of group dynamics. To tackle these challenges, this study introduces an innovative approach by implementing multi-channel hypergraph convolution within the member perspective. This approach aims to effectively extract higher-order insights from members by utilizing a member information enhancement module. By establishing group interconnections based on similarity and employing an adaptive fusion network to amalgamate multiple viewpoints, a final representation is derived. Experimental results demonstrate that our proposed model surpasses baseline models by 3% to 4% in terms of hit rate and accuracy, validating the efficacy of our approach. © 2023 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Social-enhanced recommendation using graph-based contrastive learning 25

Social-enhanced recommendation using graph-based contrastive...

引用

作者： Xue, Peng Gao, Qian Fan, Jun Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Shandong Jinan250014 China Qilu University of Technology Shandong Academy of Sciences Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Shandong Jinan250353 China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Shandong Jinan250014 China China Telecom Digital Intelligence Techonology Co Ltd Shandong Jinan250101 China

ISBN: (纸本)9798350330014

The social network-based recommendation model use social network information to mitigate data sparsity issues and improve the accuracy of recommendation models. However, In most social network-based recommendation algorithms, the social neighbors' contributions are difficult to distinguish from the central user's, neglecting hidden correlations in social infor-mation. In order to solve this problem, this paper presents a graph-based contrastive learning framework for social-enhanced recommendation (SoGCLR) that utilizes implicit social information captured by a new social relation attention mechanism, en-rich user representations, and improve model robustness through graph-based contrastive learning. Specifically, the paper captures the degree of contribution of each neighbor in the social graph to the central user through a social relation attention layer, thus obtaining hidden correlations in social information, and further integrates this with user information in the user-item interaction graph to enrich user representations. In addition, the paper incorporates graph-based contrastive learning into the recommendation task using cross-layer contrastive learning, calculating contrastive loss and mapping nodes with similar but different exposure rates to nearby regions to mitigate exposure bias issues. Results from Ciao and Epinions demonstrate that SoGCLR reduces RMSE and MAE by 1.33% to 1.84% compared with baseline models. © 2023 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

CroPrompt: Cross-task Interactive Prompting for Zero-shot Spoken Language Understanding

CroPrompt: Cross-task Interactive Prompting for Zero-shot Sp...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Libo Qin Fuxuan Wei Qiguang Chen Jingxuan Zhou Shijue Huang Jiasheng Si Wenpeng Lu Wanxiang Che School of Computer Science and Engineering Central South University China Key Laboratory of Data Intelligence and Advanced Computing in Provincial Universities Soochow University China Research Center for Social Computing and Information Retrieval Harbin Institute of Technology China Harbin Institute of Technology Shenzhen China Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology (Shandong Academy of Sciences)

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Slot filling and intent detection are two highly correlated tasks in spoken language understanding (SLU). Recent SLU research attempts to explore zero-shot prompting techniques in large language models to alleviate the data scarcity problem. Nevertheless, the existing prompting work ignores the cross-task interaction information for SLU, which leads to sub-optimal performance. To solve this problem, we present the pioneering work of Cross-task Interactive Prompting (CroPrompt) for SLU, which enables the model to interactively leverage the information exchange across the correlated tasks in SLU. Additionally, we further introduce a multi-task self-consistency mechanism to mitigate the error propagation caused by the intent information injection. We conduct extensive experiments on the standard SLU benchmark and the results reveal that CroPrompt consistently outperforms the existing prompting approaches. In addition, the multi-task self-consistency mechanism can effectively ease the error propagation issue, thereby enhancing the performance. We hope this work can inspire more research on cross-task prompting for SLU.

关键词： Large language models Signal processing Benchmark testing Multitasking Filling Acoustics Speech processing Information exchange Standards

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：