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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,163 篇 会议
71 篇 期刊文献
65 册 图书

馆藏范围

3,298 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

2,338 篇 工学
- 2,058 篇 计算机科学与技术...
- 1,036 篇 软件工程
- 414 篇 电气工程
- 326 篇 信息与通信工程
- 309 篇 电子科学与技术（可...
- 112 篇 控制科学与工程
- 69 篇 机械工程
- 67 篇 光学工程
- 67 篇 生物工程
- 62 篇 生物医学工程（可授...
- 35 篇 动力工程及工程热...
- 33 篇 仪器科学与技术
- 32 篇 建筑学
- 30 篇 材料科学与工程（可...
- 29 篇 化学工程与技术
- 25 篇 土木工程
- 21 篇 力学（可授工学、理...
722 篇 理学
- 483 篇 数学
- 174 篇 物理学
- 80 篇 生物学
- 65 篇 系统科学
- 60 篇 统计学（可授理学、...
- 36 篇 化学
246 篇 管理学
- 158 篇 管理科学与工程(可...
- 102 篇 图书情报与档案管...
- 70 篇 工商管理
62 篇 医学
- 53 篇 临床医学
- 21 篇 基础医学(可授医学...
22 篇 农学
- 19 篇 作物学
21 篇 法学
- 19 篇 社会学
15 篇 经济学
12 篇 文学
11 篇 教育学
4 篇 军事学

主题

327 篇 parallel process...
204 篇 graphics process...
202 篇 computer archite...
156 篇 parallel archite...
136 篇 parallel process...
123 篇 parallel algorit...
121 篇 graphics process...
115 篇 hardware
113 篇 image processing
86 篇 concurrent compu...
86 篇 computational mo...
77 篇 signal processin...
72 篇 parallel program...
72 篇 field programmab...
69 篇 multicore proces...
68 篇 instruction sets
67 篇 parallel computi...
65 篇 algorithm design...
60 篇 gpu
59 篇 throughput

机构

9 篇 college of compu...
9 篇 natl univ def te...
8 篇 carleton univ sc...
8 篇 national laborat...
6 篇 hosei univ dept ...
6 篇 inria rennes
6 篇 st francis xavie...
5 篇 chinese acad sci...
5 篇 univ aizu dept c...
5 篇 polish japanese ...
5 篇 computer science...
5 篇 college of compu...
5 篇 city university ...
4 篇 shanghai jiao to...
4 篇 charles univ pra...
4 篇 rwth aachen univ...
4 篇 hainan internati...
4 篇 department of co...
4 篇 university of ch...
4 篇 universidad carl...

作者

11 篇 jack dongarra
10 篇 roman wyrzykowsk...
8 篇 dongarra jack
7 篇 liu jie
7 篇 konrad karczewsk...
7 篇 quintana-orti en...
6 篇 hannig frank
6 篇 li dongsheng
6 篇 teich juergen
6 篇 li chao
6 篇 nakano koji
6 篇 peng shietung
6 篇 li yamin
6 篇 chu wanming
6 篇 krulis martin
5 篇 zhang lei
5 篇 ito yasuaki
5 篇 li kenli
5 篇 wanlei zhou
5 篇 tudruj marek

语言

3,188 篇 英文
99 篇 其他
19 篇 中文

检索条件"任意字段=5th International Conference on Algorithms and Architectures for Parallel Processing"

共 3299 条记录，以下是2041-2050 订阅

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

详细简洁

排序：

Mapping OpenMP Concepts to the Stream Programming Model

Mapping OpenMP Concepts to the Stream Programming Model

引用

the 5th international conference on Computer Science & Education(第五届国际计算机新技术与教育学术研讨会 ICCSE'10)

作者： Tao Tang Yisong Lin Xiaoguang Ren National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

OpenMP is a widely used parallel programming model on traditional multi-core processors. Generally, OpenMP is used to develop fine-grained parallelism through a multithread model. Stream programming model is a new kind of parallel programming model for stream architectures. OpenMP bears a resemblance to the stream programming model at some level. the transformation between the two models has attracted much attention from the research community, since it is the foundation of porting programs between the two architectures. Most related researches focus on the efficiency of porting existing parallel programs to the new architectures such as GPUs. Very few of these studies, however, focus on the portative problem systematically, namely, what kind of parallel programs can be or should be transplanted into stream programs and mapped to run on the stream processors. In this paper, we study the mapping relationship of parallel mechanism in OpenMP to the stream programming model, and point out those parallel mechanisms in OpenMP that are infeasible or undesirable for stream programs. By analyzing two typical benchmarks, we draw the conclusion that a majority of scientific applications are suitable to be mapped to the stream programming model. Our conclusion effectively validates the idea of accelerating scientific applications with the stream processors.

关键词： OpenMP:stream programming model:parallel mechanism:mapping

来源：评论

学校读者我要写书评

暂无评论

PGP-mc: Towards a Multicore parallel Approach for Mining Gradual Patterns

PGP-mc: Towards a Multicore Parallel Approach for Mining Gra...

引用

15th international conference on Database Systems for Advanced Applications

作者： Laurent, Anne Negrevergne, Benjamin Sicard, Nicolas Termier, Alexandre UM2 LIRMM CNRS UMR 5506 161 Rue Ada F-34392 Montpellier 5 France UJF LIG CNRS UMR 5217 F-38402 St Martin Dheres France LRIE EFREI F-94800 Villejuif France

ISBN: (纸本)9783642120251

Gradual patterns highlight complex order correlations of the form "the more/less X. the more/less Y". Only recently algorithms have appeared to mine efficiently gradual rules. However, due to the complexity of milling gradual rules, these algorithms cannot yet scale on huge real world datasets. hi this paper, we propose to exploit parallelism in order to enhance the performances of the fastest existing one (GRITE). through a detailed experimental study, we show that our parallel algorithm scales very well with the number of cores available.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Towards parallel access of multi-dimensional, multi-resolution scientific data

Towards parallel access of multi-dimensional, multi-resoluti...

引用

2010 5th Petascale Data Storage Workshop, PDSW'10, Held in Conjunction with SC'10 - the international conference for High Performance Computing, Networking, Storage and Analysis

作者： Kumar, Sidharth Pascucci, Valerio Vishwanath, Venkatram Carns, Philip Hereld, Mark Latham, Robert Peterka, Tom Papka, Michael E. Ross, Robert SCI Institute University of Utah Salt Lake City UT United States Argonne National Laboratory Argonne IL United States

ISBN: (纸本)9781424489121

Large-scale scientific simulations routinely produce data of increasing resolution. Analyzing this data is key to scientific discovery. A critical bottleneck facing data analysis is the I/O time to access the data due to the disparity between a simulation's data layout and the data layout requirements of analysis applications. One method of addressing this problem is to reorganize the data in a manner that makes it more amenable to analysis and visualization. the IDX file format is one example of this approach. It orders data points so that they can be accessed at multiple resolution levels with favorable spatial locality and caching properties. IDX has been used successfully in fields such as digital photography and visualization of large scientific data, and is a promising approach for analysis of HPC data. Unfortunately, the existing tools for writing data in this format only provide a serial interface. HPC applications must therefore either write all data from a single process or convert existing data as a post-processing step, in either case failing to utilize available parallel I/O resources. In this work, we provide an overview of the IDX file format and the existing ViSUS library that provides serial access to IDX data. We investigate methods for writing IDX data in parallel and demonstrate that it is possible for HPC applications to write data directly into IDX format with scalable performance. Our preliminary results demonstrate 60% of the peak I/O throughput when reorganizing and writing the data from 512 processes on an IBM BG/P system. We also analyze the performance bottlenecks and propose future work towards a flexible and efficient implementation. ©2010 IEEE.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

parallel numerical solver for modelling of electromagnetic properties of thin conductive layers

Parallel numerical solver for modelling of electromagnetic p...

引用

8th international conference on parallel processing and Applied Mathematics, PPAM 2009

作者： Čiegis, Raimondas Kancleris, Žilvinas Šlekas, Gediminas Vilnius Gediminas Technical University Sauletekio al. 11 Vilnius LT10223 Lithuania Semiconductor Physics Institute A. Goštauto 11 Vilnius LT01108 Lithuania

ISBN: (纸本)3642144020

In this paper we develop the parallel numerical algorithm for modelling of electromagnetic properties of thin conductive layers. the explicit finite difference scheme is obtained after approximation of the system of differential equations on the staggered grid. the parallelization of the discrete algorithm is based on the domain decomposition method. the tool of parallel linear algebra objects ParSol is used to get a semiautomatical implementation of this parallel algorithm on distributed memory computers. Some results of numerical simulations are presented and the efficiency of the proposed parallel algorithm is investigated. © 2010 Springer-Verlag Berlin Heidelberg.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Reliability analysis of declustered-parity RAID 6 with disk scrubbing and considering Irrecoverable Read Errors

Reliability analysis of declustered-parity RAID 6 with disk ...

引用

5th IEEE international conference on Networking, Architecture and Storage, NAS 2010

作者： Gao, Yan Meister, Dirk Brinkmann, André University of Paderborn Paderborn Center for Parallel Computing Fuerstenallee 11 33102 Paderborn Germany

ISBN: (纸本)9780769541341

We investigate the impact of Irrecoverable Read Errors (IREs) on Mean Time To Data Loss (MTTDL) of declustered-parity RAID 6 systems. By extending the analytic model to study the reliability of RAID 5 systems from [1] we obtain the MTTDL which mainly takes into account two types of data loss: data loss caused by three independent disk failures, and data loss due to a detected IRE during the rebuild after two disks failed. Furthermore we improve the analysis by also considering disk scrubbing to reduce the probability of IREs via periodically reading the data stored on a disk. the results of our numerical analysis show that IREs have a large effect on the MTTDL. the countermeasure is to increase the disk scrubbing rate. As an example, the MTTDL of a system where each disk is scrubbed everyday increases by a factor of at least 27 compared to that of a system with a scrubbing rate of once a year. In addition, declustered-parity RAID 6 system improves the reliability of standard non-declustered RAID 6 systems. For example, a declustered-parity RAID 6 system without disk scrubbing improves the MTTDLs by a factor at least 150 compared to that of a standard system where each disk is scrubbed everyday. © 2010 IEEE.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

Complex event processing over uncertain data streams

Complex event processing over uncertain data streams

引用

5th international conference on P2P, parallel, Grid, Cloud and Internet Computing, 3PGCIC 2010

作者： Kawashima, Hideyuki Kitagawa, Hiroyuki Li, Xin Graduate School of Systems and Information Engineering University of Tsukuba Tsukuba Japan National Institute for Environmental Studies Tsukuba Japan

ISBN: (纸本)9780769542379

Pattern matching over event streams is well developed. However, with the increasing demand of measurement accuracy, confidence of more complex events sourced from original, continuously arriving events generated from sensor kind electronic devices is becoming more and more been concerned. Actually, some applications such as RFID-based supply chain management and monitoring in health care require data stream with high reliability, but current hardware and wireless communication techniques cannot support 100% confident data, one stream processing engine which can report confidence for processed complex events over uncertain data is needed. In this paper, we propose an optimized method to not only calculate the probability of outputs of compound events but also obtain the value of confidence of the complex pattern given by user against uncertain raw input data stream generated by distrustful network devices. Our proposal is based on an existing stream processing engine SASE+, and we extend its evaluation model NFAb automaton to a new type of automaton in order to manage the runtime against probabilistic stream. In the design of automaton, we consider optimizations to reduce the computation cost and response time to a realistic degree with long sliding time window. © 2010 IEEE.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 2010 IEEE international conference on Networking, Architecture and Storage, NAS 2010

Proceedings - 2010 IEEE International Conference on Networki...

引用

5th IEEE international conference on Networking, Architecture and Storage, NAS 2010

ISBN: (纸本)9780769541341

the proceedings contain 57 papers. the topics discussed include: label-based DV-Hop localization against wormhole attacks in wireless sensor networks;a simple group key management approach for mobile ad hoc networks;a fine-grained data reconstruction algorithm for solid-state disks;a distributed approach for hidden wormhole detection with neighborhood information;a high effective indexing and retrieval method providing block-level timely recovery to any point-in-time;characterizing the dependability of distributed storage systems using a two-layer hidden Markov model-based approach;fault tolerant data collection in heterogeneous intelligent monitoring networks;a probabilistic routing protocol for heterogeneous sensor networks;time-bounded essential localization for wireless sensor networks;stabilizing path modification of power-aware on/off interconnection networks;and fast and memory-efficient traffic classification with deep packet inspection in CMP architecture.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel implementation of 2D Daubechies - D4 transform in a cluster

Parallel implementation of 2D Daubechies - D4 transform in a...

引用

international conference on Computer Sciences and Convergence Information Technology (ICCIT)

作者： Jaumin Ajdari Fatmir Hoxha Faculty of Contemporary Science and Technologies South East European University in Tetovo Macedonia University of Tirana Albania

Wavelet transform is an important mathematical tool with strong application in signal processing. From the mathematical point of view many different wavelet transforms are developed, where orthogonal wavelet transforms are more important. Also, various algorithms for their computations are developed. In this paper we present the parallel implementation of the orthogonal wavelet transform named Daubechies D4 transform, which consists of four taps filters. At the beginning, a short mathematical introduction of the Daubechies D4 transform is presented. After that the sequential and parallel algorithm implementations are analyzed. A parallel implementation for the PC cluster environment is done. We have analyzed two ways of parallel implementation, one with row mapping and the other with block mapping (mesh architecture of the processing elements). For practical implementation the C++ programming language and MPI paradigm (for parallel environment) are used. Finally, the mathematical complexity of these implementations is presented. In particular, we have analyzed separately the complexity of computations and communications. It is shown, also, that the complexity is between O(log 2 n) and O(n 2 / p). At the end, a comparison of sequential and parallel implementations is presented according to the results obtained by testing the practical implementations.

关键词： Complexity theory Wavelet transforms Computer architecture Filtering algorithms Clustering algorithms Wavelet domain

来源：评论

学校读者我要写书评

暂无评论

Soft-core reduction methodology for SIMD architecture: OPENRISC case study

Soft-core reduction methodology for SIMD architecture: OPENR...

引用

international Design and Test Workshop

作者： Bouthaina Dammak Mouna Baklouti Mohamed Abid CESlab ENIS school Sfax University Sfax Tunisia

Multi-Processor Systems on Chip (MPSoCs) have been proposed as a promising solution for the increasing demand of computational power required for recent application. the parallelization through SIMD (single instruction/multiple data) architectures has been a proven solution to speed up the processing of the recent application that exhibit massive amounts of data parallelism. the level of parallelism impacts the SIMD architecture performance and it is closely related to the design of the processing element. In this context this paper presents a new design methodology of designing processing element for SIMD architecture. the scope of this work is to reduce the pipeline stages of the soft-core processor to reduce the size of the PEs and so that to built up a high level parallelism architecture.

关键词： Arrays Pipelines Field programmable gate arrays Random access memory System-on-a-chip parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel Performance Evaluation of MIC(0) Preconditioning Algorithm for Voxel μFE Simulation

Parallel Performance Evaluation of MIC(0) Preconditioning Al...

引用

8th international conference, PPAM 2009

作者： Lirkov, Ivan Vutov, Yavor Paprzycki, Marcin Ganzha, Maria Bulgarian Acad Sci Inst Parallel Proc Acad G Bonchev Bl 25A BU-1113 Sofia Bulgaria Polish Acad Sci Syst Res Inst PL-01447 Warsaw Poland

ISBN: (纸本)9783642144028

Numerical homogenization is used for up-scaling of a linear elasticity tensor of strongly heterogeneous micro-structures Utilized approach assumes presence of a periodic micro-structure and thus periodic boundary conditions Rotated trilinear Rannacher-Turek finite elements are used for the discretization while a parallel PCG method is used to solve arising large-scale systems with sparse, symmetric, positive semidefinite matrices Applied preconditioner is based on modified incomplete Cholesky factorization MIC(0) the test problem represents a trabecular bone tissue, and takes into account only the elastic response of the solid phase the voxel micro-structure of the bone is extracted from a high resolution computer tomography image Numerical tests performed on parallel computers demonstrate the efficiency of the developed algorithm

关键词： micro finite element simulation modeling of human bone tissue parallel algorithms PCG method preconditioner MIC(0) factorization parallel performance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共330页 << < 201 202 203 204 205 206 207 208 209 210 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：