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

Fine extraction of multi-crop planting area based on deep learning with Sentinel- 2 time-series data

Environmental Science and Pollution Research 2025年第19期32卷 11931-11949页

作者： Jiang, Jingmin Zhang, Jiahua Wang, Xue Zhang, Shichao Kong, Delong Wang, Xiaopeng Ali, Shawkat Ullah, Hidayat Space Information and Big Earth Data Research Center School of Computer Science and Technology Qingdao University Qingdao266071 China Key Laboratory of Digital Earth Science Aerospace Information Research Institute Chinese Academy of Sciences Beijing100094 China

Accurate and timely access to the spatial distribution of crops is crucial for sustainable agricultural development and food security. However, extracting multi-crop areas based on high-resolution time-series data and deep learning still faces challenges. Therefore, this study aims to provide an effective model for multi-crop classification using high-resolution remote sensing time-series data. We designed two deep learning models based on convolutional neural network-long short-term memory (CNN-LSTM) and bidirectional long short-term memory (Bi-LSTM). The monthly synthetic time series of the normalized difference vegetation index (NDVI) from Sentinel-2 data will be used as input features to extract the multi-crop planting area in Shandong province’s northwestern, southwestern, and eastern regions. The results showed that deep learning models achieved higher accuracy compared to the random forest (RF) and extreme gradient boosting (XGBoost) models, with CNN-LSTM achieving the highest overall accuracy of 96.48%. At the county level, the coefficients of determination (R2) for the CNN-LSTM model were 0.91 for wheat, 0.88 for maize, and 0.73 for spring cotton. This study demonstrates that the CNN-LSTM model combined with monthly synthetic time-series NDVI provides a feasible approach for accurately mapping high-resolution multi-crop planting areas and also contributes significantly to decision support and resource management in agricultural production. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Deep learning High-resolution Monthly synthetic time-series NDVI Multi-crop classification Remote sensing Sentinel- 2

来源：评论

学校读者我要写书评

暂无评论

StoryLLaVA: Enhancing Visual Storytelling with Multi-Modal Large Language Models 31

StoryLLaVA: Enhancing Visual Storytelling with Multi-Modal L...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Yang, Li Xiao, Zhiding Huang, Wenxin Zhong, Xian Hubei Key Laboratory of Big Data Intelligent Analysis and Application School of Computer Science and Information Engineering Hubei University China Hubei Key Laboratory of Transportation Internet of Things School of Computer Science and Artificial Intelligence Wuhan University of Technology China

ISBN: (纸本)9798891761964

The rapid development of multi-modal large language models (MLLMs) has positioned visual storytelling as a crucial area in content creation. However, existing models often struggle to maintain temporal, spatial, and narrative coherence across image sequences and frequently lack the depth and engagement of human-authored stories. To address these challenges, we propose Story with Large Language and Vision Assistant (StoryLLaVA), a novel framework for enhancing visual storytelling. Our approach introduces a Topic-Driven Narrative Optimizer (TDNO) that improves both the training data and MLLM models by integrating image descriptions, topic generation, and GPT-4-based refinements. Furthermore, we employ a preference-based ranked story sampling method that aligns model outputs with human storytelling preferences through positive-negative pairing. These two phases of the framework differ in their training methods: the former uses supervised fine-tuning, while the latter incorporates reinforcement learning with positive and negative sample pairs. Experimental results demonstrate that StoryLLaVA outperforms current models in visual relevance, coherence, and fluency, with LLM-based evaluations confirming the generation of richer and more engaging narratives. The enhanced dataset and model are available at https://***/XxxZzD/StoryLLaVA. © 2025 Association for Computational Linguistics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Trajectory optimization for UAV-enabled relaying with reinforcement learning

引用

Digital Communications and Networks 2025年第1期11卷 200-209页

作者： Chiya Zhang Xinjie Li Chunlong He Xingquan Li Dongping Lin School of Electronic and Information Engineering Harbin Institute of TechnologyShenzhenChina Guangdong Key Laboratory of Intelligent Information Processing Shenzhen UniversityShenzhenChina Peng Cheng Laboratory(PCL) ShenzhenChina National Mobile Communications Research Laboratory Southeast UniversityNanjingChina Shenzhen Institute of Information Technology ShenzhenChina Guangdong-Hong Kong Joint Laboratory for Big Data Imaging and Communication Shenzhen UniversityShenzhenChina

