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

3rd International Conference on Cyber-Enabled distributed Computing and Knowledge Discovery, CyberC 2011

作者： Zhu, Yanxu Yin, Gang Wang, Huaimin Shi, Dianxi Rao, Xiang Yuan, Lin School of Computer National Laboratory for Parallel and Distributed Processing National University of Defense Technology 410073 Changsha Hunan China College of Electronic Technology Information Engineering University 450004 Zhengzhou Henan China

ISBN: (纸本)9780769545578

Mining of repeated patterns from HTML documents is the key step towards Web-based data mining and knowledge extraction. Many web crawling applications need efficient repeated patterns mining techniques to generate their wrapper automatically. Existing approaches such as tree matching and string matching can detect repeated patterns with high precision, but their performance is still a challenge for practical web crawling applications. In this paper, we propose an efficient approach for mining repeated patterns based on indent shape of HTML document. Indent shape is a novel and simple model of HTML document, in which tandem repeated waves have strong association with the repeated patterns to be detected. By scanning an indent shape with a horizontal indent-line from bottom to top, the tandem repeated waves are identified by filtering the wave segments with low self-similarities. After that the boundary of HTML code corresponding to repeated patterns can be identified, which could be transformed to regular expressions formal-defined easily. Extensive experiments on two practical data sets retrieved from Internet show that our approach achieves high efficiency significantly, and its precision performance is also generally better than the existing approaches. © 2011 IEEE.

关键词： HTML

来源：评论

学校读者我要写书评

暂无评论

A novel L1 cache based on volatile STT-RAM 20th

A novel L1 cache based on volatile STT-RAM

引用

20th Annual Conference on computer Engineering and Technology, NCCET 2016

作者： Hongguang, Zhang Minxuan, Zhang College of Computer National University of Defense Technology Changsha410073 China National Key Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha410073 China

ISBN: (纸本)9789811031588

Spin-transfer torque random access memory (STT-RAM) is one of the most promising substitutes for universal main memory and cache due to its excellent scalability, high density and low leakage power. Nevertheless, the current non-volatile STT-RAM cache architecture also has some drawbacks, such as long write latency and high write energy, which limit the application of STTRAM in the top level cache design. To solve these problems, we relax the retention time of STT-RAM to explore its different write performance, and propose a novel STT-RAM L1 cache architecture implemented with volatile STT-RAM as well as its related refresh scheme. The performance of proposed design is the same as SRAM L1 cache while its overall power consumption is only 63.8% of the latter one. © Springer Nature Singapore Pte Ltd. 2016.

关键词： Static random access storage

来源：评论

学校读者我要写书评

暂无评论

Exploiting contention and congestion aware switch allocation in network-on-chips 17

Exploiting contention and congestion aware switch allocation...

引用

50th ACM Turing Conference - China, ACM TUR-C 2017

作者： Li, Cunlu Dongy, Dezun Liao, Xiangke National Laboratory for Parallel and Distributed Processing Collaborative Innovation Center of High Performance Computing College of Computer National University of Defense Technology Changsha Hunan410073 China

ISBN: (纸本)9781450348737

Network-on-chip system plays an important role to improve the performance of chip multiprocessor systems. As the complexity of the network increases, congestion problem has become the major performance bottleneck and seriously influence the performance of NoCs. Prior works have focused on designing effective routing algorithm based on collecting congestion and contention information to load balance the traffic. However, most prior works do not consider balancing the traffic load during switch allocation. Due to the lack of congestion information in switch allocation stage, switch allocator performs allocation only based on packet requests and thus aggravates the congestion in the ports of switch. In this paper, we propose to add the congestion and contention information into the switch allocation process and design an efficient on-chip switching strategy which utilizes the contention and congestion information to load balance the traffic and achieve efficient switch allocation. To further enhance the performance of our design, we carefully design our switch allocation strategy to balance the trade-off between traffic load balance and the matching efficiency in switch allocation. We evaluate our design under synthetic traffic and trace of parsec benchmarks. Our evaluations show this mechanism achieves optimal latency compared to best previous switch allocation strategies. © 2017 ACM.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Linearized alternating direction method of multipliers for constrained nonconvex regularized optimization 8

