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

arXiv 2023年

作者： Lin, Longlong Yuan, Pingpeng Li, Rong-Hua Zhu, Chunxue Qin, Hongchao Jin, Hai Jia, Tao College of Computer and Information Science Southwest University Chongqing400715 China National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China School of Computer Science and Technololgy Beijing Institute of Technology Beijing100081 China

Existing temporal community search suffers from two defects: (i) they ignore the temporal proximity between the query vertex q and other vertices but simply require the result to include q. Thus, they find many temporal irrelevant vertices (these vertices are called query-drifted vertices) to q for satisfying their cohesiveness, resulting in q being marginalized;(ii) their methods are NP-hard, incurring high costs for exact solutions or compromised qualities for approximate/heuristic algorithms. Inspired by these, we propose a novel problem named query-centered temporal community search to circumvent query-drifted vertices. Specifically, we first present a novel concept of Time-Constrained Personalized PageRank to characterize the temporal proximity between q and other vertices. Then, we introduce a model called β-temporal proximity core, which can combine temporal proximity and structural cohesiveness. Subsequently, our problem is formulated as an optimization task that finds a β-temporal proximity core with the largest β. To solve our problem, we first devise an exact and near-linear time greedy removing algorithm that iteratively removes unpromising vertices. To improve efficiency, we then design an approximate two-stage local search algorithm with bound-based pruning techniques. Finally, extensive experiments on eight real-life datasets and nine competitors show the superiority of the proposed solutions. © 2023, CC BY.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

BeamVQ: Beam Search with Vector Quantization to Mitigate Data Scarcity in Physical Spatiotemporal Forecasting

arXiv

引用

arXiv 2025年

作者： Wang, Weiyan Shi, Xingjian Shu, Ruiqi Gao, Yuan Chen, Rui Ray Wang, Kun Xu, Fan Xue, Jinbao Li, Shuaipeng Tao, Yangyu Wang, Di Wu, Hao Huang, Xiaomeng TEG Tencent China Boson AI United States Department of Earth System Science Ministry of Education Key Laboratory for Earth System Modeling Institute for Global Change Studies Tsinghua University China Institute for Interdisciplinary Information Sciences Tsinghua University China School of Computer Science and Engineering Nanyang Technological University Singapore Department and Computer and Science University of Science and Technology of China China

In practice, physical spatiotemporal forecasting can suffer from data scarcity, because collecting large-scale data is non-trivial, especially for extreme events. Hence, we propose BeamVQ, a novel probabilistic framework to realize iterative self-training with new self-ensemble strategies, achieving better physical consistency and generalization on extreme events. Following any base forecasting model, we can encode its deterministic outputs into a latent space and retrieve multiple codebook entries to generate probabilistic outputs. Then BeamVQ extends the beam search from discrete spaces to the continuous state spaces in this field. We can further employ domain-specific metrics (e.g., Critical Success Index for extreme events) to filter out the top-k candidates and develop the new self-ensemble strategy by combining the high-quality candidates. The self-ensemble can not only improve the inference quality and robustness but also iteratively augment the training datasets during continuous self-training. Consequently, BeamVQ realizes the exploration of rare but critical phenomena beyond the original dataset. Comprehensive experiments on different benchmarks and backbones show that BeamVQ consistently reduces forecasting MSE (up to 39%), enhancing extreme events detection and proving its effectiveness in handling data scarcity. Our codes are available at https://***/easylearningscores/BeamVQ. © 2025, CC BY.

关键词： Spatio-temporal data

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities

arXiv

引用

arXiv 2024年

作者： Li, Zhen Wang, Ning Zou, Deqing Li, Yating Zhang, Ruqian Xu, Shouhuai Zhang, Chao Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Department of Computer Science University of Colorado Colorado Springs Colorado SpringsCO United States Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab China JinYinHu Laboratory Wuhan China

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter-Procedural Vulnerability Dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers;and (ii) function-level vulnerability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities. Copyright © 2024, The Authors. All rights reserved.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Covert Communication in Satellite-Terrestrial systems with a Full-Duplex Receiver

Covert Communication in Satellite-Terrestrial Systems with a...

引用

2024 International Conference on Satellite Internet, SAT-NET 2024

作者： Guo, Zewei Sun, Ranran He, Ji Shen, Yulong Jiang, Xiaohong Future University Hakodate School of Systems Information Science Hakodate041-8655 Japan Hangzhou Institute of Technology Xidian University Hangzhou311200 China Xidian University School of Computer Science and Technology Xi'an710071 China Institute of Systems General Academy of Systems Engineering Academy of Military Sciences Beijing100101 China Xidian University Shaanxi Key Laboratory of Network and System Security Xi'an710071 China

ISBN: (纸本)9798350375176

