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

IEEE Transactions on Intelligent Vehicles 2024年 1-14页

作者： Fang, Yuchen Luo, Haiyong Zhao, Fang Sun, Poly Z.H. Qin, Yanjun Zeng, Liang Hui, Bo Wang, Chenxing School of Computer Science National Pilot Software Engineering School Beijing University of Posts and Telecommunications Beijing China Beijing Key Laboratory of Mobile Computing and Pervasive Device Institute of Computing Technology Chinese Academy of Sciences Beijing China Department of Industrial Engineering School of Mechanical Engineering Shanghai Jiao Tong University Shanghai China Tsinghua University Beijing China University of Tulsa Tulsa USA

Vehicle-based traffic speed forecasting aims to predict the average speed of vehicles on the road in the future, which is an essential side information in intelligent vehicles and beneficial to safe autonomous driving, yet is very challenging due to the complex and dynamic spatio-temporal dependencies in real-world vehicle-based traffic. To extract intricate correlations among multiple vehicle-based speed time series, previous methods have used graph convolution networks. However, the conventional static and dynamic graphs fail to reflect the traffic evolution and the hysteresis spatial influence caused by vehicle movement. To address this issue, we propose a novel cross-time dynamic graph-based deep learning model, named CDGNet, for vehicle-based traffic speed forecasting. The model is able to effectively capture hysteresis spatial dependencies between each time slice and its historical time slices through the cross-time dynamic graph-based GCN. Meanwhile, a gating mechanism is integrated into our cross-time dynamic graph, which conforms to the sparse correlation in the real world. Besides, GCNs are incorporated into a novel encoder-decoder architecture to forecast multi-step speed. Experimental results on three real-world vehicle-based traffic speed datasets demonstrate the superiority of our CDGNet over various state-of-the-art spatio-temporal forecasting methods and the effectiveness of each component. We additionally provide a visualization of our cross-time dynamic graph to show the capability of assisting intelligent vehicles to avoid congestion. IEEE

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Dynamic Tracking with Fuzzy Rules for Evolutionary Dynamic Constrained Optimization

Dynamic Tracking with Fuzzy Rules for Evolutionary Dynamic C...

引用

2023 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2023

作者： Bu, Chenyang Liu, Yuxin Zhang, Lizhong Zhu, Tao Luo, Wenjian School of Computer Science and Information Engineering Hefei University of Technology Ministry of Education Key Laboratory of Knowledge Engineering with Big Data Anhui Hefei230027 China School of Computer Science and Information Engineering University of South China Hunan Hengyang421200 China School of Computer Science and Technology Harbin Institute of Technology Guangdong Shenzhen518000 China

ISBN: (纸本)9798350337020

Nature-inspired population-based stochastic search algorithms (SSA) have demonstrated effectiveness in solving many real-world dynamic optimization problems (DOPs), such as dynamic optimal power flow (DOPF) problems. The basic idea of solving DOPs using SSAs is to 'track the moving optima', rather than solving the changed problems from scratch. Its hidden assumption is that the problems are slightly changed in general, and it is expected that the search process can be accelerated by learning from past search experiences. However, the hidden assumption that the current search process can always benefit from previous search experiences might not be true for certain cases. For example, if the current problem is not similar to any of its previous problems, the historical solutions might not be helpful for the current search. To reduce such negative transfer, the following issues are worthy of study: how to choose which historical problems to learn from, and how to determine the degree of learning from historical problems. To solve the above problems, we propose a dynamic processing framework based on fuzzy rules from the perspective of incorporating human knowledge for optima tracking. The experimental results on the DOPF problems show that the SSA with the proposed optima tracking strategy outperforms other comparative algorithms. We open up the code and data of our algorithm44https://***/DMiC-Lab-HFUT/SMDE-Transfer. © 2023 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

data-Driven Active Power Dispatch for Wind Farms 13

Data-Driven Active Power Dispatch for Wind Farms

引用

13th IEEE data Driven Control and Learning Systems Conference, DDCLS 2024

作者： Jiao, Xuguo Zhang, Daoyuan Wang, Xin Ma, Zhaoxing Zhang, Zhenyong Liu, Wenfeng School of Information and Control Engineering Qingdao University of Technology Qingdao266520 China College of Control Science and Engineering Zhejiang University State Key Laboratory of Industrial Control Technology Hangzhou310027 China Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Jinan250014 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan250014 China College of Computer Science and Technology Guizhou University State Key Laboratory of Public Big Data Guiyang550025 China School of Civil Engineering Qingdao University of Technology Qingdao266520 China

