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

DCAS-BMT: Dynamic Construction and Adjustment of Skewed Bonsai Merkle Tree for Performance Enhancement in Secure Non-Volatile Memory

引用

IEEE Transactions on Computers 2025年

作者： Zhang, Yu Chen, Renhai Yan, Hangyu Wu, Hongyue Feng, Zhiyong Tianjin University College of Intelligence and Computing Tianjin300350 China Nanjing University State Key Lab. for Novel Software Technology Nanjing210023 China Yunnan University of Finance and Economics Yunnan Key Lab. of Service Computing Kunming650221 China

Traditional DRAM-based memory solutions face challenges, including high energy consumption and limited scalab.lity. Non-Volatile Memory (NVM) offers low energy consumption and high scalab.lity. However, security challenges, particularly data remanence vulnerabilities, persist. Prevalent methods such as the Bonsai Merkle Tree (BMT) are employed to ensure data security. However, the consistency requirements for integrity tree updates have led to performance issues. It is observed that compared to a secure NVM system without persistent secure metadata, the average overhead for updating and persisting the BMT root with persistent secure metadata is as high as 2.48 times. Therefore, this paper aims to mitigate these inefficiencies by leveraging the principle of memory access locality. We propose the Dynamic Construction and Adjustment of Skewed Bonsai Merkle Tree (DCAS-BMT). The DCAS-BMT is dynamically built and continuously adjusted at runtime according to access weights, ensuring frequently accessed memory blocks reside on shorter paths to the root node. This reduces the verification steps for frequently accessed memory blocks, thereby lowering the overall cost of memory authentication and updates. Experimental results using the USIMM memory simulator demonstrate that compared to the widely used BMT approach, the DCAS-BMT scheme shows a performance improvement of 34.1%. © 1968-2012 IEEE.

关键词： Scalab.lity

来源：评论

学校读者我要写书评

暂无评论

An event summarizing algorithm based on the timeline relevance model in Sina Weibo

引用

Science China(Information Sciences) 2018年第12期61卷 184-186页

作者： Kai LEI Lizhu ZHANG Ying LIU Ying SHEN Chenwei LIU Qian YU Weitao WENG Shenzhen Key Lab for Cloud Computing Technology & Applications (SPCCTA) School of Electronics and Computer Engineering Peking University

Dear editor,Depicting superior punctuality and originality,Weibo has become increasingly critical and influential in China for online information acquisition and sharing. However, very few research has studied Weibo to investigate event summarizing even though most of the published Weibos are event-driven. Besides, we observe that the existing methods are unsuitable for process-

关键词： IDF TF HAC An event summarizing algorithm based on the timeline relevance model in Sina Weibo

来源：评论

学校读者我要写书评

暂无评论

The NeRF Signature: Codebook-Aided Watermarking for Neural Radiance Fields

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年第6期47卷 4652-4667页

作者： Ziyuan Luo Anderson Rocha Boxin Shi Qing Guo Haoliang Li Renjie Wan Department of Computer Science Hong Kong Baptist University Hong Kong SAR China Artificial Intelligence Lab. Recod.ai Institute of Computing University of Campinas Campinas Brazil State Key Laboratory of Multimedia Information Processing and National Engineering Research Center of Visual Technology School of Computer Science Peking University Beijing China IHPC and CFAR Agency for Science Technology and Research (A*STAR) Singapore Department of Electrical Engineering City University of Hong Kong Kowloon Hong Kong

Neural Radiance Fields (NeRF) have been gaining attention as a significant form of 3D content representation. With the proliferation of NeRF-based creations, the need for copyright protection has emerged as a critical issue. Although some approaches have been proposed to embed digital watermarks into NeRF, they often neglect essential model-level considerations and incur substantial time overheads, resulting in reduced imperceptibility and robustness, along with user inconvenience. In this paper, we extend the previous criteria for image watermarking to the model level and propose NeRF Signature, a novel watermarking method for NeRF. We employ a Codebook-aided Signature Embedding (CSE) that does not alter the model structure, thereby maintaining imperceptibility and enhancing robustness at the model level. Furthermore, after optimization, any desired signatures can be embedded through the CSE, and no fine-tuning is required when NeRF owners want to use new binary signatures. Then, we introduce a joint pose-patch encryption watermarking strategy to hide signatures into patches rendered from a specific viewpoint for higher robustness. In addition, we explore a Complexity-Aware key Selection (CAKS) scheme to embed signatures in high visual complexity patches to enhance imperceptibility. The experimental results demonstrate that our method outperforms other baseline methods in terms of imperceptibility and robustness.

