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

Memristor-based hyper-chaotic circuit for image encryption

Chinese Physics B 2020年第11期29卷 259-270页

作者： Jiao-Jiao Chen Deng-Wei Yan Shu-Kai Duan Li-Dan Wang College of Electronic and Information Engineering Southwest UniversityChongqing 400715China Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Southwest UniversityChongqing 400715China Intelligent Transmission and Control Technology Joint Engineering Laboratory Chongqing 400715China Brain-inspired Computing and Intelligent Control Chongqing Key Laboratory Chongqing 400715China Chongqing Collaborative Innovation Center for Brain Science Chongqing 400715China School of Artificial Intelligence Southwest UniversityChongqing 400715China

The memristor is a kind of non-linear element with memory function,which can be applied to chaotic systems to increase signal randomness and *** this paper,a new four-dimensional hyper-chaotic system is designed based on a flux controlled memristor model,which can generate complex chaotic *** basic dynamic theory analysis and numerical simulations of the system,such as the stability of equilibrium points,the Lyapunov exponents and dimension,Poincare maps,the power spectrum,and the waveform graph prove that it has rich dynamic ***,the circuit implementation of this system is *** consistency of simulation program with integrated circuit emphasis(SPICE)simulation and numerical analysis proves the ability to generate ***,a new image encryption scheme is designed by using the memristor-based hyper-chaotic system proposed in this *** scheme involves a total of two *** using different security analysis factors,the proposed algorithm is compared with other image encryption schemes,including correlation analysis,information entropy,*** results show that the proposed image encryption scheme has a large key space and presents a better encryption effect.

关键词： memristor SPICE simulation hyper-chaotic system image encryption

来源：评论

学校读者我要写书评

暂无评论

Revisiting Adversarial Robustness Distillation: Robust Soft Labels Make Student Better

Revisiting Adversarial Robustness Distillation: Robust Soft ...

引用

International Conference on Computer Vision (ICCV)

作者： Bojia Zi Shihao Zhao Xingjun Ma Yu-Gang Jiang Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan Univeristy Shanghai Collaborative Innovation Center on Intelligent Visual Computing School of Information Technology Deakin University Geelong Australia

ISBN: (纸本)9781665428132

Adversarial training is one effective approach for training robust deep neural networks against adversarial attacks. While being able to bring reliable robustness, adversarial training (AT) methods in general favor high capacity models, i.e., the larger the model the better the robustness. This tends to limit their effectiveness on small models, which are more preferable in scenarios where storage or computing resources are very limited (e.g., mobile devices). In this paper, we leverage the concept of knowledge distillation to improve the robustness of small models by distilling from adversarially trained large models. We first revisit several state-of-the-art AT methods from a distillation perspective and identify one common technique that can lead to improved robustness: the use of robust soft labels – predictions of a robust model. Following this observation, we propose a novel adversarial robustness distillation method called Robust Soft Label Adversarial Distillation (RSLAD) to train robust small student models. RSLAD fully exploits the robust soft labels produced by a robust (adversarially-trained) large teacher model to guide the student’s learning on both natural and adversarial examples in all loss terms. We empirically demonstrate the effectiveness of our RSLAD approach over existing adversarial training and distillation methods in improving the robustness of small models against state-of-the-art attacks including the AutoAttack. We also provide a set of understandings on our RSLAD and the importance of robust soft labels for adversarial robustness distillation. Code: https://***/zibojia/RSLAD.

关键词： Training Deep learning Computer vision Codes Computational modeling Neural networks Predictive models

来源：评论

学校读者我要写书评

暂无评论

Revisiting adversarial robustness distillation: Robust soft labels make student better

arXiv

引用

arXiv 2021年

作者： Zi, Bojia Zhao, Shihao Ma, Xingjun Jiang, Yu-Gang Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan Univeristy Shanghai Collaborative Innovation Center on Intelligent Visual Computing School of Information Technology Deakin University Geelong Australia

