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

Proceedings of the ACM Symposium on Applied Computing 2007年 128-132页

作者： Zhang, Fa Xu, Lin Liu, Zhiyong Yuan, Bo Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Science Graduate School Chinese Academy of Science Institute of Computing Technology Chinese Academy of Science Department of Computer Science and Engineering Shanghai Jiaotong University

ISBN: (纸本)1595934804;9781595934802

In this paper, we presented a method to improve structural modeling based on conserved domain clusters and structure-anchored alignments. We first constructed a template library of structural clusters for all conserved sequence domains. Then, for each cluster, we built the profile using the structure and sequence information. Finally we use the profile and structural alignments as anchors to increase the alignment accuracy between a query and its templates. Our preliminary results show that this method can be used for the partial prediction for a majority of known protein sequences with better qualities. Copyright 2007 ACM.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

The optimization of parallel Smith-Waterman sequence alignment using on-chip memory of GPGPU

The optimization of parallel Smith-Waterman sequence alignme...

引用

2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010

作者： Zhang, Qian An, Hong Liu, Gu Han, Wenting Yao, Ping Xu, Mu Li, Xiaoqiang Department of Computer Science and Technology University of Science and Technology of China Hefei China Laboratory of Computer System and Architecture Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781424464388

Memory optimization is an important strategy to gain high performance for sequence alignment implemented by CUDA on GPGPU. Smith-Waterman (SW) algorithm is the most sensitive algorithm widely used for local sequence alignment but very time consuming. Although several parallel methods have been used in some studies and shown good performances, advantages of GPGPU memory hierarchy are still not fully exploited. This paper presents a new parallel method on GPGPU using on-chip memory more efficiently to optimize parallel Smith-Waterman sequence alignment presented by Gregory M. Striemer. To minimize the cost of data transfers, on-chip shared memory is used to store intermediate results. Constant memory is also used effectively in our implementation of parallel Smith-Waterman algorithm. Using these two kinds of on-chip memory decreases long latency memory access operations, and reduces demand for global memory when aligning longer sequences. The experimental results show 1.66× to 3.16× speedup over Gregory's parallel SW on GPGPU in terms of execution time and 19.70× speedup on average and 22.43× speedup peak performance over serial SW in terms of clock cycles on our computer platform. © 2010 IEEE.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

Thoughts on the application of digital substation

Thoughts on the application of digital substation

引用

2012 8th International Conference on Computing and Networking technology (INC, ICCIS and ICMIC), ICCNT 2012

作者： Yue, Jie Zhao, Mingzhan Wang, Qinglin Computer Science and Technology Department Hebei Institute of Architecture Civil Engineering Zhangjiakou China

ISBN: (纸本)9788994364179

Digitized substation is the substation automation technology of the popular development direction, compared with the traditional transformer substation equipment, equipments and information system has had a great changes. In the faster and faster pace of digital process, the actual application also comes across the problem such as design and construction. These problems prompted us to experience the superior performance of digital more comprehensive understanding of the nature of the digital, to better serve the safety in production, promote modernization substation management development. © 2012 AICIT.

关键词： Wind power

来源：评论

学校读者我要写书评

暂无评论

Cost-aware function migration in heterogeneous systems 11

Cost-aware function migration in heterogeneous systems

引用

Proceedings of the 6th International Conference on High Performance and Embedded architectures and Compilers

作者： Kicherer, Mario Buchty, Rainer Karl, Wolfgang Department Computer Architecture and Parallel Processing Karlsruhe Institute of Technology 76128 Karlsruhe Germany

ISBN: (纸本)9781450302418

Today's approaches towards heterogeneous computing rely on either the programmer or dedicated programming models to efficiently integrate heterogeneous components. In this work, we propose an adaptive cost-aware function-migration mechanism built on top of a light-weight hardware abstraction layer. With this mechanism, the highly dynamic task of choosing the most beneficial processing unit will be hidden from the programmer while causing only minor variation in the work and program flow. The migration mechanism transparently adapts to the current workload and system environment without the necessity of JIT compilation or binary translation. Evaluation shows that our approach successfully adapts to new circumstances and predicts the most beneficial processing unit (PU). Through fine-grained PU selection, our solution achieves a speedup of up to 2.27 for the average kernel execution time but introduces only a marginal overhead in case its services are not required. Copyright 2011 ACM.

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

