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

arXiv 2025年

作者： Liao, Zehui Hu, Shishuai Zou, Ke Fu, Huazhu Zhen, Liangli Xia, Yong National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology School of Computer Science and Engineering Northwestern Polytechnical University Xi’an710072 China Institute of High Performance Computing Agency for Science Technology and Research Singapore138632 Singapore National University of Singapore Singapore119077 Singapore

Multimodal large language models (MLLMs) have demonstrated significant potential in medical Visual Question Answering (VQA). Yet, they remain prone to hallucinations—incorrect responses that contradict input images, posing substantial risks in clinical decision-making. Detecting these hallucinations is essential for establishing trust in MLLMs among clinicians and patients, thereby enabling their real-world adoption. Current hallucination detection methods, especially semantic entropy (SE), have demonstrated promising hallucination detection capacity for LLMs. However, adapting SE to medical MLLMs by incorporating visual perturbations presents a dilemma. Weak perturbations preserve image content and ensure clinical validity, but may be overlooked by medical MLLMs, which tend to over rely on language priors. In contrast, strong perturbations can distort essential diagnostic features, compromising clinical interpretation. To address this issue, we propose Vision Amplified Semantic Entropy (VASE), which incorporates weak image transformations and amplifies the impact of visual input, to improve hallucination detection in medical VQA. We first estimate the semantic predictive distribution under weak visual transformations to preserve clinical validity, and then amplify visual influence by contrasting this distribution with that derived from a distorted image. The entropy of the resulting distribution is estimated as VASE. Experiments on two medical open-ended VQA datasets demonstrate that VASE consistently outperforms existing hallucination detection methods. Copyright © 2025, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Numerical Singular Integral Methods for Computational Electromagnetics 22

Numerical Singular Integral Methods for Computational Electr...

引用

22nd IEEE International Conference on Communication Technology, ICCT 2022

作者： Luo, Kuang Ou, Lu Zhang, Chuangfeng Zhang, Ming Li, Jinxin Liao, Shaolin Guangdong Guangzhou China School of Journalism and Communication Hunan University Hunan Province Key Laboratory of Big Data Research and Applications Hunan Changsha China College of Computer Science and Electronic Engineering Hunan University Hunan Changsha China Illinois Institute of Technology Electrical and Computer Engineering ChicagoIL United States

ISBN: (纸本)9781665470674

Efficient Numerical Singular Integral (NSI) methods have been developed for both 1D and 2D electromagnetics problems, in both the Cartesian and polar coordinates. Through a special type of integration by parts, rigorous mathematics derivation has been performed to decompose the original singular integrals into sum of non-singular integrals that can be evaluated numerically. It can be shown that it is more convenient to evaluate the line-type singularity in the Cartesian coordinate;while it is better to evaluate the point-type singularity in the polar coordinate. Also, numerical schemes to find the order of singularity has been presented. Finally, to validate the 2D numerical singular integral methods, the electromagnetic scattering problem of a 2D reflecting ellipse antenna has been simulated through the Ping-Pong algorithm developed by the authors. © 2022 IEEE.

关键词： Computational electromagnetics

来源：评论

学校读者我要写书评

暂无评论

An Exploratory Investigation of Log Anomalies in Unmanned Aerial Vehicles

An Exploratory Investigation of Log Anomalies in Unmanned Ae...

引用

International Conference on Software engineering (ICSE)

作者： Dinghua Wang Shuqing Li Guanping Xiao Yepang Liu Yulei Sui Pinjia He Michael R. Lyu University of Technology Sydney Australia Southern University of Science and Technology China The Chinese University of Hong Kong China Nanjing University of Aeronautics and Astronautics China Department of Computer Science and Engineering Research Institute of Trustworthy Autonomous Systems Southern University of Science and Technology China The University of New South Wales Australia School of Data Science The Chinese University of Hong Kong Shenzhen (CUHK-Shenzhen) China Shenzhen Research Institute of Big Data China

ISBN: (数字)9798400702174

ISBN: (纸本)9798350382143

