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

Proceedings of the 38th International Conference on Neural Information Processing Systems

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

ISBN: (纸本)9798331314385

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 https://***/Darkbblue/diffusion-content-shift.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GM-DF: Generalized Multi-Scenario Deepfake Detection

arXiv

引用

arXiv 2024年

作者： Lai, Yingxin Yu, Zitong Yang, Jing Li, Bin Kang, Xiangui Shen, Linlin The School of Computing and Information Technology Great Bay University Dongguan523000 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen University Shenzhen518060 China The Guangdong Key Laboratory of Information Security The School of Computer Science and Engineering Sun Yat-sen University Guangzhou510080 China Computer Vision Institute School of Computer Science & Software Engineering Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Key Laboratory of Intelligent Information Processing National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China

Existing face forgery detection usually follows the paradigm of training models in a single domain, which leads to limited generalization capacity when unseen scenarios and unknown attacks occur. In this paper, we elaborately investigate the generalization capacity of deepfake detection models when jointly trained on multiple face forgery detection datasets. We first find a rapid degradation of detection accuracy when models are directly trained on combined datasets due to the discrepancy across collection scenarios and generation methods. To address the above issue, a Generalized Multi-Scenario Deepfake Detection framework (GM-DF) is proposed to serve multiple real-world scenarios by a unified model. First, we propose a hybrid expert modeling approach for domain-specific real/forgery feature extraction. Besides, as for the commonality representation, we use CLIP to extract the common features for better aligning visual and textual features across domains. Meanwhile, we introduce a masked image reconstruction mechanism to force models to capture rich forged details. Finally, we supervise the models via a domain-aware meta-learning strategy to further enhance their generalization capacities. Specifically, we design a novel domain alignment loss to strongly align the distributions of the meta-test domains and meta-train domains. Thus, the updated models are able to represent both specific and common real/forgery features across multiple datasets. In consideration of the lack of study of multi-dataset training, we establish a new benchmark leveraging multi-source data to fairly evaluate the models' generalization capacity on unseen scenarios. Both qualitative and quantitative experiments on five datasets conducted on traditional protocols as well as the proposed benchmark demonstrate the effectiveness of our approach. The codes will be available on https://***/laiyingxin2/GM-DF. Copyright © 2024, The Authors. All rights reserved.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Raft Consensus Algorithm Based on Credit Model in Consortium Blockchain

引用

Wuhan University Journal of Natural Sciences 2020年第2期25卷 146-154页

作者： CHEN Yunfang LIU Ping ZHANG Wei School of Computer Science Nanjing University of Posts and TelecommunicationsNanjing 210023JiangsuChina Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and TelecommunicationsNanjing 210023JiangsuChina

As one of the underlying technologies of the blockchain,the consensus algorithm plays a vital role in ensuring security and *** a consensus algorithm for the private blockchain,Raft has better performance than the rest of the consensus algorithms,and it does not cause problems such as the concentrated hashing power,resource waste and ***,Raft can only be used in a non-byzantine environment with a small network *** order to enable Raft to be used in a large-scale network with a certain number of byzantine nodes,this paper combines Raft and credit model to propose a Raft blockchain consensus algorithm based on credit model *** the node credit evaluation phase,RBF-based support vector machine is used as the anomaly detection method,and the node credit evaluation model is *** the Trust Nodes List(TNL)mechanism is introduced to make the consensus phase in a creditable network ***,the common node is synchronized to the consensus node to update the blockchain of the entire *** show that CRaft has better throughput and lower latency than the commonly used consortium blockchain consensus algorithm PBFT(Practical Byzantine Fault Tolerance).

关键词： credit model consensus algorithm consortium blockchain P2P network

来源：评论

学校读者我要写书评

暂无评论

A Virtual Network Mapping Method Based on Compound Particle Swarm Optimization

A Virtual Network Mapping Method Based on Compound Particle ...

引用

