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

Robust Quantum Feature Selection With Sparse Optimization Circuit

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2025年

作者： Li, Jiaye Song, Jiagang Shi, Jinjing Xu, Hang Yu, Hao Chen, Gang Zhang, Shichao Zhejiang University State Key Laboratory of Blockchain and Data Security Hangzhou310027 China Institute of Blockchain and Data Security China Central South University School of Computer Science and Engineering Changsha410083 China Central South University School of Electronic Information Changsha410083 China Xiangtan University School of Computer Science and School of Cyberspace Science Hunan Xiangtan411105 China Guangxi Normal University Guangxi Key Lab of Multisource Information Mining and Security Guilin541004 China

High-dimensional data has long been a notoriously challenging issue. Existing quantum dimension reduction technology primarily focuses on quantum principal component analysis. However, there are only a few studies on quantum feature selection (QFS) algorithms, and these algorithms are often not robust. Additionally, there are limited quantum circuits specifically designed for feature selection, and they still cannot address the objective function based on sparse learning. To address these issues, this paper proposes a robust QFS algorithm by designing a novel sparse optimization circuit. Specifically, we first apply sparse regularization and least squares loss to construct the proposed objective function. Then, six types of quantum registers and their initial states are prepared. Furthermore, quantum techniques such as quantum phase estimation and controlled rotation are employed to construct a sparse optimization circuit, which is used to obtain the final quantum state of the feature selection ***, a series of experiments are conducted to verify the accuracy of the feature selection and the robustness of the proposed algorithm. © 1982-2012 IEEE.

关键词： Quantum electronics

来源：评论

学校读者我要写书评

暂无评论

Suppress Content Shift: Better Diffusion Features via Off-the-Shelf Generation Techniques 38

Suppress Content Shift: Better Diffusion Features via Off-th...

引用

38th Conference on Neural information Processing Systems, NeurIPS 2024

作者： Meng, Benyuan Xu, Qianqian Wang, Zitai Yang, Zhiyong Cao, Xiaochun Huang, Qingming Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China Peng Cheng Laboratory China School of Computer Science and Tech. University of Chinese Academy of Sciences China School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University China Key Laboratory of Big Data Mining and Knowledge Management CAS China

Diffusion models are powerful generative models, and this capability can also be applied to discrimination. The inner activations of a pre-trained diffusion model can serve as features for discriminative tasks, namely, diffusion feature. We discover that diffusion feature has been hindered by a hidden yet universal phenomenon that we call content shift. To be specific, there are content differences between features and the input image, such as the exact shape of a certain object. We locate the cause of content shift as one inherent characteristic of diffusion models, which suggests the broad existence of this phenomenon in diffusion feature. Further empirical study also indicates that its negative impact is not negligible even when content shift is not visually perceivable. Hence, we propose to suppress content shift to enhance the overall quality of diffusion features. Specifically, content shift is related to the information drift during the process of recovering an image from the noisy input, pointing out the possibility of turning off-the-shelf generation techniques into tools for content shift suppression. We further propose a practical guideline named GATE to efficiently evaluate the potential benefit of a technique and provide an implementation of our methodology. Despite the simplicity, the proposed approach has achieved superior results on various tasks and datasets, validating its potential as a generic booster for diffusion features. Our code is available at this url. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving IoT Image Transmission: Multi-Stage SVD Data Embedding and Heatmap Alignment

引用

IEEE Internet of Things Journal 2025年

作者： Du, Kaixin Ma, Bin Yang, Meihong Wang, Xiaoyu Li, Xiaolong Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250101 China Beijing Jiaotong University School of Computer and Information Technology Beijing100044 China

The images transmitted by IoT devices, particularly those used for surveillance or sensor data, are vulnerable to malicious screenshots and unauthorized access, leading to potential privacy breaches. To address this, we propose a multi-stage Singular Value Decomposition (SVD)-based robust data-hiding scheme for JPEG images aimed at mitigating screenshot attacks. The method exploits the decorrelation properties of the Discrete Cosine Transform (DCT) to preprocess the carrier image, facilitating the selection of specific frequency coefficients. These coefficients undergo a dual-stage SVD transformation, where dimensionality reduction reduces the impact of noise from non-critical image regions. Additionally, we optimize Grad-CAM heatmap generation to better align with human visual perception, enabling the identification of stable and reliable feature regions for embedding secret information. This approach ensures that the visual integrity of the carrier image is maintained while preserving the legibility of the embedded information, even under *** method enhances both the visual fidelity of the carrier image and the robustness of the embedded information. Experimental results demonstrate that the proposed scheme outperforms existing methods, achieving at least a 5% improvement in confidential information extraction accuracy and a data extraction rate exceeding 95% across screenshot angles ranging from -40∘ to 40∘. Extensive evaluations confirm the superior performance, efficiency, and security of our method in mitigating screenshot attacks, showcasing its broad applicability to various image formats and resilience to distortions. © 2014 IEEE.

