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

PACLIC 23 - Proceedings of the 23rd Pacific Asia Conference on Language, Information and Computation 2009年 2卷 733-740页

作者： Liang, Weiming Huang, Chang-Ning Li, Mu Lu, Bao-Liang Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Shanghai Jiao Tong University 800 Dong Chuan Road Shanghai 200240 China Microsoft Research Asia 49 Zhichun Road Haidian District Beijing 100080 China MOE-Microsoft Key Laboratory for Intelligent Computing and Intelligent Systems Shanghai Jiao Tong University 800 Dong Chuan Road Shanghai 200240 China

ISBN: (纸本)9789624423198

Keyphrases extracted from articles are beneficial in helping people boost browsing speed, but unfortunately keyphrases are rarely available for news articles due to the high expense of labor and time for manual annotation. This paper proposes a practical approach to extracting keyphrases for Chinese news articles using the Text Rank and query log knowledge. Previous work is word based, while our approach uses phrase as its basic element. We generate phrases by employing several statistical criteria with the huge amount of queries as a training corpus. We use Text Rank, a graph-based learning algorithm, for extracting keyphrases from Chinese news articles. In addition, two instructive features, lengths and positions of phrases, are incorporated into the Text Rank model. Experimental results demonstrate that our methods improve the performance significantly. © 2009 by Weiming Liang, Chang-Ning Huang, Mu Li, and Bao-Liang Lu.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Green supercomputing comes of age

引用

IT Professional 2008年第1期10卷 17-23页

作者： Feng, Wu-Chun Feng, Xizhou Ge, Rong Department of Computer Science and Electrical and Computer Engineering Virginia Tech. Network Dynamics and Simulation Science Laboratory Virginia Tech. Center for High-End Computing Systems Virginia Tech.

Energy-efficient (green) supercomputing has evolved to improve system reliability and provide better availability and productivity. Green Destiny supercomputing system is a Linux-based cluster that uses low-power components whose performance could be optimized for supercomputing. Low-power supercomputing focuses on energy efficiency at system integration time, selects low-power chips as the building blocks for power reduction and system reliability, and achieves better performance by scaling up to a larger number of processors. Researchers have implemented various power-aware software prototypes for commodity supercomputing starting with cluster of high-performance, high-power processors that support mechanism called dynamic voltage and frequency scaling (DVFS). Various approaches for parallel supercomputing nodes are studied by aiming execution phases that are not on the critical execution path.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

A projection-based optimization framework for abstractions with application to the unstructured mesh domain

A projection-based optimization framework for abstractions w...

引用

22nd ACM International Conference on Supercomputing, ICS'08

作者： White, Brian S. McKee, Sally A. Quinlan, Daniel Computer Systems Lab. Cornell University Ithaca NY 14853 United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA 94551 United States

ISBN: (纸本)9781605581583

Computational scientists often must choose between the greater programming productivity of high-level abstractions, such as matrices and mesh entities, and the greater execution efficiency of low-level constructs. Performance is degraded when abstraction indirection introduces overhead and hinders compiler analysis. This can be overcome by targeting the semantics, rather than the implementation, of abstractions. Raising operators specified by a domain expert project an application from an implementation space to an abstraction space, where optimizations leverage domain semantics to complement conservative analyses. Raising operators define a domain-specific intermediate representation, which optimizations target for improved portability. Following optimization, transformed code is reified as a concrete implementation via lowering operators. We have developed a framework to implement this optimization strategy, which we use to introduce two domainspecific unstructured mesh optimizations. The first uses an inspector/executor approach to avoid costly traversals over a static mesh by memoizing the relatively few references required for mathematical computations. The executor phase accesses stored entities without incurring the indirections. The second optimization lowers object-based mesh access and iteration to a low-level implementation, which uses integer-based access and iteration. Copyright 2008 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Editorial: Dependability and security

引用

IEEE Transactions on Dependable and Secure computing 2008年第1期5卷 1-3页

作者： Iyer, Ravishankar K. Gligor, Virgil D. Kalbarczyk, Zbigniew T. Kanoun, Karama Katzenbeisser, Stefan Mukherjee, Shubu Shieh, Shiuhpyng Zorian, Yervant Department of Electrical and Computer Engineering Carnegie Mellon University Microsoft's Trusted Computing Academic Advisory Board Center for Reliable and High-Performance Computing Coordinated Science Laboratory University of Illinois Urbana-Champaign United States IEEE IEEE Computer Society LAAS CNRS IFIP Working Group 10.4 on Dependable Computing and Fault Tolerance Special Interest Group on Dependability Benchmarking IFIP Working Group 10.4 French SEE Technical Committee on Trustworthy Computer Systems SEE Working Group Design and Validation for Dependability Technical University Munich Germany Darmstadt University of Technology ACM IACR Intel's SER Tech Council Intel's Architecture Patent Committee Taiwan Information Security Center NCTU IEEE Reliability Society Taipei and Tainan IACR United States Virage Logic Corp. AT and T Bell Laboratories Logic Vision Inc. University of British Columbia IEEE Test Technology Technical Council

