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

arXiv 2025年

作者： Sun, Geng Ma, Weilong Li, Jiahui Sun, Zemin Wang, Jiacheng Niyato, Dusit Mao, Shiwen College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore College of Software Jilin University Changchun130012 China Department of Electrical and Computer Engineering Auburn University AuburnAL36849-5201 United States

The low-altitude economy (LAE), driven by unmanned aerial vehicles (UAVs) and other aircraft, has revolutionized fields such as transportation, agriculture, and environmental monitoring. In the upcoming six-generation (6G) era, UAV-assisted mobile edge computing (MEC) is particularly crucial in challenging environments such as mountainous or disaster-stricken areas. The computation task offloading problem is one of the key issues in UAV-assisted MEC, primarily addressing the trade-off between minimizing the task delay and the energy consumption of the UAV. In this paper, we consider a UAV-assisted MEC system where the UAV carries the edge servers to facilitate task offloading for ground devices (GDs), and formulate a calculation delay and energy consumption multi-objective optimization problem (CDECMOP) to simultaneously improve the performance and reduce the cost of the system. Then, by modeling the formulated problem as a multi-objective Markov decision process (MOMDP), we propose a multi-objective deep reinforcement learning (DRL) algorithm within an evolutionary framework to dynamically adjust the weights and obtain non-dominated policies. Moreover, to ensure stable convergence and improve performance, we incorporate a target distribution learning (TDL) algorithm. Simulation results demonstrate that the proposed algorithm can better balance multiple optimization objectives and obtain superior non-dominated solutions compared to other methods. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

AMPCliff: Quantitative definition and benchmarking of activity cliffs in antimicrobial peptides

引用

Journal of Advanced Research 2025年

作者： Li, Kewei Wu, Yuqian Li, Yinheng Guo, Yutong Kong, Yanwen Wang, Yan Liang, Yiyang Fan, Yusi Huang, Lan Zhang, Ruochi Zhou, Fengfeng College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun 130012 China School of Software Jilin University Jilin Changchun 130012 China School of Life Sciences Jilin University Jilin Changchun 130012 China Department of Computer Science Columbia University 116th and Broadway New York City 10027 NY United States School of Artificial Intelligence Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun 130012 China School of Biology and Engineering Guizhou Medical University Guizhou Guiyang 550025 China School of Computer Engineering Changchun University of Engineering Jilin Changchun 130103 China Changchun Wenli High School Jilin Changchun 130062 China

Introduction: Activity cliff (AC) is a phenomenon that a pair of similar molecules differ by a small structural alternation but exhibit a large difference in their biochemical activities. This phenomenon affects various tasks ranging from virtual screening to lead optimization in drug development. The AC of small molecules has been extensively investigated but limited knowledge is accumulated about the AC phenomenon in pharmaceutical peptides with canonical amino acids. Objectives: This study introduces a quantitative definition and benchmarking framework AMPCliff for the AC phenomenon in antimicrobial peptides (AMPs) composed by canonical amino acids. Methods: This study establishes a benchmark dataset of paired AMPs in Staphylococcus aureus from the publicly available AMP dataset GRAMPA, and conducts a rigorous procedure to evaluate various AMP AC prediction models, including nine machine learning, four deep learning algorithms, four masked language models, and four generative language models. Results: A comprehensive analysis of the existing AMP dataset reveals a significant prevalence of AC within AMPs. AMPCliff quantifies the activities of AMPs by the metric minimum inhibitory concentration (MIC), and defines 0.9 as the minimum threshold for the normalized BLOSUM62 similarity score between a pair of aligned peptides with at least two-fold MIC changes. Our analysis reveals that these models are capable of detecting AMP AC events and the pre-trained protein language model ESM2 demonstrates superior performance across the evaluations. The predictive performance of AMP activity cliffs remains to be further improved, considering that ESM2 with 33 layers only achieves the Spearman correlation coefficient 0.4669 for the regression task of the −log(MIC) values on the benchmark dataset. Conclusion: Our findings highlight limitations in current deep learning-based representation models. To more accurately capture the properties of antimicrobial peptides (AMPs), it is ess