This paper investigates the covert communication in a satellite-terrestrial system, including a satellite transmitter Alice, a terrestrial full-duplex receiver Bob and a terrestrial warden Willie. To help the covert transmission from Alice, the full-duplex Bob transmits the jamming signal to confuse Willie and also receives the signal from Alice simultaneously. To explore the fundamental covertness in such a system, we first provide theoretical modelings for satellite-terrestrial downlink, and the detection error probability of Willie. Based on these models, we then study the transmit power optimization for covert rate maximization. Finally, we present extensive numerical results to validate our theoretical analysis and to illustrate the impact of various system parameters on the maximum covert rate. © 2024 IEEE.

关键词： Satellite communication systems

来源：评论

学校读者我要写书评

暂无评论

SADBA: Self-Adaptive Distributed Backdoor Attack Against Federated Learning 39

SADBA: Self-Adaptive Distributed Backdoor Attack Against Fed...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Feng, Jun Lai, Yuzhe Sun, Hong Ren, Bocheng Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Economics Wuhan Textile University China School of Computer Science and Technology Hainan University China

ISBN: (纸本)157735897X

Backdoor attacks in federated learning (FL) face challenges such as lower attack success rates and compromised main task accuracy (MA) compared to local training. Existing methods like distributed backdoor attack (DBA) mitigate these issues by modifying malicious clients’ updates and partitioning global triggers to enhance backdoor persistence and stealth. The recent full combination backdoor attack (FCBA) further improves backdoor efficiency with a full combination strategy. However, these methods are mainly applicable in small-scale FL. In large-scale FL, small trigger patterns weaken impact, and scaling them requires controlling exponentially more clients, which poses significant challenges, while simply reverting to DBA may decrease backdoor performance. To overcome these challenges, we propose the self-adaptive distributed backdoor attack (SADBA), which achieves similar performance to FCBA with a lower percentage of malicious clients (PMC). It also adapts more flexibly through an optimized model poisoning strategy and a self-adaptive data poisoning strategy. Experiments demonstrate SADBA outperforms state-of-the-art methods, achieving higher or comparable backdoor performance and MA across various datasets with limited PMC. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Graph-Augmented Contrastive Clustering for Time Series Data

SSRN

引用

SSRN 2024年

作者： Zhang, Qin Liang, Zhuoluo Ngueilbaye, Alladoumbaye Liu, Han Zhou, Hong Huang, Joshua Zhexue College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Guangzhou University China

The recent emergence of time series contrastive clustering methods can be categorized into two classes. The first class uses contrastive learning for universal representations, which can be effective in various downstream tasks, but overlooks important categorical information and clustering objectives, leading to unsuitable models. The second class incorporates contrastive learning into clustering objectives but fails to fully explore potential connections and structures between time series data. To this end, we propose the "Time Series Graph-augmented Contrastive Clustering (TSGCC) method", a graph-augmented contrastive learning framework aiming to create cluster-friendly features and assignments by iteratively optimizing contrastive loss. The method uses a weighted KNN graph to build positive and negative sample pairs, projecting the instances into a feature space with the dimensionality number of clusters. Experimental results demonstrate that TSGCC outperforms 18 advanced time-series clustering methods on the 36 representatives out of the 128 UCR benchmarks, achieving the best clustering results on 12 datasets, with the highest average rank (3.22) of RI and the second-highest average rank (3.89) of NMI among 18 clustering methods. We further compared our method with recent approaches on the entire set of 128 UCR datasets, demonstrating our method's broad applicability and effectiveness. © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

DuSSS: Dual Semantic Similarity-Supervised Vision-Language Model for Semi-Supervised Medical Image Segmentation

arXiv

引用

arXiv 2024年

作者： Pan, Qingtao Qiao, Wenhao Lou, Jingjiao Ji, Bing Li, Shuo School of Control Science and Engineering Shandong University Jinan China Key Laboratory of Machine Intelligence and System Control Ministry of Education China Department of Computer and Data Science Department of Biomedical Engineering Case Western Reserve University United States

Semi-supervised medical image segmentation (SSMIS) uses consistency learning to regularize model training, which alleviates the burden of pixel-wise manual annotations. However, it often suffers from error supervision from low-quality pseudo labels. Vision-Language Model (VLM) has great potential to enhance pseudo labels by introducing text prompt guided multimodal supervision information. It nevertheless faces the cross-modal problem: the obtained messages tend to correspond to multiple targets. To address aforementioned problems, we propose a Dual Semantic Similarity-Supervised VLM (DuSSS) for SSMIS. Specifically, 1) a Dual Contrastive Learning (DCL) is designed to improve cross-modal semantic consistency by capturing intrinsic representations within each modality and semantic correlations across modalities. 2) To encourage the learning of multiple semantic correspondences, a Semantic Similarity-Supervision strategy (SSS) is proposed and injected into each contrastive learning process in DCL, supervising semantic similarity via the distribution-based uncertainty levels. Furthermore, a novel VLM-based SSMIS network is designed to compensate for the quality deficiencies of pseudo-labels. It utilizes the pretrained VLM to generate text prompt guided supervision information, refining the pseudo label for better consistency regularization. Experimental results demonstrate that our DuSSS achieves outstanding performance with Dice of 82.52%, 74.61% and 78.03% on three public datasets (QaTa-COV19, BM-Seg and MoNuSeg). Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Defect Screening on Nuclear Power Plant Concrete Structures: A Two-staged Method Based on Contrastive Representation Learning

