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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

16 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

15 篇 工学
- 15 篇 计算机科学与技术...
- 13 篇 软件工程
- 5 篇 电气工程
- 5 篇 电子科学与技术（可...
- 3 篇 力学（可授工学、理...
- 3 篇 信息与通信工程
- 3 篇 建筑学
- 2 篇 机械工程
- 2 篇 材料科学与工程（可...
- 2 篇 土木工程
- 2 篇 化学工程与技术
- 1 篇 光学工程
- 1 篇 仪器科学与技术
- 1 篇 控制科学与工程
- 1 篇 测绘科学与技术
- 1 篇 船舶与海洋工程
- 1 篇 航空宇航科学与技...
- 1 篇 核科学与技术
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
12 篇 理学
- 9 篇 数学
- 3 篇 化学
- 2 篇 物理学
- 1 篇 大气科学
- 1 篇 地球物理学
- 1 篇 生物学
- 1 篇 系统科学
8 篇 管理学
- 5 篇 图书情报与档案管...
- 4 篇 管理科学与工程(可...
- 2 篇 工商管理
1 篇 医学

主题

2 篇 parallel archite...
2 篇 parallel program...
1 篇 parallel algorit...
1 篇 parallel process...
1 篇 theory of comput...
1 篇 software enginee...
1 篇 concurrent compu...
1 篇 application soft...
1 篇 computer archite...
1 篇 alarm systems
1 篇 ad hoc networks
1 篇 security of data
1 篇 computer communi...
1 篇 grid computing
1 篇 electric filters
1 篇 quality assuranc...
1 篇 bioinformatics
1 篇 algorithm design...
1 篇 parallel process...
1 篇 clustering algor...

机构

1 篇 inp irit univers...
1 篇 faculdade de eng...
1 篇 lawrence berkele...
1 篇 research computi...
1 篇 department of el...
1 篇 city college and...
1 篇 cern ch-1211 gen...
1 篇 national e-scien...
1 篇 department of en...
1 篇 school of comput...
1 篇 cea list embedde...
1 篇 faculty of engin...
1 篇 dept of electron...
1 篇 faculty of autom...
1 篇 computer systems...
1 篇 national e-scien...
1 篇 workflow systems...
1 篇 institut d'elect...
1 篇 mathematics and ...
1 篇 department of el...

作者

1 篇 millar c.
1 篇 adhar gur saran
1 篇 choi k.
1 篇 harada takashi
1 篇 ishihata hiroaki
1 篇 yazaki syunji
1 篇 harbulot b.
1 篇 tanaka kazuto
1 篇 jones m.
1 篇 yamashita masafu...
1 篇 schikuta erich
1 篇 litvinova antoni...
1 篇 basir otman
1 篇 asenov a.
1 篇 stewart g.
1 篇 davenhall c.
1 篇 guerre alexandre
1 篇 pawaskar sachin
1 篇 vinek elisabeth
1 篇 saadawi tarek

语言

17 篇 英文

检索条件"任意字段=9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010"

共 17 条记录，以下是1-10 订阅

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

详细简洁

排序：

Proceedings of the 9th iasted international conference on parallel and distributed computing and networks, pdcn 2010

Proceedings of the 9th IASTED International Conference on Pa...

引用

9th iasted international conference on parallel and distributed computing and networks, pdcn 2010

ISBN: (纸本)9780889868205

the proceedings contain 40 papers. the topics discussed include: a classified cluster based architecture for resource discovery in P2P networks using collaborative agents;the probabilistic double token ring;an efficient inter-domain routing in wireless mesh networks;a reliable transmission protocol for sensors in poorly connected areas over mobile networks;grid scheduling divisible load with load adaptive computing power;an energy efficient SMT processor with heterogeneous instruction set architectures;a proactive fault tolerance framework for high-performance computing;coverage overlay backfilling: efficient job allocation scheduling scheme for large-scale mesh-connected supercomputers;development of a network on chip for parallel processing systems;a low-power fault-tolerant NOC using error correction and detection codes;link state aware routing for multiple mobile robots in wireless sensor network;and channel assignment protocol with weaker restrictions in wireless multihop networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Grid scheduling divisible load with load adaptive computing power

Grid scheduling divisible load with load adaptive computing ...

引用

9th iasted international conference on parallel and distributed computing and networks, pdcn 2010

作者： Choi, K. Robertazzi, T.G. Department of Electrical and Computer Engineering Stony Brook University Stony Brook NY 11794 United States

ISBN: (纸本)9780889868205

For an initial study in divisible load scheduling, an optimal computing power allocation problem in a distributed parallel computing grid involving two sources and a sink is considered. the objective is to optimally allocate the computing power of the sink in the grid in a such way that the total parallel computing finish time of the entire load is equalized to the sequential computing finish time while utilizing the full computing power. A numerical method to calculate the optimal adaptive computing power via a deterministic analysis is presented under several computing constraints. Performance of the computing power adaptation is modeled and evaluated. For performance evaluation, we define average computing finish time.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

A proactive fault tolerance framework for high-performance computing

A proactive fault tolerance framework for high-performance c...

引用

9th iasted international conference on parallel and distributed computing and networks, pdcn 2010

作者： Litvinova, Antonina Engelmann, Christian Scott, Stephen L. Department of Computer Science University of Reading Reading United Kingdom Computer Science and Mathematics Division Oak Ridge National Laboratory Oak Ridge TN United States

ISBN: (纸本)9780889868205

As high-performance computing (HPC) systems continue to increase in scale, their mean-time to interrupt decreases respectively. the current state of practice for fault tolerance (FT) is checkpoint/restart. However, with increasing error rates, increasing aggregate memory and not proportionally increasing I/O capabilities, it is becoming less efficient. Proactive FT avoids experiencing failures through preventative measures, such as by migrating application parts away from nodes that are "about to fail". this paper presents a proactive FT framework that performs environmental monitoring, event logging, parallel job monitoring and resource monitoring to analyze HPC system reliability and to perform FT through such preventative actions.

关键词： Quality assurance

来源：评论

学校读者我要写书评

暂无评论

Message flowsimulator for evaluating communication algorithms

Message flowsimulator for evaluating communication algorithm...

引用

9th iasted international conference on parallel and distributed computing and networks, pdcn 2010

作者： Yazaki, Syunji Ishihata, Hiroaki School of Computer Science Tokyo University of Technology 1404-1 Katakuramachi Hachioji City Tokyo 192-0982 Japan

ISBN: (纸本)9780889868205

this paper proposes Message Flow Simulator (MFS), which evaluates the communication algorithms for inter- connection network of large-scale parallel computer. MFS calculates communication time from the amount of message flow on communication links. To show the characteristics of MFS, we presented the run time of MFS and the estimated virtual communication time on fat-tree networks including up to 3456 nodes for all-to-all communication. We compared MFS with Booksim 2.0 developed at Stanford University, which is an existing flit-level simulator. the ratio of the throughput of the network estimated by MFS differs from that estimated by Booksim (500 flits/packet) by 2.1% on average (3.6% at maximum and 1.2% at minimum). the simulation results of Booksim were close to the results of MFS when a packet consisted of many flits. We conclude that MFS provides the simulation results that reflect characteristics of the communication algorithms.

关键词： parallel flow

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel architecture of median filter

Efficient parallel architecture of median filter

引用

9th iasted international conference on parallel and distributed computing and networks, pdcn 2010

作者： Medhat, R. Faheem, H.M. Khaleefa, M.E. Computer Systems Department Faculty of Computer and Information Sciences Ain Shams University Cairo Egypt

ISBN: (纸本)9780889868205

Many attempts have been made to optimize the median filter from the software and hardware approach. An architectural design of hardware capable of performing real-time median filtering is presented. the architecture uses the histogram approach to calculate the median, while optimizing the sliding window method to reuse all its calculations. Data is output row by row and every input pixel is processed only once. the design is independent of window size or image size, and supports adding more processing elements to support wider images. the control unit design is minimized to enable self-adjustment of plug-and-play processing elements. the architecture is implemented in VHDL and synthesized to a Virtex-2 Pro FPGA. the architecture's performance as well as operation is compared to previous work.

关键词： Electric filters

来源：评论

学校读者我要写书评

暂无评论

An adaptive multi-agent approach for distributed alarm correlation and fault identification

An adaptive multi-agent approach for distributed alarm corre...

引用

9th iasted international conference on parallel and distributed computing and networks, pdcn 2010

作者： Mohamed, Abduljalil A. Basir, Otman Department of Systems Design Engineering University of Waterloo Waterloo ON Canada Department of Electrical and Computer Engineering University of Waterloo Waterloo ON Canada

ISBN: (纸本)9780889868205

Network fault management systems rely heavily on observed alarms to identify the root causes of network failures. Due to the increasing complexity of modern computer networks, the information carried by these alarms may in fact be vague, imprecise, and inconsistent. thus, these alarms often possess different diagnostic capabilities and should not be treated equally. In this paper, we propose a new distributed alarm correlation approach that effectively tackles the aforementioned data deficiencies. According to the proposed approach, the managed network is first divided into a disjoint set of management domains and each domain is assigned an intelligent agent. Within the framework of Dempster-Shafer evidence theory, the intelligent agent perceives each network entity in its domain as a source of information. As such, alarms emitted by these entities are expected to exhibit different information qualities and are assigned different weights accordingly. Based on their weights, the observed alarms are then correlated by their respective agent into a single local fuzzy composite alarm. Since local composite alarms constitute only partial views of the managed network, they are correlated, by a higher management entity, into a global alarm that accurately reflects a comprehensive view of the managed network.

关键词： Alarm systems

来源：评论

学校读者我要写书评

暂无评论

On the tradeoff between speedup and energy consumption in high performance computing - A bioinformatics case study

On the tradeoff between speedup and energy consumption in hi...

引用

9th iasted international conference on parallel and distributed computing and networks, pdcn 2010

作者： Pawaskar, Sachin Ali, Hesham H. Department of Computer Science College of Information Science and Technology University of Nebraska at Omaha Omaha NE 68182 United States

ISBN: (纸本)9780889868205

High Performance computing has been very useful to researchers in the Bioinformatics, Medical and related fields. the bioinformatics domain is rich in applications that require extracting useful information from very large and continuously growing sequence of databases. Automated techniques such as DNA sequencers, DNA microarrays & others are continually growing the dataset that is stored in large public databases such as GenBank and Protein DataBank. Most methods used for analyzing genetic/protein data have been found to be extremely computationally intensive, providing motivation for the use of powerful computers or systems with high throughput characteristics. In this paper, we provide a case study for one such bioinformatics application called BLAT running in a high performance computing environment. We use sequences gathered from researchers and parallelize the runs to study the performance characteristics under three different query and data partitioning models. this research highlights the need to carefully develop a parallel model with energy awareness in mind, based on our understanding of the application and then appropriately designing a parallel model that works well for the specific application and domain. We found that the BLAT program is highly parallelizable and a high degree of speedup is achievable. the experiments suggest that the speed up depends on model used for query and database segmentation.

关键词： Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Constructing non-dominated m-group coteries for group mutual exclusion

Constructing non-dominated m-group coteries for group mutual...

引用

9th iasted international conference on parallel and distributed computing and networks, pdcn 2010

作者： Harada, Takashi Yamashita, Masafumi Graduate School of Management Hiroshima University Hiroshima Japan Department of Informatics Kyushu University Fukuoka Japan

ISBN: (纸本)9780889868205

A typical group mutual exclusion algorithm among m groups makes use of anm-group coterie, which determines the performance of the algorithm. there are two main performance measures: the availability is the probability that an algorithm tolerates process crash failures, and the concurrency is the number of processes that it allows simultaneous access to the resources. Since non-dominated (ND, for short) m-group coteries (locally) maximize the availability and their degrees roughly correspond to the concurrency, methods to construct ND m-group coteries with large degrees are looked for. Nevertheless, only a few naive methods have been proposed. this paper presents three methods to construct desirable m-group coteries. the first method constructs an ND m-group coterie from a dominated one using the transversal composition. the second one constructs an ND (m - 1)-group coterie from an ND m-group coterie. the last one uses the coterie join operation to produce an ND m-group coterie from an ND coterie and another ND mgroup coterie. these methods preserve the degrees of the original m-group coteries.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Low-complex task scheduling algorithms for hierarchical embedded many-core architectures and dynamic applications

Low-complex task scheduling algorithms for hierarchical embe...

引用

9th iasted international conference on parallel and distributed computing and networks, pdcn 2010

作者： Guerre, Alexandre Ventroux, Nicolas David, Raphäel Mérigot, Alain CEA LIST Embedded Computing Laboratory PC 94 Gif-sur-Yvette F-91191 France Institut D'Electronique Fondamentale Université Paris Sud Orsay F-91405 France

ISBN: (纸本)9780889868205

Embedded systems require more and more computational power. Moreover, embedded applications are becoming data-dependent and their execution time depends on their input data. Only a dynamic global scheduling can balance the workload on the computation resources and reach good performances. thus, a solution to address this problem is to use many-core architectures with a dynamic and centralized control. In this article, we propose new on-line scheduling algorithms adapted to hierarchical many-core embedded systems. the proposed algorithms reduce communications between clusters in order to increase global performance. this paper highlights the good results of a scheduling algorithm named Static Clustering Dynamic Mapping. It consists in dividing the application graph offline and dynamically allocating each part on each cluster.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

HEPRA: History of encounters probabilistic routing algorithm in delay-tolerant network

HEPRA: History of encounters probabilistic routing algorithm...

引用

9th iasted international conference on parallel and distributed computing and networks, pdcn 2010

作者： Alnajjar, Fuad Saadawi, Tarek City College and Graduate Center City University of New York Electrical Engineering Department 138th Street New York NY 10031 United States

ISBN: (纸本)9780889868205

Routing in mobile ad hoc networks (MANET) is complex and complicated because the network graph is episodically connected. the topology is changing rapidly because of weather, terrain, highly variable delay links, error rate links, and jamming. A key challenge is to create a method that can present good delivery performance and low end-to-end delay in an intermittent network graph and opportunistic or scheduled intermittent links where nodes may move freely. Delay-Tolerant Networking (DTN) architecture is designed to provide communication in intermittently connected networks by moving messages towards destination via 'store, carry and forward' technique that supports multi-routing algorithms to acquire best path towards destination. In this paper, we propose the use of probabilistic routing in DTN architecture using the concept of History of Encounters. We compared the new approach, History of Encounters Probabilistic Routing Algorithm (HEPRA) to the common DTN-based protocols. We have used the Opportunistic Network Environment (ONE) simulator as a simulation tool. We demonstrate the ability of HEPRA to accomplish good quality performance than the other common existing Protocols.

关键词： Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：