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

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Qiaowen Jia Guanxiong Ha Hanwei Wang Haoyu Ma Hang Chen State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China College of Cyber Science Nankai University Tianjin China Tianjin Key Laboratory of Network and Data Security Technology Tianjin China Zhejiang Lab Hangzhou China The School of Cyber Engineering Xidian University Xi’an China

The encrypted deduplication can provide both storage savings and data confidentiality for cloud storage systems. Convergent encryption (CE) is a well-known solution for encrypted deduplication, but it brings huge computation and storage overheads for key management. MinHash encryption is an effective solution to this issue. It reduces the number of keys by grouping multiple consecutive chunks into segments and generating one key for each segment. However, MinHash encryption does not take full advantage of the segment similarity, which can be used to further reduce the overhead for key management. To this end, we augment MinHash encryption with Bloom filter and Locality Sensitivity Hash (LSH) to design an enhanced MinHash encryption scheme. Firstly, our scheme generates a sketch for each segment based on the Bloom filter, and projects sketches to the points in a hash table through LSH functions. Secondly, we detect the segment similarity by the distance between points, and similar segments are grouped into super-segments. Finally, we combine MinHash encryption and server-aided message-locked encryption to encrypt the super-segments for achieving encrypted deduplication. We conduct trace-driven experiments using a realworld dataset. Compared with MinHash encryption, our scheme has higher storage efficiency and better encryption performance.

关键词： Privacy Maximum likelihood estimation data privacy Cloud computing Sensitivity Encryption

来源：评论

学校读者我要写书评

暂无评论

A Survey on Applications of Reinforcement Learning in Spatial Resource Allocation

arXiv

引用

arXiv 2024年

作者： Zhang, Di Wang, Moyang Mango, Joseph Li, Xiang Xu, Xianrui Key Laboratory of Geographic Information Science Ministry of Education School of Geographic Sciences East China Normal University Shanghai200241 China Department of Transportation and Geotechnical Engineering University of Dar es Salaam Dar es salaam Tanzania United Republic of Shanghai Key Lab for Urban Ecological Processes and Eco-Restoration East China Normal University Shanghai200241 China Key Laboratory of Spatial-Temporal Big Data Analysis and Application of Natural Resources in Megacities Ministry of Natural Resources East China Normal University Shanghai200241 China School of Economics and Management Shanghai University of Sport Shanghai200438 China

The challenge of spatial resource allocation is pervasive across various domains such as transportation, industry, and daily life. As the scale of real-world issues continues to expand and demands for real-time solutions increase, traditional algorithms face significant computational pressures, struggling to achieve optimal efficiency and real-time capabilities. In recent years, with the escalating computational power of computers, the remarkable achievements of reinforcement learning in domains like Go and robotics have demonstrated its robust learning and sequential decision-making capabilities. Given these advancements, there has been a surge in novel methods employing reinforcement learning to tackle spatial resource allocation problems. These methods exhibit advantages such as rapid solution convergence and strong model generalization abilities, offering a new perspective on resolving spatial resource allocation problems. Therefore, this paper aims to summarize and review recent theoretical methods and applied research utilizing reinforcement learning to address spatial resource allocation problems. It provides a summary and comprehensive overview of its fundamental principles, related methodologies, and applied research. Additionally, it highlights several unresolved issues that urgently require attention in this direction for the future. Copyright © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Universal deep network for steganalysis of color image based on channel representation

arXiv

引用

arXiv 2021年

作者： Wei, Kangkang Luo, Weiqi Tan, Shunquan Huang, Jiwu The Guangdong Key Lab of Information Security Technology School of Computer Science and Engineering Sun Yat-Sen University Guangzhou510006 China The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China The Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China

