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

4th International Conference on Blockchain Technology and Information Security, ICBCTIS 2024

作者： Gao, Qianwen Tu, Yichi Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences Tca Lab of State Key Laboratory of Computer Science Beijing China

ISBN: (纸本)9798331528324

Blockchain wallet is a technology focusing on generating, storing and utilizing private keys to manage digital assets securely. As a service, blockchain wallets require user authentication. Traditional blockchain wallets employ mnemonic phrases to assist users in storing and managing private keys. However, the complex operation procedures and the totally different identity authentication mechanism of traditional wallets undoubtedly hinder their development. What's worse, it's inconvenient for secure storage, and doesn't support account recovery, which affects the security and usability of traditional wallets. To address this issue, this paper provides a solution for identity authentication and private key management of blockchain digital wallets in distributed scenarios. It proposes an architecture for building a distributed multi-factor authentication digital wallet for blockchain. We design and implement this blockchain digital wallet based on a distributed multi-factor authentication system. By employing a secret sharing scheme, the encrypted private key shares are stored on distributed servers. When a user wants to use his private key, the wallet conducts a private key recovery operation, which significantly reducing the risk of storing the private key locally. This mitigates security issues such as single-point failure and weak password attacks. What's more, Users are only required to operate the hardware token once during the authentication and private key recovery operation, ensuring the balance between the security and usability of blockchain digital wallets. © 2024 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Improved key-Recovery Attacks Under Imperfect SCA Oracle for Lattice-Based KEMs 17th

Improved Key-Recovery Attacks Under Imperfect SCA Oracle for...

引用

17th International Conference on Provable and Practical Security, ProvSec 2023

作者： Shi, Wenhao Han, Jiang Jiang, Haodong Ma, Zhi Henan Key Laboratory of Network Cryptography Technology Zhengzhou China TCA of State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783031455124

Plaintext-checking (PC) oracle-based side-channel-attacks (SCAs) is a major class of key recovery chosen-ciphertext SCAs on lattice-based key encapsulation mechanisms (KEMs). In practice, the PC oracle derived in SCAs is usually imperfect. In this paper, we propose an improved SCA for lattice-based KEMs with lower sample complexity (i.e. the required number of traces) when the PC oracle is imperfect. The basic idea of our method is to roughly recover the secret key and detect the erroneous position in the secret key, later correct the problematic entries with various known attacks for LWE (e.g., primal attack). We experimentally verified our method on Kyber512, and the reduction of sample complexity is significant. For example, it can reduce the sample complexity by 54.06 % when the accuracy is 0.890, for higher accuracy 0.950, the reduction of sample complexity is 35.81 %. We also estimate the concrete security of Kyber512 after the side-channel-attack for different accuracy levels, including the primal attack, dual attack, decoding approach and the hybrid attack. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Side channel attack

来源：评论

学校读者我要写书评

暂无评论

FIFAWC:a dataset with detailed annotation and rich semantics for group activity recognition

引用

Frontiers of computer science 2024年第6期18卷 271-272页

作者： Duoxuan PEI Di HUANG Yunhong WANG State Key Laboratory of Software Development Environment School of Computer Science and EngineeringBeihang UniversityBeijing 100191China Intelligent Recognition and Image Processing Lab. School of Computer Science and EngineeringBeihang UniversityBeijing 100191China

1 *** Activity Recognition(GAR),which aims to identify activities performed collectively in videos,has gained significant attention *** conventional action recognition centered on single individuals,GAR explores the c... 详细信息

关键词： has collective gained

来源：评论

学校读者我要写书评

暂无评论

Reorder Pointer Flow in Sound Concurrency Bug Prediction 24

Reorder Pointer Flow in Sound Concurrency Bug Prediction

引用

46th IEEE/ACM International Conference on Software Engineering, ICSE 2024

作者： Guo, Yuqi Zhu, Shihao Cai, Yan He, Liang Zhang, Jian State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China TCA Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9798400702174

Due to the non-determinism of thread interleaving, predicting concurrency bugs has long been an extremely difficult task. Recently, several sound bug-detecting approaches were proposed. These approaches are based on local search, i.e., mutating the sequential order of the observed trace and predicting whether the mutated sequential order can trigger a bug. Surprisingly, during this process, they never consider reordering the data flow of the pointers, which can be the key point to detecting many complex bugs. To alleviate this weakness, we propose a new flow-sensitive point-to analysis technique ConPTA to help actively reorder the pointer flow during the sequential order mutation process. Based on ConPTA, we further propose a new sound predictive bug-detecting approach Eagle to predict four types of concurrency bugs. They are null pointer dereference (NPD), uninitialized pointer use (UPU), use after free (UAF), and double free (DF). By actively reordering the pointer flow, Eagle can explore a larger search space of the thread interleaving during the mutation and thus detect more concurrency bugs. Our evaluation of Eagle on 10 real-world multi-threaded programs shows that Eagle significantly outperforms four state-of-the-art bug-detecting approaches UFO, ConVul, ConVulPOE and Period in both effectiveness and efficiency. © 2024 IEEE computer Society. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Large circuit models: opportunities and challenges