来源：评论

学校读者我要写书评

暂无评论

Untitled

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE computing 2008年第1期5卷 4-5页

作者： Gligor, Virgil D. Formal Methods Section Center for High Assurance Computer Systems Naval Research Laboratory NRL Protocol Analyzer Internet Engineering Task Force IFIP Working Group 1.7 on Foundations of Security Analysis and Design University of Texas Austin United States Boston University IFIP WG 10.4 on Dependability Microsoft's Trustworthy Computing Academic Advisory Board

来源：评论

学校读者我要写书评

暂无评论

Program Phase Detection based on Critical Basic Block Transitions

Program Phase Detection based on Critical Basic Block Transi...

引用

IEEE International Symposium on Performance Analysis of systems and Software

作者： Paruj Ratanaworabhan Martin Burtscher Computer Systems Laboratory Cornell University USA Center for Distributed and Grid Computing University of Texas Austin USA

ISBN: (纸本)9781424422326

Many programs go through phases as they execute. Knowing where these phases begin and end can be beneficial. For example, adaptive architectures can exploit such information to lower their power consumption without much loss in performance. Architectural simulations can benefit from phase information by simulating only a small interval of each program phase, which significantly reduces the simulation time while still yielding results that are representative of complete simulations. This paper presents a lightweight profile-based phase detection technique that marks each phase change boundary in the program's binary at the basic block level with a critical basic block transition (CBBT). It is independent of execution windows and does not explicitly employ the notion of threshold to make a phase change decision. We evaluate the effectiveness of CBBTs for reconfiguring the LI data cache size and for guiding architectural simulations. Our CBBT method is as effective at dynamically reducing the L1 data cache size as idealized cache reconfiguration schemes are. Using CBBTs to statically determine simulation intervals yields as low a CPI error as the well-known SimPoint method does. In addition, experimental results indicate the CBBTs' effectiveness in both the self-trained and cross-trained inputs, demonstrating the CBBTs' stability across different program inputs.

关键词： Phase detection Grid computing Distributed computing Laboratories computer architecture Energy consumption Performance loss Computational modeling Stability Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

MemoryIO: An Extended I/O Technology in Embedded systems

MemoryIO: An Extended I/O Technology in Embedded Systems

引用

International Conference on Networking, Architecture, and Storage (NAS)

作者： Xiaojun Yang Tao Liu Fei Chen Hailiang Cheng National Research Center for Intelligent Computing Systems Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy and Sciences China Graduate University of Advanced Studies (SOKENDAI) Beijing China Key Laboratory of Computer System and Architecture Institute of Computing TechnologyNational Research Center for Intelligent Computing Systems Chinese Academy and Sciences China

MemoryIO, a sort of extended I/O in embedded systems, is presented in this paper. MemoryIO makes it powerful for embedded systems to achieve the high-performance interconnect. In view of the facts that the main memory system is absolutely necessary in any embedded system, and not all embedded systems integrate HyperTransport (HT), PCI Express or RapidIO interface, the MemoryIO based interconnect in embedded systems has more universalities compared with that based on HT, PCI Express or RapidIO. MemoryIO can not only thoroughly compensates for the lack of high performance data transfer channel, but also efficiently utilizes the memory bus bandwidth and the direct memory access (DMA) engine to reduce the latency for data transfer in embedded systems. This paper discusses some key technologies of MemoryIO, and presents its application in DCNet and the implementation of MemoryIO IP core. The MemoryIO technology can be used in various systems, but not limited to embedded systems.

关键词： Embedded system Payloads Switches Clocks Storage area networks Physical layer Protocols

来源：评论

学校读者我要写书评

暂无评论

In-network data estimation for sensor-driven scientific applications 08

引用

Proceedings of the 15th international conference on High performance computing

作者： Nanyan Jiang Manish Parashar Center for Autonomic Computing The Applied Software Systems Laboratory Department of Electrical and Computer Engineering Rutgers University Piscataway NJ

ISBN: (纸本)9783540898931