Linearized alternating direction method of multipliers for c...

引用

8th Asian Conference on Machine Learning, ACML 2016

作者： Qiao, Linbo Zhang, Bofeng Su, Jinshu Lu, Xicheng College of Computer National University of Defense Technology ChangSha410073 China National Laboratory for Parallel and Distributed Processing National University of Defense Tech-nology ChangSha410073 China

In this paper, we consider a wide class of constrained nonconvex regularized minimization problems, where the constraints are linearly constraints. It was reported in the litera- ture that nonconvex regularization usually yields a solution with more desirable sparse structural properties beyond convex ones. However, it is not easy to obtain the proximal mapping associated with nonconvex regularization, due to the imposed linearly constraints. In this paper, the optimization problem with linear constraints is solved by the Linearized Alternating Direction Method of Multipliers (LADMM). Moreover, we present a detailed convergence analysis of the LADMM algorithm for solving nonconvex compositely regular- ized optimization with a large class of nonconvex penalties. Experimental results on several real-world datasets validate the efficacy of the proposed algorithm. © 2016 L. Qiaoyz, B. Zhangy, J. Suyz & X. Luyz.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

A systematic review of structured sparse learning

引用

Frontiers of Information Technology & Electronic Engineering 2017年第4期18卷 445-463页

作者： Lin-bo QIAO Bo-feng ZHANG Jin-shu SU Xi-cheng LU College of Computer National University of Defense Technology Changsha 410073 China National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

High-dimensional data arising from diverse scientific research fields and industrial development have led to increased interest in sparse learning due to model parsimony and computational advantage. With the assumption of sparsity, many computational problems can be handled efficiently in practice. Structured sparse learning encodes the structural information of the variables and has been quite successful in numerous research fields. With various types of structures discovered, sorts of structured regularizations have been proposed. These regularizations have greatly improved the efficacy of sparse learning algorithms through the use of specific structural information. In this article, we present a systematic review of structured sparse learning including ideas, formulations, algorithms, and applications. We present these algorithms in the unified framework of minimizing the sum of loss and penalty functions, summarize publicly accessible software implementations, and compare the computational complexity of typical optimization methods to solve structured sparse learning problems. In experiments, we present applications in unsupervised learning, for structured signal recovery and hierarchical image reconstruction, and in supervised learning in the context of a novel graph-guided logistic regression.

关键词： Sparse learning Structured sparse learning Structured regularization

来源：评论

学校读者我要写书评

暂无评论

Using complex network features for fast clustering in the web 11

Using complex network features for fast clustering in the we...

引用

Proceedings of the 20th international conference companion on World wide web

作者： Tang, Jintao Wang, Ting Wang, Ji Lu, Qin Li, Wenjie School of Computer National University of Defense Technology Changsha China Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong National Laboratory for Parallel and Distributed Processing Changsha China

ISBN: (纸本)9781450305181

Applying graph clustering algorithms in real world networks needs to overcome two main challenges: the lack of prior knowledge and the scalability issue. This paper proposes a novel method based on the topological features of complex networks to optimize the clustering algorithms in real-world networks. More specifically, the features are used for parameter estimation and performance optimization. The proposed method is evaluated on real-world networks extracted from the web. Experimental results show improvement both in terms of Adjusted Rand index values as well as runtime efficiency. © 2011 Authors.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

Fast query over encrypted data based on B+ tree

Fast query over encrypted data based on B+ tree

引用

2009 International Conference on Apperceiving Computing and Intelligence Analysis, ICACIA 2009

作者： Wang, Zheng-Fei Tang, Ai-Guo Wang, Wei Department of Computer Hunan Business College Changsha 410205 China National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China School of Computer Science Fudan University Shanghai 200433 China

ISBN: (纸本)9781424452040

There are a lot of important and sensitive data in databases, which need to be protected from attacks. To secure the data, Cryptography support is an effective mechanism. However, a tradeoff must be made between the performance and the security because encryption and decryption greatly degrade the query performance. In this paper, a framework is proposed that can quickly implement query over encrypted data based on B+ tree. When data are stored in the form of cipher, it not only stores the encrypted data themselves, but also creates a B+ tree index for the data before encrypting them. When querying the encrypted data, firstly, it locates the encrypted records related to the querying predicate based on the B+ tree index;secondly, it decrypts the encrypted records to accomplish the results. Meanwhile, it must encrypt the B+ tree itself to protect it from leaking confidential information. According to the structure of the B+ tree, it encrypts each node of the B+ tree separately. The results of experiments show that the query performance over the encrypted data decreases about 20 percent compared with the plaintext query performance, and validate the functionality and usability of our approach. ©2009 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

