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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,016 篇 会议
981 篇 期刊文献
24 册 图书

馆藏范围

2,021 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,197 篇 工学
- 769 篇 计算机科学与技术...
- 569 篇 软件工程
- 188 篇 信息与通信工程
- 163 篇 电子科学与技术（可...
- 140 篇 电气工程
- 124 篇 光学工程
- 99 篇 生物工程
- 86 篇 控制科学与工程
- 79 篇 化学工程与技术
- 79 篇 生物医学工程（可授...
- 74 篇 材料科学与工程（可...
- 47 篇 动力工程及工程热...
- 44 篇 机械工程
- 40 篇 仪器科学与技术
- 37 篇 力学（可授工学、理...
- 32 篇 环境科学与工程（可...
- 30 篇 土木工程
857 篇 理学
- 399 篇 数学
- 383 篇 物理学
- 119 篇 生物学
- 86 篇 化学
- 77 篇 统计学（可授理学、...
- 47 篇 系统科学
270 篇 管理学
- 186 篇 管理科学与工程(可...
- 97 篇 工商管理
- 89 篇 图书情报与档案管...
72 篇 医学
- 63 篇 临床医学
- 52 篇 基础医学(可授医学...
- 36 篇 药学(可授医学、理...
29 篇 经济学
- 29 篇 应用经济学
21 篇 法学
20 篇 农学
18 篇 教育学
7 篇 军事学
4 篇 艺术学
2 篇 文学
1 篇 哲学
1 篇 历史学

主题

103 篇 high performance...
83 篇 computer science
57 篇 computational mo...
47 篇 application soft...
45 篇 grid computing
38 篇 distributed comp...
36 篇 concurrent compu...
34 篇 bandwidth
33 篇 computer archite...
33 篇 hardware
32 篇 laboratories
31 篇 resource managem...
29 篇 processor schedu...
27 篇 internet
26 篇 data mining
24 篇 parallel process...
24 篇 costs
23 篇 quantum cryptogr...
23 篇 computer network...
22 篇 supercomputers

机构

56 篇 institute of hig...
41 篇 department of ph...
41 篇 faculty of scien...
41 篇 departamento de ...
41 篇 department for p...
41 篇 department of ph...
41 篇 yerevan physics ...
39 篇 department of ph...
39 篇 dipartimento di ...
38 篇 department of ph...
38 篇 department of ph...
38 篇 lehrstuhl für ex...
38 篇 west university ...
38 篇 institute for qu...
37 篇 faculté des scie...
37 篇 department of mo...
37 篇 centre de calcul...
37 篇 research center ...
37 篇 kirchhoff-instit...
36 篇 graduate school ...

作者

36 篇 m. klein
34 篇 c. alexa
34 篇 j. m. izen
34 篇 s. veneziano
34 篇 g. bella
34 篇 j. strandberg
34 篇 d. calvet
34 篇 c. amelung
34 篇 n. orlando
34 篇 h. a. gordon
34 篇 y. tayalati
34 篇 g. spigo
34 篇 v. chiarella
34 篇 f. siegert
34 篇 a. c. könig
34 篇 yang chao-tung
33 篇 d. di valentino
33 篇 a. dimitrievska
33 篇 f. deliot
33 篇 r. ströhmer

语言

1,926 篇 英文
60 篇 其他
35 篇 中文

检索条件"机构=High-Performance Computing Laboratory Department of Computer Science"

共 2021 条记录，以下是1871-1880 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Loki: a state-driven fault injector for distributed systems

Loki: a state-driven fault injector for distributed systems

引用

International Conference on Dependable Systems and Networks (DSN)

作者： R. Chandra R.M. Lefever M. Cukier W.H. Sanders Center for Reliable and High-Performance Computing Coordinated Science Laboratory and Department of Electrical and Computer Engineering University of Illinois Urbana-Champaign Urbana IL USA

Distributed applications can fail in subtle ways that depend on the state of multiple parts of a system. This complicates the validation of such systems via fault injection, since it suggests that faults should be injected based on the global state of the system. In Loki, fault injection is performed based on a partial view of the global state of a distributed system, i.e. faults injected in one node of the system can depend on the state of other nodes. Once faults are injected, a post-runtime analysis, using off-line clock synchronization, is used to place events and injections on a single global timeline and to determine whether the intended faults were properly injected. Finally, experiments containing successful fault injections are used to estimate the specified measures. In addition to briefly reviewing the concepts behind Loki and its organization, we detail Loki's user interface. In particular, we describe the graphical user interfaces for specifying state machines and faults, for executing a campaign and for verifying whether the faults were properly injected.

关键词： Synchronization Clocks Distributed computing Application software User interfaces Graphical user interfaces Cost accounting Contracts Particle measurements Runtime

来源：评论

学校读者我要写书评

暂无评论

Virtual roller coaster

Virtual roller coaster

引用

IEEE Annual International Symposium Virtual Reality

作者： Zen-Chung Shih Yuh-Sen Jaw Mei-Ling Hsu Department of Computer & Information Science National Chiao Tung University Taiwan National Center of High-performance Computing Taiwan

Roller coasters are an attractive, adventurous and exciting form of entertainment. In this paper, we present a virtual roller coaster system, which includes roller coaster simulation software, a motion platform and a motion control unit. We investigate the track structure of the roller coaster and propose a methodology to generate the track automatically. We also simulate the forces exerted on the running carriage to give the user the impression he/she is riding a real roller coaster. A motion platform with two degrees of freedom is constructed using hydraulic cylinders for its actuators. An electronic circuit is designed to allow the motion platform to communicate with the host computer. We also provide flexibility for changing the track type and the surrounding scenery, in order to give the rider a variety of exciting experiences. This system also considers safety concerns in the design of the motion platform.

关键词： Computational modeling Virtual reality Circuits Motion control Information science Hydraulic actuators computer interfaces Virtual environment Testing Process design

来源：评论

学校读者我要写书评

暂无评论

A new approach for computing the discrete Fourier transform of arbitrary length

A new approach for computing the discrete Fourier transform ...

引用

International Conference on Signal Processing Proceedings (ICSP)

作者： Zhang Xianchao Huang Liusheng Chen Guoliang National High Performance Computing Center at Hefei Department Computer Sci & Tech University of Science and Technology of China Hefei China

A new approach for computing DFT of arbitrary length is proposed, which is based on the arithmetic Fourier transform (AFT). The algorithm needs only /spl Oscr/(N) multiplications and has a simple computational structure, so it can be easily performed in parallel and it is very suitable for VLSI design. The algorithm is faster than the classical FFT when the length of the DFT contains relatively large factors. It is especially efficient for computing the DFT of prime length, where FFT does not work. The algorithm is competitive with the FFT in term of accuracy. A method to enhance the accuracy of the algorithm is also proposed for cases when higher accuracy is required.

关键词： Discrete Fourier transforms Signal processing algorithms Arithmetic Discrete transforms Fourier transforms Very large scale integration high performance computing Concurrent computing Algorithm design and analysis Electrostatic precipitators

来源：评论

学校读者我要写书评

暂无评论

Accurate and efficient predicate analysis with binary decision diagrams

Accurate and efficient predicate analysis with binary decisi...

引用

IEEE/ACM International Symposium on Microarchitecture (MICRO)

作者： J.W. Sias W.W. Hwu D.I. August Center for Reliable and High-Performance Computing Department of Electrical and Computer Engineering University of Illinois Urbana-Champaign IL USA Department of Computer Science Princeton University Princeton NJ USA

Functionality and performance of EPIC architectural features depend on extensive compiler support. Predication, one of these features, promises to reduce control flow overhead and to enhance optimization, provided that compilers can utilize it effectively. Previous work has established the need for accurate, direct predicate analysis and has demonstrated a few useful techniques, but has not provided an efficient, general framework. The paper presents the Predicate Analysis System (PAS), which maps knowledge of predicate and condition relations in general control flow onto a convenient logical substrate, the reduced ordered binary decision diagram. PAS is the first such framework to demonstrate direct, accurate, and efficient analysis of arbitrary condition and predicate define networks in arbitrary control flow.

关键词： Data structures Boolean functions Control systems performance analysis high performance computing computer science Fasteners Parallel processing Assembly Engines

来源：评论

学校读者我要写书评

暂无评论

Hardware support for dynamic activation of compiler-directed computation reuse

Hardware support for dynamic activation of compiler-directed...

引用

Proceedings of the ninth international conference on Architectural support for programming languages and operating systems

作者： Daniel A. Connors Hillery C. Hunter Ben-Chung Cheng Wen-mei W. Hwu Department of Electrical and Computer Engineering & Computer Science University of Colorado Center for Reliable and High-Performance Computing University of Illinois at Urbana-Champaign Transmeta Corporation Santa Clara CA

ISBN: (纸本)9781581133172

Compiler-directed Computation Reuse (CCR) enhances program execution speed and efficiency by eliminating dynamic computation redundancy. In this approach, the compiler designates large program regions for potential reuse. During run time, the execution results of these reusable regions are recorded into hardware buffers for future reuse. Previous work shows that CCR can result in significant performance enhancements in general applications. A major limitation of the work is that the compiler relies on value profiling to identify reusable regions, making it difficult to deploy the scheme in many software production environments. This paper presents a new hardware model that alleviates the need for value profiling at compile time. The compiler is allowed to designate reusable regions that may prove to be inappropriate. The hardware mechanism monitors the dynamic behavior of compiler-designated regions and selectively activates the profitable ones at run time. Experimental results show that the proposed design makes more effective utilization of hardware buffer resources, achieves rapid employment of computation regions, and improves reuse accuracy, all of which promote more flexible compiler methods of identifying reusable computation regions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimal record and replay for debugging of nondeterministic MPI/PVM programs

Optimal record and replay for debugging of nondeterministic ...

引用

International Conference on high performance computing in the Asia-Pacific Region

作者： Qilong Zheng Guoliang Cheng Liusheng Huang National High Performance Computing Center at Hefei Department of Computer Science and Technology University of Science and Technology Hefei Anhui China University of Science and Technology of China Hefei Anhui CN

ISBN: (纸本)0769505892

The record-and-replay technique proved to be an effective solution to the cyclic debugging of nondeterministic parallel programs. Because of its nondeterminism, a parallel program given the same inputs on successive runs can sometimes produce different results. In this paper, an optimal record-and-replay technique is presented which produces less overhead in time and space by using the "non-overtaking rule" provided by MPI and PVM.

关键词： Debugging Concurrent computing computer science computer bugs Message passing Libraries Asynchronous communication Delay

来源：评论

学校读者我要写书评

暂无评论

MPICH-GQ: quality-of-service for message passing programs 00

MPICH-GQ: quality-of-service for message passing programs

引用

Proceedings of the 2000 ACM/IEEE conference on Supercomputing

作者： Alain J. Roy Ian Foster William Gropp Brian Toonen Nicholas Karonis Volker Sander Department of Computer Science The University of Chicago Chicago IL Department of Computer Science The University of Chicago Chicago IL and Mathematics and Computer Science Division Argonne National Laboratory Argonne IL Mathematics and Computer Science Division Argonne National Laboratory Argonne IL High-Performance Computing Laboratory Department of Computer Science Northern Illinois University DeKalb IL Central Institute for Applied Mathematics Forschungszentrum Jülich GmbH 52425 Jülich Germany

ISBN: (纸本)9780780398023

Parallel programmers typically assume that all resources required for a program's execution are dedicated to that purpose. However, in local and wide area networks, contention for shared networks, CPUs, and I/O systems can result in significant variations in availability, with consequent adverse effects on overall performance. We describe a new message-passingarchitecture, MPICH-GQ, that uses quality of service (QoS) mechanisms to manage contention and hence improve performance of message passing interface (MPI) applications. MPICH-GQ combines new QoS specification, traffic shaping, QoS reservation, and QoS implementation techniques to deliver QoS capabilities to the high-bandwidth bursty flows, complex structures, and reliable protocols used in high-performance applications-characteristics very different from the low-bandwidth, constant bit-rate media flows and unreliable protocols for which QoS mechanisms were designed. Results obtained on a differentiated services testbed demonstrate our ability to maintain application performance in the face of heavy network contention.

关键词： Quality of Service Differentiated Services TCP MPI

来源：评论

学校读者我要写书评

暂无评论

Exploiting hierarchy in parallel computer networks to optimize collective operation performance

Exploiting hierarchy in parallel computer networks to optimi...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： N.T. Karonis B.R. de Supinski I. Foster W. Gropp E. Lusk J. Bresnahan High Performance Computing L ab or atory Department of Computer Science Northern Illinois University DeKalb IL USA Center for Applied Scientific Computing Lawrence Livemore National Laboratory Livermore CA USA University of Chicago Chicago IL USA Argonne National Laboratory Argonne IL USA Mathematics and Computer Science Division Argonne National Laboratory Argonne IL USA

The efficient implementation of collective communication operations has received much attention. Initial efforts modeled network communication and produced "optimal" trees based on those models. However, the models used by these initial efforts assumed equal point-to-point latencies between any two processes. This assumption is violated in heterogeneous systems such as clusters of SMPs and wide-area "computational grids", and as a result, collective operations that utilize the trees generated by these models perform suboptimally. In response, more recent work has focused on creating topology-aware trees for collective operations that minimize communication across slower channels (e.g., a wide-area network). While these efforts have significant communication benefits, they all limit their view of the network to only two layers. We present a strategy based upon a multilayer view of the network. By creating multilevel topology trees we take advantage of communication cost differences at every level in the network. We used this strategy to implement topology-aware versions of several MPI collective operations in MPICH-G, the Globus-enabled version of the popular MPICH implementation of the MPI standard. Using information about topology discovered by Globus, we construct these topology-aware trees automatically during execution, thus freeing the MPI application programmer from having to write special files or functions to describe the topology to the MPICH library. We present results demonstrating the advantages of our multilevel approach by comparing it to the default (topology-unaware) implementation provided by MPICH and a topology-aware two-layer implementation.

关键词： Intelligent networks computer networks Chromium

来源：评论

学校读者我要写书评

暂无评论

Load balancing across near-homogeneous multi-resource servers

Load balancing across near-homogeneous multi-resource server...

引用

Heterogeneous computing Workshop

作者： W. Leinberger G. Karypis V. Kumar R. Biswas Army High Performance Computing and Research Center Department of Computer Science and Engineering University of Minnesota MRJ Technology Solutions Numerical Aerospace Simulation Division NASA Ames Research Center Moffett Field CA USA

An emerging model for computational grids interconnects similar multi-resource servers from distributed sites. A job submitted to the grid can be executed by any of the servers; however, resource size or balance may be different across servers. One approach to resource management for this grid is to layer a global load distribution system on top of the local job management systems at each site. Unfortunately, classical load distribution policies fail on two aspects when applied to a multi-resource server grid First, simple load indices may not recognize that a resource imbalance exists at a server. Second, classical job selection policies do not actively correct such a resource-imbalanced state. We show through simulation that new policies based on resource balancing perform consistently better than the classical load distribution strategies.

关键词： Load management Resource management high performance computing NASA Grid computing Military computing Contracts computer science Space technology Aerospace simulation

来源：评论

学校读者我要写书评

暂无评论

On the representation of wideband images using permutations for lossless coding

On the representation of wideband images using permutations ...

引用

IEEE Southwest Symposium on Image Analysis and Interpretation

作者： M.S. Pattichis A.C. Bovik J.W. Havlicek N.D. Sidiropoulos Department of Electrical and Computer Engineering University of Minnesota Minneapolis MN USA Department of Electrical and Computer Engineering Engineering Science Bldg University of Texas Austin Austin TX USA Department of Computer Sciences University of Texas Austin Austin TX USA Department of EECE and Center for High Performance Computing University of New Mexico Albuquerque NM USA

ISBN: (纸本)0769505953

We introduce a novel method for representing and coding wideband signals using permutations. The signal samples are first sorted, and then encoded using differential pulse code modulation. We show that our method is optimal for DPCM coding and develop a novel algorithm for encoding the permutation information efficiently. We show that the new algorithm achieves coding gains over Huffman coding.

关键词： Wideband Image coding Encoding Discrete wavelet transforms Decoding Character generation high performance computing Modulation coding Time frequency analysis Discrete transforms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共203页 << < 184 185 186 187 188 189 190 191 192 193 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：