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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

294 篇 会议
8 册 图书
4 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

192 篇 工学
- 176 篇 计算机科学与技术...
- 87 篇 软件工程
- 27 篇 电气工程
- 16 篇 电子科学与技术（可...
- 15 篇 信息与通信工程
- 9 篇 控制科学与工程
- 8 篇 生物工程
- 4 篇 仪器科学与技术
- 4 篇 动力工程及工程热...
- 3 篇 机械工程
- 3 篇 生物医学工程（可授...
- 2 篇 建筑学
- 2 篇 土木工程
- 2 篇 环境科学与工程（可...
- 2 篇 安全科学与工程
40 篇 理学
- 23 篇 数学
- 10 篇 系统科学
- 8 篇 生物学
- 5 篇 物理学
- 4 篇 统计学（可授理学、...
- 2 篇 大气科学
- 1 篇 化学
- 1 篇 地理学
- 1 篇 地球物理学
29 篇 管理学
- 22 篇 管理科学与工程(可...
- 16 篇 工商管理
- 10 篇 图书情报与档案管...
2 篇 农学
2 篇 医学
- 2 篇 基础医学(可授医学...
- 2 篇 临床医学
- 2 篇 公共卫生与预防医...

主题

22 篇 parallel process...
17 篇 cloud computing
16 篇 distributed comp...
15 篇 computational mo...
13 篇 routing
12 篇 computer archite...
11 篇 scalability
11 篇 servers
10 篇 graphics process...
10 篇 peer-to-peer com...
9 篇 concurrent compu...
9 篇 resource managem...
9 篇 protocols
9 篇 hardware
9 篇 distributed comp...
8 篇 runtime
8 篇 monitoring
8 篇 real-time system...
8 篇 performance eval...
7 篇 computer science

机构

5 篇 institute of com...
3 篇 university of ch...
2 篇 school of scienc...
2 篇 vienna universit...
2 篇 shanghai key lab...
2 篇 guangdong provin...
2 篇 college of compu...
2 篇 department of co...
2 篇 tu münchen garch...
2 篇 school of comput...
2 篇 green univ bangl...
2 篇 univ chinese aca...
2 篇 school of cybers...
2 篇 school of comput...
2 篇 university of pi...
2 篇 isislab - dipart...
2 篇 department of co...
2 篇 institute of par...
2 篇 tennessee tech u...
2 篇 rwth aachen univ...

作者

3 篇 hai jin
3 篇 gonzalez teofilo...
2 篇 dan meng
2 篇 li cui
2 篇 roy palash
2 篇 chaudhary vipin
2 篇 haibin cai
2 篇 hassan mohammad ...
2 篇 michael alexande...
2 篇 liu yang
2 篇 roberto g. casce...
2 篇 shigeng zhang
2 篇 qiang li
2 篇 alexandru costan
2 篇 ammar reda a.
2 篇 luís lopes
2 篇 emmanuel jeannot
2 篇 vittorio scarano
2 篇 xiaofei liao
2 篇 stephen l. scott

语言

304 篇 英文
1 篇 其他
1 篇 中文

检索条件"任意字段=20th International Conference on Parallel and Distributed Computing Systems, PDCS 2007"

共 306 条记录，以下是31-40 订阅

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

详细简洁

排序：

parallel Implementation of Shallow Water Model on distributed Memory Architectures 20

Parallel Implementation of Shallow Water Model on Distribute...

引用

20th international conference on parallel and distributed computing systems, pdcs 2007

作者： Ganeshamoorthy, K. Silva, K.P.M.K. Ranasinghe, D.N. Wait, R. Department of Computing & Intelligent Systems University of Colombo School of Computing 35 Reid Avenue Colombo-7 Sri Lanka International Science Programme Department of Information Technology Uppsala University Uppsala Sweden

ISBN: (纸本)9781604233926

In this paper, we study the impact of memory architectures, distributed memory (DM) and virtual shared memory (VSM), in the solution of parallel numerical algorithms on a multi-processor nodes cluster. the parallel implementation of the shallow water equations to model the Tsunami effect is chosen to be the case study. Data is partitioned into sub domains, namely a four into three (4 × 3) Grid scheme and a eight into six (8×6) Grid scheme which are used for the parallel implementation of this model. We present four parallel algorithms in each Grid scheme: distributed memory without threads, distributed memory with threads, virtual shared memory without threads, and virtual shared memory with threads. these four parallel algorithms have been implemented on a high performance cluster, connected to the"Nordugrid". Experiments are realized using the Message Passing Interface (MPI) library, the C/Linda, and the Linux pthreads. Subject to available memory, the virtual shared memory version without threads performs best, but as the task is scaled up, the threaded version becomes efficient in both DM and VSM implementations. © 20th international conference on parallel and distributed computing systems, pdcs 2007. All rights reserved.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Massively parallel Expressed Sequence Tag Clustering 20

Massively Parallel Expressed Sequence Tag Clustering

引用

20th international conference on parallel and distributed computing systems, pdcs 2007

作者： Emrich, Scott J. Kalyanaraman, Ananth Aluru, Srinivas Electrical and Computer Engineering Iowa State University AmesIA50010 United States Electrical Engineering and Computer Science Washington State University PullmanWA99164 United States

ISBN: (纸本)9781604233926

Expressed Sequence Tag (EST) sequencing is a technique that samples expressed genes required for most cellular functions. While this is a well-studied problem, large-scale EST clustering has previously been pursued through incremental approaches, a pipeline of programs and manual efforts to achieve a modest degree of parallelism. Here, we present the first method that can directly cluster millions of ESTs on thousands of processors. this approach requires only linear space and uses rigorous alignment-based techniques to ensure biological accuracy. Further, we minimize computationally intensive alignments with single linkage clustering and develop a method to limit the formation of large spurious clusters. the computational scalability and biological validity of this approach is demonstrated by clustering mouse EST data, one of the two largest EST collections, on a 1,024 node BlueGene/L supercomputer. © 20th international conference on parallel and distributed computing systems, pdcs 2007. All rights reserved.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

SDSS: A Strategy Decision Support System in distributed Campus Information systems 20

SDSS: A Strategy Decision Support System in Distributed Camp...

引用

20th international conference on parallel and distributed computing systems, pdcs 2007

作者： Fujimoto, Takayuki Matsuo, Tokuro Department of Future Desiggn Sonoda Women’s University 7-29-1 Minami-Tsukaguchi Amagasaki661–8520 Japan Department of Informatics Yamagata University Jonan 4-3-16 Yonezawa Yamagata992-8510 Japan

ISBN: (纸本)9781604233926

In this paper, we discuss a new strategy decision support system (SDSS) in distributed campus information systems. Our system supports university management staffs to make decisions of strategy. It is different between universities and companies regarding as operations since universities are never managed only monetary and finalcial decision making. For example, the concepts of educational resourses and educational intentions do not exist in companies even though both universities and companies should get a good deal of money. Most of universities never manage only course fee and fees for tuition paid by students, but also gain donations from companies. To analyse such situations qualitatively, we propose one of information reuse methods in the decision making system for campus operation. However, even though campus information systems run in the university, they sometimes distributes with students support section, faculty of special interest groups, libraries, and so on. Our proposed system integrates such information to SDSS server and resend to each system to simulate effectively and distributionally. Users can know and understand status and conditions of universities’ managements whether there are important options or not when they make a decision based on operation strategies. Our system realizes an effective university operation and new comer-officers can learn the state of operations. © 20th international conference on parallel and distributed computing systems, pdcs 2007. All rights reserved.

关键词： Decision support systems

来源：评论

学校读者我要写书评

暂无评论

Efficient Soft QoS Guarantee in Mobile Ad Hoc Networks 20

Efficient Soft QoS Guarantee in Mobile Ad Hoc Networks

引用

20th international conference on parallel and distributed computing systems, pdcs 2007

作者： Xie, Gaogang Li, Zhenyu Chen, Jianing Issarny, Valerie Conte, Alberto Institute of Computing Technology Chinese Academy of Sciences Beijing100080 China INRIA-Rocquencourt Domaine de Voluceau Le Chesnay78153 France Alcatel Research & Innovation Center Marcoussis France

ISBN: (纸本)9781604233926

More and more Quality of Service (QoS) sensitive applications, such as streaming media, high bandwidth content distribution and VoIP, will be deployed in Mobile Ad hoc Networks (MANETs) as part of the pervasive computing realization. However, traditional QoS guarantee technologies cannot be used directly in MANETs due to the dynamic network environment. this paper proposes a QoS management mechanism combining Caching and Backup Service Paths (CBSP) and an Enhanced CBSP (ECBSP) for soft QoS guarantee in MANETs. In CBSP, Service Provider Nodes (SPNs) with distinct Service Paths (SPs) providing the required service are found in the MANET during the service discovery phase. the client node then selects one SP to get the service and the other SPs as Backup Service Paths (BSPs). If the serving SP fails to serve the client node, the client node can handover quickly to a BSP and consume the resource in its cache during the handover operation in order to avoid service interruption. In ECBSP, the required data are further divided into several segments and transmitted concurrently to the client node through different SPs for enhanced availability. Simulation experiments in ns2 show that CBSP/ECBSP can improve the performance of applications in MANETs effectively. © 20th international conference on parallel and distributed computing systems, pdcs 2007. All rights reserved.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Architectural Requirements of parallel Computational Biology Applications with Explicit Instruction Level parallelism 20

Architectural Requirements of Parallel Computational Biology...

引用

20th international conference on parallel and distributed computing systems, pdcs 2007

作者： Azeemi, Naeem Z. Christian Doppler Laboratory for Design Methodology of Signal Processing Algorithms Institute of Communications and Radio Frequency Engineering University of Technology Vienna Austria

ISBN: (纸本)9781604233926

Computational biology applications expression profile is a critical performance metric in high end genomic data processing. these profiles are compute intensive and offers a wide range of computation pattern ranging from data base searching applications to highly irregular phylogenetic trees. Such debilitating factors lead to poor architecture-application correlation. A prior knowledge of software application would be very useful to exploit the instruction level parallelism inside the computational biology applications. this paper presents an integrated approach for parameterized workload characterization and trace driven simulation at a high end multimedia processor in bioinformatics applications. A set of sixteen widely used bioinformatics applications is selected as benchmark. Software monitoring techniques are used to collect execution traces. Based on the measured results, we investigate both the computation and communication behavior of these applications, including execution time, functional unit utilization, scheduling factors and cache misses. the temporal and spatial localities in gnomic data are also discussed. Experimental results are measured at a high end SIMD (single instruction stream over multiple data stream) processor. © 20th international conference on parallel and distributed computing systems, pdcs 2007. All rights reserved.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

the right activities, people and resources to satisfy process constraints in a multiagent process management system 16

The right activities, people and resources to satisfy proces...

引用

16th international conference on parallel and distributed computing systems (pdcs 2003)

作者： Debenham, J Univ Technol Sydney Fac Informat Technol Sydney NSW 2007 Australia

来源：评论

学校读者我要写书评

暂无评论

Evaluation of CPU power control and scheduling technique on parallel computing environment

Evaluation of CPU power control and scheduling technique on ...

引用

20th IASTED international conference on parallel and distributed computing and systems, pdcs 2008

作者： Sato, Hiroyuki Ozaki, Atsuo Information Technology R and D Center Mitsubishi Electric Corporation 5-1-1 Ofuna Kamakura Kanagawa 247-8501 Japan

ISBN: (纸本)9780889867741

Large-scale parallel and distributed computing environments have several problems concerning power consumption, thermal ascent, and setting space. In particular, power consumption and thermal ascent are the two serious problems that have to be taken care of when a system is used for a long time. We had proposed a CPU power control and scheduling technique (PCST) for realtime parallel and distributed computing systems in order to solve the abovementioned problems;in these systems, the processors can change the frequencies and voltages. In this study, we evaluate the PCST by using the tracking program. the evaluation results show that when the PCST is employed, the power consumption is 60%-80% when compared to that of the commercial power control;moreover, when compared to that of the no power control, the power consumption is only 20%-40%.

关键词： Electric power utilization

来源：评论

学校读者我要写书评

暂无评论

A parallel path planning approach based on Organic computing principles

A parallel path planning approach based on Organic Computing...

引用

20th IASTED international conference on parallel and distributed computing and systems, pdcs 2008

作者： Schmidt, Michael Fey, Dietmar Institute of Computer Science Friedrich-Schiller-University Jena Thuringia Germany

ISBN: (纸本)9780889867741

Path planning is one of the most computation expensive tasks in the field of mobile robotics especially in dynamically changing environments. It is difficult to meet realtime requirements with serial path planning algorithms. this would require a high speed processor. Particularly in small autonomous robot systems, this is inefficient due to the energy consumption and space requirement. In contrast, we propose a parallel path planning approach based on Marching Pixels which is a new innovative Organic computing principle. It can be used as coarse global path planner in dynamically changing environments because the algorithm is very fast and only requires few resources.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Scheduling independent tasks to minimize computation and communication makespan in distributed systems

Scheduling independent tasks to minimize computation and com...

引用

20th IASTED international conference on parallel and distributed computing and systems, pdcs 2008

作者： Gonzalez, Teofilo F. Department of Computer Science University California Santa Barbara CA 93106-5110 United States

ISBN: (纸本)9780889867741

We study the problem of scheduling tasks in a distributed system where the data (and code) for a program may reside on a processor different from the one where it will be executed. the scheduling of the tasks is complex as one must balance execution and communications times. We present an off-line polynomial time approximation algorithm for the case when the processors can be split into storage (client) and processing (server) nodes. Our algorithm is the first constant ratio approximation algorithm for this problem. then we discuss generalization of our problem as well as the on-line version of our problem.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A parallel approach for solving data flow analysis problems

A parallel approach for solving data flow analysis problems

引用

20th IASTED international conference on parallel and distributed computing and systems, pdcs 2008

作者： Edvinsson, Marcus Löwe, Welf Department of Computer Science Växjö University Sweden

ISBN: (纸本)9780889867741

Program analysis supporting software development is often part of edit-compile-cycles and precise program analysis is time consuming. With the availability parallel processing power on desktop computers, paral-lelization is a way to speed up program analysis. this paper introduces a parallelization schema for program analysis that can be translated to parallel machines using standard scheduling techniques. First benchmarks analyzing a number of Java programs indicate that the schema scales well for up to 8 processors, but not very well for 128 processors. these results are a first step towards more precise program analysis in Integrated Development Environments utilizing the computational power of today's custom computers.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共31页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：