关键词： Discrete cosine transforms

来源：评论

学校读者我要写书评

暂无评论

Partially Hidden Policy Attribute-Based Multi-keyword Searchable Encryption with Verification and Revocation

引用

IEEE Transactions on Mobile Computing 2025年

作者： Chen, Liqing Xu, Shiguo Jin, Chunhua Zhang, Hao Weng, Jian Huaiyin Institute of Technology Faculty of Computer and Software Engineering Jiangsu Huai'an223003 China Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Fuzhou350117 China Jinan University College of Information Science and Technology Guangdong Guangzhou510632 China

Data security is becoming increasingly critical as outsourced data services flourish. An effective solution for ensuring data confidentiality in the cloud is attribute-based searchable encryption (ABSE). However, most extant ABSE solutions have not been able to simultaneously achieve rich expressive queries, result validation, attribute revocation, and policy hiding, and there are problems such as inflexibility in query methods and access control capabilities, insufficient scalability and practicality, and privacy leakage. In particular, it should be noted that most ABSE schemes fail to promise the privacy security of access policies and are susceptible to offline keyword guessing attack. Hidden policy-ABSE (HP-ABSE) has been proposed to tackle the issue of explicit attribute values in access policies potentially compromising privacy. Nevertheless, in most existing HP-ABSE schemes, an adversary may initiate attribute values guessing attack to speculate on the values of attribute within access strategy. To this end, this paper proposes partially hidden policy attribute-based multi-keyword searchable encryption with verification and revocation (PHP-ABMKSE-VR). PHP-ABMKSE-VR scheme is practical, secure, as well as effective, making it appropriate for real-world scenarios like smart healthcare, as demonstrated by the experimental outcomes and safety analysis. © 2002-2012 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Funny words detection via Contrastive Representations and Pre-trained Language Model 2

Funny words detection via Contrastive Representations and Pr...

引用

2nd International Seminar on Artificial Intelligence, networking and information Technology, AINIT 2021

作者： Du, Yiming Tian, Zelin Key Lab of Computer Network and Information Integration Nanjing China University of British Columbia Dept. Computer Science Vancouver Canada

ISBN: (纸本)9781665412964

Funniness detection of news headlines is a challenging task in computational linguistics. However, most existing works on funniness detection mainly tackle the scenario by simply judging whether a sentence is humorous, whose result is unstable due to factors such as sentence length. To solve this issue, in this paper, our idea is to fine-grained mine the detailed information of the words and the contextual relationship between different words in the sentence, which help to evaluate the correlation between keywords and the funniness of news headlines quantitatively. Specifically, we propose a funny words detection algorithm based on the contrastive representations learning and BERT model. To quantify the impact of different words on the degree of humor, we first subtract the funniness grades of the original news headlines and the funniness grades of the original news headlines with a single word replaced. Both funniness grades are predicted with a pre-trained model, which is supervised by a a threshold to limit the amount of data and ensure the validity of data. To ensure the accuracy of our prediction, we further introduce the contrastive learning to constrain the differences of news headlines before and after word replacement. Finally, according to the Root Mean Square Error (RMSE) matrix in our experiment, we develop a BERT model with mixed sequence embedding to generate a table about words and their corresponding funniness improvement about the news headlines. © 2021 IEEE.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation for Mutualistic Symbiotic Radio with Hybrid Active-Passive Communications

Resource Allocation for Mutualistic Symbiotic Radio with Hyb...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Hong Guo Yinghui Ye Haijian Sun Liqin Shi Shaanxi Key Laboratory of Information Communication Network and Security Xi'an University of Posts & Telecommunications China School of Electrical and Computer Engineering The University of Georgia Athens GA USA