In this paper,we investigate the application of the Unmanned Aerial Vehicle(UAV)-enabled relaying system in emergency communications,where one UAV is applied as a relay to help transmit information from ground users to a Base Station(BS).We maximize the total transmitted data from the users to the BS,by optimizing the user communication scheduling and association along with the power allocation and the trajectory of the *** solve this non-convex optimization problem,we propose the traditional Convex Optimization(CO)and the Reinforcement Learning(RL)-based ***,we apply the block coordinate descent and successive convex approximation techniques in the CO approach,while applying the soft actor-critic algorithm in the RL *** simulation results show that both approaches can solve the proposed optimization problem and obtain good ***,the RL approach establishes emergency communications more rapidly than the CO approach once the training process has been completed.

关键词： Unmanned aerial vehicle Emergency communications Trajectory optimization Convex optimization Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Privacy Preserving Adjacency Query Supporting Homoionym Search over Medical Graph data in Cloud Computing 17th

Privacy Preserving Adjacency Query Supporting Homoionym Sear...

引用

17th International Conference on Cloud Computing, CLOUD 2024, Held as Part of the Services Conference Federation, SCF 2024

作者： Li, Hourong Tian, Yun Wu, Bin Shi, Jiaoli School of Computer and Big Data Science Jiujiang University Jiujiang332005 China Jiujiang Key Laboratory of Network and Information Security Jiujiang332005 China

ISBN: (纸本)9783031771521

Cloud computing is widely used in all walks of life today. Massive amounts of medical graph data are being outsourced to cloud servers to reduce overhead. The untrustworthiness of cloud servers puts the sensitive information of outsourced graph data at risk. To eliminate this security risk, it is an effective method to encrypt sensitive data. The adjacent queries are frequently used and highly valuable in graph data operations, and the adjacency query supporting homoionym search will enlarge the query effect and improve the query function. When the medical graph data is encrypted and stored on the cloud server, the operation of the data becomes extremely difficult. In this article, we propose a scheme to implement the adjacency query supporting homoionym search in cloud computing (AQHS), which maintains search contents privacy. We use a stem extraction algorithm and the searchable encryption mechanism to build secure index, and then achieve the adjacency query. The security of our proposed scheme is verified by formal analysis, and the effectiveness of the scheme is verified by experimental analysis. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Fingerprint Recognition via Federated Adaptive Domain Generalization

引用

computers, Materials & Continua 2025年第3期82卷 5035-5055页

作者： Yonghang Yan Xin Xie Hengyi Ren Ying Cao Hongwei Chang Henan Key Laboratory of Big Data Analysis and Processing Computer and Information EngineeringHenan UniversityKaifeng475004China College of Information Science and Technology Nanjing Forestry UniversityNanjing210037China Henan Branch China Life Insurance Co.Ltd.Zhengzhou450000China

Fingerprint features,as unique and stable biometric identifiers,are crucial for identity ***,traditional centralized methods of processing these sensitive data linked to personal identity pose significant privacy risks,potentially leading to user data *** Learning allows multiple clients to collaboratively train and optimize models without sharing raw data,effectively addressing privacy and security ***,variations in fingerprint data due to factors such as region,ethnicity,sensor quality,and environmental conditions result in significant heterogeneity across *** heterogeneity adversely impacts the generalization ability of the global model,limiting its performance across diverse *** address these challenges,we propose an Adaptive Federated Fingerprint Recognition algorithm(AFFR)based on Federated *** algorithm incorporates a generalization adjustment mechanism that evaluates the generalization gap between the local models and the global model,adaptively adjusting aggregation weights to mitigate the impact of heterogeneity caused by differences in data quality and feature ***,a noise mechanism is embedded in client-side training to reduce the risk of fingerprint data leakage arising from weight disclosures during model *** conducted on three public datasets demonstrate that AFFR significantly enhances model accuracy while ensuring robust privacy protection,showcasing its strong application potential and competitiveness in heterogeneous data environments.

