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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

147 篇 会议
38 篇 期刊文献

馆藏范围

185 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

94 篇 工学
- 85 篇 计算机科学与技术...
- 64 篇 软件工程
- 12 篇 控制科学与工程
- 9 篇 信息与通信工程
- 8 篇 生物工程
- 6 篇 机械工程
- 5 篇 电气工程
- 4 篇 交通运输工程
- 3 篇 安全科学与工程
- 2 篇 力学（可授工学、理...
- 2 篇 材料科学与工程（可...
- 2 篇 动力工程及工程热...
- 2 篇 电子科学与技术（可...
- 2 篇 建筑学
- 2 篇 土木工程
- 2 篇 水利工程
- 2 篇 化学工程与技术
- 2 篇 农业工程
- 2 篇 生物医学工程（可授...
46 篇 理学
- 32 篇 数学
- 8 篇 生物学
- 5 篇 化学
- 4 篇 统计学（可授理学、...
- 2 篇 物理学
- 2 篇 大气科学
34 篇 管理学
- 20 篇 管理科学与工程(可...
- 16 篇 图书情报与档案管...
- 7 篇 工商管理
4 篇 农学
- 2 篇 作物学
2 篇 教育学
- 2 篇 教育学
2 篇 医学
1 篇 经济学
1 篇 法学
1 篇 文学

主题

36 篇 distributed comp...
30 篇 concurrent compu...
15 篇 laboratories
11 篇 parallel algorit...
11 篇 parallel process...
10 篇 computer science
10 篇 grid computing
9 篇 computational mo...
8 篇 java
8 篇 computer network...
7 篇 runtime
6 篇 application soft...
6 篇 costs
6 篇 data structures
6 篇 web services
5 篇 routing
5 篇 scheduling algor...
5 篇 fault tolerance
5 篇 data mining
5 篇 processor schedu...

机构

11 篇 national laborat...
10 篇 center for paral...
7 篇 department of pa...
6 篇 parallel and dis...
5 篇 parallel and dis...
5 篇 department of co...
5 篇 department of co...
5 篇 parallel and dis...
4 篇 shanghai key lab...
4 篇 department of co...
4 篇 center for resea...
4 篇 department of co...
4 篇 high performance...
4 篇 institute of inf...
4 篇 shanghai key lab...
3 篇 high-performance...
3 篇 parallel and dis...
3 篇 institute of par...
3 篇 guangxi intellig...
3 篇 parallel and dis...

作者

11 篇 li kuan-ching
11 篇 yang chao-tung
9 篇 a. choudhary
7 篇 e. gatial
7 篇 p. banerjee
7 篇 ji wang
7 篇 v. chaudhary
6 篇 z. balogh
6 篇 s.k. das
6 篇 hluchy ladislav
6 篇 das sajal k.
5 篇 guan haibing
5 篇 babik marian
5 篇 kuan-ching li
5 篇 chen haibo
5 篇 zang binyu
5 篇 hsu ching-hsien
5 篇 chao-tung yang
4 篇 wei dong
4 篇 chen ningjiang

语言

183 篇 英文
1 篇 其他
1 篇 中文

检索条件"机构=Department of Parallel and Distributed Computing"

共 185 条记录，以下是61-70 订阅

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

详细简洁

排序：

A resource broker for computing nodes selection in grid computing environments 3rd

引用

3rd International Conference on Grid and Cooperative computing, GCC2004

作者： Yang, Chao-Tung Lai, Chuan-Lin Shih, Po-Chi Li, Kuan-Ching High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung407 Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Shalu Taichung433 Taiwan

ISBN: (纸本)3540235647

As Grid computing is becoming a reality, there is a need for managing and monitoring the available resources worldwide, as well as the need for conveying these resources to the everyday user. This paper describes a resource broker with its main function as to match the available resources to the user’s needs. The use of the resource broker provides a uniform interface to access any of the available and appropriate resources using user’s credentials. The resource broker runs on top of the Globus Toolkit. Therefore, it provides security and current information about the available resources and serves as a link to the diverse systems available in the Grid. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

parallel biomedical image processing with GPGPUs in cancer research

Parallel biomedical image processing with GPGPUs in cancer r...

引用

3rd IEEE International Symposium on Logistics and Industrial Informatics, LINDI 2011

作者： Reményi, Attila Szénási, Sándor Bándi, István Vámossy, Zoltán Valcz, Gábor Bogdanov, Pál Sergyán, Szabolcs Kozlovszky, Miklos Óbuda University John von Neumann Faculty of Informatics Budapest Hungary Semmelweiss University 2nd Department of Internal Medicine Budapest Hungary MTA SZTAKI/Laboratory of Parallel and Distributed Computing Budapest Hungary

ISBN: (纸本)9781457718410

The main aim of this work is to show, how GPGPUs can facilitate certain type of image processing methods. The software used in this paper is used to detect special tissue part, the nuclei on (HE - hematoxilin eosin) stained colon tissue sample images. Since pathologists are working with large number of high resolution images - thus require significant storage space -, one feasible way to achieve reasonable processing time is the usage of GPGPUs. The CUDA software development kit was used to develop processing algorithms to NVIDIA type GPUs. Our work focuses on how to achieve better performance with coalesced global memory access when working with three-channel RGB tissue images, and how to use the on-die shared memory efficiently. © 2011 IEEE.

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

A Comparative Study of Star Graphs and Rotator Graphs

A Comparative Study of Star Graphs and Rotator Graphs

引用

International Conference on parallel Processing (ICPP)

作者： Subburajan Ponnuswamy Vipin Chaudhary Parallel and Distributed Computing Laboratory Department of ECE Wayne State University Detroit MI USA

Star graph is an extensively studied Cayley graph, considered to be an attractive alternative to the popular binary cube. The rotator graphs are a set of directed Cayley graphs introduced recently. In this paper we compare the structural and algorithmic aspects of star graphs with that of rotator graphs. In the process we present some new results for star graphs and rotator graphs. We present a formula for the number of nodes at any distance from the identity permutation in star graphs. The minimum bisection width of star and rotator graphs is obtained. Partitioning and fault tolerant parameters for both star and rotator graphs are analyzed. The node disjoint parallel paths and hence the upper bound on the fault diameter of rotator graphs are presented. We compare the minimal path routing in star and rotator graphs using simulation results.

关键词： Routing Fault tolerance Tin parallel processing distributed computing Laboratories Delay Computational modeling Upper bound Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

Survey on Divisible Load Theory and its Applications

Survey on Divisible Load Theory and its Applications

引用

International Conference on Information Management and Engineering, ICIME

作者： Amin Shokripour Mohamed Othman Department of parallel and distributed computing Universiti Putra Malaysia Serdang Selangor Darul Ehsan Malaysia

ISBN: (纸本)9781424437740

During the last decade, using parallel and distributed system has been more general. In these systems a huge size of data or computation is distributed between many systems for getting better performance. Dividing data is one of the challenges in this type of system. Because efficiency of system has direct relation to distributed data. One of proposed method for managing data distribution called divisible load theory. This method is based on this actuality that data in some applications can be divided arbitrarily to some independent parts which each of them can be processed independently from others. In this paper we present a survey on DLT. This article will discuss about some basic concepts for understanding this method. Then some reasons for using it and basic concept and notation used in this method, will be investigated. We will solve an example and some of application of this method will be mentioned.

关键词： Object oriented modeling distributed computing Processor scheduling Computer networks Grid computing Information management Availability Costs Predictive models Data models

来源：评论

学校读者我要写书评

暂无评论

Decision tree construction for data mining on grid computing environments

Decision tree construction for data mining on grid computing...

引用

19th International Conference on Advanced Information Networking and Applications, AINA 2005

作者： Yang, Chao-Tung Tsai, Shu-Tzu Li, Kuan-Ching High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung City 40704 Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung County 43301 Taiwan

ISBN: (纸本)0769522491

In this paper, we present our Grid-based decision tree architecture, with the intention of applying it to both parallel and sequential algorithms. Also, we show that, based on the scope and model of data mining applied in the Grid environment as well as user equivalent perspective, Grid roles can be categorized into three types. It is our goal, through these definitions, to help software developers define clear system processes and differentiate the application scope for software applications. To, fulfill our architecture, we first apply an existing parallel decision tree algorithm (the SPRINT algorithm) to the Grid environment. The performance and differences in many other areas are compared using datasets of different sizes. The experimental results will be used for future reference and further development. © 2005 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Incremental capacitance extraction and its application to iterative timing-driven detailed routing 99

Incremental capacitance extraction and its application to it...

引用

Proceedings of the 1999 international symposium on Physical design

作者： Yanhong Yuan Prithviraj Banerjee Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston IL

来源：评论

学校读者我要写书评

暂无评论

Scalable high-level caching for parallel I/O

Scalable high-level caching for parallel I/O

引用

International Symposium on parallel and distributed Processing (IPDPS)

作者： K. Coloma A. Choudhary W. Liao L. Ward E. Russell N. Pundit Center for Parallel and Distributed Computing Northwestern University USA Scalable Computing Systems Department Sandia National Laboratories USA

Summary form only given. In order for I/O systems to achieve high performance in a parallel environment, they must either sacrifice client-side file caching, or keep caching and deal with complex coherency issues. The most common technique for dealing with cache coherency in multiclient file caching environments uses file locks to bypass the client-side cache. Aside from effectively disabling cache usage, file locking is sometimes unavailable on larger systems. The high-level abstraction layer of MPI allows us to tackle cache coherency with additional information and coordination without using file locks. By approaching the cache coherency issue further up, the underlying I/O accesses can be modified in such a way as to ensure access to coherent data while satisfying the user's I/O request. We can effectively exploit the benefits of a file system's client-side cache while minimizing its management costs.

关键词： File systems Delay distributed computing Costs Concurrent computing High performance computing Environmental management Laboratories Throughput Bandwidth

来源：评论

学校读者我要写书评

暂无评论

An enhanced parallel loop self-scheduling scheme for cluster environments

An enhanced parallel loop self-scheduling scheme for cluster...

引用

19th International Conference on Advanced Information Networking and Applications, AINA 2005

作者： Yang, Chao-Tung Cheng, Kuan-Wei Li, Kuan-Ching High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung City 40704 Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung County 43301 Taiwan

ISBN: (纸本)0769522491

In this paper, a parallel loop self-scheduling scheme for heterogeneous PC cluster systems is proposed. Though the proposed scheme does allow users to choose parameters before the execution initialization phase, there are still weaknesses that motivate us to go further with new improvements in that scheme. For instance, a decision on a fixed and monotonous parameter can easily lead to invalid schedule by using previous input information. Thus, it is proposed in this paper a new scheme, where the scheduling parameter can be adjusted dynamically and fit into most widely available computer systems, in order to provide higher overall performance. © 2005 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

A high-performance computational resource broker for Grid computing environments

A high-performance computational resource broker for Grid Co...

引用

19th International Conference on Advanced Information Networking and Applications, AINA 2005

作者： Yang, Chao-Tung Shih, Po-Chi Li, Kuan-Ching High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung City 40704 Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung County 43301 Taiwan

ISBN: (纸本)0769522491

Internet computing and grid technologies promise to change the way we tackle complex problems. They will enable large-scale aggregation and sharing of computational, data and other resources across institutional boundaries. As Grid computing is becoming a reality, there is a need for managing and monitoring the available resources worldwide, ax well as the need for conveying these resources to the everyday user. This paper describes a resource broker with its main function as to match the available resources to the user's needs. The use of the resource broker provides a uniform interface to access any of the available and appropriate resources using user's credentials. The resource broker runs on top of the Globus Toolkit. Therefore, it provides security and current information about the available resources and serves as a link to the diverse systems available in the Grid. © 2005 IEEE.

关键词： Computer systems

来源：评论

学校读者我要写书评

暂无评论

Secure execution of mobile programs

Secure execution of mobile programs

引用

DARPA Information Survivability Conference & Exposition

作者： R. Pandey B. Hashii M. Lal Parallel and Distributed Computing Laboratory Computer Science Department University of California Davis CA USA

There is increasing interest in computing models that support extensibility of systems through code migration. Although appealing both from the system design and extensibility points of view, extensible systems are vulnerable to an external program's aberrant execution behaviors. We examine the problems of resource access control and resource consumption. We propose solutions for these problems and analyze their effectiveness.

关键词： Operating systems Kernel Concurrent computing Computer science Internet Communication system security Government Laboratories Read only memory Java

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共19页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：