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

IEEE Transactions on AgriFood Electronics 2025年第1期3卷 246-253页

作者： Wang, Xu Wang, Deyi He, Zhaoshui Lin, Zhijie Xie, Shengli Guangdong Mechanical and Electrical Polytechnic School of Electronics and Communication Guangzhou510550 China Guangdong University of Technology School of Automation Guangzhou510006 China Key Laboratory for IoT Intelligent Information Processing and System Integration of Ministry of Education Guangzhou510006 China Guangdong Provincial Key Laboratory of Intelligent Systems and Optimization Integration Guangzhou510006 China

Agriculture crop classification is helpful for agricultural production. However, it is challenging to classify crops from the agriculture image suffering from these problems: 1) Crops are often masked in complex backgrounds;2) There is high similarity between crop categories. To address these problems, an adaptive masking attention network (AMA-Net) is proposed for agriculture crop identification from natural images, where the adaptive masking (AM) module is developed to distinguish the crop from the complex background by selectively eliminating redundant information of feature maps, and the fair attention module is devised to identify similar crops between categories by modeling the fine-grained features. Experiments conducted on the benchmark show the effectiveness and superiority of the proposed AMA-Net, achieving the performance of 96.65%, 96.65%, 97.13%, and 96.72% on the accuracy, precision, recall, and F1-score, respectively, which is better than other state-of-the-art methods. © 2023 IEEE.

关键词： Crops Agriculture Accuracy Visualization Training Production Autonomous aerial vehicles Attention mechanisms Adaptive systems Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Complementary Learning Subnetworks Towards Parameter-Efficient Class-Incremental Learning

引用

IEEE Transactions on Knowledge and Data Engineering 2025年第6期37卷 3240-3252页

作者： Li, Depeng Zeng, Zhigang Dai, Wei Suganthan, Ponnuthurai Nagaratnam Huazhong University of Science and Technology School of Artificial Intelligence and Automation Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan430074 China China University of Mining and Technology School of Information and Control Engineering Xuzhou221116 China Qatar University Kindi Center for Computing Research College of Engineering Doha2713 Qatar

In the scenario of class-incremental learning (CIL), deep neural networks have to adapt their model parameters to non-stationary data distributions, e.g., the emergence of new classes over time. To mitigate the catastrophic forgetting phenomenon, typical CIL methods either cumulatively store exemplars of old classes for retraining model parameters from scratch or progressively expand model size as new classes arrive, which, however, compromises their practical value due to little attention paid to parameter efficiency. In this paper, we contribute a novel solution, effective control of the parameters of a well-trained model, by the synergy between two complementary learning subnetworks. Specifically, we integrate one plastic feature extractor and one analytical feed-forward classifier into a unified framework amenable to streaming data. In each CIL session, it achieves non-overwritten parameter updates in a cost-effective manner, neither revisiting old task data nor extending previously learned networks;Instead, it accommodates new tasks by attaching a tiny set of declarative parameters to its backbone, in which only one matrix per task or one vector per class is kept for knowledge retention. Experimental results on a variety of task sequences demonstrate that our method achieves competitive results against state-of-the-art CIL approaches, especially in accuracy gain, knowledge transfer, training efficiency, and task-order robustness. Furthermore, a graceful forgetting implementation on previously learned trivial tasks is empirically investigated to make its non-growing backbone (i.e., a model with limited network capacity) suffice to train on more incoming tasks. © 2025 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Analysis of On-policy Policy Gradient Methods under the Distribution Mismatch

arXiv

引用

arXiv 2025年

作者： Wang, Weizhen He, Jianping Duan, Xiaoming Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China