关键词： Fingerprint recognition privacy protection federated learning adaptive weight adjustment

来源：评论

学校读者我要写书评

暂无评论

A numerical magnitude aware multi-channel hierarchical encoding network for math word problem solving

引用

Neural Computing and Applications 2025年第3期37卷 1651-1672页

作者： Xu, Junjie Chen, Yuzhong Xiao, Lingsheng Liao, Hongmiao Zhong, Jiayuan Dong, Chen College of Computer and Data Science Fuzhou University Fujian Province Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fujian Province Fuzhou350108 China

Math word problem (MWP) represents a critical research area within reading comprehension, where accurate comprehension of math problem text is crucial for generating math expressions. However, current approaches still grapple with unresolved challenges in grasping the sensitivity of math problem text and delineating distinct roles across various clause types, and enhancing numerical representation. To address these challenges, this paper proposes a Numerical Magnitude Aware Multi-Channel Hierarchical Encoding Network (NMA-MHEA) for math expression generation. Firstly, NMA-MHEA implements a multi-channel hierarchical context encoding module to learn context representations at three different channels: intra-clause channel, inter-clause channel, and context-question interaction channel. NMA-MHEA constructs hierarchical constituent-dependency graphs for different levels of sentences and employs a Hierarchical Graph Attention Neural Network (HGAT) to learn syntactic and semantic information within these graphs at the intra-clause and inter-clause channels. NMA-MHEA then refines context clauses using question information at the context-question interaction channel. Secondly, NMA-MHEA designs a number encoding module to enhance the relative magnitude information among numerical values and type information of numerical values. Experimental results on two public benchmark datasets demonstrate that NMA-MHEA outperforms other state-of-the-art models. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

ANALYSIS OF TRIPARTITE GAME IN POWER SYSTEMS BASED ON UNCERTAIN NASH EQUILIBRIUM THEORY

引用

UPB Scientific Bulletin, Series A: Applied Mathematics and Physics 2025年第1期87卷 117-128页

作者： Wu, Liang Yan, Xiaolin Yao, Zhangsong Zhao, Teng School of Management and Ningxia Key Laboratory of intelligent information and Big Data Processing North Minzu University Ningxia Yinchuan750021 China School of Mathematical Sciences Tiangong University Tianjin300387 China School of Information Engineering Nanjing Xiaozhuang University Nanjing211171 China School of Mathematics and Information Science North Minzu University Ningxia Yinchuan750021 China

Power systems serve as the fundamental infrastructure for the socioeconomic development of modern societies. Researching power systems can stimulate the growth of the power industry and contribute to the sustainable development of society. This paper aims to address uncertainties prevalent in power systems, including extreme weather events, disruptions in renewable energy supply, and adjustments in economic policies. To achieve this objective, an uncertain Nash equilibrium model is established. Subsequently, a game theoretic analysis is conducted to maximize the interests of users, grid companies, and proxy purchasers. Under the condition of not necessarily continuous differentiability, the Riemann-Stieltjes discrete approximation method has been proposed. The difficulty of calculating the expectation of the optimal revenue function has been resolved. Weak first-order equilibrium condition based on Clarke’s generalized gradient, the convergence and convergence rate of uncertain Nash equilibrium solutions are proved. © 2025, Politechnica University of Bucharest. All rights reserved.

关键词： power system tripartite game uncertain Nash equilibrium uncertainty theory

来源：评论

学校读者我要写书评

暂无评论

data Aggregation Point Placement and Subnetwork Optimization for Smart Grids

引用

computers, Materials & Continua 2025年第4期83卷 407-434页

作者： Tien-Wen Sung Wei Li Chao-Yang Lee Yuzhen Chen Qingjun Fang Fujian Provincial Key Laboratory of Big Data Mining and Applications College of Computer Science and MathematicsFujian University of TechnologyFuzhou350118China Department of Computer Science and Information Engineering National Yunlin University of Science and TechnologyYunlin640301TaiwanChina