Cyber security and Information Engineering (ICCSIE), International Conference on

作者： Jianhua Huang Yunlong Tang Yongjun Wei Huan Wang Haifeng Zhang Bing Zhang Liuzhou Key Laboratory of Big Data Intelligent Processing and Security Guangxi Education System Network Security Monitoring Center School of Computer Science and Technology (School of Software) Guangxi University of Science and Technology Liuzhou China Liuzhou Railway Vocational Technical College Liuzhou China

ISBN: (纸本)9781665455756

Aiming at problems of low credibility of results and low accuracy of the scheme in the mapping process of virtual networks. It is suggested to use a composite particle swarm optimization approach for virtual network mapping. Firstly, to derive the maximum number of virtual cyberspaces, we construct the virtual network model and the physical network model; secondly, resource limitations are used to build the node mapping and link mapping models, and once more, the mapping scheme of the virtual network on the physical network is solved using the composite particle swarm algorithm to improve the acceptance rate of virtual network requests. In simulation experiments, we compare our established algorithm with two algorithms, D-ViNE-SP and VNE-R-PSO, in two dimensions, and the results show that our proposed VNE-MM-PSO mapping method improves the acceptance rate of network requests by 8% and also improves on the benefit-cost ratio.

关键词： cyberspace Compounds Particle swarm optimization Computer crime

来源：评论

学校读者我要写书评

暂无评论

A Fast Two-Stage Black-Box Deep Learning Network Attacking Method Based on Cross-Correlation

引用

Computers, Materials & Continua 2020年第7期64卷 623-635页

作者： Deyin Li Mingzhi Cheng Yu Yang Min Lei Linfeng Shen State Key Laboratory of Public Big Data Guizhou UniversityGuiyang550025China School of Cyberspace Security Beijing University of Posts and TelecommunicationsBeijing100876China College of New Media Beijing Institute of Graphic CommunicationBeijing102600China School of Computing Science Simon Fraser UniversityBurnabyCanada

Deep learning networks are widely used in various systems that require ***,deep learning networks are vulnerable to adversarial *** study on adversarial attacks plays an important role in ***-box attacks require less knowledge about target models than white-box attacks do,which means black-box attacks are easier to launch and more ***,the state-of-arts black-box attacks still suffer in low success rates and large visual distances between generative adversarial images and original *** paper proposes a kind of fast black-box attack based on the cross-correlation(FBACC)*** attack is carried out in two *** the first stage,an adversarial image,which would be missclassified as the target label,is generated by using gradient descending *** far the image may look a lot different than the original ***,in the second stage,visual quality keeps getting improved on the condition that the label keeps being *** using the cross-correlation method,the error of the smooth region is ignored,and the number of iterations is *** with the proposed black-box adversarial attack methods,FBACC achieves a better fooling rate and fewer *** attacking LeNet5 and AlexNet respectively,the fooling rates are 100%and 89.56%.When attacking them at the same time,the fooling rate is 69.78%.FBACC method also provides a new adversarial attack method for the study of defense against adversarial attacks.

关键词： Black-box adversarial attack cross-correlation two-module

来源：评论

学校读者我要写书评

暂无评论

A Point Cloud Completion Method for Industrial Component Based on Multiple Encoders

A Point Cloud Completion Method for Industrial Component Bas...

引用

Chinese Automation Congress (CAC)

作者： Lei Wang Ran Chen Wei Huang Yiping Chen Jun Yin School of Computer Nanjing University of Posts and Telecommunications Nanjing P. R. China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing P. R. China School of Internet of Things Nanjing University of Posts and Telecommunications Nanjing P. R. China