关键词： Activity cliff (AC) AMPCliff Antimicrobial peptide (AMP) Benchmark Minimum inhibitory concentration (MIC)

来源：评论

学校读者我要写书评

暂无评论

Curve length estimation based on cubic spline interpolation in gray-scale images

引用

Journal of Zhejiang University-Science C(Computers and Electronics) 2013年第10期14卷 777-784页

作者： Zhen-xin WANG Ji-hong OUYANG College of Computer Science and Technology Jilin University MOE Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University

This paper deals with a novel local arc length estimator for curves in gray-scale *** method first estimates a cubic spline curve fit for the boundary points using the gray-level information of the nearby pixels,and then computes the sum of the spline segments’*** this model,the second derivatives and y coordinates at the knots are required in the computation;the spline polynomial coefficients need not be computed *** provide the algorithm pseudo code for estimation and preprocessing,both taking linear *** shows that the proposed model gains a smaller relative error than other state-of-the-art methods.

关键词： Arc length estimation Cubic spline interpolation Gray-scale image Local algorithm

来源：评论

学校读者我要写书评

暂无评论

Verifying Diagnosability of Discrete Event System with Logical Formula

引用

Chinese Journal of Electronics 2020年第2期29卷 304-311页

作者： GENG Xuena OUYANG Dantong HAN Cheng College of Computer Science and Technology Changchun University of Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering for Ministry of Education Jilin University

Diagnosability is an important property in the field of fault diagnosis. In this paper, a novel approach based on logical formula is proposed to verify diagnosability of Discrete event systems(DESs). CNFFSM is defined to represent a new model for DES. Each transition in DES can be described as a clause. According to CNF-FSM, we construct a CNF-diagnoser. Based on the resolution principle and CNF-diagnoser, an algorithm is presented to test whether the failure events can be detected or not in a finite number of observable *** algorithm can be applied in both off-line diagnosis and on-line diagnosis. Experimental results show that our algorithm can solve the diagnosability problem efficiently.

关键词： Fault diagnosis Diagnosability Discrete event system Finite state machine Conjunctive normal form

来源：评论

学校读者我要写书评

暂无评论

Collaboration and Controversy Among Experts: Rumor Early Detection by Tuning a Comment Generator

arXiv

引用

arXiv 2025年

作者： Wang, Bing Zhao, Bingrui Li, Ximing Li, Changchun Gao, Wanfu Wang, Shengsheng College of Computer Science and Technology Jilin University Jilin Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Jilin University China

Over the past decade, social media platforms have been key in spreading rumors, leading to significant negative impacts. To counter this, the community has developed various Rumor Detection (RD) algorithms to automatically identify them using user comments as evidence. However, these RD methods often fail in the early stages of rumor propagation when only limited user comments are available, leading the community to focus on a more challenging topic named Rumor Early Detection (RED). Typically, existing RED methods learn from limited semantics in early comments. However, our preliminary experiment reveals that the RED models always perform best when the number of training and test comments is consistently extensive. This inspires us to address the RED issue by generating more human-like comments to support this hypothesis. To implement this idea, we tune a comment generator by simulating expert collaboration and controversy and propose a new RED framework named CameRed. Specifically, we integrate a mixture-of-expert structure into a generative language model and present a novel routing network for expert collaboration. Additionally, we synthesize a knowledgeable dataset and design an adversarial learning strategy to align the style of generated comments with real-world comments. We further integrate generated and original comments with a mutual controversy fusion module. Experimental results show that CameRed outperforms state-of-the-art RED baseline models and generation methods, demonstrating its effectiveness. Copyright © 2025, The Authors. All rights reserved.

关键词： Tweets

来源：评论

学校读者我要写书评

