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

PDDD-PreTrain:A Series of Commonly Used Pre-Trained Models Support Image-Based Plant Disease Diagnosis

Plant Phenomics 2023年第2期5卷 313-332页

作者： Xinyu Dong Qi Wang Qianding Huang Qinglong Ge Kejun Zhao Xingcai Wu Xue Wu Liang Lei Gefei Hao State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China The School of Physics and Optoelectronic Engineering Guangdong University of TechnologyGuangzhou 510006China National Key Laboratory of Green Pesticide Key Laboratory of Green Pesticide and Agricultural BioengineeringMinistry of EducationGuizhou UniversityGuiyang 550025China

Plant diseases threaten global food security by reducing crop yield;thus,diagnosing plant diseases is critical to agricultural *** intelligence technologies gradually replace traditional plant disease diagnosis methods due to their time-consuming,costly,inefficient,and subjective *** a mainstream AI method,deep learning has substantially improved plant disease detection and diagnosis for precision *** the meantime,most of the existing plant disease diagnosis methods usually adopt a pre-trained deep learning model to support diagnosing diseased ***,the commonly used pre-trained models are from the computer vision dataset,not the botany dataset,which barely provides the pre-trained models sufficient domain knowledge about plant ***,this pre-trained way makes the final diagnosis model more difficult to distinguish between different plant diseases and lowers the diagnostic *** address this issue,we propose a series of commonly used pre-trained models based on plant disease images to promote the performance of disease *** addition,we have experimented with the plant disease pre-trained model on plant disease diagnosis tasks such as plant disease identification,plant disease detection,plant disease segmentation,and other *** extended experiments prove that the plant disease pre-trained model can achieve higher accuracy than the existing pre-trained model with less training time,thereby supporting the better diagnosis of plant *** addition,our pre-trained models will be open-sourced at https://***/and Zenodo platform https://***/10.5281/zenodo.7856293.

关键词： diagnosis Plant thereby

来源：评论

学校读者我要写书评

暂无评论

Edge Computing Task Scheduling with Joint Blockchain and Task Caching in Industrial Internet

引用

computers, Materials & Continua 2023年第4期75卷 2101-2117页

作者： Yanping Chen Xuyang Bai Xiaomin Jin Zhongmin Wang Fengwei Wang Li Ling School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’an710121China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an710121China Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’anShaanxi710121China ZTE Corporation Shenzhen51805China

Deploying task caching at edge servers has become an effectiveway to handle compute-intensive and latency-sensitive tasks on the industrialinternet. However, how to select the task scheduling location to reduce taskdelay and cost while ensuring the data security and reliable communicationof edge computing remains a challenge. To solve this problem, this paperestablishes a task scheduling model with joint blockchain and task cachingin the industrial internet and designs a novel blockchain-assisted cachingmechanism to enhance system security. In this paper, the task schedulingproblem, which couples the task scheduling decision, task caching decision,and blockchain reward, is formulated as the minimum weighted cost problemunder delay constraints. This is a mixed integer nonlinear problem, which isproved to be nonconvex and NP-hard. To solve the optimal solution, thispaper proposes a task scheduling strategy algorithm based on an improvedgenetic algorithm (IGA-TSPA) by improving the genetic algorithm initializationand mutation operations to reduce the size of the initial solutionspace and enhance the optimal solution convergence speed. In addition,an Improved Least Frequently Used algorithm is proposed to improve thecontent hit rate. Simulation results show that IGA-TSPA has a faster optimalsolution-solving ability and shorter running time compared with the existingedge computing scheduling algorithms. The established task scheduling modelnot only saves 62.19% of system overhead consumption in comparison withlocal computing but also has great significance in protecting data security,reducing task processing delay, and reducing system cost.

关键词： Edge computing task scheduling blockchain task caching industrial security

来源：评论

学校读者我要写书评

暂无评论

CDS: data Synthesis Method Guided by Cognitive Diagnosis Theory

arXiv

引用

arXiv 2025年

作者： Zhao, Haokun Han, Jinyi Liang, Jiaqing Xiao, Yanghua Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China Shanghai Institute of Artificial Intelligence for Education East China Normal University China Shanghai Key Laboratory of Data Science School of Data Science Fudan University China

Large Language Models (LLMs) have achieved significant advancements, but the increasing complexity of tasks and higher performance demands highlight the need for continuous improvement. Some approaches utilize synthetic data generated by advanced LLMs based on evaluation results to train models. However, conventional evaluation methods fail to provide detailed, fine-grained profiles of LLMs, limiting their guidance for data synthesis. In this paper, we introduce the Cognitive Diagnostic Synthesis (CDS) method, which incorporates a diagnostic process inspired by Cognitive Diagnosis Theory (CDT) to refine evaluation results and characterize model profiles at the knowledge component level. Based on these diagnostics, we propose two diagnosis-synthesis strategies for weakness-targeted data synthesis. Additionally, we present an enhanced data augmentation and selection pipeline to improve the quality and diversity of synthesized data. Our experiments with several open-source models show significant improvements across multiple benchmarks, achieving up to 6.00% improvement in code generation, 13.10% in mathematical reasoning, and 5.43% in academic exams. Code and data are available on GitHub 1 Copyright © 2025, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Heterophilic Graph Representation Learning Based on Multi-Order Information Extraction and High and Low Pass Filters 10