ISBN: (纸本)9798350361674

Active power dispatch of wind farms plays an important role in power grid scheduling. In this paper, a data-driven active power dispatch strategy for wind farms is proposed, which uses the key point of minimizing the standard deviation of wind turbines' output power series to reduce their fluctuations. First, to build the optimization problem, the historical active power output data of each wind turbine is collected from the Supervisory Control And data Acquisition (SCADA) system. Then, the objective function is developed based on the idea of minimizing the standard deviation of the output power time series. Meanwhile, considering the constraints of wind turbines' output power and active power balance of the grid, the feasible domain of the cost function is constructed. Further, to solve the proposed nonlinear optimization problem with equality and inequality constraints, the trust region interior point method (TRIPM) is employed to explore optimal solution within the feasible domain. Finally, actual data collected from wind farms is used to test effectiveness of the designed approach and experimental results show that our method can achieve better output power smoothing performance than conventional Proportional Dispatch (PD) method. © 2024 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Local and Global Feature-Aware Dual-Branch Networks for Plant Disease Recognition

引用

植物表型组学（英文） 2024年第4期6卷 828-840页

作者： Jianwu Lin Xin Zhang Yongbin Qin Shengxian Yang Xingtian Wen Tomislav Cernava Quirico Migheli Xiaoyulong Chen Text Computing & Cognitive Intelligence Engineering Research Center of National Education Ministry College of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China College of Big Data and Information Engineering Guizhou UniversityGuiyang 550025China Guizhou-Europe Environmental Biotechnology and Agricultural Informatics Oversea Innovation Center in Guizhou University Guizhou Provincial Science and Technology DepartmentGuiyang 550025China Text Computing & Cognitive Intelligence Engineering Research Center of National Education Ministry College of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China College of Big Data and Information Engineering Guizhou UniversityGuiyang 550025China Guizhou-Europe Environmental Biotechnology and Agricultural Informatics Oversea Innovation Center in Guizhou University Guizhou Provincial Science and Technology DepartmentGuiyang 550025China College of Big Data and Information Engineering Guizhou UniversityGuiyang 550025China School of Biological Sciences Faculty of Environmental and Life SciencesUniversity of SouthamptonSouthampton S017 1BJUK Dipartimento di Agraria and NRD-Nucleo di Ricerca sulla Desertificazione Università degli Studi di SassariSassariItaly Guizhou-Europe Environmental Biotechnology and Agricultural Informatics Oversea Innovation Center in Guizhou University Guizhou Provincial Science and Technology DepartmentGuiyang 550025China College of Life Sciences Guizhou UniversityGuiyang 550025China

Accurate identification of plant diseases is important for ensuring the safety of agricultural *** neural networks(CNNs)and visual transformers(VTs)can extract effective representations of images and have been widely used for the intelligent recognition of plant disease ***,CNNs have excellent local perception with poor global perception,and VTs have excellent global perception with poor local *** makes it difficult to further improve the performance of both CNNs and VTs on plant disease recognition *** this paper,we propose a local and global feature-aware dual-branch network,named LGNet,for the identification of plant *** specifically,we first design a dual-branch structure based on CNNs and VTs to extract the local and global ***,an adaptive feature fusion(AFF)module is designed to fuse the local and global features,thus driving the model to dynamically perceive the weights of different ***,we design a hierarchical mixed-scale unit-guided feature fusion(HMUFF)module to mine the key information in the features at different levels and fuse the differentiated information among them,thereby enhancing the model's multiscale perception ***,extensive experiments were conducted on the Al Challenger 2018 dataset and the self-collected corn disease(SCD)*** experimental results demonstrate that our proposed LGNet achieves state-of-the-art recognition performance on both the Al Challenger 2018 dataset and the SCD dataset,with accuracies of 88.74％and 99.08％,respectively.

关键词： global plant disease dual-branch feature-aware local networks recognition

来源：评论

学校读者我要写书评

暂无评论

How Easily do Irrelevant Inputs Skew the Responses of Large Language Models?

arXiv

引用

arXiv 2024年

作者： Wu, Siye Xie, Jian Chen, Jiangjie Zhu, Tinghui Zhang, Kai Xiao, Yanghua Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China Wuhan University China The Ohio State University United States