关键词： Neural radiance field Watermarking Three-dimensional displays Training Robustness Pipelines Computational modeling Visualization Solid modeling Rendering (computer graphics)

来源：评论

学校读者我要写书评

暂无评论

A method to evaluate the spatial extensibility of a switching unit and network

引用

Science China(Information Sciences) 2014年第2期57卷 140-156页

作者： ZHANG Bo WU JunTing WANG BinQiang LI Hui National Digital Switching System Engineering Technological R&D Center Shenzhen Key Lab of Cloud Computing Technology and Application

Switching units and networks have been analyzed as extensible fabrics,mostly in terms of their scheduling *** traditional literature on switching extensibility has provided complexity theory only relating to the total numbers of inputs(or outputs)and exchange *** paper analyzes switching extensibility in terms of not only the scheduling algorithm and also the fabric *** is found that determining extensibility from soft complexity related to the number of inputs(or outputs)of the scheduling algorithm and the fabric extensibility in previous studies without quantization is a flawed conception.A method is thus proposed to express the spatial extensibility of a switching unit or network in terms of the connections of a switching resource and *** method calculates parameter ES(the efciency of switching)of an m×n switching unit and obtains two functions of the switching unit to describe spatial extensibility along with the number of unilateral inputs or *** is found that the range of ES is(0,1]and three types of switching unit and two types of crosspoint networks have ES=*** is calculated for banyan,Clos,parallel packet,fully interconnected and recirculation switching *** ES value for the banyan switching network is larger than that for other networks,and switching networks are classified into three types that have absolute/linear/denied spatial extensibility according to the limES *** is demonstrated that a switching network has the largest ES value when it contains only the five types of switching unit for which ES=***,a group-switching-first self-routing banyan switching network with lower blocking probability and time delay is deduced,and the ES method is contrasted with two other methods of evaluating spatial extensibility in terms of their mathematical expressions and intuitive graphics,for the five types of switching network listed above.

关键词： spatial extensibility connection state efciency of switching banyan fully interconnected recirculation switching network

来源：评论

学校读者我要写书评

暂无评论

Vulnerability and risk assessment of XEN hypervisor 24

Vulnerability and risk assessment of XEN hypervisor

引用

24th Americas Conference on Information Systems 2018: Digital Disruption, AMCIS 2018

作者： Litchfield, Alan Shahzad, Abid Service and Cloud Computing Research Lab. Auckland University of Technology New Zealand

ISBN: (纸本)9780996683166

A vulnerability prediction and risk assessment process for the Xen hypervisor that predicts the number of vulnerabilities and levels of risk a specific software version provides is presented. 89 hypervisor is a key component of virtualisation and is thus a target of attackers. When such critical infrastructure is compromised, then the assets of service consumers are consequently at risk. The benefit of a risk analysis process is that it provides surety for cloud services consumers (making the cloud computing option more attractive) and assists Systems Administrators in decision making about software choices and version upgrades. The process has been tested on three popular open source, infrastructure level software packages. In each case, the level of predictive accuracy is excellent to good. The study combines quantitative and qualitative methods to predict vulnerabilities and determine risk levels. © 2018 Association for Information Systems. All rights reserved.

关键词： Risk assessment

来源：评论

学校读者我要写书评

暂无评论

A synchronous algorithm of network coding with hardware logic

A synchronous algorithm of network coding with hardware logi...

引用

Symposium on ICT and Energy Efficiency and Workshop on Information Theory and Security, CIICT 2012

作者： Li, Jiang Li, Yining Li, Hui Zhu, Zhipu Zhang, Huayu Chen, Fuxing Shenzhen Key Lab. of Cloud Computing Technology and Application Shenzhen Graduate School Peking University Shenzhen 518055 China

ISBN: (纸本)9781849195478