暂无评论

The Fitzpatrick-Neville-Type Algorithm for Multivariate Vector-Valued Osculatory Rational Interpolation

引用

Journal of Systems Science & Complexity 2015年第1期28卷 222-242页

作者： XIA Peng ZHANG Shugong LEI Na KIM Zhangyong School of Mathematics Liaoning University Automated Reasoning and Cognition Key Laboratory of Chongqing School of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering(Ministry of Education)Jilin University

In this paper,the authors first apply the Fitzpatrick algorithm to multivariate vectorvalued osculatory rational *** based on the Fitzpatrick algorithm and the properties of an Hermite interpolation basis,the authors present a Fitzpatrick-Neville-type algorithm for multivariate vector-valued osculatory rational *** may be used to compute the values of multivariate vector-valued osculatory rational interpolants at some points directly without computing the interpolation function explicitly.

关键词： Fitzpatrick algorithm GrSbner basis module vector-valued osculatory rational interpolation.

来源：评论

学校读者我要写书评

暂无评论

Are Your Apps Accessible? A GCN-based Accessibility Checker for Low Vision Users

arXiv

引用

arXiv 2025年

作者： Zhang, Mengxi Liu, Huaxiao Song, Shenning Chen, Chunyang Huang, Pei Zhao, Jian College of Computer Science and Technology Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Jilin Changchun130012 China Department of Computer Science Technical University of Munich Heilbronn85354 Germany Department of Computer Science Stanford University CA94305 United States College of Computer Science Changchun University Jilin Changchun130012 China

Context: Accessibility issues (e.g., small size and narrow interval) in mobile applications (apps) lead to obstacles for billions of low vision users in interacting with Graphical User Interfaces (GUIs). Although GUI accessibility scanning tools exist, most of them perform rule-based check relying on complex GUI hierarchies. This might make them detect invisible redundant information, cannot handle small deviations, omit similar components, and is hard to extend. Objective: In this paper, we propose a novel approach, named ALVIN (Accessibility Checker for Low Vision), which represents the GUI as a graph and adopts the Graph Convolutional Neural Networks (GCN) to label inaccessible components. Method: ALVIN removes invisible views to prevent detecting redundancy and uses annotations from low vision users to handle small deviations. Also, the GCN model could consider the relations between GUI components, connecting similar components and reducing the possibility of omission. ALVIN only requires users to annotate the relevant dataset when detecting new kinds of issues. Results: Our experiments on 48 apps demonstrate the effectiveness of ALVIN, with precision of 83.5%, recall of 78.9%, and F1-score of 81.2%, outperforming baseline methods. In RQ2, the usefulness is verified through 20 issues submitted to open-source apps. The RQ3 also illustrates the GCN model is better than other models. Conclusion: To summarize, our proposed approach can effectively detect accessibility issues in GUIs for low vision users, thereby guiding developers in fixing them efficiently. Copyright © 2025, The Authors. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Beam Tracking for High-Speed UAV Via Generative Diffusion Model-Enabled Joint Optimization Approach

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Zhang, Jing Zhang, Chaofeng Feng, Xin Yang, Hongwei Liang, Shuang Sun, Geng Wang, Jiacheng Niyato, Dusit Changchun University of Science and Technology College of Computer Science and Technology Changchun130022 China Jilin University College of Communication Engineering Changchun130012 China Northeast Normal University School of Information Science and Technology Changchun130117 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Jilin University College of Computer Science and Technology Changchun130012 China Nanyang Technological University College of Computing and Data Science 639798 Singapore Nanyang Technological University 639798 Singapore