Policy gradient methods are one of the most successful methods for solving challenging reinforcement learning problems. However, despite their empirical successes, many SOTA policy gradient algorithms for discounted problems deviate from the theoretical policy gradient theorem due to the existence of a distribution mismatch. In this work, we analyze the impact of this mismatch on the policy gradient methods. Specifically, we first show that in the case of tabular parameterizations, the methods under the mismatch remain globally optimal. Then, we extend this analysis to more general parameterizations by leveraging the theory of biased stochastic gradient descent. Our findings offer new insights into the robustness of policy gradient methods as well as the gap between theoretical foundations and practical implementations. © 2025, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Ocean archaea PPI prediction with pretraining models 25

Ocean archaea PPI prediction with pretraining models

引用

Proceedings of the 2025 5th International Conference on Bioinformatics and Intelligent Computing

作者： Ying Zhang Yuan Liu Xiaoyong Pan Hongbin Shen Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China

ISBN: (纸本)9798400712203

Protein-Protein Interaction (PPI) provides important insights into the metabolic mechanisms of different biological processes. Although PPIs in some organisms have been investigated systematically, PPIs in the ocean archaea remain largely unexplored. But such species have special investigation value since their adaptation to extreme living conditions may generate unique PPIs. In this paper, we aim to characterize and predict PPIs in ocean archaea to advance understanding of their metabolic networks. First, we collect all ocean archaea PPIs with high confidence from STRING database and analyze the PPI network features, including centrality and enrichment analysis. The functional enrichment results of the largest connecting subgraph in the PPI network show most PPIs in our constructed dataset is related to the translation and transcription processes. Then, we generate an equal number of negative PPI pairs, whose members have either different subcellular locations or GO terms. We also use the generated dataset to test the performance of three pretraining methods and their ensemble methods in the binary PPI prediction task. Our results suggest the ensemble methods could be applied to further improve models’ performance. Fine-tuned models trained on the ocean archaea dataset are expected to predict the other ocean archaea PPIs that are not included in the STRING database and get more understanding about the ocean archaea PPI universe.

关键词： Binary PPI prediction

来源：评论

学校读者我要写书评

暂无评论

Bilateral Pricing for Dynamic Association in Federated Edge Learning

引用

IEEE Transactions on Mobile Computing 2025年第6期24卷 4684-4697页

作者： Pan, Bangqi Lu, Jianfeng Cao, Shuqin Liu, Jing Tian, Wenlong Li, Minglu Wuhan University of Science and Technology School of Computer Science and Technology Wuhan430065 China Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China Dalian University of Technology Ministry of Education Key Laboratory of Social Computing and Cognitive Intelligence China University of South China School of Computer Science and Technology Hengyang421001 China Zhejiang Normal University School of Computer Science and Technology Jinhua321004 China

Devices and servers in Federated Edge Learning (FEL) are self-interested and resource-constrained, making it critical to design incentives to improve model performance. However, dynamic network conditions raise energy consumption, while data heterogeneity undermines device cooperation. Current research overlooks the interplay between system efficiency and device clustering, resulting in suboptimal updates. To address these challenges, we develop BENCH, a bilateral pricing mechanism consisting of three core rules aimed at incentivizing participation from both devices and servers. Specifically, we first design a reward allocation rule, based on the Rubinstein bargaining model, which dynamically allocates rewards. Theoretically, we derive a closed-form solution for this rule, demonstrating BENCH achieves Nash equilibrium. Secondly, we design a device partitioning rule that leverages modularity to group similar devices, facilitating personalized edge aggregation to accelerate local data adaptation. Thirdly, we design an edge matching rule that employs the Kuhn-Munkres algorithm to balance the load at edge servers, thus minimizing the congestion. Together, these three rules enable hierarchical optimization of pricing and associations, effectively mitigating the impact of dynamic costs and device heterogeneity. Extensive experiments demonstrate BENCH's effectiveness in increasing device participation by 28.81% and improving model performance by 2.66% compared to state-of-the-art baselines. © 2002-2012 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Learning-based 3D Reconstruction in Autonomous Driving: A Comprehensive Survey

arXiv

引用

arXiv 2025年

作者： Liao, Liewen Yan, Weihao Yang, Ming Zhang, Songan Global Institute of Future Technology Shanghai Jiao Tong University Key Labeoratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Department of Automation Shanghai Jiao Tong University Key Labeoratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China