Sensor networks employed by scientific applications oftenneed to support localized collaboration of sensor nodes to perform in-network data processing. This includes new quantitative synthesis andhypothesis testing in near real time, as data streaming from distributedinstruments, to transform raw data into high level domain-dependent information. This paper investigates in-network data processing mechanismswith dynamic data requirements in resource constrained heterogeneoussensor networks. Particularly, we explore how the temporaland spatial correlation of sensor measurements can be used to trade offbetween the complexity of coordination among sensor clusters and thesavings that result from having fewer sensors involved in in-network processing,while maintaining an acceptable error threshold. Experimentalresults show that the proposed in-network mechanisms can facilitate theefficient usage of resources and satisfy data requirement in the presenceof dynamics and uncertainty.

关键词： in-network data estimation sensor system programming sensor-driven scientific applications

来源：评论

学校读者我要写书评

暂无评论

A concurrency control protocol for parallel B-tree structures without latch-coupling for explosively growing digital content 08

A concurrency control protocol for parallel B-tree structure...

引用

11th International Conference on Extending Database Technology, EDBT 2008

作者： Yoshihara, Tomohiro Kobayashi, Dai Yokota, Haruo Department of Computer Science Tokyo Institute of Technology 2-12-1 Ookayama Meguro-ku Tokyo 152-8552 Japan Global Scientific Information and Computing Center Tokyo Institute of Technology 2-12-1 Ookayama Meguro-ku Tokyo 152-8550 Japan Systems Development Laboratory Hitachi Ltd. JSPS

ISBN: (纸本)9781595939265

While shared-nothing parallel infrastructures provide fast processing of explosively growing digital content, managing data efficiently across multiple nodes is important. The value-range partitioning method with parallel B-tree structures in a shared-nothing environment is an efficient approach for handling large amounts of data. To handle large amounts of data, it is also important to provide an efficient concurrency control protocol for the parallel B-tree. Many studies have proposed concurrency control protocols for B-trees, which use latch-coupling. None of these studies has considered that latch-coupling contains a performance bottleneck of sending of messages between processing elements (PEs) in distributed environments because latch-coupling is efficient for a B-tree on a single machine. The only protocol without latch-coupling is the B-link algorithm, but it is difficult to use the B-link algorithm directly on an entire parallel B-tree structure because it is necessary to guarantee the consistency of the side pointers. We propose a new concurrency control protocol named LCFB that requires no latch-coupling in optimistic processes. LCFB reduces the amount of communication between PEs during a B-tree traversal. To detect access path errors in the LCFB protocol caused by removal of latch-coupling, we assign boundary values to each index page. Because a page split may cause page deletion in a Fat-Btree, we also propose an effective method for handling page deletions without latch-coupling. We then combine LCFB with the B-link algorithm within each PE to reduce the cost of Structure Modification Operations (SMOs) in a PE, as a solution to the difficulty of consistency management for the side pointers in a parallel B-tree structure. To compare the performance of the proposed protocol with conventional protocols MARK-OPT, INC-OPT, and ARIES/IM, we implemented them on an autonomous disk system with a Fat-Btree structure. Experimental results in various environments

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

A service-oriented priority-based resource scheduling scheme for virtualized utility computing 08

引用

Proceedings of the 15th international conference on High performance computing

作者： Ying Song Yaqiong Li Hui Wang Yufang Zhang Binquan Feng Hongyong Zang Yuzhong Sun Key Lab. of Computer System and Architecture Inst. of Computing Techn. Chinese Academy of Sciences China and National Research Center for Intelligent Computing Systems ICT China and Graduate Univ. of Chinese Academy of Sciences China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences China and National Research Center for Intelligent Computing Systems ICT China

ISBN: (纸本)9783540898931

In order to provide high resource utilization and QoS assurance inutility computing hosting concurrently various services, this paper proposes aservice computing framework-RAINBOW for VM(Virtual Machine)-basedutility computing. In RAINBOW, we present a priority-based resourcescheduling scheme including resource flowing algorithms (RFaVM) to optimizeresource allocations amongst services. The principle of RFaVM is preferentiallyensuring performance of some critical services by degrading of others to someextent when resource competition arises. Based on our prototype, we evaluateRAINBOW and RFaVM. The experimental results show that RAINBOWwithout RFaVM provides 28%-324% improvements in service performance,and 26% higher the average CPU utilization than traditional service computingframework (TSF) in typical enterprise environment. RAINBOW with RFaVMfurther improves performance by 25%-42% for those critical services whileonly introducing up to 7% performance degradation to others, with 2%-8%more improvements in resource utilization than RAINBOW without RFaVM.

关键词： resource scheduling utility computing virtualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：