By leveraging the retrieval of information from external knowledge databases, Large Language Models (LLMs) exhibit enhanced capabilities for accomplishing many knowledge-intensive tasks. However, due to the inherent flaws of current retrieval systems, there might exist irrelevant information within those retrieving top-ranked passages. In this work, we present a comprehensive investigation into the robustness of LLMs to different types of irrelevant information under various conditions. We initially introduce a framework to construct high-quality irrelevant information that ranges from semantically unrelated, partially related, and related to questions. Furthermore, our analysis demonstrates that the constructed irrelevant information not only scores highly on similarity metrics, being highly retrieved by existing systems, but also bears semantic connections to the context. Our investigation reveals that current LLMs still face challenges in discriminating highly semantically related information and can be easily distracted by these irrelevant yet misleading content. Besides, we also find that current solutions for handling irrelevant information have limitations in improving the robustness of LLMs to such distractions. All the resources are available on GitHub. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Automatic Code Annotation Generation Based on Heterogeneous Graph Structure

Automatic Code Annotation Generation Based on Heterogeneous ...

引用

IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)

作者： Zhijie Jiang Haixu Xiong Yingwei Ma Yao Zhang Yan Ding Yun Xiong Shanshan Li College of Computer Science National University of Defense Technology Changsha China Shanghai Key Laboratory of Data Science School of Computer Science Fudan University Shanghai China

Automatic code annotation generation aims to generate readable annotations that describe the functionality of source code, which may facilitate software developers and programmers. Previous methods follow the encoder-decoder structures where the encoders are based on the abstract syntax trees (ASTs) to encode syntactic structures of code fragments. However, the AST alone cannot fully express complicated control structures, data flows, or dependencies of source code, leading to sub-optimal annotations. On the other hand, a functionality can be implemented in various ways with possibly different structures and token names. Most methods treat code fragments independently and do not exploit these similarities among code fragments. In this paper, we present HANCode2Seq, an automatic code annotation generation method by utilizing the code heterogeneous representation graph. Specifically, we construct the heterogeneous graph by combining multiple code induced graphs, including abstract syntax trees, control flow graphs, data flow graphs, and program dependency graphs. Then a heterogeneous graph attention network is applied to extract the comprehensive semantic meanings and syntactic structures of the source code fragments. Furthermore, we present a novel adaptive code similarity graph with code fragments being nodes. The representation of a code fragment is enhanced by aggregating information from other similar fragments on the graph, which may reduce the ambiguity of the code. The experimental results on real datasets show that our proposed model outperforms other baselines and produces more fluent and readable code annotations.

关键词： Adaptation models Codes Annotations Source coding Software algorithms Semantics Syntactics

来源：评论

学校读者我要写书评

暂无评论

Dimensionality-Reduction Techniques for Approximate Nearest Neighbor Search: A Survey and Evaluation

arXiv

引用

arXiv 2024年

作者： Wang, Zeyu Xiong, Haoran Wang, Qitong He, Zhenying Wang, Peng Palpanas, Themis Wang, Wei Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China Harvard University United States Université Paris Cité France

Approximate Nearest Neighbor Search (ANNS) on high-dimensional vectors has become a fundamental and essential component in various machine learning tasks. Recently, with the rapid development of deep learning models and the applications of Large Language Models (LLMs), the dimensionality of the vectors keeps growing in order to accommodate a richer semantic representation. This poses a major challenge to the ANNS solutions since distance calculation cost in ANNS grows linearly with the dimensionality of vectors. To overcome this challenge, dimensionality-reduction techniques can be leveraged to accelerate the distance calculation in the search process. In this paper, we investigate six dimensionality-reduction techniques that have the potential to improve ANNS solutions, including classical algorithms such as PCA and vector quantization, as well as algorithms based on deep learning approaches. We further describe two frameworks to apply these techniques in the ANNS workflow, and theoretically analyze the time and space costs, as well as the beneficial threshold for the pruning ratio of these techniques. The surveyed techniques are evaluated on six public datasets. The analysis of the results reveals the characteristics of the different families of techniques and provides insights into the promising future research directions. © 2024, CC BY-NC-SA.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

StrucText-Eval: Evaluating Large Language Model's Reasoning Ability in Structure-Rich Text

arXiv

引用

arXiv 2024年

作者： Gu, Zhouhong Ye, Haoning Chen, Xingzhou Zhou, Zeyang Feng, Hongwei Xiao, Yanghua Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China Fudan-Aishu Cognitive Intelligence Joint Research Center China