引用

science China(Information sciences) 2024年第10期67卷 25-66页

作者： Lei CHEN Yiqi CHEN Zhufei CHU Wenji FANG Tsung-Yi HO Ru HUANG Yu HUANG Sadaf KHAN Min LI Xingquan LI Yu LI Yun LIANG Jinwei LIU Yi LIU Yibo LIN Guojie LUO Hongyang PAN Zhengyuan SHI Guangyu SUN Dimitrios TSARAS Runsheng WANG Ziyi WANG Xinming WEI Zhiyao XIE Qiang XU Chenhao XUE Junchi YAN Jun YANG Bei YU Mingxuan YUAN Evangeline F.Y.YOUNG Xuan ZENG Haoyi ZHANG Zuodong ZHANG Yuxiang ZHAO Hui-Ling ZHEN Ziyang ZHENG Binwu ZHU Keren ZHU Sunan ZOU Huawei Noah’s Ark Lab School of Integrated Circuits Peking University Faculty of Electrical Engineering and Computer Science Ningbo University Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Department of Computer Science and Engineering The Chinese University of Hong Kong School of Integrated Circuits Southeast University Huawei HiSilicon Peng Cheng Laboratory School of Computer Science Peking University School of Microelectronics State Key Laboratory of Integrated Chips and System Fudan University School of Artificial Intelligence Shanghai Jiao Tong University

Within the electronic design automation(EDA) domain, artificial intelligence(AI)-driven solutions have emerged as formidable tools, yet they typically augment rather than redefine existing methodologies. These solutions often repurpose deep learning models from other domains, such as vision, text, and graph analytics, applying them to circuit design without tailoring to the unique complexities of electronic circuits. Such an “AI4EDA” approach falls short of achieving a holistic design synthesis and understanding,overlooking the intricate interplay of electrical, logical, and physical facets of circuit data. This study argues for a paradigm shift from AI4EDA towards AI-rooted EDA from the ground up, integrating AI at the core of the design process. Pivotal to this vision is the development of a multimodal circuit representation learning technique, poised to provide a comprehensive understanding by harmonizing and extracting insights from varied data sources, such as functional specifications, register-transfer level(RTL) designs, circuit netlists,and physical layouts. We champion the creation of large circuit models(LCMs) that are inherently multimodal, crafted to decode and express the rich semantics and structures of circuit data, thus fostering more resilient, efficient, and inventive design methodologies. Embracing this AI-rooted philosophy, we foresee a trajectory that transcends the current innovation plateau in EDA, igniting a profound “shift-left” in electronic design methodology. The envisioned advancements herald not just an evolution of existing EDA tools but a revolution, giving rise to novel instruments of design-tools that promise to radically enhance design productivity and inaugurate a new epoch where the optimization of circuit performance, power, and area(PPA) is achieved not incrementally, but through leaps that redefine the benchmarks of electronic systems' capabilities.

关键词： AI-rooted EDA large circuit models (LCMs) multimodal circuit representation learning circuit optimization

来源：评论

学校读者我要写书评

暂无评论

SpikingMiniLM: energy-efficient spiking transformer for natural language understanding

引用

science China(Information sciences) 2024年第10期67卷 115-128页

作者： Jiayu ZHANG Jiangrong SHEN Zeke WANG Qinghai GUO Rui YAN Gang PAN Huajin TANG College of Computer Science and Technology Zhejiang University The State Key Lab of Brain-Machine Intelligence Zhejiang University Collaborative Innovation Center of Artificial Intelligence Zhejiang University Advanced Computing and Storage Laboratory Huawei Technologies Co. Ltd. College of Computer Science and Technology Zhejiang University of Technology MOE Frontier Science Center for Brain Science and Brain-Machine Integration Zhejiang University

