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

arXiv 2025年

作者： Dai, Zeyu Liu, Shengcai He, Rui Wu, Jiahao Lu, Ning Fan, Wenqi Li, Qing Tang, Ke Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China Department of Computing The Hong Kong Polytechnic University Hong Kong

—Unrestricted adversarial examples (UAEs), allow the attacker to create non-constrained adversarial examples without given clean samples, posing a severe threat to the safety of deep learning models. Recent works utilize diffusion models to generate UAEs. However, these UAEs often lack naturalness and imperceptibility due to simply optimizing in intermediate latent noises. In light of this, we propose SemDiff, a novel unrestricted adversarial attack that explores the semantic latent space of diffusion models for meaningful attributes, and devises a multi-attributes optimization approach to ensure attack success while maintaining the naturalness and imperceptibility of generated UAEs. We perform extensive experiments on four tasks on three high-resolution datasets, including CelebA-HQ, AFHQ and ImageNet. The results demonstrate that SemDiff outperforms state-of-the-art methods in terms of attack success rate and imperceptibility. The generated UAEs are natural and exhibit semantically meaningful changes, in accord with the attributes’ weights. In addition, SemDiff is found capable of evading different defenses, which further validates its effectiveness and threatening. © 2025, CC BY-NC-SA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Provably Secure Certificateless Signature Scheme With Anonymity for Healthcare IIoT

引用

IEEE Internet of Things Journal 2025年

作者： Qiao, Zirui Xu, Ran Zhou, Yanwei Yang, Bo Zhu, Tianqing Zhang, Mingwu Xi’an University of Posts and Telecommunications School of Cyberspace Security Xi’an China Ministry of Education Key Laboratory of Data Protection and Intelligent Management China Shaanxi Normal University School of Computer Science Xi’an China City University of Macau Faculty of Data Science Macau China Hubei University of Technology School of Computer Wuhan China

The industrial Internet of Things (IIoT) is changing our way of life and work. As the number of mobile devices connected to IIoT increases, users will face many security challenges such as insecure communication environments. The certificateless signature (CLS) scheme can ensure the integrity and validity of data and provide secure identity authentication for the IIoT, and several pairing-free CLS schemes have been proposed in recent years. However, we find they are vulnerable to the signature forgery attack of malicious key generation centers by safety analysis, which does not realize the security they have claimed. To solve this problem, we show an improved CLS scheme that achieves anonymity and formally proves its security under the hardness of the discrete logarithm problem in the random oracle. Comprehensive performance analysis and comparison show that our scheme has less communication and computation costs with higher security, and our construction is suitable for scenarios with limited resources. Finally, we apply this scheme to construct a mutual identity authentication protocol in the healthcare IIoT environment. 2014 IEEE.

关键词： Anonymity

来源：评论

学校读者我要写书评

暂无评论

Air Pollution Monitoring By Integrating Local and Global Information in Self-Adaptive Multiscale Transform Domain

引用

IEEE Transactions on Multimedia 2025年

作者： Gu, Ke Liu, Yuchen Liu, Hongyan Liu, Bo Qiao, Junfei Lin, Weisi Zhang, Wenjun Beijing University of Technology School of Information Science and Technology Engineering Research Center of Intelligent Perception and Autonomous Control of Ministry of Education Beijing Laboratory of Smart Environmental Protection Beijing Key Laboratory of Computational Intelligence and Intelligent System Beijing Artificial Intelligence Institute Beijing100124 China Massey University School of Mathematical and Computational Sciences New Zealand Nanyang Technological University College of Computing and Data Science Singapore Shanghai Jiao Tong University Institute of Image Communication and Information Processing Shanghai China

As the deadliest form of pollution, air pollution had a prolonged severe damage to the human health and life safety of nearly 99% of the world's population. Facing to the problem that billions of tons of pollutants discharged into the air per year by industrial activities, this paper proposed a novel image-based air pollution monitor (IAPM) by incorporating local and global information in the self-adaptive multiscale transform domain, so as to achieve the timely and effective leakage detection of typical air pollutants from a single image. To be specific, this paper first developed a screen-shaped module according to two significant findings in visual neuroscience, which include the high sensitivity of human eyes to horizontal and vertical stimuli and the center-surround inhibition, by designing and fusing the square module, horizontal strip module and vertical strip module parallelly for simulating the behaviour of human eyes to extract local features. Second, the learnable weights and proportional mapping were applied to incorporate the screen-shaped module and lightweight vision transformer as backbone, towards more richly exploiting and fusing local and global information just as the way a brain perceives external stimuli. Third, a new self-adaptive multiscale transform domain method was devised based on two motivations from the visual characteristics of multiscale perception and the brain characteristics of self-adaptive domain transform to modify the backbone by using the operations of pooling and pointwise convolution. Extensive experiments implemented on the datasets of carbon particulate matters and ethylene leakage confirmed the superior monitoring performance of the proposed IAPM model beyond the state-of-the-art (SOTA) peers by an accuracy gain of about 4%. Furthermore, the proposed IAPM model only required 0.089 GFLOPs and 0.15 million model parameters, remarkably outperforming SOTA competitors in computational efficiency and storage resources. © 1999-2

