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

Density Peak Clustering Algorithm Based on Data Field Theory and Grid Similarity

Journal of computer Science and Technology 2025年第2期40卷 301-321页

作者： Yu, Qing-Ying Shi, Ge-Ge Xu, Dong-Sheng Wang, Wen-Kai Chen, Chuan-Ming Luo, Yong-Long School of Computer and Information Anhui Normal University Wuhu241002 China Anhui Provincial Key Laboratory of Network and Information Security Wuhu241002 China

The density peak clustering algorithm can rapidly identify cluster centers by drawing decision graphs without any prior knowledge;however, when multiple density peaks are present in one cluster of the dataset, the cluster centers cannot be accurately obtained, leading to incorrect clustering. Moreover, the single-step allocation strategy is poorly fault-tolerant and can lead to successive allocation errors. To address these problems, this study proposes a density peak clustering method based on data field theory and grid similarity, which divides the original data into grid spaces to obtain subspace codes and grid data. Subsequently, the potential grid density is introduced to measure the density of each grid based on the data field, and the density peaks are identified to obtain the cluster centers from the high-density grids. Finally, self-organized clustering is realized based on neighborhood extension centers and grid similarity. It thus reduces the possibility of successive assignment errors and the negative impact of multiple density peaks on the clustering results. In addition, the algorithm automatically determines the cluster centers and can correctly assign the non-density-peak grid to the corresponding clusters. Experimental results with synthetic and real-world datasets demonstrate that the proposed algorithm outperforms similar algorithms in terms of accuracy and efficiency when dealing with complex datasets with large density differences and cross-tangling. © Institute of Computing Technology, Chinese Academy of Sciences 2025.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Non-Line-of-Sight Multipath Classification Method for BDS Using Convolutional Sparse Autoencoder with LSTM

引用

Tsinghua Science and Technology 2025年第1期30卷 68-86页

作者： Yahang Qin Zhenni Li Shengli Xie Bo Li Ming Liu Victor Kuzin School of Automation Guangdong University of Technologyand also with Guangdong-Hong Kong-Macao Joint Laboratory for Smart Discrete ManufacturingGuangzhou 510006China School of Automation Guangdong University of TechnologyGuangdong Key Laboratory of IoT Information TechnologyGuangzhou 510006China 111 Center for Intelligent Batch Manufacturing Based on IoT Technology Key Laboratory of Intelligent Information Processing and System Integration of IoTMinistry of EducationGuangzhou 510006China Department of Electronic and Computer Engineering Hong Kong University of Science and TechnologHong Kong 999077China Academician of Russian Engineering Academy Moscow Moscow 125009Russia

Multipath signal recognition is crucial to the ability to provide high-precision absolute-position services by the BeiDou Navigation Satellite System(BDS).However,most existing approaches to this issue involve supervised machine learning(ML)methods,and it is difficult to move to unsupervised multipath signal recognition because of the limitations in signal *** by an autoencoder with powerful unsupervised feature extraction,we propose a new deep learning(DL)model for BDS signal recognition that places a long short-term memory(LSTM)module in series with a convolutional sparse autoencoder to create a new autoencoder ***,we propose to capture the temporal correlations in long-duration BeiDou satellite time-series signals by using the LSTM module to mine the temporal change patterns in the time ***,we develop a convolutional sparse autoencoder method that learns a compressed representation of the input data,which then enables downscaled and unsupervised feature extraction from long-duration BeiDou satellite series ***,we add an l_(1/2) regularizer to the objective function of our DL model to remove redundant neurons from the neural network while ensuring recognition *** tested our proposed approach on a real urban canyon dataset,and the results demonstrated that our algorithm could achieve better classification performance than two ML-based methods(e.g.,11%better than a support vector machine)and two existing DL-based methods(e.g.,7.26%better than convolutional neural networks).

关键词： convolutional sparse autoencoder BeiDou Navigation Satellite System(BDS) long short-term memory(LSTM) multipath classification

来源：评论

学校读者我要写书评

暂无评论