Unmanned aerial vehicles (UAVs) are becoming increasingly ubiqui-tous in our daily lives. However, like many other complex systems, UAVs are susceptible to software bugs that can lead to abnormal system behaviors and undesirable consequences. It is crucial to study such software bug-induced UAV anomalies, which are often mani-fested in flight logs, to help assure the quality and safety of UAV systems. However, there has been limited research on investigating the code-level patterns of software bug-induced UAV anomalies. This impedes the development of effective tools for diagnosing and localizing bugs within UAV system code. To bridge the research gap and deepen our understanding of UAV anomalies, we carried out an empirical study on this subject. We first collected 178 real-world abnormal logs induced by soft-ware bugs in two popular open-source UAV platforms, i.e., PX4 and Ardupilot. We then examined each of these abnormal logs and com-piled their common patterns. In particular, we investigated the most severe anomalies that led to UAV crashes, and identified their features. Based on our empirical findings, we further summarized the challenges of localizing bugs in system code by analyzing anoma-lous UAV flight data, which can offer insights for future research in this field.

关键词： Bridges Codes Computer bugs Autonomous aerial vehicles Software Safety Complex systems

来源：评论

学校读者我要写书评

暂无评论

SpreadFGL: Edge-Client Collaborative Federated Graph Learning with Adaptive Neighbor Generation

arXiv

引用

arXiv 2024年

作者： Zhong, Luying Pi, Yueyang Chen, Zheyi Yu, Zhengxin Miao, Wang Chen, Xing Min, Geyong College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China School of Computing and Communications University of Lancaster United Kingdom School of Engineering Computing and Mathematics University of Plymouth United Kingdom Department of Computer Science University of Exeter United Kingdom

Federated Graph Learning (FGL) has garnered widespread attention by enabling collaborative training on multiple clients for semi-supervised classification tasks. However, most existing FGL studies do not well consider the missing inter-client topology information in real-world scenarios, causing insufficient feature aggregation of multi-hop neighbor clients during model training. Moreover, the classic FGL commonly adopts the FedAvg but neglects the high training costs when the number of clients expands, resulting in the overload of a single edge server. To address these important challenges, we propose a novel FGL framework, named SpreadFGL, to promote the information flow in edge-client collaboration and extract more generalized potential relationships between clients. In SpreadFGL, an adaptive graph imputation generator incorporated with a versatile assessor is first designed to exploit the potential links between subgraphs, without sharing raw data. Next, a new negative sampling mechanism is developed to make SpreadFGL concentrate on more refined information in downstream tasks. To facilitate load balancing at the edge layer, SpreadFGL follows a distributed training manner that enables fast model convergence. Using real-world testbed and benchmark graph datasets, extensive experiments demonstrate the effectiveness of the proposed SpreadFGL. The results show that SpreadFGL achieves higher accuracy and faster convergence against state-of-the-art algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Fence Theorem: Towards Dual-Objective Semantic-Structure Isolation in Preprocessing Phase for 3D Anomaly Detection

arXiv

引用

arXiv 2025年

作者： Liang, Hanzhe Zhou, Jie Chen, Xuanxin Dai, Tao Wang, Jinbao Gao, Can College of Computer Science and Software Engineering Shenzhen University China Shenzhen Audencia Financial Technology Institute Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Faculty of Education Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

3D anomaly detection (AD) is prominent but difficult due to lacking a unified theoretical foundation for preprocessing design. We establish the Fence Theorem, formalizing preprocessing as a dual-objective semantic isolator: (1) mitigating cross-semantic interference to the greatest extent feasible and (2) confining anomaly judgements to aligned semantic spaces wherever viable, thereby establishing intra-semantic comparability. Any preprocessing approach achieves this goal through a two-stage process of Semantic-Division and Spatial-Constraints stage. Through systematic deconstruction, we theoretically and experimentally subsume existing preprocessing methods under this theorem via tripartite evidence: qualitative analyses, quantitative studies, and mathematical proofs. Guided by the Fence Theorem, we implement Patch3D, consisting of Patch-Cutting and Patch-Matching modules, to segment semantic spaces and consolidate similar ones while independently modeling normal features within each space. Experiments on Anomaly-ShapeNet and Real3D-AD with different settings demonstrate that progressively finer-grained semantic alignment in preprocessing directly enhances point-level AD accuracy, providing inverse validation of the theorem’s causal logic. Copyright © 2025, The Authors. All rights reserved.

关键词： Fences

来源：评论

学校读者我要写书评

暂无评论

SinCWIm: An imputation method for single-cell RNA sequence dropouts using weighted alternating least squares

引用

Computers in Biology and Medicine 2024年 171卷 108225-108225页