Up to now, most existing steganalytic methods are designed for grayscale images, and they are not suitable for color images that are widely used in current social networks. In this paper, we design a universal color image steganalysis network (called UCNet) in spatial and JPEG domains. The proposed method includes preprocessing, convolutional, and classification modules. To preserve the steganographic artifacts in each color channel, in preprocessing module, we firstly separate the input image into three channels according to the corresponding embedding spaces (i.e. RGB for spatial steganography and YCbCr for JPEG steganography), and then extract the image residuals with 62 fixed high-pass filters, finally concatenate all truncated residuals for subsequent analysis rather than adding them together with normal convolution like existing CNN-based steganalyzers. To accelerate the network convergence and effectively reduce the number of parameters, in convolutional module, we carefully design three types of layers with different shortcut connections and group convolution structures to further learn high-level steganalytic features. In classification module, we employ a global average pooling and fully connected layer for classification. We conduct extensive experiments on ALASKA II to demonstrate that the proposed method can achieve state-of-the-art results compared with the modern CNN-based steganalyzers (e.g., SRNet and J-YeNet) in both spatial and JPEG domains, while keeping relatively few memory requirements and training time. Furthermore, we also provide necessary descriptions and many ablation experiments to verify the rationality of the network design. Copyright © 2021, The Authors. All rights reserved.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

A Novel Robust Watermarking Algorithm for Encrypted Medical Image Based on Bandelet-DCT 9th

A Novel Robust Watermarking Algorithm for Encrypted Medical ...

引用

9th KES International Conference on Innovation in Medicine and Healthcare, KES-InMed 2021

作者： Fang, Yangxiu Liu, Jing Li, Jingbing Yi, Dan Cui, Wenfeng Xiao, Xiliang Han, Baoru Bhatti, Uzair Aslam School of Information and Communication Engineering Hainan University Haikou Hainan China State Key Laboratory of Marine Resource Utilization South China Sea Hainan University Haikou Hainan China Research Center for Healthcare Data Science Zhejiang Lab Hangzhou Zhejiang China College of Medical Informatics Chongqing Medical University Chongqing China Nanjing Normal University Nanjing Jiangsu China

ISBN: (纸本)9789811630125

Digital watermarking technology is a good way to solve the problem of image information security. However, in previous studies, watermark is encrypted, but the host image is not encrypted, which causes the leakage of the private information of the images themselves. When the carrier image is a medical image, more attention should be paid. Therefore, a new robust zero-watermarking algorithm based on Bandelet-DCT (Bandelet Transform and Discrete Cosine Transform) for medical image in the encryption domain of DWT-DCT (Discrete Wavelet Transform and Discrete Cosine Transform) is proposed. Firstly, the original medical image is encrypted in a transform domain based on a Logistic chaotic map to enhance the security of the original medical image. Then Bandelet-DCT is applied to extract the feature sequences of encrypted medical images which were preprocessed by SIFT (Scale Invariant Feature Transform). In the stage of watermarking embedding and extraction, zero-watermarking technology is implemented to ensure that the region of interest of the medical image remains unchanged, and evaluate the robustness of the algorithm through the correlation coefficient between the original watermark and the attacked watermark. Experimental results show that the proposed algorithm has strong robustness and can effectively solve the problem of information leakage. It has a strong anti-attack ability, good robustness, and certain application prospects. © 2021, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Discrete cosine transforms

来源：评论

学校读者我要写书评

暂无评论

A Zero Watermarking Scheme for Encrypted Medical Images Based on Tetrolet-DCT 9th

A Zero Watermarking Scheme for Encrypted Medical Images Base...

引用

9th KES International Conference on Innovation in Medicine and Healthcare, KES-InMed 2021

作者： Cui, Wenfeng Liu, Jing Li, Jingbing Fang, Yangxiu Yi, Dan Xiao, Xiliang Bhatti, Uzair Aslam Han, Baoru School of Information and Communication Engineering Hainan University Haikou Hainan China State Key Laboratory of Marine Resource Utilization in the South China Sea Hainan University Haikou Hainan China Research Center for Healthcare Data Science Zhejiang Lab Hangzhou Zhejiang China Nanjing Normal University Nanjing Jiangsu China College of Medical Informatics Chongqing Medical University Chongqing China

ISBN: (纸本)9789811630125

Aiming at the problem of medical image leakage in the transmission process, in order to enhance the concealment of patient data, a Tetrolet-DCT based encrypted medical image zero watermarking scheme is proposed. Firstly, DFT and Logistic mapping are used to encrypt the original medical image to obtain the encrypted medical image. Then, Tetrolet-DCT is used to extract the features of the encrypted medical image. After that, zero watermark technology is applied to embed and extract the watermark information of patients. Experimental results show that the proposed scheme ensures the concealment of the original medical image, and can effectively extract the watermark information. It has good robustness both against traditional attacks and geometric attacks. © 2021, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Hospital data processing

来源：评论

学校读者我要写书评