C-privacy: A social relationship-driven image customization sharing method in cyber-physical networks

引用

Digital Communications and networks 2025年第2期11卷 563-573页

作者： Wu, Dapeng Liu, Jian Wan, Yangliang Yang, Zhigang Wang, Ruyan Lin, Xinqi School of Communications and Information Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China Aerospace Tianmu Satellite Technology Company Limited Chongqing401332 China School of Cyber Security and Information Law Chongqing University of Posts and Telecommunications Chongqing400065 China College of Computer and Cyber Security Fujian Normal University Fujian 350117 China The Advanced Network and Intelligent Connection Technology Key Laboratory Chongqing400065 China Key Laboratory of Ubiquitous Sensing and Networking Chongqing400065 China

Cyber-Physical networks (CPN) are comprehensive systems that integrate information and physical domains, and are widely used in various fields such as online social networking, smart grids, and the Internet of Vehicles (IoV). With the increasing popularity of digital photography and Internet technology, more and more users are sharing images on CPN. However, many images are shared without any privacy processing, exposing hidden privacy risks and making sensitive content easily accessible to Artificial Intelligence(AI) algorithms. Existing image sharing methods lack fine-grained image sharing policies and cannot protect user privacy. To address this issue, we propose a social relationship-driven privacy customization protection model for publishers and co-photographers. We construct a heterogeneous social information network centered on social relationships, introduce a user intimacy evaluation method with time decay, and evaluate privacy levels considering user interest similarity. To protect user privacy while maintaining image appreciation, we design a lightweight face-swapping algorithm based on Generative Adversarial network (GAN) to swap faces that need to be protected. Our proposed method minimizes the loss of image utility while satisfying privacy requirements, as shown by extensive theoretical and simulation analyses. © 2024

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

C-privacy: A social relationship-driven image customization sharing method in cyber-physical networks

引用

Digital Communications and networks 2025年第02期 563-573页

作者： Dapeng Wu Jian Liu Yangliang Wan Zhigang Yang Ruyan Wang Xinqi Lin School of Communications and Information Engineering Chongqing University of Posts and Telecommunications The Advanced Network and Intelligent Connection Technology Key Laboratory Key Laboratory of Ubiquitous Sensing and Networking Aerospace Tianmu Satellite Technology Company Limited School of Cyber Security and Information Law Chongqing University of Posts and Telecommunications College of Computer and Cyber Security Fujian Normal University

Cyber-Physical networks(CPN) are comprehensive systems that integrate information and physical domains, and are widely used in various fields such as online social networking, smart grids, and the Internet of Vehicles(IoV). With the increasing popularity of digital photography and Internet technology, more and more users are sharing images on CPN. However, many images are shared without any privacy processing, exposing hidden privacy risks and making sensitive content easily accessible to Artificial Intelligence(AI) algorithms. Existing image sharing methods lack fine-grained image sharing policies and cannot protect user privacy. To address this issue, we propose a social relationship-driven privacy customization protection model for publishers and co-photographers. We construct a heterogeneous social information network centered on social relationships, introduce a user intimacy evaluation method with time decay, and evaluate privacy levels considering user interest similarity. To protect user privacy while maintaining image appreciation, we design a lightweight face-swapping algorithm based on Generative Adversarial network(GAN) to swap faces that need to be protected. Our proposed method minimizes the loss of image utility while satisfying privacy requirements, as shown by extensive theoretical and simulation analyses.

关键词：

来源：评论

学校读者我要写书评

暂无评论

引用

8th International Congress on Edge Computing, EDGE 2024, Held as Part of the Services Conference Federation, SCF 2024

作者： Tian, Yun Wu, Bin Shi, Jiaoli Zhang, Caicai Xu, Du School of Computer and Big Data Science Jiujiang University Jiujiang332005 China Jiujiang Key Laboratory of Network and Information Security Jiujiang332005 China School of Modern Information Technology Zhejiang Polytechnic University of Mechanical and Electrical Engineering Hangzhou310053 China

