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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A New Dual-Population Evolutionary Algorithm Leveraging Objective-Constraint Relationships for Constrained Multi-Objective optimization

SSRN

引用

SSRN 2025年

作者： Ye, Jialu Tan, Chaogui Xia, Yizhang Hou, Zhanglu Liu, Yuan Zou, Juan Hunan Engineering Research Center of intelligent System Optimization and Security Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Hunan National Applied Mathematics Center China Xiangtan University China

Population co-evolution strategies are widely used to handle constrained multi-objective optimization problems (CMOPs). However, existing coevolutionary algorithms oversimplify population collaboration and are rigid in evolving the auxiliary population, ignoring the importance of maintaining population diversity, especially for CMOPs with irregular feasible regions. To tackle this issue, we propose a new dual-population evolutionary algorithm, denoted as AACMO, which attempts to mine the relational features between the unconstrained Pareto front (UPF) and the constrained Pareto front (CPF) to better adapt to CMOPs with various constraints. Specifically, the method is categorized into two phases: a learning phase and an evolving phase. First, the main population (MP) aims to quickly learn the relationships between the UPF and the CPF by leveraging the advantages of different operators, namely, genetic algorithm operators and differential evolution operators, during the learning phase. Secondly, two auxiliary strategies are designed to collaborate with the MP during the evolving phase. These strategies are capable of employing a more effective co-evolution method to assist the MP in maintaining diversity, based on the degree of alignment between the learned UPF and CPF at the end of the learning phase. The effectiveness of AACMO is confirmed through comparative analysis with eight state-of-the-art algorithms across four CMOP benchmark suites. © 2025, The Authors. All rights reserved.

关键词： optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Solo Adaptation for Distributed Synchronization With Application to Event-Triggered Linear Multi-Agent Systems

引用

IEEE Transactions on Automatic Control 2025年第6期70卷 4225-4232页

作者： Chen, Ci Zheng, Zhiyang Lewis, Frank L. Xie, Kan Xie, Shengli Guangdong University of Technology Guangdong Provincial Key Laboratory of Intelligent Systems and Optimization Integration Key Laboratory of Intelligent Information Processing and System Integration of IoT Ministry of Education School of Automation Guangzhou510006 China Guangdong University of Technology School of Automation Guangdong Guangzhou510006 China The University of Texas at Arlington UTA Research Institute Fort Worth76118 United States Guangdong University of Technology 111 Center for Intelligent Batch Manufacturing Based on IoT Technology School of Automation Guangzhou China Guangdong University of Technology Key Laboratory of Intelligent Detection and The Internet of Things in Manufacturing Ministry of Education School of Automation Guangzhou510006 China

We study a solo adaptation-based protocol design problem for distributed synchronization of event-triggered linear multi-agent systems (MAS) over general directed graphs. We show that a solo adaptive gain, a locally static control gain matrix, and a distributed state measurement are sufficient for obtaining adaptive distributed synchronization of linear MAS over directed graphs without any prior knowledge of the global communication network. We then extend the solo adaptation structure to formulate an event-triggered synchronization control protocol. The main feature of our result is that the time for triggering a subsequent event is now computed using the distributed event-triggered state measurement, rather than the continuous-time state measurement. © 1963-2012 IEEE.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

Accuracy estimation of link-based similarity measures and its application

引用

Frontiers of Computer Science 2016年第1期10卷 113-123页

作者： Yinglong ZHANG Cuiping LI Chengwang XIE Hong CHEN School of Software East China Jiaotong University Nanchang 330045 China Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education and Department of Computer Science Renmin University of China Beijing 100872 China Intelligent Optimization and Information Processing Laboratory East China Jiaotong University Nanchang 330013 China