暂无评论

Evidence-aware hierarchical interactive attention networks for explainable claim verification 29

Evidence-aware hierarchical interactive attention networks f...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Wu, Lianwei Rao, Yuan Yang, Xiong Wang, Wanzhen Nazir, Ambreen Lab of Social Intelligence and Complexity Data Processing School of Software Engineering Xi'an Jiaotong University China Shannxi Joint Key Laboratory for Artifact Intelligence Sub-Lab of Xi'an Jiaotong University China Research Institute of Xi'an Jiaotong University Shenzhen China

ISBN: (纸本)9780999241165

Exploring evidence from relevant articles to confirm the veracity of claims is a trend towards explainable claim verification. However, most strategies capture the top-k check-worthy articles or salient words as evidence, but this evidence is difficult to focus on the questionable parts of unverified claims. Besides, they utilize relevant articles indiscriminately, ignoring the source credibility of these articles, which may cause quiet a few unreliable articles to interfere with the assessment results. In this paper, we propose Evidence-aware Hierarchical Interactive Attention Networks (EHIAN) by considering the capture of evidence fragments and the fusion of source credibility to explore more credible evidence semantics discussing the questionable parts of claims for explainable claim verification. EHIAN first designs internal interaction layer (IIL) to strengthen deep interaction and matching between claims and relevant articles for obtaining key evidence fragments, and then proposes global inference layer (GIL) that fuses source features of articles and interacts globally with the average semantics of all articles and finally earns the more credible evidence semantics discussing the questionable parts of claims. Experiments on two datasets demonstrate that EHIAN not only achieves the state-of-the-art performance but also secures effective evidence to explain the results. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Contrastive Learning for Robust Android Malware Familial Classification

arXiv

引用

arXiv 2021年

作者： Wu, Yueming Dou, Shihan Zou, Deqing Yang, Wei Qiang, Weizhong Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China University of Texas at Dallas Dallas United States National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Due to its open-source nature, Android operating system has been the main target of attackers to exploit. Malware creators always perform different code obfuscations on their apps to hide malicious activities. Features extracted from these obfuscated samples through program analysis contain many useless and disguised features, which leads to many false negatives. To address the issue, in this paper, we demonstrate that obfuscation-resilient malware family analysis can be achieved through contrastive learning. The key insight behind our analysis is that contrastive learning can be used to reduce the difference introduced by obfuscation while amplifying the difference between malware and other types of malware. Based on the proposed analysis, we design a system that can achieve robust and interpretable classification of Android malware. To achieve robust classification, we perform contrastive learning on malware samples to learn an encoder that can automatically extract robust features from malware samples. To achieve interpretable classification, we transform the function call graph of a sample into an image by centrality analysis. Then the corresponding heatmaps can be obtained by visualization techniques. These heatmaps can help users understand why the malware is classified as this family. We implement IFDroid and perform extensive evaluations on two datasets. Experimental results show that IFDroid is superior to state-of-the-art Android malware familial classification systems. Moreover, IFDroid is capable of maintaining a 98.4% F1 on classifying 69,421 obfuscated malware samples. © 2021, CC0.

关键词： Android (operating system)

来源：评论

学校读者我要写书评

暂无评论

A Semi-Supervised Approach with Error Reflection for Echocardiography Segmentation