Beam tracking is crucial for maintaining stable data transmission in unmanned aerial vehicle (UAV) communications. However, a communication link can be disrupted by frequent switching of narrow beams between a base station and a UAV at certain moments. In this study, we propose a position prediction-based beam tracking algorithm with adaptive beam reconstruction (PPBT-AR) for high-speed UAV. Specifically, long short-term memory (LSTM) recurrent neural networks are utilized to predict the nonlinear flight trajectory during high-speed flight. Moreover, we employ the generative diffusion model (GDM) to jointly optimize the beam width and signal strength, thereby reducing the number of beam switches. In addition, we design an adaptive beam reconstruction (ABR) mechanism to mitigate communication interruptions caused by prediction errors. Simulation results demonstrate that the proposed PPBT-AR reduces the number of beam switches by 66.6% and 76.9% in low-speed and high-speed scenarios compared to the traditional phased array beam tracking algorithm, respectively. © 1967-2012 IEEE.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

Don’t Confuse! Redrawing GUI Navigation Flow in Mobile Apps for Visually Impaired Users

arXiv

引用

arXiv 2025年

作者： Zhang, Mengxi Liu, Huaxiao Zhou, Yuheng Chen, Chunyang Huang, Pei Zhao, Jian College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Department of Computer Science Technical University of Munich Weipertstr.8-10 Heilbronn74076 Germany Department of Computer Science Stanford University California9025 United States Department of Computer Science Changchun University Changchun1340012 China

Mobile applications (apps) are integral to our daily lives, offering diverse services and functionalities. They enable sighted users to access information coherently in an extremely convenient manner. However, it remains unclear if visually impaired users, who rely solely on the screen readers (e.g., Talkback) to navigate and access app information, can do so in the correct and reasonable order. This may result in significant information bias and operational errors. Furthermore, in our preliminary exploration, we explained and clarified that the navigation sequence-related issues encountered by visually impaired users could be categorized into two types: unintuitive navigation sequence and unapparent focus switching. Considering these issues, in this work, we proposed a method named RGNF (Re-draw GUI Navigation Flow). It aimed to enhance the understandability and coherence of accessing the content of each component within the Graphical User Interface (GUI), together with assisting developers in creating well-designed GUI navigation flow (GNF). This method was inspired by the characteristics identified in our preliminary study, where visually impaired users expected navigation to be associated with close position and similar shape of GUI components that were read consecutively. Thus, our method relied on the principles derived from the Gestalt psychological model, aiming to group GUI components into different regions according to the laws of proximity and similarity, thereby redrawing the GNFs. To evaluate the effectiveness of our method, we calculated sequence similarity values before and after redrawing the GNF, and further employed the tools proposed by Alotaibi et al. to measure the reachability of GUI components. Our results demonstrated a substantial improvement in similarity (0.921) compared to the baseline (0.624), together with the reachability (90.31%) compared to the baseline GNF (74.35%). Furthermore, a qualitative user study revealed that our method had

关键词： Graphical user interfaces

来源：评论

学校读者我要写书评

暂无评论

Force-Based Incremental Algorithm for Mining Community Structure in Dynamic Network

引用

Journal of Computer Science & Technology 2006年第3期21卷 393-400页

作者：杨博刘大有 College of Computer Science and Technology & Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 P.R. China

Community structure is an important property of network. Being able to identify communities can provide invaluable help in exploiting and understanding both social and non-social networks. Several algorithms have been developed up till now. However, all these algorithms can work well only with small or moderate networks with vertexes of order 104. Besides, all the existing algorithms are off-line and cannot work well with highly dynamic networks such as web, in which web pages are updated frequently. When an already clustered network is updated, the entire network including original and incremental parts has to be recalculated, even though only slight changes are involved. To address this problem, an incremental algorithm is proposed, which allows for mining community structure in large-scale and dynamic networks. Based on the community structure detected previously, the algorithm takes little time to reclassify the entire network including both the original and incremental parts. Furthermore, the algorithm is faster than most of the existing algorithms such as Girvan and Newman＇s algorithm and its improved versions. Also, the algorithm can help to visualize these community structures in network and provide a new approach to research on the evolving process of dynamic networks.

关键词： incremental algorithm community structure dynamic network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：