ISBN: (纸本)9783031770685

The development of cloud computing and the widespread application of cloud services have made outsourcing services more convenient. The need for individuals and businesses to store and manipulate the graph data they generate is growing rapidly. The unreliability and insecurity of cloud servers make outsourcing graph data a great risk of information leakage. To effectively protect data security, encrypting outsourced data is a useful method. The adjacent vertex query is a very commonly used and fundamental operation, and similarity search is a widely used and powerful tool to improve the scope and functionality of queries. After outsourcing encrypted sparse graph data to cloud servers, it becomes very inconvenient to use and manipulate the data. In this work, we present a scheme to realize the adjacent vertex query supporting similarity search on sparse graph data in cloud environment (SSAQ), which also protects the security of the information. This work uses edit distance and the searchable encryption principle to construct query index, and next implement the similar adjacent vertex query on cloud server. This work provides a formal security analysis, and also gives the experimental comparison and analysis. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： information leakage

来源：评论

学校读者我要写书评

暂无评论

Rehearse With User: Personalized Opinion Summarization via Role-Playing based on Large Language Models

arXiv

引用

arXiv 2025年

作者： Zhang, Yanyue He, Yulan Zhou, Deyu School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University China Department of Informatics King’s College London United Kingdom The Alan Turing Institute

Personalized opinion summarization is crucial as it considers individual user interests while generating product summaries. Recent studies show that although large language models demonstrate powerful text summarization and evaluation capabilities without the need for training data, they face difficulties in personalized tasks involving long texts. To address this, Rehearsal, a personalized opinion summarization framework via LLMs-based role-playing is proposed. Having the model act as the user, the model can better understand the user’s personalized needs. Additionally, a role-playing supervisor and practice process are introduced to improve the role-playing ability of the LLMs, leading to a better expression of user needs. Furthermore, through suggestions from virtual users, the summary generation is intervened, ensuring that the generated summary includes information of interest to the user, thus achieving personalized summary generation. Experiment results demonstrate that our method can effectively improve the level of personalization in large model-generated summaries. Copyright © 2025, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Multi-Instance Partial-Label Learning with Margin Adjustment

arXiv

引用

arXiv 2025年

作者： Tang, Wei Yang, Yin-Fang Wang, Zhaofei Zhang, Weijia Zhang, Min-Ling School of Computer Science and Engineering Southeast University Nanjing210096 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China School of Information and Physical Sciences The University of Newcastle CallaghanNSW2308 Australia

Multi-instance partial-label learning (MIPL) is an emerging learning framework where each training sample is represented as a multi-instance bag associated with a candidate label set. Existing MIPL algorithms often overlook the margins for attention scores and predicted probabilities, leading to suboptimal generalization performance. A critical issue with these algorithms is that the highest prediction probability of the classifier may appear on a non-candidate label. In this paper, we propose an algorithm named MIPLMA, i.e., Multi-Instance Partial-Label learning with Margin Adjustment, which adjusts the margins for attention scores and predicted probabilities. We introduce a margin-aware attention mechanism to dynamically adjust the margins for attention scores and propose a margin distribution loss to constrain the margins between the predicted probabilities on candidate and non-candidate label sets. Experimental results demonstrate the superior performance of MIPLMA over existing MIPL algorithms, as well as other well-established multi-instance learning algorithms and partial-label learning algorithms. Copyright © 2025, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

BAV-DSS: Blockchain Assisted Verifiable Data Sharing Scheme with Fast Encryption and Outsourced Decryption for IoT 24th

BAV-DSS: Blockchain Assisted Verifiable Data Sharing Scheme ...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Huang, Yao Yu, Zhongyuan Wang, Guijuan Chai, Baobao Zhang, Hongliang Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan250353 China School of Information Science and Engineering Lanzhou University Lanzhou730000 China School of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China

ISBN: (纸本)9789819615414