Adversarial training is one effective approach for training robust deep neural networks against adversarial attacks. While being able to bring reliable robustness, adversarial training (AT) methods in general favor high capacity models, i.e., the larger the model the better the robustness. This tends to limit their effectiveness on small models, which are more preferable in scenarios where storage or computing resources are very limited (e.g., mobile devices). In this paper, we leverage the concept of knowledge distillation to improve the robustness of small models by distilling from adversarially trained large models. We first revisit several state-of-the-art AT methods from a distillation perspective and identify one common technique that can lead to improved robustness: the use of robust soft labels - predictions of a robust model. Following this observation, we propose a novel adversarial robustness distillation method called Robust Soft Label Adversarial Distillation (RSLAD) to train robust small student models. RSLAD fully exploits the robust soft labels produced by a robust (adversarially-trained) large teacher model to guide the student's learning on both natural and adversarial examples in all loss terms. We empirically demonstrate the effectiveness of our RSLAD approach over existing adversarial training and distillation methods in improving the robustness of small models against state-of-the-art attacks including the AutoAttack. We also provide a set of understandings on our RSLAD and the importance of robust soft labels for adversarial robustness distillation. Code: https://***/zibojia/RSLAD. © 2021, CC BY.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Author classification using transfer learning and predicting stars in co-author networks

Author classification using transfer learning and predicting...

引用

作者： Abbasi, Rashid Kashif Bashir, Ali Chen, Jianwen Mateen, Abdul Piran, Jalil Amin, Farhan Luo, Bin School of Information and Communication Engineering University of Electronics Science and Technology of China Chengdu China Department of Computing and Mathematics Manchester Metropolitan University Manchester United Kingdom Department of Computer Science Federal Urdu University of Arts Science and Technology Islamabad Pakistan Computer Engineering Department Sejong University Yeungnam Korea Republic of Department of Information and Communication engineering Yeungnam University Yeungnam Korea Republic of Key Lab of Intelligent Computing and Signal Processing of MOE & School of Computer and Technology Anhui University China

The vast amount of data is key challenge to mine a new scholar that is plausible to be star in the upcoming period. The enormous amount of unstructured data raise every year is infeasible for traditional learning;consequently, we need a high quality of preprocessing technique to expand the performance of traditional learning. We have persuaded a novel approach, Authors classification algorithm using Transfer Learning (ACTL) to learn new task on target area to mine the external knowledge from the source domain. Comprehensive experimental outcomes on real-world networks showed that ACTL, Node-based Influence Predicting Stars, Corresponding Authors Mutual Influence based on Predicting Stars, and Specific Topic Domain-based Predicting Stars enhanced the node classification accuracy as well as predicting rising stars to compared with contemporary baseline methods. © 2020 John Wiley & Sons Ltd

关键词： Stars

来源：评论

学校读者我要写书评

暂无评论

Direct Participant Recruitment Strategy in Sparse Mobile Crowdsensing

引用

Jisuanji Xuebao/Chinese Journal of Computers 2022年第7期45卷 1539-1556页

作者： Tu, Chun-Yu Yu, Zhi-Yong Han, Lei Zhu, Wei-Ping Huang, Fang-Wan Guo, Wen-Zhong Wang, Le-Ye College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China Department of Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China School of Computer Science Northwestern Polytechnical University Xi'an710072 China Key Lab of High Confidence Software Technologies Peking University Beijing100871 China School of Computer Science Peking University Beijing100871 China

Sparse Mobile Crowdsensing (Sparse MCS) selects a small part of sub-areas for data collection and infers the data of other sub-areas from the collected data. Compared with Mobile Crowdsensing (MCS) that does not use data inference methods, Sparse MCS saves sensing costs while ensuring the quality of global data. However, the existing research works on Sparse MCS only focus on selecting a small part of sub-areas with higher value. It does not consider whether the recruited participants can collect the data of the required sub-areas, and also ignores the value of other data collected by the participants. In order to solve the limitations of traditional methods in sub-areas selection, this paper starts from the perspective of participants and concentrates on the contribution of the data collected by each participant to the entire collection task. All the data contributions collected by each participant will become the basis for decision-making for the participant's choice. And correspondingly, a new idea to deal with the problem of participant selection under Sparse MCS is proposed. In view of the fact that each person's daily movement trajectory is basically stable, and the data collected by different people on their respective trajectories have different values, this paper uses this regularity and difference to study how to directly recruit participants who can collect high-value data. Furthermore, the participant selection problem considered in this paper is not limited to the data collection in the next cycle, but directly recruits some participants to continue the data collection task in the next multiple cycles. The participant selection problem that spans multiple cycles can be modeled as a dynamic decision-making problem. Since heuristic strategies may fall into a local optimal solution, this paper uses reinforcement learning to solve the participant selection problem: We use the participant selection system as an agent of reinforcement learning, and design the

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