A Semi-Supervised Approach with Error Reflection for Echocar...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Xiaoxiang Han Yiman Liu Jiang Shang Qingli Li Jiangang Chen Menghan Hu Qi Zhang Yuqi Zhang Yan Wang School of Communication and Information Engineering Shanghai University Shanghai P.R.China The SMART (Smart Medicine and AI-based Radiology Technology) Lab Shanghai Institute for Advanced Communication and Data Science Shanghai University Shanghai P.R.China Department of Pediatric Cardiology Shanghai Children’s Medical Center School of Medicine Shanghai Jiao Tong University Shanghai P.R.China Shanghai Engineering Research Center of Intelligence Pediatrics (SERCIP) Shanghai P.R.China Shanghai Key Laboratory of Multidimensional Information Processing East China Normal University Shanghai P.R.China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Segmenting internal structure from echocardiography is essential for the diagnosis and treatment of various heart diseases. Semi-supervised learning shows its ability in alleviating annotations scarcity. While existing semi-supervised methods have been successful in image segmentation across various medical imaging modalities, few have attempted to design methods specifically addressing the challenges posed by the poor contrast, blurred edge details and noise of echocardiography. These characteristics pose challenges to the generation of high-quality pseudo-labels in semi-supervised segmentation based on Mean Teacher. Inspired by human reflection on erroneous practices, we devise an error reflection strategy for echocardiography semi-supervised segmentation architecture. The process triggers the model to reflect on inaccuracies in unlabeled image segmentation, thereby enhancing the robustness of pseudo-label generation. Specifically, the strategy is divided into two steps. The first step is called reconstruction reflection. The network is tasked with reconstructing authentic proxy images from the semantic masks of unlabeled images and their auxiliary sketches, while maximizing the structural similarity between the original inputs and the proxies. The second step is called guidance correction. Reconstruction error maps decouple unreliable segmentation regions. Then, reliable data that are more likely to occur near high-density areas are leveraged to guide the optimization of unreliable data potentially located around decision boundaries. Additionally, we introduce an effective data augmentation strategy, termed as multi-scale mixing up strategy, to minimize the empirical distribution gap between labeled and unlabeled images and perceive diverse scales of cardiac anatomical structures. Extensive experiments on a public echocardiography dataset CAMUS, and a private clinical echocardiography dataset demonstrate the competitiveness of the proposed method.

关键词： Image segmentation Echocardiography Noise Semantics Anatomical structure Semisupervised learning data augmentation Reflection Robustness Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Breaking the curse of space explosion: Towards effcient NAS with curriculum search 37

Breaking the curse of space explosion: Towards effcient NAS ...

引用

37th International Conference on Machine Learning, ICML 2020

作者： Guo, Yong Chen, Yaofo Zheng, Yin Zhao, Peilin Chen, Jian Huang, Junzhou Tan, Mingkui School of Software Engineering South China University of Technology China Pazhou Laboratory China Weixin Group Tencent China Tencent AI Lab Tencent China Guangdong Key Laboratory of Big Data Analysis and Processing China

ISBN: (纸本)9781713821120

Neural architecture search (NAS) has become an important approach to automatically fnd effective architectures. To cover all possible good architectures, we need to search in an extremely large search space with billions of candidate architectures. More critically, given a large search space, we may face a very challenging issue of space explosion. However, due to the limitation of computational resources, we can only sample a very small proportion of the architectures, which provides insuffcient information for the training. As a result, existing methods may often produce suboptimal architectures. To alleviate this issue, we propose a curriculum search method that starts from a small search space and gradually incorporates the learned knowledge to guide the search in a large space. With the proposed search strategy, our Curriculum Neural Architecture Search (CNAS) method signifcantly improves the search effciency and fnds better architectures than existing NAS methods. Extensive experiments on CIFAR-10 and ImageNet demonstrate the effectiveness of the proposed method. Copyright 2020 by the author(s).

关键词： Curricula

来源：评论

学校读者我要写书评

暂无评论

Breaking the moments condition barrier: no-regret algorithm for bandits with super heavy-tailed payoffs 21

Breaking the moments condition barrier: no-regret algorithm ...

引用

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

作者： Han Zhong Jiayi Huang Lin F. Yang Liwei Wang Center for Data Science Peking University Center for Data Science Peking University Pazhou Lab Department of Electrical and Computer Engineering University of California Los Angles Key Laboratory of Machine Perception MOE School of EECS Institute for Artificial Intelligence Peking University

ISBN: (纸本)9781713845393

Despite a large amount of effort in dealing with heavy-tailed error in machine learning, little is known when moments of the error can become non-existential: the random noise η satisfies Pr[|η| > |y|] ≤ 1/|y|α for some α > 0. We make the first attempt to actively handle such super heavy-tailed noise in bandit learning problems: We propose a novel robust statistical estimator, mean of medians, which estimates a random variable by computing the empirical mean of a sequence of empirical medians. We then present a generic reductionist algorithmic framework for solving bandit learning problems (including multi-armed and linear bandit problem): the mean of medians estimator can be applied to nearly any bandit learning algorithm as a black-box filtering for its reward signals and obtain similar regret bound as if the reward is sub-Gaussian. We show that the regret bound is near-optimal even with very heavy-tailed noise. We also empirically demonstrate the effectiveness of the proposed algorithm, which further corroborates our theoretical results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：