Heterophilic Graph Representation Learning Based on Multi-Or...

引用

10th IEEE Smart World Congress, SWC 2024

作者： Wu, Ling Li, Xinyu Yang, Yingjie Guo, Kun Zhang, Qishan Fuzhou University College of Computer and Data Science Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing China De Montfort University School of Computer Science and Informatics Leicester United Kingdom Shanghai International Studies University College of Economics and Humanities Shanghai China

ISBN: (纸本)9798331520861

Real-world networks can be divided into homophilic and heterophilic graphs. Significantly, many nodes tend to be heterophilic in a homophilic graph. Graph representation learning in heterophilic graphs has attracted considerable significance in recent years as it breaks the homophily assumption and achieves higher-quality graph embeddings. However, existing heterophilic graph representation learning methods often mix attribute and topological information, neglecting the mutual exclusion between attribute information and topological information. Furthermore, algorithms in heterogeneous graphs usually rely on specific matrix structures to capture high-order information, which may restrict the applicability of these methods. To tackle these issues, this paper proposes a GNN-based strategy for Heterophilic graph Representation Learning based on Multi-order information extraction and High and Low pass filters (HRLMHL). First, we designed two relatively independent modules to learn attribute information and topological information, respectively, to address the issue of mismatch. Second, we built a multi-order information extraction module to extract multi-order similarity features, thereby achieving the learning of high-order graph information. Experiments on real datasets show that the node classification accuracy is superior to that of the state-of-the-art methods on most datasets. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal Distributed Minimax Optimization under the Second-Order Similarity 38

Near-Optimal Distributed Minimax Optimization under the Seco...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zhou, Qihao Ye, Haishan Luo, Luo School of Data Science Fudan University China School of Management Xi'an Jiaotong University SGIT AI Lab State Grid Corporation of China China School of Data Science Fudan University Shanghai Key Laboratory for Contemporary Applied Mathematics China

This paper considers the distributed convex-concave minimax optimization under the second-order similarity. We propose stochastic variance-reduced optimistic gradient sliding (SVOGS) method, which takes the advantage of the finite-sum structure in the objective by involving mini-batch client sampling and variance reduction. We prove SVOGS can achieve the Ε-duality gap within communication rounds of O(δD2/Ε), communication complexity of O(n + √nδD2/Ε), and local gradient calls of Õ(n + (√nδ + L)D2/Ε log(1/Ε)), where n is the number of nodes, δ is the degree of the second-order similarity, L is the smoothness parameter, and D is the diameter of the constraint set. We can verify that all of above complexity (nearly) matches the corresponding lower bounds. For the specific µ-strongly-convex-µ-strongly-convex case, our algorithm has the upper bounds on communication rounds, communication complexity, and local gradient calls of O(δ/µ log(1/Ε)), O((n+ √nδ/µ) log(1/Ε)), and Õ(n+ (√nδ+ L)/µ) log(1/Ε)) respectively, which are also nearly tight. Furthermore, we conduct the numerical experiments to show the empirical advantages of the proposed method. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Prediction-Based Multi-Objective VM Consolidation Approach for Cloud data Centers

引用

computers, Materials & Continua 2024年第7期80卷 1601-1631页

作者： Xialin Liu Junsheng Wu Lijun Chen Jiyuan Hu School of Computer Science Northwestern Polytechnical UniversityXi’an710005China School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’an710021China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an University of Posts and TelecommunicationsXi’an710021China School of Software and Microelectronics Northwestern Polytechnical UniversityXi’an710005China School of Automation Xi’an University of Posts and TelecommunicationsXi’an710021China

Virtual machine(VM)consolidation aims to run VMs on the least number of physical machines(PMs).The optimal consolidation significantly reduces energy consumption(EC),quality of service(QoS)in applications,and resource *** paper proposes a prediction-basedmulti-objective VMconsolidation approach to search for the best mapping between VMs and PMs with good timeliness and practical *** use a hybrid model based on Auto-Regressive Integrated Moving Average(ARIMA)and Support Vector Regression(SVR)(HPAS)as a prediction model and consolidate VMs to PMs based on prediction results by HPAS,aiming at minimizing the total EC,performance degradation(PD),migration cost(MC)and resource wastage(RW)*** results usingMicrosoft Azure trace show the proposed approach has better prediction accuracy and overcomes the multi-objective consolidation approach without prediction(i.e.,Non-dominated sorting genetic algorithm 2,Nsga2)and the renowned Overload Host Detection(OHD)approaches without prediction,such as Linear Regression(LR),Median Absolute Deviation(MAD)and Inter-Quartile Range(IQR).

关键词： VM consolidation prediction multi-objective optimization machine learning

来源：评论

学校读者我要写书评

暂无评论

Generative Entity Typing with Curriculum Learning

Generative Entity Typing with Curriculum Learning

引用