Defect Screening on Nuclear Power Plant Concrete Structures:...

引用

International Conference on Advanced Robotics and Mechatronics (ICARM)

作者： Wenlian Huang Guanming Zhu Qiang Huang Zhuangzhuang Chen Jie Chen Jianqiang Li College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

Intelligent defect detection methods are important for the surface of the containment of nuclear power plants and face many challenges in the field of computer vision. Due to the irregular shapes and large variation of defects, as well as the similarity of the features between some defects and the background. Most existing deep learning-based defect detection networks suffer from insufficient feature extraction capabilities, making it difficult to detect defects from the background. Inspired by discrete representation learning methods, we propose a two-stage defect detection model called ConVQVAE, which uses a semi-supervised method for representation learning to achieve binary classification for defect detection. In addition, contrastive learning is performed in two stages to enhance the model's diversity representation ability and inter-class disentanglement representation ability. Finally, we experimentally verify that the proposed method can obtain good classification results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

VT-SGN:Spiking Graph Neural Network for Neuromorphic Visual-Tactile Fusion

引用

IEEE Transactions on Haptics 2024年 PP卷 PP-PP页

作者： Wu, Peiliang Zhang, Haozhe Li, Yao Chen, Wenbai Gao, Guowei Yanshan University School of Information Science and Engineering Qinhuangdao066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao066004 China Beijing Information Science and Technology University School of Automation Beijing100192 China

Current issues with neuromorphic visual-tactile perception include limited training network representation and inadequate cross-modal fusion. To address these two issues, we proposed a dual network called visual-tactile spiking graph neural network (VT-SGN) that combines graph neural networks and spiking neural networks to jointly utilize the neuromorphic visual and tactile source data. First, the neuromorphic visual-tactile data were expanded spatiotemporally to create a taxel-based tactile graph in the spatial domain, enabling the complete exploitation of the irregular spatial structure properties of tactile information. Subsequently, a method for converting images into graph structures was proposed, allowing the vision to be trained alongside graph neural networks and extracting graph-level features from the vision for fusion with tactile data. Finally, the data were expanded into the time domain using a spiking neural network to train the model and propagate it backwards. This framework effectively utilizes the structural differences between sample instances in the spatial dimension to improve the representational power of spiking neurons, while preserving the biodynamic mechanism of the spiking neural network. Additionally, it effectively solves the morphological variance between the two perceptions and further uses complementary data between visual and tactile. To demonstrate that our approach can improve the learning of neuromorphic perceptual information, we conducted comprehensive comparative experiments on three datasets to validate the benefits of the proposed VT-SGN framework by comparing it with state-of-the-art studies. © 2008-2011 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

IBATree: A Novel Method for Interpretable Cancer Cell Diagnosis Using Information Bottleneck Attribution

IBATree: A Novel Method for Interpretable Cancer Cell Diagno...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Muhammad Umair Raza Jie Chen Adil Nawaz Faisal Saeed Victor C.M. Leung Jianqiang Li Zhaoxia Wang College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Department of Gastroenterology Shenzhen Children’s Hospital China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Deep Neural Networks (DNNs) have demonstrated remarkable performance in classification and regression tasks on RGB-based pathological inputs. The network’s prediction mechanism must be interpretable to establish trust in the clinical routine. One principal approach to interpretation is feature attribution. Feature attribution methods identify the importance of input features for the output prediction. Building on the Information Bottleneck Attribution (IBA) method, we recognize the RGB’s input regions with high mutual information with the network’s output for each prediction. IBA identifies input regions that have sufficient predictive information. In this paper, we introduce "IBATree", a novel approach that combines IBA with decision trees to enhance both the interpretability and accuracy of DNNs in cancer cell classification. Our method leverages the information bottleneck framework to inject noise into feature maps and then isolates the most informative features for model predictions while maintaining high classification performance. We evaluated our proposed approach on three datasets—CNMC, ISBI2016, and BreaKHis—demonstrating competitive accuracy and producing clear interpretations. This makes IBATree particularly suitable for clinical applications, where understanding the rationale behind predictions is crucial. Our results show that IBATree provides reliable predictions and valuable insights into feature importance, paving the way for its application in various biomedical domains.

关键词： Pathology Accuracy Biological system modeling Noise Predictive models Reliability Decision trees Biological cells Cancer Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：