In the era of large-scale pretrained models, artificial neural networks（ANNs） have excelled in natural language understanding（NLU） tasks. However, their success often necessitates substantial computational resources and energy consumption. To address this, we explore the potential of spiking neural networks（SNNs） in NLU——a promising avenue with demonstrated advantages, including reduced power consumption and improved efficiency due to their event-driven characteristics. We propose the SpikingMiniLM,a novel spiking Transformer model tailored for natural language understanding. We first introduce a multi-step encoding method to convert text embeddings into spike trains. Subsequently, we redesign the attention mechanism and residual connections to make our model operate on the pure spike-based paradigm without any normalization technique. To facilitate stable and fast convergence, we propose a general parameter initialization method grounded in the stable firing rate principle. Furthermore, we apply an ANN-to-SNN knowledge distillation to overcome the challenges of pretraining SNNs. Our approach achieves a macro-average score of 75.5 on the dev sets of the GLUE benchmark, retaining 98% of the performance exhibited by the teacher model MiniLMv2. Our smaller model also achieves similar performance to BERTMINIwith fewer parameters and much lower energy consumption, underscoring its competitiveness and resource efficiency in NLU tasks.

关键词： spiking neural networks natural language understanding spiking Transformer spike-based attention multi-step encoding ANN-to-SNN distillation

来源：评论

学校读者我要写书评

暂无评论

SinGRAV: Learning a Generative Radiance Volume from a Single Natural Scene

引用

Journal of computer science & Technology 2024年第2期39卷 305-319页

作者：王玉洁陈学霖陈宝权 School of Computer Science and Technology Shandong UniversityQingdao 266237China State Key Laboratory of General Artificial Intelligence Beijing 100871China School of Intelligence Science and Technology Peking UniversityBeijing 100871China Tencent AI Lab Tencent Holdings LimitedShenzhen 518057China

We present SinGRAV, an attempt to learn a generative radiance volume from multi-view observations of a single natural scene, in stark contrast to existing category-level 3D generative models that learn from images of many object-centric scenes. Inspired by SinGAN, we also learn the internal distribution of the input scene, which necessitates our key designs w.r.t. the scene representation and network architecture. Unlike popular multi-layer perceptrons (MLP)-based architectures, we particularly employ convolutional generators and discriminators, which inherently possess spatial locality bias, to operate over voxelized volumes for learning the internal distribution over a plethora of overlapping regions. On the other hand, localizing the adversarial generators and discriminators over confined areas with limited receptive fields easily leads to highly implausible geometric structures in the spatial. Our remedy is to use spatial inductive bias and joint discrimination on geometric clues in the form of 2D depth maps. This strategy is effective in improving spatial arrangement while incurring negligible additional computational cost. Experimental results demonstrate the ability of SinGRAV in generating plausible and diverse variations from a single scene, the merits of SinGRAV over state-of-the-art generative neural scene models, and the versatility of SinGRAV by its use in a variety of applications. Code and data will be released to facilitate further research.

关键词： generative model neural radiance field 3D scene generation

来源：评论

学校读者我要写书评

暂无评论

Semantic-Aware Pseudo-labeling for Unsupervised Meta-Learning

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年第07期47卷 5475-5488页

作者： Ouyang, Tianran Dong, Xingping Ye, Mang Du, Bo Shao, Ling Shen, Jianbing Wuhan University School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan430072 China University of Chinese Academy of Sciences UCAS-Terminus AI Lab Beijing China University of Macau State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science China

In unsupervised meta-learning, the clustering-based pseudo-labeling approach is an attractive framework, since it is model-agnostic, allowing it to synergize with supervised algorithms to learn from unlabeled data. However, the pseudo-labels suffer from clustering noise and semantic chaos problems, further impacting the effectiveness of meta-learning. In this paper, we analyze and optimize the pseudo-labeling process, including encoding and clustering, aiming to generate semantic- like pseudo-labels to narrow the gap between unsupervised and supervised meta-learning. Firstly, during the encoding, we observe that the embedding space of existing methods lacks clustering-friendly properties, which is the primary reason for clustering noise. To address this issue, we minimize the inter-to-intra-class similarity ratio to generate clustering-friendly embedding features and validate our approach through comprehensive experiments. Then, during the clustering, we find that the semantic quality of pseudo-labels is not adequately controlled, resulting in semantic chaos of pseudo-labels. We propose a semantic-stability index to measure the semantic quality of pseudo-labels quantitatively. Based on this index, we propose the Semantic-aware Pseudo-label Reassignment mechanism to generate semantic- like pseudo-labels for all samples. Our approach is model-agnostic and can easily be integrated into existing supervised methods. To demonstrate its generalization ability, we integrate it into two representative algorithms: MAML and EP. The results on three main few-shot benchmarks clearly show that the proposed method achieves significant improvement compared to state-of-the-art models. Notably, our approach also outperforms the corresponding supervised method in three tasks. The source code will be made publicly available. ©1979-2012 IEEE.