OpenAUC: towards AUC-oriented open-set recognition 22

OpenAUC: towards AUC-oriented open-set recognition

引用

Proceedings of the 36th International Conference on Neural information processing Systems

作者： Zitai Wang Qianqian Xu Zhiyong Yang Yuan He Xiaochun Cao Qingming Huang SKLOIS 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 Tech. CAS School of Computer Science and Tech. University of Chinese Academy of Sciences Alibaba Group School of Cyber Science and Tech. Shenzhen Campus Sun Yat-sen University and SKLOIS Institute of Information Engineering CAS School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS and BDKM University of Chinese Academy of Sciences and Peng Cheng Laboratory

ISBN: (纸本)9781713871088

Traditional machine learning follows a close-set assumption that the training and test set share the same label space. While in many practical scenarios, it is inevitable that some test samples belong to unknown classes (open-set). To fix this issue, Open-Set Recognition (OSR), whose goal is to make correct predictions on both close-set samples and open-set samples, has attracted rising attention. In this direction, the vast majority of literature focuses on the pattern of open-set samples. However, how to evaluate model performance in this challenging task is still unsolved. In this paper, a systematic analysis reveals that most existing metrics are essentially inconsistent with the aforementioned goal of OSR: (1) For metrics extended from close-set classification, such as Open-set F-score, Youden's index, and Normalized Accuracy, a poor open-set prediction can escape from a low performance score with a superior close-set prediction. (2) Novelty detection AUC, which measures the ranking performance between close-set and open-set samples, ignores the close-set performance. To fix these issues, we propose a novel metric named OpenAUC. Compared with existing metrics, OpenAUC enjoys a concise pairwise formulation that evaluates open-set performance and close-set performance in a coupling manner. Further analysis shows that OpenAUC is free from the aforementioned inconsistency properties. Finally, an end-to-end learning method is proposed to minimize the OpenAUC risk, and the experimental results on popular benchmark datasets speak to its effectiveness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Secure and Efficient Data Storage and Sharing Scheme Based on Double Blockchain

引用

Computers, Materials & Continua 2021年第1期66卷 499-515页

作者： Lejun Zhang Minghui Peng Weizheng Wang Yansen Su Shuna Cui Seokhoon Kim College of Information Engineering Yangzhou UniversityYangzhou225127China School Math&Computer Science Quanzhou Normal UniversityQuanzhou362000China Division of Computer Science University of AizuAizu–Wakamatsu9658580Japan Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and TechnologyAnhui UniversityHefei230601China Medical College of Yangzhou University Yangzhou225001China Department of Gynecology and Obstetrics Affiliated Hospital of Yangzhou UniversityYangzhouChina Department of Computer Software Engineering Soonchunhyang UniversityAsanKorea

In the digital era,electronic medical record(EMR)has been a major way for hospitals to store patients’medical *** traditional centralized medical system and semi-trusted cloud storage are difficult to achieve dynamic balance between privacy protection and data *** storage capacity of blockchain is limited and single blockchain schemes have poor scalability and low *** address these issues,we propose a secure and efficient medical data storage and sharing scheme based on double *** our scheme,we encrypt the original EMR and store it in the *** storage blockchain stores the index of the complete EMR,and the shared blockchain stores the index of the shared part of the *** with different attributes can make requests to different blockchains to share different parts according to their own *** experiments,it was found that cloud storage combined with blockchain not only solved the problem of limited storage capacity of blockchain,but also greatly reduced the risk of leakage of the original *** Extraction Signature(CES)combined with the double blockchain technology realized the separation of the privacy part and the shared part of the original *** symmetric encryption technology combined with Ciphertext-Policy Attribute-Based Encryption(CP–ABE)not only ensures the safe storage of data in the cloud,but also achieves the consistency and convenience of data update,avoiding redundant backup of *** analysis and performance analysis verified the feasibility and effectiveness of our scheme.

关键词： Cloud storage blockchain electronic medical records access control data sharing privacy

来源：评论

学校读者我要写书评

暂无评论

The minority matters: a diversity-promoting collaborative metric learning algorithm 22

The minority matters: a diversity-promoting collaborative me...

引用

Proceedings of the 36th International Conference on Neural information processing Systems