Learning-based 3D reconstruction has emerged as a transformative technique in autonomous driving, enabling precise modeling of both dynamic and static environments through advanced neural representations. Despite data augmentation, 3D reconstruction inspires pioneering solution for vital tasks in the field of autonomous driving, such as scene understanding and closed-loop simulation. We investigates the details of 3D reconstruction and conducts a multi-perspective, in-depth analysis of recent advancements. Specifically, we first provide a systematic introduction of preliminaries, including data modalities, benchmarks and technical preliminaries of learning-based 3D reconstruction, facilitating instant identification of suitable methods according to sensor suites. Then, we systematically review learning-based 3D reconstruction methods in autonomous driving, categorizing approaches by subtasks and conducting multi-dimensional analysis and summary to establish a comprehensive technical reference. The development trends and existing challenges are summarized in the context of learning-based 3D reconstruction in autonomous driving. We hope that our review will inspire future researches. Copyright © 2025, The Authors. All rights reserved.

关键词： 3D reconstruction

来源：评论

学校读者我要写书评

暂无评论

Toward High-Accuracy and Low-Latency Group Vehicle Trajectory Prediction With Linear UNet-Enhanced Fully Connected Spatial–Temporal Graph Neural Network

引用

IEEE Internet of Things Journal 2025年第9期12卷 11797-11811页

作者： Zhang, Zirui Huang, Xumin Yu, Rong Wu, Maoqiang Kang, Jiawen Xie, Shengli Guangdong University of Technology School of Automation Key Laboratory of Intelligent Information Processing and System Integration of IoT Ministry of Education Guangdong Provincial Key Laboratory of Intelligent Systems and Optimization Integration Guangzhou510006 China South China Normal University School of Electronic Science and Engineering Foshan528225 China Guangdong University of Technology School of Automation 111 Center for Intelligent Batch Manufacturing Based on IoT Technology Guangdong-Hong Kong-Macao Joint Laboratory for Smart Discrete Manufacturing Guangzhou510006 China

Group vehicle trajectory prediction (GVTP) is important for analyzing the traffic states and optimizing the traffic management. However, existing studies have performance bottlenecks in the prediction accuracy and inference latency. To tackle the problems, we propose a linear UNet-enhanced fully connected spatial–temporal GNN (LUFC-STGNN) for GVTP. First, a spatial graph is constructed by integrating prior-based and data-driven methods to capture both explicit and implicit spatial interactions between the vehicles. After that, a comprehensive temporal graph is created to capture the varying strengths of temporal interactions between all vehicles throughout historical timestamps. Furthermore, a fully connected spatial–temporal graph combining the spatial and temporal graphs is introduced to extract the effective spatial–temporal interaction features of the vehicles through the graph convolution operation. Finally, a linear UNet-based temporal dependency encoder (LU-TDE) is designed to further enhance the model’s ability of capturing the potential temporal patterns in the vehicle interactions. The encoder with linear complexity explores the multiscale temporal dependencies from the spatial–temporal interaction features but also reducing the inference latency. Experiments results based on real-world datasets show that compared to state-of-the-art models, our model reduces the average root mean square error over the 5-s prediction horizon by 31% and 10% on the NGSIM and HighD datasets, while reducing the inference latency by at least 1.26 times. © 2014 IEEE.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

Research on Medical Image Classification for Oral Cancer 3rd

Research on Medical Image Classification for Oral Cancer

引用

3rd International Conference on Machine Learning, Cloud Computing and Intelligent Mining, MLCCIM 2024

作者： Wang, Kunkun Shi, Linjun Gu, Chaochen Mo, Fan Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Department of Oral Mucosal Diseases Ninth People’s Hospital Shanghai Jiaotong University School of Medicine Shanghai China Shanghai Key Laboratory of Stomatology and Shanghai Research Institution of Stomotology National Clinical Research Center of Stomatology Shanghai China