关键词： Latent semantic analysis

来源：评论

学校读者我要写书评

暂无评论

Stackelberg-Game Computation Offloading Scheme for Parked Vehicle-Assisted VEC and Experiment Analysis

IEEE Transactions on Intelligent Vehicles

引用

IEEE Transactions on Intelligent Vehicles 2024年第9期9卷 1-12页

作者： Liu, Chunhong Zhao, Mengdi Wang, Huaichen Cheng, Bo Liu, Jialei Yuan, Peiyan Engineering Lab of Intelligence Business & Internet of Things and School of Computer and Information Engineering Henan Normal University Xinxiang China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Hubei Key Laboratory of Power System Design and Test for Electrical Vehicle and School of Computer Engineering Hubei University of Arts and Science Xiangyang China

Vehicle edge computing (VEC) offers users low-latency and high-reliability services by using computational resources at the network's edge. Nevertheless, because of inadequate infrastructure and limited resources, computation-intensive and delay-sensitive vehicle applications cannot be performed efficiently at the edge. Therefore, several studies have used the idle resources of parked vehicles to assist in computation offloading. In this paper, we propose a parked vehicle-assisted vehicle edge computing architecture considering multi-agent collaboration, including intelligent vehicles and edge servers. Additionally, we propose a framework for a parallel Internet of Vehicles (IoV) utilizing computational experiment. The service provider is assigned the role of owning VEC resources and recruiting parking vehicle resources. The model was constructed by using the resource consumption-service relationship of both offloading parties to ensure service quality. First, a Stackelberg game model was constructed based on the interaction between requesting vehicles and a service provider. The latter was the leader, and the requesting vehicles were the followers. The Nash equilibrium for optimal pricing and offloading allocations was attained and verified, and a distributed gradient-based equilibrium algorithm was designed to solve the Stackelberg game model and obtain the final decision through mutual communication. The method also protects the privacy of participants and respects the willingness of requesting vehicles to offload. Finally, the simulation experiments confirmed that the proposed algorithm can achieve game equilibrium. Furthermore, it outperformed state-of-the-art algorithms in improving the service provider's utility. IEEE

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Joint Optimization of Compression, Transmission and Computation for Cooperative Perception Aided Intelligent Vehicular Networks

引用

IEEE Transactions on Vehicular Technology 2025年第5期74卷 8201-8214页

作者： Lu, Binbin Huang, Xumin Wu, Yuan Qian, Liping Zhou, Sheng Niyato, Dusit University of Macau State Key Laboratory of Internet of Things for Smart City The Department of Computer and Information Science Macau China Guangdong University of Technology School of Automation Guangzhou510006 China University of Macau State Key Lab of Internet of Things for Smart City Macau China University of Macau State Key Laboratory of Internet of Things for Smart City The Department of Computer Information Science Macau China Zhuhai UM Science and Technology AQ2 Research Institute Zhuhai519301 China Zhejiang University of Technology Institute of Cyberspace Security Hangzhou310023 China Tsinghua University Beijing National Research Center for Information Science and Technology Department of Electronic Engineering Beijing100084 China Nanyang Technological University School of Computer Science and Engineering Singapore

Cooperative perception is a promising paradigm to tackle the perception limitations of a single intelligent vehicle (IV) to enhance the driving safety and efficiency in intelligent vehicular networks. However, the real-time transmission and computation-intensive fusion of raw sensing data raise new challenges for satisfying the stringent delay requirement of delay-sensitive applications. In this paper, we formulate a joint optimization problem of the cooperative IV selection, compression ratio selection, transmit power control, task offloading decision and computation allocation to minimize the end-to-end delay consisting of compression, transmission and computation. In particular, to meet the perception probability requirement, the quality and quantity-aware matching algorithm is proposed to optimize the cooperative IV selection. To guarantee the queue stability of offloading tasks, we develop the Lyapunov optimization algorithm to determine the upper bound of the offloading tasks and the corresponding optimal computation allocation. The Lyapunov aided deep reinforcement learning algorithm is further proposed to dynamically adjust the task offloading decision and compression ratio selection to minimize the end-to-end delay with the transmit power control being optimized by the successive convex approximation algorithm. Simulation results demonstrate that, compared to several benchmark algorithms, our proposed algorithm achieves the lowest end-to-end delay while guaranteeing the requirements on perception probability and queue stability effectively. © 1967-2012 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：