In real-world scenarios, laser-scanned point clouds often suffer from missing data points due to occlusion and other factors, significantly impacting subsequent tasks. We propose a novel point cloud completion method based on self-attention mechanisms and multi-layer perceptrons to address this issue, building upon the PCN model. Our experimental evaluations on the PCN dataset demonstrate notable enhancements in the completion effectiveness and evaluation metrics compared to the baseline model. Additionally, focusing on the point cloud completion context for industrial components, we introduce an approach for constructing an industrial component point cloud dataset. This method leverages 3D mesh models to swiftly generate complete point clouds with uniform distribution and devoid of noise while simulating the incomplete point clouds obtained from real-world scanning scenarios. The final results fully exhibit the feasibility of this scheme, which is a strong candidate for future industrial component point cloud completion.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Disentangled Noisy Correspondence Learning

arXiv

引用

arXiv 2024年

作者： Dang, Zhuohang Luo, Minnan Wang, Jihong Jia, Chengyou Han, Haochen Wan, Herun Dai, Guang Chang, Xiaojun Wang, Jingdong The School of Computer Science and Technology The Ministry of Education Key Laboratory of Intelligent Networks and Network Security The Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Shaanxi Xi'An710049 China SGIT AI Lab State Grid Shaanxi Electric Power Company Limited State Grid Corporation of China Shaanxi China The School of Information Science and Technology University of Science and Technology China United Arab Emirates The Baidu Inc China

Cross-modal retrieval is crucial in understanding latent correspondences across modalities. However, existing methods implicitly assume well-matched training data, which is impractical as real-world data inevitably involves imperfect alignments, i.e., noisy correspondences. Although some works explore similarity-based strategies to address such noise, they suffer from sub-optimal similarity predictions influenced by modality-exclusive information (MEI), e.g., background noise in images and abstract definitions in texts. This issue arises as MEI is not shared across modalities, thus aligning it in training can markedly mislead similarity predictions. Moreover, although intuitive, directly applying previous cross-modal disentanglement methods suffers from limited noise tolerance and disentanglement efficacy. Inspired by the robustness of information bottlenecks against noise, we introduce DisNCL, a novel information-theoretic framework for feature Disentanglement in Noisy Correspondence Learning, to adaptively balance the extraction of MII and MEI with certifiable optimal cross-modal disentanglement efficacy. DisNCL then enhances similarity predictions in modality-invariant subspace, thereby greatly boosting similarity-based alleviation strategy for noisy correspondences. Furthermore, DisNCL introduces soft matching targets to model noisy many-to-many relationships inherent in multi-modal input for noise-robust and accurate cross-modal alignment. Extensive experiments confirm DisNCL's efficacy by 2% average recall improvement. Mutual information estimation and visualization results show that DisNCL learns meaningful MII/MEI subspaces, validating our theoretical analyses. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Not All Diffusion Model Activations Have Been Evaluated as Discriminative Features

arXiv

引用

arXiv 2024年

作者： Meng, Benyuan Xu, Qianqian Wang, Zitai 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 Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University China School of Computer Science and Tech. University of Chinese Academy of Sciences China Key Laboratory of Big Data Mining and Knowledge Management CAS China

Diffusion models are initially designed for image generation. Recent research shows that the internal signals within their backbones, named activations, can also serve as dense features for various discriminative tasks such as semantic segmentation. Given numerous activations, selecting a small yet effective subset poses a fundamental problem. To this end, the early study of this field performs a large-scale quantitative comparison of the discriminative ability of the activations. However, we find that many potential activations have not been evaluated, such as the queries and keys used to compute attention scores. Moreover, recent advancements in diffusion architectures bring many new activations, such as those within embedded ViT modules. Both combined, activation selection remains unresolved but overlooked. To tackle this issue, this paper takes a further step with a much broader range of activations evaluated. Considering the significant increase in activations, a full-scale quantitative comparison is no longer operational. Instead, we seek to understand the properties of these activations, such that the activations that are clearly inferior can be filtered out in advance via simple qualitative evaluation. After careful analysis, we discover three properties universal among diffusion models, enabling this study to go beyond specific models. On top of this, we present effective feature selection solutions for several popular diffusion models. Finally, the experiments across multiple discriminative tasks validate the superiority of our method over the SOTA competitors. Our code is available at this url. © 2024, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Understanding and Detecting Privacy Leakage Vulnerabilities in Hyperledger Fabric Chaincodes