Many sophisticated cloud platforms are available to provide services such as storage and computation for Internet of Things (IoT) applications. However, with the concerns about the semi-trusted nature of cloud platforms, data security and privacy have been gaining broad attention. In this paper, we propose a blockchain-assisted verifiable data sharing scheme (BAV-DSS) for IoT. The BAV-DSS features fine-grained access control, fast encryption, and outsourced decryption with verifiability. Specifically, with the application of ciphertext-policy attribute-based encryption (CP-ABE), flexible access control is enabled. Blockchain is employed to store public keys, generate account addresses, and perform data verification. Furthermore, the selective replayable chosen ciphertext attacks (sRCCA) security of BAV-DSS is proved, and the simulation results indicate that BAV-DSS obtains high efficiency and practicality compared to other schemes. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

Do Not Trust What They Tell: Exposing Malicious Accomplices in Tor via Anomalous Circuit Detection 25

Do Not Trust What They Tell: Exposing Malicious Accomplices ...

引用

Proceedings of the ACM on Web Conference 2025

作者： Yixuan Yao Ming Yang Zixia Liu Kai Dong Xiaodan Gu Chunmian Wang Southeast University Nanjing Jiangsu China Anhui University of Technology Maanshan Anhui China and Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education Nanjing Jiangsu China

ISBN: (纸本)9798400712746

The Tor network, while offering anonymity through traffic routing across volunteer-operated nodes, remains vulnerable to attacks that aim to deanonymize users by correlating traffic patterns between colluded entry and exit nodes in circuits. This paper presents a novel approach for detecting anomalous circuits in the Tor network, and for the first time provides a more comprehensive identification of potential malicious accomplice nodes in Tor by taking roles of nodes in anomalous circuits into consideration. Our method strategically utilizes modified middle nodes to capture traffic data, followed by a novel circuit classification based on traffic patterns to pinpoint concerned circuits. Two kinds of anomalies are identified: routing anomalies and usage anomalies, that respectively represent the anomalies with explicit or implicit violation of Tor's circuit construction guidelines. This leads to a successful revealing of totally 1,960 anomalous nodes in Tor. Furthermore, we apply clustering analysis with considering corresponding anomalous circuits and other key characteristics to the detected anomalous nodes, revealing potential hidden organizations behind these nodes that can threaten the network's security. Our findings highlight the necessity for the Tor project to adopt targeted mitigation strategies to enhance overall network security and privacy.

关键词： Tor network

来源：评论

学校读者我要写书评

暂无评论

ALFC-Point: Adaptive Laplacian Feature Convolution network for 3D Point Cloud Understanding 41st

ALFC-Point: Adaptive Laplacian Feature Convolution Network f...

引用

41st computer Graphics International Conference, CGI 2024

作者： Liao, Junjie Yin, Mengxiao Li, Ming Zhu, Congyang Yang, Zhiqiang Zhan, Feng School of Computer and Electronics Information Guangxi University Guangxi Nanning530004 China Guangxi Key Laboratory of Multimedia Communications and Network Technology Guangxi Nanning530004 China Education Department of Guangxi Zhuang Autonomous Region Nanning China

ISBN: (纸本)9783031820236

To capture 3D geometric details, point cloud understanding primarily employs convolution, dynamic map, or transformer methods to build complex local geometry extractors. When dealing with sparse and noisy point clouds in real-world environments, the structural design of these methods tends to be complex and perform poorly. In this paper, we propose a lightweight point cloud understanding framework based on Laplacian feature convolution, which has high accuracy on normal-sized point cloud datasets and performs well when dealing with sparse and noisy point cloud inputs. The adaptive Laplacian convolution module combined with the vector attention mechanism can effectively capture the local details of point cloud geometry. The framework employs a multi-scale feature fusion mechanism between modules to reduce the number of sampling points step by step, reducing redundant computations and achieving a lightweight effect. In addition, we propose a parameter-free module for interpolation to enhance the training part. Experimental results on object-level datasets show that the lightweight method proposed in our paper has similar accuracy to the current best method in terms of accuracy (Acc) and mean intersection over union (mIoU), and has better robustness in handling sparse and noisy point clouds. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Laplace transforms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：