To transmit customer power data collected by smart meters(SMs)to utility companies,data must first be transmitted to the corresponding data aggregation point(DAP)of the *** number of DAPs installed and the installation location greatly impact the whole *** the traditional DAP placement algorithm,the number of DAPs must be set in advance,but determining the best number of DAPs is difficult,which undoubtedly reduces the overall performance of the ***,the excessive gap between the loads of different DAPs is also an important factor affecting the quality of the *** address the above problems,this paper proposes a DAP placement algorithm,APSSA,based on the improved affinity propagation(AP)algorithm and sparrow search(SSA)algorithm,which can select the appropriate number of DAPs to be installed and the corresponding installation locations according to the number of SMs and their distribution locations in different *** algorithm adds an allocation mechanism to optimize the subnetwork in the *** is evaluated under three different areas and compared with other DAP placement *** experimental results validated that the method in this paper can reduce the network cost,shorten the average transmission distance,and reduce the load gap.

关键词： Smart grid data aggregation point placement network cost average transmission distance load gap

来源：评论

学校读者我要写书评

暂无评论

引用

8th International Congress on Edge Computing, EDGE 2024, Held as Part of the Services Conference Federation, SCF 2024

作者： Tian, Yun Wu, Bin Shi, Jiaoli Zhang, Caicai Xu, Du School of Computer and Big Data Science Jiujiang University Jiujiang332005 China Jiujiang Key Laboratory of Network and Information Security Jiujiang332005 China School of Modern Information Technology Zhejiang Polytechnic University of Mechanical and Electrical Engineering Hangzhou310053 China

ISBN: (纸本)9783031770685

The development of cloud computing and the widespread application of cloud services have made outsourcing services more convenient. The need for individuals and businesses to store and manipulate the graph data they generate is growing rapidly. The unreliability and insecurity of cloud servers make outsourcing graph data a great risk of information leakage. To effectively protect data security, encrypting outsourced data is a useful method. The adjacent vertex query is a very commonly used and fundamental operation, and similarity search is a widely used and powerful tool to improve the scope and functionality of queries. After outsourcing encrypted sparse graph data to cloud servers, it becomes very inconvenient to use and manipulate the data. In this work, we present a scheme to realize the adjacent vertex query supporting similarity search on sparse graph data in cloud environment (SSAQ), which also protects the security of the information. This work uses edit distance and the searchable encryption principle to construct query index, and next implement the similar adjacent vertex query on cloud server. This work provides a formal security analysis, and also gives the experimental comparison and analysis. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： information leakage

来源：评论

学校读者我要写书评

暂无评论

Solving Multiobjective Combinatorial Optimization via Learning to Improve Method

引用

IEEE Transactions on Emerging Topics in Computational Intelligence 2025年第3期9卷 2122-2136页

作者： Ye, Te Zhang, Zizhen Zhang, Qingfu Chen, Jinbiao Wang, Jiahai Sun Yat-sen University School of Computer Science and Engineering Guangzhou510275 China Sun Yat-sen University Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou510275 China City University of Hong Kong Department of Computer Science Kowloon Hong Kong

Recently, neural combinatorial optimization (NCO) methods have been prevailing for solving multiobjective combinatorial optimization problems (MOCOPs). Most NCO methods are based on the "Learning to Construct"(L2C) paradigm, where the trained model(s) can directly generate a set of approximate Pareto optimal solutions. However, these methods still suffer from insufficient proximity and poor diversity towards the true Pareto front. In this paper, following the "Learning to Improve"(L2I) paradigm, we propose weight-related policy network (WRPN), a learning-based improvement method for solving MOCOPs. WRPN is incorporated into multiobjective evolutionary algorithm (MOEA) frameworks to effectively guide the search direction. A shared baseline for proximal policy optimization is presented to reduce variance in model training. A quality enhancement mechanism is designed to further refine the Pareto set during model inference. Computational experiments conducted on two classic MOCOPs, i.e., multiobjective traveling salesman problem and multiobjective vehicle routing problem, indicate that our method achieves remarkable results. Notably, our WRPN module can be easily integrated into various MOEA frameworks such as NSGA-II, MOEA/D and MOGLS, providing versatility and applicability across different problem domains. © 2025 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：