作者： Gong, Lejun Cui, Xiong Liu, Yang Lin, Cai Gao, Zhihong Jiangsu Key Lab of Big Data Security & Intelligent Processing School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Department of Burn Wound Repair and Regenerative Medicine Center The First Affiliated Hospital of Wenzhou Medical University Zhejiang Wenzhou325000 China Zhejiang Engineering Research Center of Intelligent Medicine The First Affiliated Hospital of Wenzhou Medical University Wenzhou325000 China

Background and objectives: Single-cell RNA sequencing (scRNA-seq) provides a powerful tool for exploring cellular heterogeneity, discovering novel or rare cell types, distinguishing between tissue-specific cellular composition, and understanding cell differentiation during development. However, due to technological limitations, dropout events in scRNA-seq can mistakenly convert some entries in the real data to zero. This is equivalent to introducing noise into the data of cell gene expression entries. The data is contaminated, which affects the performance of downstream analyses, including clustering, cell annotation, differential gene expression analysis, and so on. Therefore, it is a crucial work to accurately determine which zeros are due to dropout events and perform imputation operations on them. Methods: Considering the different confidence levels of different zeros in the gene expression matrix, this paper proposes a SinCWIm method for dropout events in scRNA-seq based on weighted alternating least squares (WALS). The method utilizes Pearson correlation coefficient and hierarchical clustering to quantify the confidence of zero entries. It is then combined with WALS for matrix decomposition. And the imputation result is made close to the actual number by outlier removal and data correction operations. Results: A total of eight single-cell sequencing datasets were used for comparative experiments to demonstrate the overall superiority of SinCWIm over state-of-the-art models. SinCWIm was applied to cluster the data to obtain an adjusted RAND index evaluation, and the Usoskin, Pollen and Bladder datasets scored 94.46%, 96.48% and 76.74%, respectively. In addition, significant improvements were made in the retention of differential expression genes and visualization. Conclusions: SinCWIm provides a valuable imputation method for handling dropout events in single-cell sequencing data. In comparison to advanced methods, SinCWIm demonstrates excellent performance in

关键词： RNA

来源：评论

学校读者我要写书评

暂无评论

DHFM-FLM: A Dynamic Hierarchical Federated Learning Mechanism for Financial Models under Client Resource Heterogeneity

DHFM-FLM: A Dynamic Hierarchical Federated Learning Mechanis...

引用

IEEE International Conference on big data

作者： Kangning Yin Zhen Ding Shaoqi Hou Xinhui Ji Guangqiang Yin Zhiguo Wang Kash Institute of Electronics and Information Industry University of Electronic Science and Technology of China Chengdu China School of Information Management Wuhan University Big Data Research Institute Wuhan University Wuhan China Shanghai New Energy Vehicle Public Data Collection and Monitoring Research Center Shanghai China School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (数字)9798350362480

ISBN: (纸本)9798350362497

Federated Learning (FL) is an emerging distributed machine learning technology. However, in practical applications, it frequently encounters the challenge of client resource heterogeneity. This can result in long wait times or even model training failures during the communication process of FL. To address this problem, we propose a dynamic hierarchical federated learning mechanism for financial models (DHFM-FLM). The local client adopts a dynamic model training design that leverages the property of resource heterogeneity to enhance the performance of the local model. To avoid prolonged wait times for failing clients, a dynamic communication detection design is proposed at three critical junctures. In each round, the model hierarchical reservation communication design is employed to collect models in segments, thus reducing communication congestion and preventing malicious attacks on the communication process. Experiments with heterogeneous computation and communication resources demonstrate that utilizing the DHFM-FLM boosts model performance by approximately 5-8% and reduces communication time by about 15%. Additionally, DHFM-FLM increases the success rate of the FL task by approximately 6%.

关键词： Training Performance evaluation Federated learning Computational modeling Dynamic scheduling data models Servers Resource management Reliability Convergence

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Truthful Online Incentive Mechanism for a Social Crowdsensing Network 16th

An Efficient and Truthful Online Incentive Mechanism for a S...

引用

16th EAI International Conference on Collaborative Computing: Networking, Applications, and Worksharing, CollaborateCom 2020