Effect of Environment Size on Spatial Perception in Virtual Reality 6

Effect of Environment Size on Spatial Perception in Virtual ...

引用

6th International Conference on computer-Human Interaction Research and Applications, CHIRA 2022

作者： Bach, Morten Trier Jensen, Poul Anker Lucaci, Andrei Iuliu Pupczyk, Damian Grzegorz Madsen, Claus Brøndgaard Computer Graphics Group Department of Architecture and Media Technology Aalborg University Aalborg Denmark

ISBN: (纸本)9789897586095

A trend of distance underestimations in Virtual Reality (VR) is well documented, but the reason still remains unclear. Therefore, this paper investigates the effect of differently sized Virtual Environments (VEs) on egocentric distance perception in VR as a potential influence. Verbal assessment, blind walking, and our own proposed method: walk and assess, were compared in an experiment, and blind walking was found to be the most accurate. A virtual replica of a real-life location was created as a transitional environment, while small (15m2), medium (35m2) and large (95m2) rooms were created to investigate the effect of VE size on spatial perception in VR. To establish the differences in estimations between the real world and VR when using blind walking, a study was conducted with the virtual replica and its real life counterpart at distances between 1 and 10 meters. Following this, the three distinct room sizes were used in an experiment to investigate the effect of the size of rooms on spatial perception in VR. The findings showed consistent underestimates of distances, and a trend for underestimation to grow as the distance grows was observed. Similarly, underestimates grew with the size of the environment. Copyright © 2022 by SCITEPRESS - Science and technology Publications, Lda. All rights reserved.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Two stage SVM and kNN text documents classifier 6th

Two stage SVM and kNN text documents classifier

引用

6th International Conference on Pattern Recognition and Machine Intelligence, PReMI 2015

作者： Kępa, Marcin Szymański, Julian Department of Computer Systems Architecture Gdańsk University of Technology Gdańsk Poland

The paper presents an approach to the large scale text documents classification problem in parallel environments. A two stage classifier is proposed, based on a combination of k-nearest neighbors and support vector machines classification methods. The details of the classifier and the parallelisation of classification, learning and prediction phases are described. The classifier makes use of our method named onevs- near. It is an extension of the one-vs-all approach, typically used with binary classifiers in order to solve multiclass problems. The experiments were performed on a large scale dataset, with use of many parallel threads on a supercomputer. Results of the experiments show that the proposed classifier scales well and gives reasonable quality results. Finally, it is shown that the proposed method gives better performance compared to the traditional approach. © Springer International Publishing Switzerland 2015.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

Software pipelining for transport-triggered architectures 24

Software pipelining for transport-triggered architectures

引用

Proceedings of the 24th International Symposium on Microarchitecture - MICRO 24

作者： Hoogerbrugge, Jan Corporaal, Henk Mulder, Hans Delft University of Technology Department of Electrical Engineering Section Computer Architecture and Digital Systems

ISBN: (纸本)0897914600

This paper discusses software pipelining for a new class of architectures that we call transport-triggered. These architectures reduce the interconnection requirements between function units. They also exhibit code scheduling possibilities which are not available in traditional operation-triggered architectures. In addition the scheduling freedom is extended by the use of so-called hybridpipelined function utits. In order to exploit this tleedom, existing scheduling techniques need to be extended. We present a software pipelirtirtg technique, based on Lam's algorithm, which exploits the potential of !mnsport-triggered architectures. Performance results are presented for several benchmak loops. Depending on the available transport capacity, MFLOP rates may increase significantly as compared to scheduling without the extra degrees of freedom. © 1991 ACM.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Balanced Quantization： An Effective and Efficient Approach toQuantized Neural Networks

引用

Journal of computer Science & technology 2017年第4期32卷 667-682页

作者： Shu-Chang Zhou Yu-Zhi Wang He Wen Qin-Yao He Yu-Heng Zou University of Chinese Academy of Sciences Beijing 100049 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Megvii Inc. Beijing 100190 China Department of Electronic Engineering Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