To address the limitation on the rate of secondary users (SUs) in traditional mutualistic symbiotic radio (SR) systems, this paper proposes a new mutualistic SR with hybrid active-passive communications. Unlike the traditional mutualistic SR, where SUs only perform passive backscatter communications (BC), in the proposed mutualistic SR, each SU conveys information via passive BC and active communications (AC) alternatively. To exploit the potential advantages of the proposed SR, we formulate a non-convex problem to maximize the total rate of all SUs by jointly optimizing the transmit power of the primary user (PU), the reflection coefficient and transmit power of each SU, and the time allocation for each SU to perform passive BC and AC. With proof by contradiction, auxiliary variables and successively convex approximation (SCA), we transform the original problem into a convex one and solve it by proposing an iterative algorithm. The simulation results demonstrate that the proposed iterative algorithm converges quickly. Furthermore, the performance evaluation of the proposed mutualistic SR system demonstrates its superiority over the traditional mutualistic SR in terms of the rate achieved by SUs under the same constraints.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Early Detection Model of Prostate Cancer Based on MRI 9

An Early Detection Model of Prostate Cancer Based on MRI

引用

9th IEEE International Conference on Data Science in Cyberspace, DSC 2024

作者： Liu, Yuankun Xing, Lumin Wang, Di Nie, Xin Zhang, Xueyan Wu, Di Liu, Wenjian The First Affiliated Hospital of Shandong First Medical University Shandong Provincial Qianfoshan Hospital Jinan China City University of Macau Faculty of Data Science China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China Chongqing Jianzhu College Chongqing China Shandong Youth University of Political Science School of Information Work Office Jinan China University of Southern Queensland School of Mathematics Physics and Computing QLD Australia

ISBN: (纸本)9798350391367

Prostate cancer is a prevalent form of cancer among men, with a high rate of occurrence but relatively lower mortality compared to other types of cancer. Early detection is crucial because it allows for earlier intervention, potentially preventing progression to more severe stages, and improving patient outcomes. However, human diagnosis is time-consuming and inefficient, an autonomous early detection system is essential for saving lives. To address this challenge, we propose a novel MoE-MRIViT framework that uses advanced machine learning and computer vision techniques to analyze MRI images and identify features indicative of prostate cancer. The system processes the data using a vision transformer to extract precise prostate cancer features from MRI scans, and uses attention mechanisms to focus on significant areas. Through the MoE-MRIViT intervention in two stages, we have achieved superior results compared to the state-of-the-art (SOTA) methods. Experimental results demonstrate that our model achieves an impressive accuracy of 94.84%, outperforming the ResNet-101 and the basic ViT models, which achieve accuracies of 89.4% and 92.31%, respectively. © 2024 IEEE.

关键词： Urology

来源：评论

学校读者我要写书评

暂无评论

ADFQ-ViT: Activation-Distribution-Friendly Post-Training Quantization for Vision Transformers

arXiv

引用

arXiv 2024年

作者： Jiang, Yanfeng Sun, Ning Xie, Xueshuo Yang, Fei Li, Tao College of Computer Science Nankai University Tianjin China Tianjin Key Laboratory of Network and Data Security Technology Tianjin China Zhejiang Lab Zhejiang Hangzhou China Haihe Lab of ITAI Tianjin China

Vision Transformers (ViTs) have exhibited exceptional performance across diverse computer vision tasks, while their substantial parameter size incurs significantly increased memory and computational demands, impeding effective inference on resource-constrained devices. Quantization has emerged as a promising solution to mitigate these challenges, yet existing methods still suffer from significant accuracy loss at low-bit. We attribute this issue to the distinctive distributions of post-LayerNorm and post-GELU activations within ViTs, rendering conventional hardware-friendly quantizers ineffective, particularly in low-bit scenarios. To address this issue, we propose a novel framework called Activation-Distribution-Friendly post-training Quantization for Vision Transformers, ADFQ-ViT. Concretely, we introduce the Per-Patch Outlier-aware Quantizer to tackle irregular outliers in post-LayerNorm activations. This quantizer refines the granularity of the uniform quantizer to a per-patch level while retaining a minimal subset of values exceeding a threshold at full-precision. To handle the non-uniform distributions of post-GELU activations between positive and negative regions, we design the Shift-Log2 Quantizer, which shifts all elements to the positive region and then applies log2 quantization. Moreover, we present the Attention-score enhanced Module-wise Optimization which adjusts the parameters of each quantizer by reconstructing errors to further mitigate quantization error. Extensive experiments demonstrate ADFQ-ViT provides significant improvements over various baselines in image classification, object detection, and instance segmentation tasks at 4-bit. Specifically, when quantizing the ViT-B model to 4-bit, we achieve a 10.23% improvement in Top-1 accuracy on the ImageNet dataset. Copyright © 2024, The Authors. All rights reserved.