Link-based similarity measures play a significant role in many graph based applications. Consequently, mea- suring node similarity in a graph is a fundamental problem of graph data mining. Personalized PageRank （PPR） and Sim- Rank （SR） have emerged as the most popular and influen- tial link-based similarity measures. Recently, a novel link- based similarity measure, penetrating rank （P-Rank）, which enriches SR, was proposed. In practice, PPR, SR and P-Rank scores are calculated by iterative methods. As the number of iterations increases so does the overhead of the calcula- tion. The ideal solution is that computing similarity within the minimum number of iterations is sufficient to guaran- tee a desired accuracy. However, the existing upper bounds are too coarse to be useful in general. Therefore, we focus on designing an accurate and tight upper bounds for PPR, SR, and P-Rank in the paper. Our upper bounds are designed based on the following intuition： the smaller the difference between the two consecutive iteration steps is, the smaller the difference between the theoretical and iterative similar- ity scores becomes. Furthermore, we demonstrate the effec- tiveness of our upper bounds in the scenario of top-k similar nodes queries, where our upper bounds helps accelerate the speed of the query. We also run a comprehensive set of exper- iments on real world data sets to verify the effectiveness and efficiency of our upper bounds.

关键词： personalized PageRank SimRank P-Rank up-per bound

来源：评论

学校读者我要写书评

暂无评论

An Enhanced Particle Swarm Algorithm Based on Fitness Landscape information 13

An Enhanced Particle Swarm Algorithm Based on Fitness Landsc...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Diao, Zhenya Yu, Fei Guan, Jian Liu, Meitong School of Physics and Information Engineering Minnan Normal University Key Lab of Intelligent Optimization and Information Processing Zhangzhou36300 China School of Physics and Information Engineering Minnan Normal University Key Laboratory of Light Field Manipulation and System Integration Applications in Fujian Province Key Lab of Intelligent Optimization and Information Processing Zhangzhou36300 China

ISBN: (纸本)9798350308365

In the original Particle Swarm optimization (PSO), the selection of parameters significantly impacts the search capability of PSO. The paper introduces an innovative algorithm called Fitness Landscape-based PSO (FLPSO) to address the impact of parameter selection on the search capability of PSO. The algorithm focuses on acquiring fitness landscape information and analyzing the population state to intelligently select appropriate parameters in each generation. FLPSO defines four primary states: exploration, exploitation, convergence, and escaping state. In the convergence state, an elite learning strategy is incorporated to help the algorithm escape potential local optima by targeting the global best particle. To validate the efficacy of FLPSO, the paper conducted experiments on 30 different characteristic test functions from CEC2017. FLPSO was compared with six existing algorithms: PSO, PSO-TVAC, APSO, AWPSO, RPSO and ASRPPSO. The experimental results showed significant improvements in FLPSO, providing promising evidence for its effectiveness. © 2024 IEEE.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Exploring the Causality of Accident Severity on Mountainous Freeways With a Two-Stage Approach

引用

Journal of Advanced Transportation 2025年第1期2025卷

作者： Lingzhi Kong Changan Xiong Wenchen Yang Weiliang Zeng National Engineering Research Center of Geological Disaster Prevention in Land Transportation Broadvision Engineering Consultants Co. Ltd. Kunming China Yunnan Key Laboratory of Digital Communications Kunming China School of Automation Guangdong University of Technology Guangzhou China *** Joint International Research Laboratory of Intelligent Information Processing and System Integration of IoT Ministry of Education Guangzhou China meb.gov.tr Guangdong Provincial Key Laboratory of Intelligent Transportation System Guangzhou China Guangdong Provincial Key Laboratory of Intelligent Systems and Optimization Integration Guangzhou China

Studies on accident severity on mountainous freeways have predominantly centered on the personal injury level, rather than the aggregation level. However, for quantifying the accident causality, clustering the accident severity from multidimensional perspectives based on data-driven approach is seldom investigated in existing studies. To address this research gap, we propose a two-stage methodology that integrates accident clustering with Bayesian inference. Initially, a Gaussian mixture clustering algorithm is developed to categorize accident severity. Subsequently, a Bayesian network is constructed to explore the risk factors associated with accident severity. The proposed model is calibrated and validated using accident data collected from mountainous freeways in Yunnan Province, China, spanning the period from 2016 to 2021. The findings suggest that our proposed accident clustering method exhibits superior robustness compared to alternative clustering techniques. Bayesian inference analysis further elucidates that accident severity is significantly influenced by factors such as driving behavior, weather conditions, and road surface conditions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A GENERALIZED PENALTY METHOD FOR DIFFERENTIAL VARIATIONAL-HEMIVARIATIONAL INEQUALITIES

引用