The fault tolerant parallel algorithm: The parallel recomputing based failure recovery

The fault tolerant parallel algorithm: The parallel recomput...

引用

16th International Conference on parallel Architecture and Compilation Techniques, PACT 2007

作者： Yang, Xuejun Du, Yunfei Wang, Panfeng Fu, Hongyi Jia, Jia Wang, Zhiyuan Suo, Guang National Laboratory for Paralleling and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan 410073 China

ISBN: (纸本)0769529445

This paper addresses the issue of fault tolerance in parallel computing, and proposes a new method named parallel recomputing. Such method achieves fault recovery automatically by using surviving processes to recompute the workload of failed processes in parallel. The paper firstly defines the fault tolerant parallel algorithm (FTPA) as the parallel algorithm which tolerates failures by parallel recomputing. Furthermore, the paper proposes the inter-process definition-use relationship analysis method based on the conventional definition-use analysis for revealing the relationship of variables in different processes. Under the guidance of this new method, principles of fault tolerant parallel algorithm design are given. At last, the authors present the design of FTPAs for matrix-matrix multiplication and NPB kernels, and evaluate them by experiments on a cluster system. The experimental results show that the overhead of FTPA is less than the overhead of checkpointing. © 2007 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

A radiation hardening algorithm on 2nd order CDR 20th

A radiation hardening algorithm on 2nd order CDR

引用

20th Annual Conference on computer Engineering and Technology, NCCET 2016

作者： Chunmei, Hu Shuming, Chen Yao, Liu Jianjun, Chen Jingyan, Xu School of Computer National University of Defense Technology Deya Street 109 Changsha410073 China National Laboratory for Parallel and Distributed Processing National University of Defense Technology Deya Street 109 Changsha410073 China

ISBN: (纸本)9789811031588

A radiation hardening algorithm named as state-conservation on 2nd order clock and data recovery (CDR) system is presented in this paper. This proposed algorithm is used to resist the single event transient (SET) of CDR tracking loop. A MATLAB model is established to fast evaluate the sensitive position of the system. A circuit model of 5 Gbps half rate CDR together with the hardening algorithm is set up to verify the effect of the proposed algorithm in Cadence design environment. The simulation result shows that SET does not lead to any error data and no loop delay is added. Compared to the RHBD standard-cell technique, the hardening algorithm saves area about 15.3% and reduces power consumption about 47.8%. © Springer Nature Singapore Pte Ltd. 2016.

关键词： Radiation hardening

来源：评论

学校读者我要写书评

暂无评论

Component model supporting trustworthiness-oriented software evolution

引用

Ruan Jian Xue Bao/Journal of Software 2011年第1期22卷 17-27页

作者： Ding, Bo Wang, Huai-Min Shi, Dian-Xi Li, Xiao School of Computer National University of Defense Technology Changsha 410073 China National Defense Laboratory for Parallel and Distributed Processing Changsha 410073 China

Environment-Driven adaptation is an important means ensuring software integrity. Confronted with scenarios not anticipated during the developmental stage, the predefined adaptability of the software should be adjusted to ensure that its behavior agree with the users' expectation. The premise of this kind of adjustment are efficient software engineering mechanisms. Based on the principles of the Separation of Concerns and the Dynamic Software Architecture (DSA) technology, this paper proposes a component model named ACOE (adaptive component model for open environment) that supports the online fine-grained adjustment to software adaptability. ACOE encapsulates adaptation concerns, such as sensing, decision, and execution into components, and connectors, and then supports their dynamic configuration with the DSA technology. As a result, a third-party can adjust the adaptability by selectively upgrading it when necessary. An ACOE container prototype and experimental applications are implemented to validate this approach. © Copyright 2011, Institute of Software, the Chinese Academy of Sciences. All rights reserved.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：