The effective utilization of structured data, integral to corporate data strategies, has been challenged by the rise of large language models (LLMs) capable of processing unstructured information. This shift prompts the question: can LLMs interpret structured data directly in its unstructured form? We propose an automatic evaluation data generation method for assessing LLMs' reasoning capabilities on structure-rich text to explore this. Our approach supports 8 structured languages and 29 tasks, generating data with adjustable complexity through controllable nesting and structural width. We introduce StrucText-Eval, a benchmark containing 5,800 pre-generated and annotated samples designed to evaluate how well LLMs understand and reason through structured text. StrucText-Eval is divided into two suites: a regular Test suite (3,712 samples) and a Test-Hard suite (2,088 samples), the latter emphasizing the gap between human and model performance on more complex tasks. Experimental results show that while open-source LLMs achieve a maximum accuracy of 74.9% on the standard dataset, their performance drops significantly to 45.8% on the harder dataset. In contrast, human participants reach an accuracy of 92.6% on StrucText-Eval-Hard, highlighting LLMs' current limitations in handling intricate structural information. The benchmark and generation codes are open sourced in https://***/MikeGu721/StrucText-Eval. © 2024, CC BY.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

Transfer learning enhanced graph neural network for aldehyde oxidase metabolism prediction and its experimental application

引用

Acta Pharmaceutica Sinica B 2024年第2期14卷 623-634页

作者： Jiacheng Xiong Rongrong Cui Zhaojun Li Wei Zhang Runze Zhang Zunyun Fu Xiaohong Liu Zhenghao Li Kaixian Chen Mingyue Zheng Drug Discovery and Design Center State Key Laboratory of Drug ResearchShanghai Institute of Materia MedicaChinese Academy of SciencesShanghai 201203China University of Chinese Academy of Sciences Beijing 100049China College of Computer and Information Engineering Dezhou UniversityDezhou 253023China AI Department Suzhou Alphama Biotechnology Co.Ltd.Suzhou 215000China Shanghai Institute for Advanced Immunochemical Studies and School of Life Science and TechnologyShanghaiTech UniversityShanghai 200031China State Key Laboratory of Pharmaceutical Biotechnology Nanjing UniversityNanjing 210023China

Aldehyde oxidase(AOX)is a molybdoenzyme that is primarily expressed in the liver and is involved in the metabolism of drugs and other ***-mediated metabolism can result in unexpected outcomes,such as the production of toxic metabolites and high metabolic clearance,which can lead to the clinical failure of novel therapeutic *** models can assist medicinal chemists in rapidly evaluating the AOX metabolic risk of compounds during the early phases of drug discovery and provide valuable clues for manipulating AOX-mediated metabolism *** this study,we developed a novel graph neural network called AOMP for predicting AOX-mediated *** integrated the tasks of metabolic substrate/non-substrate classification and metabolic site prediction,while utilizing transfer learning from 13C nuclear magnetic resonance data to enhance its performance on both *** significantly outperformed the benchmark methods in both cross-validation and external *** AOMP,we systematically assessed the AOX-mediated metabolism of common fragments in kinase inhibitors and successfully identified four new scaffolds with AOX metabolism liability,which were validated through in vitro ***,for the convenience of the community,we established the first online service for AOX metabolism prediction based on AOMP,which is freely available at https://***.

关键词： Drugmetabolism Aldehyde oxidase Transferlearning Graph neural network Kinase inhibitor

来源：评论

学校读者我要写书评

暂无评论

Up to 320-GBaud Coherent Optical System Based on Broadband Segmented TFLN I/Q Modulator

Up to 320-GBaud Coherent Optical System Based on Broadband S...

引用

2024 Asia Communications and Photonics Conference, ACP 2024 and International Conference on Information Photonics and Optical Communications, IPOC 2024

作者： Zhou, Lingjun Fang, Xiansong Zhu, Yixiao Zhu, Junbo Li, Yunchen Nie, Xiaomin Zhou, Xian Yang, Chuanchuan Wang, Lei Hu, Weisheng Li, Ke He, Zhixue Zhang, Fan School of Electronic and Computer Engineering Peking University Shenzhen China Peng Cheng Laboratory Shenzhen China State Key Laboratory of Advanced Optical Communication System and Networks School of Electronics Peking University Beijing China State Key Laboratory of Advanced Optical Communication System and Networks Shanghai Jiao Tong University Shanghai China School of Computer & Communication Engineering University of Science and Technology Beijing Beijing China

We demonstrate the record 320-GBd single-polarization QPSK and 300-GBd dual-polarization QPSK signal generation and intradyne coherent detection. This result is achieved with a novel broadband segmented TFLN I/Q modul... 详细信息

ISBN: (纸本)9798350379266

关键词： Quadrature phase shift keying

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：