关键词： Information leakage

来源：评论

学校读者我要写书评

暂无评论

GAEM: Graph-driven Attention-based Entropy Model for LiDAR Point Cloud Compression

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Cui, Mingyue Zhong, Yuyang Feng, Mingjian Long, Junhua Ling, Yehua Xu, Jiahao Huang, Kai Sun Yat-sen University School of Computer Science and Engineering Guangzhou400100 China Sun Yat-sen University key Laboratory of Machine Intelligence and Advanced Computing Guangzhou400100 China Nanyang Technological University College of Computing and Data Science 639798 Singapore Guangxi Transportation Science and Technology Group Co. Ltd Nanning530029 China

High-quality LiDAR point cloud (LPC) coding is essential for efficiently transmitting and storing the vast amounts of data required for accurate 3D environmental representation. The Octree-based entropy coding framework has emerged as the predominant method, however, previous study usually overly relies on large-scale attention-based context prediction to encode Octree nodes, overlooking the inherent correlational properties of this structure. In this paper, we propose a novel Graph-driven Attention-based Entropy Model (GAEM), which adopts partitioned graph attention mechanisms to uncover contextual dependencies among neighboring nodes. Different from the Cartesian coordinate-based coding mode with higher redundancy, GAEM uses the multi-level spherical Octree to organize point clouds, improving the quality of LPC reconstruction. GAEM combines graph convolution for node feature embedding and grouped-graph attention for exploiting dependency among contexts, which preserves performance in low-computation using localized nodes. Besides, to further increase the receptive field, we design a high-resolution cross-attention module introducing sibling nodes. Experimental results show that our method achieves state-of-the-art performance on the LiDAR benchmark SemanticKITTI and MPEG-specified dataset Ford, compared to all baselines. Compared to the benchmark GPCC, our method achieves gains of up to 53.9% and 53.6% on SemanticKITTI and Ford while compared to the sibling-introduced methods, we achieve up to 42.3% and 44.7% savings in encoding/decoding time. In particular, our GAEM allows for extension to downstream tasks (i.e., vehicle detection and semantic segmentation), further demonstrating the practicality of the method. (Figure presented) © 1991-2012 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorithm 19th

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorit...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Chen, Jiebin Hu, Ziqiang Ye, Renjie Zhang, Qishan Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Xianda College of Economics and Humanities Shanghai International Studies University Shanghai China

ISBN: (纸本)9789819623723

Large-scale graphs have become prevalent with the advent of the big data era. Distributed graph computing systems are commonly used for processing and analyzing large-scale graphs, with graph partitioning being a key prerequisite for their efficient computation. Graph partitioning aims to balance the load across partitions while minimizing the number of cut-edges. Moreover, it should achieve high efficiency and scalability. However, the existing popular graph partitioning algorithms do not fully take into account the internal topology of real-world graphs, which affects the final partition quality and convergence. Meanwhile, they easily fall into the local optimum due to partition load constraints. This paper introduces a Novel Optimized Balanced Graph Partitioning algorithm (NOBGP). First, we propose an initialization strategy based on label propagation of core vertices to achieve initial partitions with good locality and accelerate convergence. Second, we optimize the label propagation process to ensure balanced partitions and propose a probability-based disruption strategy to avoid the local optimum. We implement NOBGP on the distributed graph computing framework GraphX. Extensive experimental results on real-world graphs show that the proposed algorithm is scalable and performs better than the existing algorithms. We also run PageRank and Louvain applications using the graph partitioning results to demonstrate the efficiency of our algorithm. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： 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

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges

arXiv

引用

arXiv 2025年

作者： Zhou, Xiaotian Zehmakan, Ahad N. Zhang, Zhongzhi Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China Research Institute of Intelligent Complex Systems Fudan University Shanghai200433 China School of Computing Australian National University Canberra Australia

The Kirchhoff index, which is the sum of the resistance distance between every pair of nodes in a network, is a key metric for gauging network performance, where lower values signify enhanced performance. In this paper, we study the problem of minimizing the Kirchhoff index by adding edges. We first provide a greedy algorithm for solving this problem and give an analysis of its quality based on the bounds of the submodularity ratio and the curvature. Then, we introduce a gradient-based greedy algorithm as a new paradigm to solve this problem. To accelerate the computation cost, we leverage geometric properties, convex hull approximation, and approximation of the projected coordinate of each point. To further improve this algorithm, we use pre-pruning and fast update techniques, making it particularly suitable for large networks. Our proposed algorithms have nearly-linear time complexity. We provide extensive experiments on ten real networks to evaluate the quality of our algorithms. The results demonstrate that our proposed algorithms outperform the state-of-the-art methods in terms of efficiency and effectiveness. Moreover, our algorithms are scalable to large graphs with over 5 million nodes and 12 million edges. Copyright © 2025, The Authors. All rights reserved.

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Multivariate Time Series Anomaly Detection by Feature Decoupling in Federated Learning Scenarios

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年