This paper presents an efficient hardware prototype for network coding (NC). First, a packet synchronization mechanism is introduced to settle the problem of packet arriving mismatch between different incoming channels. Then a high-speed lookup-table-based circuit is designed to perform dot product over Galois Field, which forms the basic calculation unit of NC operation. Taking the speed advantage of FPGA hardware, this prototype is able to perform network coding operations within several hundred nanoseconds. Thus further studies and emulations on NC are able to be carried out upon this platform in the real network scenario.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Query-focused multi-document summarization based on query-sensitive feature space 12

Query-focused multi-document summarization based on query-se...

引用

21st ACM International Conference on Information and Knowledge Management, CIKM 2012

作者： Yin, Wenpeng Pei, Yulong Zhang, Fan Huang, Lian'en Shenzhen Key Lab. for Cloud Computing Technology and Application Peking University Shenzhen Graduate School Shenzhen 518055 China

ISBN: (纸本)9781450311564

Query-oriented relevance, information richness and novelty are important requirements in query-focused summarization, which, to a considerable extent, determine the summary quality. Previous work either rarely took into account all above demands simultaneously or dealt with part of them in the dynamic process of choosing sentences to generate a summary. In this paper, we propose a novel approach that integrates all these requirements skillfully by treating them as sentence features, making that the finally generated summary could fully reflect the combinational effect of these properties. Experimental results on the DUC2005 and DUC2006 datasets demonstrate the effectiveness of our approach. © 2012 ACM.

关键词： Vector spaces

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised clustering ensemble based on multi-ant colonies algorithm

Semi-supervised clustering ensemble based on multi-ant colon...

引用

7th International Conference on Rough Sets and Knowledge technology, RSKT 2012

作者： Yang, Yan Wang, Hongjun Lin, Chao Zhang, Jinyuan School of Information Science and Technology Provincial Key Lab. of Cloud Computing and Intelligent Technology Southwest Jiaotong University Chengdu 610031 China

ISBN: (纸本)9783642318993

Semi-supervised clustering ensemble has emerged as an important elab.ration of classical clustering problem that improves quality and robustness in clustering by combining the results of different clustering components with user provided constraints. In this paper, we propose a novel semi-supervised consensus clustering algorithm based on multi-ant colonies. Our method incorporates pairwise constraints not only in each ant colony clustering process, but also in computing new similarity matrix during the multi-ant colonies ensemble. Experimental results demonstrate the effectiveness of the proposed method. © 2012 Springer-Verlag.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Automatic multi-document summarization based on new sentence similarity measures

Automatic multi-document summarization based on new sentence...

引用

12th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2012

作者： Yin, Wenpeng Pei, Yulong Huang, Lian'en Shenzhen Key Lab. for Cloud Computing Technology and Applications Peking University Shenzhen Graduate School Shenzhen Guangdong 518055 China

ISBN: (纸本)9783642326943

The acquiring of sentence similarity has become a crucial step in graph-based multi-document summarization algorithms which have been intensively studied during the past decade. Previous algorithms generally considered sentence-level structure information and semantic similarity separately, which, consequently, had no access to grab similarity information comprehensively. In this paper, we present a general framework to exemplify how to combine the two factors above together so as to derive a corpus-oriented and more discriminative sentence similarity. Experimental results on the DUC2004 dataset demonstrate that our approaches could improve the multi-document summarization performance to a considerable extent. © 2012 Springer-Verlag.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Generic multi-document summarization using topic-oriented information

Generic multi-document summarization using topic-oriented in...

引用

12th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2012

作者： Pei, Yulong Yin, Wenpeng Huang, Lian'En Shenzhen Key Lab. for Cloud Computing Technology and Applications Peking University Shenzhen Graduate School Shenzhen Guangdong 518055 China

ISBN: (纸本)9783642326943

The graph-based ranking models have been widely used for multi-document summarization recently. By utilizing the correlations between sentences, the salient sentences can be extracted according to the ranking scores. However, sentences are treated in a uniform way without considering the topic-level information in traditional methods. This paper proposes the topic-oriented PageRank (ToPageRank) model, in which topic information is fully incorporated, and the topic-oriented HITS (ToHITS) model is designed to compare the influence of different graph-based algorithms. We choose the DUC2004 data set to examine the models. Experimental results demonstrate the effectiveness of ToPageRank. And the results also show that ToPageRank is more effective and robust than other models including ToHIST under different evaluation metrics. © 2012 Springer-Verlag.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：