2022 Conference on Empirical Methods in Natural Language Processing, EMNLP 2022

作者： Yuan, Siyu Yang, Deqing Liang, Jiaqing Li, Zhixu Liu, Jinxi Huang, Jingyue Xiao, Yanghua School of Data Science Fudan University Shanghai China Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China Fudan-Aishu Cognitive Intelligence Joint Research Center

Entity typing aims to assign types to the entity mentions in given texts. The traditional classification-based entity typing paradigm has two unignorable drawbacks: 1) it fails to assign an entity to the types beyond the predefined type set, and 2) it can hardly handle few-shot and zero-shot situations where many long-tail types only have few or even no training instances. To overcome these drawbacks, we propose a novel generative entity typing (GET) paradigm: given a text with an entity mention, the multiple types for the role that the entity plays in the text are generated with a pre-trained language model (PLM). However, PLMs tend to generate coarse-grained types after fine-tuning upon the entity typing dataset. In addition, only the heterogeneous training data consisting of a small portion of human-annotated data and a large portion of auto-generated but low-quality data are provided for model training. To tackle these problems, we employ curriculum learning (CL) to train our GET model on heterogeneous data, where the curriculum could be self-adjusted with the self-paced learning according to its comprehension of the type granularity and data heterogeneity. Our extensive experiments upon the datasets of different languages and downstream tasks justify the superiority of our GET model over the state-of-the-art entity typing models. The code has been released on https://***/siyuyuan/GET. © 2022 Association for Computational Linguistics.

关键词： Curricula

来源：评论

学校读者我要写书评

暂无评论

Evaluating Character Understanding of Large Language Models via Character Profiling from Fictional Works

arXiv

引用

arXiv 2024年

作者： Yuan, Xinfeng Yuan, Siyu Cui, Yuhan Lin, Tianhe Wang, Xintao Xu, Rui Chen, Jiangjie Yang, Deqing School of Data Science Fudan University China Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China

Large language models (LLMs) have demonstrated impressive performance and spurred numerous AI applications, in which role-playing agents (RPAs) are particularly popular, especially for fictional characters. The prerequisite for these RPAs lies in the capability of LLMs to understand characters from fictional works. Previous efforts have evaluated this capability via basic classification tasks or characteristic imitation, failing to capture the nuanced character understanding with LLMs. In this paper, we propose evaluating LLMs' character understanding capability via the character profiling task, i.e., summarizing character profiles from corresponding materials, a widely adopted yet understudied practice for RPA development. Specifically, we construct the CROSS dataset from literature experts and assess the generated profiles by comparing them with ground truth references and evaluating their applicability in downstream tasks. Our experiments, which cover various summarization methods and LLMs, have yielded promising results. These results strongly validate the character understanding capability of LLMs. Resources are available at https://***/Joanna0123/character_profiling. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Few-shot Link Prediction on Hyper-relational Facts 30

Few-shot Link Prediction on Hyper-relational Facts

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Wei, Jiyao Guan, Saiping Jin, Xiaolong Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9782493814104

Hyper-relational facts, which consist of a primary triple (head entity, relation, tail entity) and auxiliary attribute-value pairs, are widely present in real-world Knowledge Graphs (KGs). Link Prediction on Hyper-relational Facts (LPHFs) is to predict a missing element in a hyper-relational fact, which helps populate and enrich KGs. However, existing LPHFs studies usually require an amount of high-quality data. They overlook few-shot relations, which have limited instances, yet are common in real-world scenarios. Thus, we introduce a new task, Few-Shot Link Prediction on Hyper-relational Facts (FSLPHFs). It aims to predict a missing entity in a hyper-relational fact with limited support instances. To tackle FSLPHFs, we propose MetaRH, a model that learns Meta Relational information in Hyper-relational facts. MetaRH comprises three modules: relation learning, support-specific adjustment, and query inference. By capturing meta relational information from limited support instances, MetaRH can accurately predict the missing entity in a query. As there is no existing dataset available for this new task, we construct three datasets to validate the effectiveness of MetaRH. Experimental results on these datasets demonstrate that MetaRH significantly outperforms existing representative models. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Decentralized Convex Finite-Sum Optimization with Better Dependence on Condition Numbers 41

Decentralized Convex Finite-Sum Optimization with Better Dep...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Liu, Yuxing Chen, Lesi Luo, Luo School of Data Science Fudan University Shanghai China Institute for Interdisciplinary Information Sciences Tsinghua University Beijing China Shanghai Key Laboratory for Contemporary Applied Mathematics Shanghai China

This paper studies decentralized optimization problem, where the local objective on each node is an average of a finite set of convex functions and the global function is strongly convex. We propose an efficient stochastic variance reduced first-order method that allows the different nodes to establish their stochastic local gradient estimator with different mini-batch sizes per iteration. We prove the upper bound on the computation time of the proposed method contains the dependence on the global condition number, which is sharper than the previous results that only depend on the local condition numbers. Compared with the state-of-the-art methods, we also show that our method requires less local incremental first-order oracle calls and comparable communication cost. We further perform numerical experiments to validate the advantage of our method. Copyright 2024 by the author(s)

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：