ISBN: (纸本)9789819624676

In recent years, deep learning has made significant progress in medical imaging, deepening the crossover between the medical and industrial fields. However, not all medical images are suitable for deep learning neural networks;simultaneously, some medical images are difficult to collect and preprocess. In this paper, we reconstruct the image information collected by dental clinicians over many years, normalizing it with diagnostic results as the gold standard. On this basis, we explore the applicability and potential of deep learning on complex medical images. Further, we compare the performance of multiple models on this dataset and visualize the learning outcomes, demonstrating that deep learning networks exhibit good learning capabilities on certain images. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Distributionally Robust control Synthesis for Stochastic systems with Safety and Reach-Avoid Specifications

arXiv

引用

arXiv 2025年

作者： Chen, Yu Li, Yuda Li, Shaoyuan Yin, Xiang Department of Automation Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China

We investigate the problem of synthesizing distributionally robust control policies for stochastic systems under safety and reach-avoid specifications. Using a game-theoretical framework, we consider the setting where the probability distribution of the disturbance at each time step is selected from an ambiguity set defined by the Wasserstein distance. The goal is to synthesize a distributionally robust control policy that ensures the satisfaction probability exceeds a specified threshold under any distribution within the ambiguity set. First, for both safety and reach-avoid specifications, we establish the existence of optimal policies by leveraging the dynamic programming principles. Then we demonstrate how the associated optimization problem can be efficiently solved using the dual representation of Wasserstein distributionally robust optimization. Furthermore, for safety specifications in particular, we introduce a novel concept of distributionally robust control barrier certificates and show how these enable the efficient synthesis of controllers through sum-of-squares programming techniques. Finally, our experimental results reveal that incorporating distributional robustness during the synthesis phase significantly improves the satisfaction probability during online execution, even with limited statistical knowledge of the disturbance distribution. Copyright © 2025, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Online Flow Scheduling in Virtualized Time-Sensitive Networks: A Joint Admission control and VNF Embedding Approach

引用

IEEE Transactions on Mobile Computing 2025年第6期24卷 4651-4667页

作者： Zhang, Yajing Chen, Cailian Li, Mingyan You, Chaoqun Guan, Xinping Quek, Tony Q. S. Shanghai Satellite Network Research Institute Co. Ltd. Shanghai200120 China Shanghai Jiao Tong University Department of Automation Shanghai200240 China Ministry of Education of China Key Laboratory of System Control and Information Processing Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China Chongqing University College of Computer Science Chongqing400044 China Fudan University School of Computer Science Shanghai200433 China Singapore University of Technology and Design 487372 Singapore

Time-sensitive networking (TSN) is proposed to satisfy the increasingly stringent demands of Industrial 4.0 for deterministic transmission. This is achieved by generating a series of centrally configured gate control lists to strictly restrict the forwarding time of arriving flows. However, such a centralized scheme requires prior information of all flows, severely impeding TSN from providing an online response to dynamic industrial applications. To solve this problem, we innovatively propose to use admission control (AC) to realize deterministic transmission in the virtualized TSN network. In this approach, AC is distributively executed on each node and link, whereby flows of applications are served by passing through a series of virtual network functions (VNFs). This distributed AC execution is regarded as a VNF embedding (VNE) process. Specifically, we propose a two-stage online framework, Smart Admission control (SmartAC), to cater to dynamic applications. The first stage, referred to as the static stage, obtains a deterministic VNE solution by synthesizing AC decisions of individual TSN nodes and links. The second stage, referred to as the dynamic stage, fine-tunes VNE solutions obtained from the static stage to adapt to the harsh environment with insufficient resources or limited VNF migration budgets. Simulation results demonstrate the effectiveness of SmartAC in improving response rate and resource utilization ratio. Notably, SmartAC reduces runtime by 90% compared to existing algorithms and exhibits robustness across different network topologies. © 2002-2012 IEEE.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：