作者： Shilong Bao Qianqian Xu Zhiyong Yang Yuan He Xiaochun Cao Qingming Huang State Key Laboratory of Information Security 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 School of Computer Science and Tech. University of Chinese Academy of Sciences Alibaba Group School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Laboratory of Big Data Mining and Knowledge Management CAS and Peng Cheng Laboratory

ISBN: (纸本)9781713871088

Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and Collaborative Filtering. Following the convention of RS, existing methods exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, we argue that the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to include a multiple set of representations for each user in the system. Based on this embedding paradigm, user preference toward an item is aggregated from different embeddings by taking the minimum item-user distance among the user embedding set. Furthermore, we observe that the diversity of the embeddings for the same user also plays an essential role in the model. To this end, we propose a Diversity Control Regularization Scheme (DCRS) to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could generalize well to unseen test data by tackling the challenge of the annoying operation that comes from the minimum value. Experiments over a range of benchmark datasets speak to the efficacy of DPCML.

关键词：

来源：评论

学校读者我要写书评

暂无评论

OTKGE: multi-modal knowledge graph embeddings via optimal transport 22

OTKGE: multi-modal knowledge graph embeddings via optimal tr...

引用

Proceedings of the 36th International Conference on Neural information processing Systems

作者： Zongsheng Cao Qianqian Xu Zhiyong Yang Yuan He Xiaochun Cao Qingming Huang SKLOIS 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 Tech. CAS School of Computer Science and Tech. University of Chinese Academy of Sciences Alibaba Group School of Cyber Science and Tech. Shenzhen Campus Sun Yat-sen University and SKLOIS Institute of Information Engineering CAS School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS and BDKM University of Chinese Academy of Sciences and Peng Cheng Laboratory

ISBN: (纸本)9781713871088

Multi-modal knowledge graph embeddings (KGE) have caught more and more attention in learning representations of entities and relations for link prediction tasks. Different from previous uni-modal KGE approaches, multi-modal KGE can leverage expressive knowledge from a wealth of modalities (image, text, etc.), leading to more comprehensive representations of real-world entities. However, the critical challenge along this course lies in that the multi-modal embedding spaces are usually heterogeneous. In this sense, direct fusion will destroy the inherent spatial structure of different modal embeddings. To overcome this challenge, we revisit multi-modal KGE from a distributional alignment perspective and propose optimal transport knowledge graph embeddings (OTKGE). Specifically, we model the multi-modal fusion procedure as a transport plan moving different modal embeddings to a unified space by minimizing the Wasserstein distance between multi-modal distributions. Theoretically, we show that by minimizing the Wasserstein distance between the individual modalities and the unified embedding space, the final results are guaranteed to maintain consistency and comprehensiveness. Moreover, experimental results on well-established multi-modal knowledge graph completion benchmarks show that our OTKGE achieves state-of-the-art performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Unified-modal Salient Object Detection via Adaptive Prompt Learning

arXiv

引用

arXiv 2023年

作者： Wang, Kunpeng Li, Chenglong Tu, Zhengzheng Liu, Zhengyi Luo, Bin Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Computer Science and Technology Anhui University Hefei230601 China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei China Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Artificial Intelligence Anhui University Hefei230601 China The Institute of Physical Science and Information Technology Anhui University Hefei230601 China

Existing single-modal and multi-modal salient object detection (SOD) methods focus on designing specific architectures tailored for their respective tasks. However, developing completely different models for different tasks leads to labor and time consumption, as well as high computational and practical deployment costs. In this paper, we attempt to address both single-modal and multi-modal SOD in a unified framework called UniSOD, which fully exploits the overlapping prior knowledge between different tasks. Nevertheless, assigning appropriate strategies to modality variable inputs is challenging. To this end, UniSOD learns modality-aware prompts with task-specific hints through adaptive prompt learning, which are plugged into the proposed pre-trained baseline SOD model to handle corresponding tasks, while only requiring few learnable parameters compared to training the entire model. Each modality-aware prompt is generated from a switchable prompt generation block, which adaptively performs structural switching based on single-modal and multi-modal inputs without human intervention. Through end-to-end joint training, UniSOD achieves overall performance improvement on 14 benchmark datasets for RGB, RGB-D, and RGB-T SOD, which demonstrates that our method effectively and efficiently unifies single-modal and multi-modal SOD tasks. The code and results are available at https://***/Angknpng/UniSOD. Copyright © 2023, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：