作者： He, Yifan Ding, Xi Tang, Yateng Guan, Jihong Zhou, Shuigeng Fudan University School of Computer Science Shanghai200433 China Shanghai Key Laboratory of Intelligent Information Processing Shanghai200433 China Tencent Weixin Group Guangzhou510308 China Tongji University Department of Computer Science and Technology Shanghai201804 China Ministry of Education Key Laboratory of Embedded System and Service Computing Tongji University Shanghai200092 China

Anomalies are usually regarded as data errors or novel patterns previously unseen, which are quite different from most observed data. Accurate detection of anomalies is crucial in various application scenarios. This paper focuses on unsupervised anomaly detection from Multivariate Time Series (MTS), as real-world data collected from sources such as wearable devices, medical equipment and industrial machines typically manifest as MTS and are often unlabeled. Anomaly detection in MTS represents a data-driven challenge that traditionally requires substantial centralized data for training models. However, in practice, data are frequently distributed among multiple institutions, with privacy concerns restricting unrestricted access. To address these issues, we introduce Feature Decoupling Federated Learning (FDFL), an approach designed to collaboratively train a representation learning network over multiple clients for unsupervised anomaly detection in MTS. Unlike previous methods that simply integrate MTS anomaly detection algorithms with federated learning strategies, FDFL specifically addresses heterogeneity among clients by decoupling the representation network into shared and private branches through a contrastive learning mechanism. This method aggregates shared parameters during each federated round while maintaining client-specific private parameters locally. Additionally, we develop a self-attention block that integrates the representations derived from both shared and private parameters to reconstruct MTS and identify anomalies based on reconstruction errors. Extensive experiments conducted on three publicly available datasets demonstrate that FDFL outperforms existing algorithms in most cases, highlighting the effectiveness and superiority of our proposed method in MTS anomaly detection. © 2020 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Conditional Privacy-Preserving Transaction for the Unspent Transaction Output-Based Multi-Chain Blockchain System

引用

IEEE Transactions on Computers 2025年

作者： Cui, Jie Zhuang, Wenting Zhong, Hong Zhang, Qingyang Wang, Fengqun He, Debiao Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230039 China Anhui University Anhui Engineering Laboratory of IoT Security Technologies Hefei230039 China Wuhan University School of Cyber Science and Engineering Wuhan430072 China MatrixElements Technologies Shanghai Key Laboratory of Privacy Preserving Computation Shanghai201204 China

The anonymity of blockchain may be exploited by criminals for illegal fund transfers, thus a conditional privacy-preserving scheme is important for blockchain regulation. Currently, sharding technology under a multi-chain architecture is used to improve blockchain scalability. However, current conditional privacy-preserving schemes cannot work on this architecture. To protect the privacy of the transaction, we present a conditional privacy-preserving transaction scheme (MC-CPPT) for multi-chain blockchain system. In this system, we proposed a zero-knowledge proof based anonymous transaction, in terms of the identities of transaction participants and amounts, which also enables the unlinkability of transactions and indistinguishability between cross-chain and intra-chain transactions in multi-chain blockchain system. In addition, a multi-node regulatory agency is introduced to control the transaction amount and frequency in the system without a single point of failure. Moreover, an ECC-based encryption scheme is proposed to achieve the traceability of suspicious transactions. A security model is defined and the security of MC-CPPT is demonstrated to meet the expected security goals. Evaluating the prototype revealed acceptable performance and additional security features. © 1968-2012 IEEE.

关键词： Anonymity

来源：评论

学校读者我要写书评

暂无评论

Semi-Asynchronous Federated Split Learning for computing-Limited Devices in Wireless Networks

引用

IEEE Transactions on Wireless Communications 2025年

作者： Ao, Huiqing Tian, Hui Ni, Wanli Nie, Gaofeng Niyato, Dusit Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing100876 China Tsinghua University Department of Electronic Engineering Beijing100084 China Nanyang Technological University College of Computing and Data Science Singapore

The rapid evolution of edge computing and artificial intelligence (AI) paves the way for pervasive intelligence in the next-generation network. As a hybrid training paradigm, federated split learning (FSL) leverages data and model parallelism to enhance training efficiency. However, existing FSL encounters unacceptable waiting latency due to device heterogeneity and synchronous model aggregation. To address this issue, we propose a semi-asynchronous FSL (SAFSL) framework that enables personalized model splitting and aperiodic model aggregation. We derive the convergence upper bound by considering factors such as the number of devices, training iterations, and data heterogeneity. To minimize the long-term average training latency while maintaining high energy efficiency in resource-constrained wireless networks, we formulate a stochastic mixed-integer nonlinear programming problem. By decomposing it into multiple sub-problems in each round, we propose a Lyapunov-based alternating optimization algorithm to solve it in an online manner. Numerical results demonstrate that our SAFSL achieves faster convergence with reduced communication overhead while maintaining high prediction performance under non-independent and identically distributed data, outperforming state-of-the-art benchmarks. Moreover, our algorithm achieves a low training latency, highlighting its superior performance and effectiveness. © 2002-2012 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：