关键词： Distribution transformers

来源：评论

学校读者我要写书评

暂无评论

Enhancing Unknown Encrypted Traffic Clustering with Self-Supervised Learning

Enhancing Unknown Encrypted Traffic Clustering with Self-Sup...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Ke Ding Xia Zhou Xiaoyan Hu Guang Cheng Ruidong Li Hua Wu School of Cyber Science & Engineering Southeast University Nanjing China Purple Mountain Laboratories for Network and Communication Security Nanjing China Jiangsu Province Engineering Research Center of Security for Ubiquitous Network Nanjing China Ministry of Education Key Laboratory of Computer Network and Information Integration (Southeast University) China Institute of Science and Engineering Kanazawa University Kanazawa Japan

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

Many malicious attacks are launched through encrypted traffic from unknown proprietary network protocols. Timely identification of such malicious unknown encrypted traffic is essential for the defense. However, it is challenging to acquire labels for unknown protocols in the context of encrypted traffic. Due to the lack of prior knowledge, unsupervised learning is adopted to cluster unknown encrypted traffic. The existing unsupervised encrypted traffic clustering methods do not customize feature extraction and representation of unknown encrypted traffic, resulting in imperfect clustering results. This work innovatively proposes BiFR-SSL to accurately cluster unknown encrypted traffic without prior knowledge. BiFRSSL extracts features of each unknown encrypted bidirectional network flow based on the lengths, arrival time, and directions of packets within the flow to construct a Bidirectional Flowpic Representation (BiFR). Subsequently, it exploits Self-Supervised Learning (SSL) to pre-train a feature extractor that produces feature representations from BiFRs, guaranteeing the closeness of encrypted traffic flows from the same protocol in the representation space. Finally, it clusters unknown encrypted traffic based on their feature representations generated by the pre-trained feature extractor. Our experimental studies demonstrate that BiFR-SSL can effectively cluster encrypted traffic of unknown protocols and outperforms state-of-the-art methods.

关键词： Protocols Clustering methods Clustering algorithms Self-supervised learning Telecommunication traffic Feature extraction Data augmentation Cryptography Global communication Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Establishing Multi-Party Trust Architecture for DRM by Using Game-Theoretic Analysis of security Policies

引用

Chinese Journal of Electronics 2023年第3期18卷 519-524页

作者： Zhiyong Zhang Qingqi Pei Jianfeng Ma Lin Yang Ministry of Education Key Laboratory of Computer Network and Information Security Xidian University Xi'an China Electronic and Information Engineering College Henan University of Science and Technology Luoyang China The Research Institute China Electronic Equipment and Systems Engineering Corporation Beijing China

A successful transaction of digital contents is primarily dependent on security policies, trust mechanisms and benefits balances, as well as the simple adoption of the combination of enhanced security policies would not effectively establish a trust relationship among various stakeholders in the DRM (Digital rights management)-enabling contents value chain. With respect to a generic DRM ecosystem, the hierarchy analyses of the multi-participant trust architecture were proposed based on the game-theoretic adoptions of security policies. By using formalized definitions of security components and services' utilities, we presented the choice of policies with the external relativity, in the contents acquisition scenario, as a multi-player simultaneous-move game referred to contents provider, digital services/rights provider and consumer. Also, in term of security policies combinations' utilities and benefit effects on participants, we further gained the game's Nash Equilibrium, which is a stable profile of security policies achieving the optimal balance of the security and utilities, thus establishing and strengthening the multi-party trust. The analytic conclusions show that enhanced security policies profile does not necessarily achieve optimal benefits balance in the one-stage game, for a small quantity of digital contents transactions. Whereas, the profile could transform into Nash Equilibrium with the increase of transaction sessions, meanwhile being Pareto Optimality.

关键词： Ecosystems Games computer architecture Transforms Copyright protection Nash equilibrium security

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：