Understanding and Detecting Privacy Leakage Vulnerabilities ...

引用

International Symposium on Software Reliability Engineering (ISSRE)

作者： Ziming Chen Yue Li Jianbo Gao Jiashuo Zhang Ke Wang Jianbin Hu Zhi Guan Zhong Chen School of Computer Science Peking University Beijing China College of Computer Science and Technology Taiyuan University of Technology Taiyuan China Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing Jiaotong University Beijing China Peking University Chongqing Research Institute of Big Data Chongqing China National Engineering Research Center for Software Engineering Peking University Beijing China

ISBN: (数字)9798350353884

ISBN: (纸本)9798350353891

The application on a blockchain cannot maintain secrecy because its data is replicated across all peers in the network. To remedy this problem, Hyperledger Fabric introduces private data collection (PDC) into its smart contract (i.e. chaincode) to facilitate applications that require privacy. However, recent studies have revealed that PDC is too complex for chaincode developers to fully understand and use correctly, leading to privacy leaks vulnerabilities. In this paper, we present an empirical study on the prevalence of PDC misuse in chaincodes by extracting privacy leakage cases from StackOverflow posts and Hyperledger Fabric repositories on GitHub. Subsequently, we systematically categorize the misuse of PDC into three categories of vulnerabilities resulting in the leakage of private data and provide formal definitions for them. Furthermore, we develop PDChecker, an automated security analysis framework for identifying the privacy and security vulnerabilities in Fabric chaincodes. We evaluated PDChecker on 956 real-world chaincodes applying PDC and found that 67.78% of them contain at least one privacy leakage vulnerability. In addition, PDChecker uncovered 10 zero-day vulnerabilities documented by the China National Vulnerability database.

关键词： Privacy data privacy Distributed ledger databases Smart contracts Fabrics Blockchains Software reliability security Software development management

来源：评论

学校读者我要写书评

暂无评论

Privacy Protection Algorithm for the Internet of Vehicles Based on Local Differential Privacy and Game Model

引用

Computers, Materials & Continua 2020年第8期64卷 1025-1038页

作者： Wenxi Han Mingzhi Cheng Min Lei Hanwen Xu Yu Yang Lei Qian Guizhou Provincial Key Laboratory of Public Big Data Guizhou UniversityGuiyang550025China School of Cyberspace Security Beijing University of Posts and TelecommunicationsBeijing100876China College of New Media Beijing Institute of Graphic CommunicationBeijing102600China School of Computer Science The University of AucklandAucklandNew Zealand

In recent years,with the continuous advancement of the intelligent process of the Internet of Vehicles(IoV),the problem of privacy leakage in IoV has become increasingly *** research on the privacy protection of the IoV has become the focus of the *** paper analyzes the advantages and disadvantages of the existing location privacy protection system structure and algorithms,proposes a privacy protection system structure based on untrusted data collection server,and designs a vehicle location acquisition algorithm based on a local differential privacy and game *** algorithm first meshes the road network ***,the dynamic game model is introduced into the game user location privacy protection model and the attacker location semantic inference model,thereby minimizing the possibility of exposing the regional semantic privacy of the k-location set while maximizing the availability of the *** this basis,a statistical method is designed,which satisfies the local differential privacy of k-location sets and obtains unbiased estimation of traffic density in different ***,this paper verifies the algorithm based on the data set of mobile vehicles in *** experimental results show that the algorithm can guarantee the user’s location privacy and location semantic privacy while satisfying the service quality requirements,and provide better privacy protection and service for the users of the IoV.

关键词： The Internet of Vehicles privacy protection local differential privacy location semantic inference attack game theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：