Acta Mathematica Scientia 2022年第1期42卷 247-264页

作者： Liang LU Lijie LI Mircea SOFONEA Guangxi Key Laboratory of Cross-border E-commerce Intelligent Information Processing Guangxi University of Finance and EconomicsNanning 530003China Guangxi Colleges and Universities Key Laboratory of Complex System Optimization and Big Data Processing Yulin Normal UniversityYulin 537000China Laboratoire de Mathématiques et Physique Universitéde Perpignan Via Domitia52 Avenue Paul Alduy66860 PerpignanFrance

We consider a differential variational-hemivariational inequality with constraints,in the framework of reflexive Banach *** existence of a unique mild solution of the inequality,together with its stability,was proved in[1].Here,we complete these results with existence,uniqueness and convergence results for an associated penalty-type *** this end,we construct a sequence of perturbed differential variational-hemivariational inequalities governed by perturbed sets of constraints and penalty *** prove the unique solvability of each perturbed inequality as well as the convergence of its solution to the solution of the original ***,we consider a mathematical model which describes the equilibrium of a viscoelastic rod in unilateral *** weak formulation of the model is in a form of a differential variational-hemivariational inequality in which the unknowns are the displacement field and the history of the *** apply our abstract penalty method in the study of this inequality and provide the corresponding mechanical interpretations.

关键词： differential variational-hemivariational inequality generalized penalty method Mosco convergence viscoelastic rod unilateral constraint

来源：评论

学校读者我要写书评

暂无评论

Cooperative coevolution with dependency identification grouping for large scale global optimization

Cooperative coevolution with dependency identification group...

引用

2016 IEEE Congress on Evolutionary Computation, CEC 2016

作者： Dai, Guangming Chen, Xiaoyu Chen, Liang Wang, Maocai Peng, Lei School of Computer China University of Geosciences Wuhan China Hubei Key Laboratory of Intelligent Geo-Information Processing China University of Geosciences Wuhan China Group of Discrete and Combinatorial Optimization University of Heidelberg Heidelberg Germany

ISBN: (纸本)9781509006229

Large scale optimization is a very challenging task in optimization area. The variable interaction in non-separable problems is a primary source of performance loss, especially for large scale problems. Cooperative Coevolution framework is a popular approach to deal with large scale optimization. It is based on a divide-and-conquer manner. This paper proposes a novel algorithm called DISCC to tackle large-scale optimization problems. It adopts a function-based grouping decomposition strategy called Dependency Identification Grouping to distinguish the interactive variables in the decision space. The grouping strategy aims to find the most suitable arrangement for the variables in order to minimize the limitation that occurs when they are grouped into different groups. The experimental results show this new algorithm is more effective than the existing Cooperative-Coevolution-based algorithms. © 2016 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Analysis of the Research Status of information Technology Education Literature in China and Abroad 24

Analysis of the Research Status of Information Technology Ed...

引用

24th IEEE International Conference on High Performance Computing and Communications, 8th IEEE International Conference on Data Science and Systems, 20th IEEE International Conference on Smart City and 8th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Application, HPCC/DSS/SmartCity/DependSys 2022

作者： Zhao, Yulin Liu, Kai Li, Junke School of Information Engineering Suqian University Jiangsu Suqian223800 China School of Computer and Information Qiannan Normal University for Nationalities Duyun558000 China Jiangsu Province Engineering Research Center of Smart Poultry Farming and Intelligent Equipment Jiangsu 223800 China Key Laboratory of Machine Learning and Unstructured Data Processing of Qiannan Duyun558000 China Key Laboratory of Complex Systems and Intelligent Optimization of Guizhou Duyun558000 China

ISBN: (纸本)9798350319934

information technology education contributes to the development of national education. Understanding the research status of information technology education at home and abroad is helpful to the implementation of education informatization. This paper takes the information technology education research literature collected by CNKI and the Web of Science database as the object and uses the bibliometric method to analyze the literature characteristics of information technology education at home and abroad. Specifically, the paper mainly carries out statistical analysis from the time distribution of literature, journal distribution, and hot keywords, and visually describes the literature features of the information technology education discipline, providing references for the research of information technology education discipline at home and abroad. © 2022 IEEE.

关键词： Informatization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：