Quantized neural networks (QNNs), which use low bitwidth numbers for representing parameters and performing computations, have been proposed to reduce the computation complexity, storage size and memory usage. In QNNs, parameters and activations are uniformly quantized, such that the multiplications and additions can be accelerated by bitwise operations. However, distributions of parameters in neural networks are often imbalanced, such that the uniform quantization determined from extremal values may underutilize available bitwidth. In this paper, we propose a novel quantization method that can ensure the balance of distributions of quantized values. Our method first recursively partitions the parameters by percentiles into balanced bins, and then applies uniform quantization. We also introduce computationally cheaper approximations of percentiles to reduce the computation overhead introduced. Overall, our method improves the prediction accuracies of QNNs without introducing extra computation during inference, has negligible impact on training speed, and is applicable to both convolutional neural networks and recurrent neural networks. Experiments on standard datasets including ImageNet and Penn Treebank confirm the effectiveness of our method. On ImageNet, the top-5 error rate of our 4-bit quantized GoogLeNet model is 12.7%, which is superior to the state-of-the-arts of QNNs.

关键词： quantized neural network percentile histogram equalization uniform quantization

来源：评论

学校读者我要写书评

暂无评论

Nesting OpenMP and MPI in the conjugate gradient method for band systems

引用

11th European Conference on Parallel Virtual Machine and Message Passing Interface Users Group Meeting, PVM/MPI 2004

作者： Romero, Luis F. Ortigosa, Eva M. Romero, Sergio Zapata, Emilio L. Department of Computer Architecture University of Málaga Málaga29071 Spain Department of Computer Architecture and Technology University of Granada Granada18071 Spain

ISBN: (纸本)3540231633

An analysis of the data dependencies in the Conjugate Gradient iterative method for the solution of narrow band systems is performed in order to develop and implement a mixed OpenMP-MPI code which takes into account the computer architecture and memory hierarchy at three different levels: processor, shared–memory and network levels. This kind of hybrid parallelization allows code porting and tuning for different multiprocessors and grids. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Conjugate gradient method

来源：评论

学校读者我要写书评

暂无评论

NfvInsight:A Framework for Automatically Deploying and Benchmarking VNF Chains

引用

Journal of computer Science & technology 2022年第3期37卷 680-698页

作者： Tian-Ni Xu Hai-Feng Sun Di Zhang Xiao-Ming Zhou Xiu-Feng Sui Sa Wang Qun Huang Yun-Gang Bao State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China School of Information and Electronics Beijing Institute of TechnologyBeijing 100081China Peng Cheng Laboratory Shenzhen 518055China Department of Computer Science and Technology Peking UniversityBeijing 100871China

With the advent of virtualization techniques and software-defined networking(SDN),network function virtualization(NFV)shifts network functions(NFs)from hardware implementations to software appliances,between which exists a performance *** to narrow the gap is an essential issue of current NFV ***,the cumbersomeness of deployment,the water pipe effect of virtual network function(VNF)chains,and the complexity of the system software stack together make it tough to figure out the cause of low performance in the NFV *** pinpoint the NFV system performance,we propose NfvInsight,a framework for automatic deployment and benchmarking VNF *** framework tackles the challenges in NFV performance *** framework components include chain graph generation,automatic deployment,and fine granularity *** design and implementation of each component have their *** the best of our knowledge,we make the first attempt to collect rules forming a knowledge base for generating reasonable chain *** deploys the generated chain graphs automatically,which frees the network operators from executing at least 391 lines of bash commands for a single *** diagnose the performance bottleneck,NfvInsight collects metrics from multiple layers of the software ***,we collect the network stack latency distribution ingeniously,introducing only less than 2.2%*** showcase the convenience and usability of NfvInsight in finding bottlenecks for both VNF chains and the underlying *** our framework,we find several design flaws of the network stack,which are unsuitable for packet forwarding inside one single server under the NFV *** optimization for these flaws gains at most 3x performance improvement.

关键词： network function virtualization(NFV) service chain performance bottleneck network stack latency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：