作者： Fang, Lu Liu, Tong Gao, Honghao Cao, Chenhong Li, Weimin Tong, Weiqin School of Computer Engineering and Science Shanghai University Shanghai China Shanghai Key Laboratory of Data Science Shanghai China Shanghai Institute for Advanced Communication and Data Science Shanghai University Shanghai China Shanghai Engineering Research Center of Intelligent Computing System Shanghai China

ISBN: (纸本)9783030675363

Crowdsening plays an important role in spatiotemporal data collection by leveraging ubiquitous smart devices equipped with sensors. Considering rational and strategic device users, designing a truthful incentive mechanism is a crucial issue. Moreover, another key challenge is that there may not exist adequate participating users in reality. To encourage more users to participate, the social relationship among them can be leveraged, as users may be significantly influenced by their social friends. In this paper, we assume recruited users to diffuse uncompleted sensing tasks to their friends, and propose an efficient and truthful online incentive mechanism for a such social crowdsensing network. Specially, we model the time-varying social influence of a user by extending two metrics of node centrality used in social networks. In order to maximize the accumulated social welfare achieved by the network, we design a user selection algorithm and a payment determination algorithm respectively, in which payments given to participants not only depend on data qualities but also related with social influences. We theoretically prove that our mechanism achieves properties of computational efficiency, individual rationality, and truthfulness. Extensive simulations are conducted, and the results show the superiority of our mechanism. © 2021, ICST institute for Computer sciences, Social Informatics and Telecommunications engineering.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

A DQN-Based Approach for Online Service Placement in Mobile Edge Computing 16th

A DQN-Based Approach for Online Service Placement in Mobile ...

引用

16th EAI International Conference on Collaborative Computing: Networking, Applications, and Worksharing, CollaborateCom 2020

作者： Jie, Xiaogan Liu, Tong Gao, Honghao Cao, Chenhong Wang, Peng Tong, Weiqin School of Computer Engineering and Science Shanghai University Shanghai China Shanghai Key Laboratory of Data Science Shanghai China Shanghai Institute for Advanced Communication and Data Science Shanghai University Shanghai China Shanghai Engineering Research Center of Intelligent Computing System Shanghai China

ISBN: (纸本)9783030675394

Due to the development of 5G networks, computation intensive applications on mobile devices have emerged, such as augmented reality and video stream analysis. Mobile edge computing is put forward as a new computing paradigm, to meet the low-latency requirements of applications, by moving services from the cloud to the network edge like base stations. Due to the limited storage space and computing capacity of an edge server, service placement is an important issue, determining which services are deployed at edge to serve corresponding tasks. The problem becomes particularly complicated, with considering the stochastic arrivals of tasks, the additional latency incurred by service migration, and the time spent for waiting in queues for processing at edge. Benefiting from reinforcement learning, we propose a deep Q network based approach, by formulating service placement as a Markov decision process. Real-time service placement strategies are output, to minimize the total latency of arrived tasks in a long term. Extensive simulation results demonstrate that our approach works effectively. © 2021, ICST institute for Computer sciences, Social Informatics and Telecommunications engineering.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Detection and Classification of Transmission Line Transient Faults Based on Graph Convolutional Neural Network

引用

CSEE Journal of Power and Energy Systems 2021年第3期7卷 456-471页

作者： Houjie Tong Robert C.Qiu Dongxia Zhang Haosen Yang Qi Ding Xin Shi Department of Electrical Engineering Center for Big Data and Artificial IntelligenceShanghai Jiao Tong UniversityShanghai 200240China School of Electronic Information and Communication Huazhong University of Science and TechnologyWuhan 430000China Electric Power Research Institute Haidian DistrictBeijing 100192China School of Control and Computer Engineering North China Electric Power UniversityBeijing 102206China

We present a novel transient fault detection and classification approach in power transmission lines based on graph convolutional neural *** with the existing techniques,the proposed approach considers explicit spatial information in sampling sequences as prior knowledge and it has stronger feature extraction *** this basis,a framework for transient fault detection and classification is *** structure is generated to provide topology information to the *** approach takes the adjacency matrix of topology graph and the bus voltage signals during a sampling period after transient faults as inputs,and outputs the predicted classification results ***,the proposed approach is tested in various situations and its generalization ability is verified by experimental *** results show that the proposed approach can detect and classify transient faults more effectively than the existing techniques,and it is practical for online transmission line protection for its rapidness,high robustness and generalization ability.

关键词： Graph convolutional network(GCN) power transmission line fault detection and classification spatio-temporal data topology information

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：