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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,157 篇 会议
72 篇 期刊文献
65 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

327 篇 parallel process...
204 篇 graphics process...
203 篇 computer archite...
157 篇 parallel archite...
136 篇 parallel process...
123 篇 parallel algorit...
121 篇 graphics process...
115 篇 hardware
113 篇 image processing
86 篇 concurrent compu...
86 篇 computational mo...
76 篇 signal processin...
72 篇 parallel program...
71 篇 field programmab...
68 篇 instruction sets
68 篇 multicore proces...
67 篇 parallel computi...
65 篇 algorithm design...
58 篇 throughput
57 篇 gpu

机构

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,230 篇 英文
53 篇 其他
15 篇 中文

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

共 3294 条记录，以下是3021-3030 订阅

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

详细简洁

排序：

A numeric weather prediction model for the IBM SP2 parallel computer

A numeric weather prediction model for the IBM SP2 parallel ...

引用

IEEE international conference on algorithms and architectures for parallel processing (ICAP)

作者： G.R. Wightwick L.M. Leslie S.F. Wail IBM Australia Science & Technology School of Mathematics University of New South Wales Australian Computing & Communications Institute

A limited-area numeric weather prediction model specifically targeted for parallel computers has been successfully implemented an an IBM SP2 distributed-memory parallel computer. the model employs an explicit finite-difference scheme and was parallelised using a simple domain decomposition technique. On a twelve processor SP2, a 24 hour forecast using archived operational data and including a sophisticated representation of physical processes was run at a range of resolutions between 150 km and 19 km and near-linear speedups were achieved. Major weather centres have indicated a requirement for regional prediction models to be run at resolutions of approximately 5 km by the end of the decade. Based on this work, it appears that this target can be achieved through the use of scalable parallel computers.< >

关键词： Weather forecasting Predictive models Numerical models Concurrent computing Distributed computing Reduced instruction set computing Supercomputers Workstations Mathematical model Power system modeling

来源：评论

学校读者我要写书评

暂无评论

A highly parallel algorithm to approximate MaxCut on distributed memory architectures

A highly parallel algorithm to approximate MaxCut on distrib...

引用

international Symposium on parallel processing

作者： S. Homer M. Peinado Department of Computer Science and Center for Computational Science Boston University Boston MA USA

We develop and experiment with a new parallel algorithm to approximate the maximum weight cut in a weighted undirected graph. Our implementation is based on the recent new algorithm of Goemans and Williamson for this problem. However, our work aims for an efficient, practical formulation of the algorithm with close to optimal parallelization. Our theoretical analysis and an implementation on the Connection Machine CM5 show that our parallelization achieves linear speedup. We test our implementation on several large graphs (more than 9000 vertices), particularly on large instances of the Ising model.< >

关键词： parallel algorithms Memory architecture Algorithm design and analysis Clustering algorithms Testing Physics Greedy algorithms Computer science NP-complete problem parallel machines

来源：评论

学校读者我要写书评

暂无评论

Efficient barriers for distributed shared memory computers

Efficient barriers for distributed shared memory computers

引用

Proceedings of the 8th international parallel processing Symposium

作者： Grunwald, Dirk Vajracharya, Suvas Univ of Colorado Boulder United States

ISBN: (纸本)0818656026

Barrier algorithms are central to the performance of numerous algorithms on scalable, high-performance architectures. Numerous barrier algorithms have been suggested and studied for Non-Uniform Memory Access (NUMA) architectures, but less work has been done for Cache Only Memory Access (COMA) or attraction memory [1] architectures such as the KSR-1. In this paper, we presented two new barrier algorithms that offer the best performance we have recorded on the KSR-1 distributed cache multiprocessor. We discuss the trade-offs and the performance of seven algorithms on two architectures. the new barrier algorithms adapt well to a hierarchical caching memory model and take advantage of parallel communication offered by most multiprocessor interconnection networks,. Performance results are shown for a 256-processor KSR-1 and a 20-processor Sequent Symmetry.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

parallelIZATION OF COMPUTER VISION algorithms ON A RECONFIGURABLE MULTIPROCESSOR 12

PARALLELIZATION OF COMPUTER VISION ALGORITHMS ON A RECONFIGU...

引用

conference C on Signal processing and conference D on parallel Computing, at the 12th IAPR international conference on Pattern Recognition

作者： BHANDARKAR, SM ARABNIA, HR UNIV GEORGIA DEPT COMP SCIATHENSGA 30602

ISBN: (纸本)0818662751

A novel reconfigurable architecture based on a Multi-Ring Multiprocessor Network is described. the reconfigurable architecture is shown to combine low network diameter with a low degree of connectivity for each node in the network. the mathematical properties of the network topology and the hardware for the reconfiguration switch are described. Primitive parallel operations on the network topology are described and analyzed. A large class of algorithms for the Boolean n-cube and the 2-D mesh is shown to map efficiently on the proposed architecture without loss of performance. the architecture is shown to be well suited for a number of problems in computer vision. © 1994 IEEE.

关键词： Reconfigurable architectures

来源：评论

学校读者我要写书评

暂无评论

LOW LEVEL IMAGE processing OPERATORS ON FPGA - IMPLEMENTATION EXAMPLES AND PERFORMANCE EVALUATION 12

LOW LEVEL IMAGE PROCESSING OPERATORS ON FPGA - IMPLEMENTATIO...

引用

conference C on Signal processing and conference D on parallel Computing, at the 12th IAPR international conference on Pattern Recognition

作者： DEBARROS, MA AKIL, M LAB IAAI ESIEE GRPF-93162 NOISY LE GRANDFRANCE

ISBN: (纸本)0818662751

this work deals with evaluation of hardware implementations of image processing algorithms for real time applications, using SRAM based Field Programmable Gate Arrays. We discuss a generic architectural model adapted to this domain and to the technology characteristics. A method to evaluate the area costs and timing performances of architectures implemented on such a model is presented. A feasibility study of a pre-processing chain in an image-recognition system is presented. © 1994 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

SURVEY OF parallel algorithms FOR STRUCTURAL PATTERN MATCHING 12

SURVEY OF PARALLEL ALGORITHMS FOR STRUCTURAL PATTERN MATCHIN...

引用

conference C on Signal processing and conference D on parallel Computing, at the 12th IAPR international conference on Pattern Recognition

作者： GUERRA, C UNIV PADUA DIPARTIMENTO ELETTR & INFORMATI-35100 PADUAITALY

ISBN: (纸本)0818662751

Matching is an important pari of a model-based object recognition system. Matching is a difficult task, for a number of reasons. First, in a number of recognition systems matching is formulated as a combinatorial problem with exponential worst-case complexity. thus, heuristics are needed to reduce the complexity by pruning the search space. Second, images do not present perfect data: noise and occlusion greatly complicate the task. Finally, even at moderate image resolutions the amount of data to be handled is such that this task cannot be done in real-time on supercomputers. Although no existing visual system can solve the general recognition problem, some existing approaches have obtained acceptable results for limited domains or simple scenes. Surveys of many sequential approaches to matching in recognition systems can be found in [2], [7], [18]. Comparatively, much less work has been done on parallel matching, despite the great need for speeding up the process. parallel algorithms have oflen to be designed from scratch, and the recognition problem itself oflen requires reformulation since many of the proposed sequential algorithms do not lend themselves naturally to efficient parallel implementations. In this paper, we survey some of the existing parallel matching algorithms for 2D and 3D objects. Some of these algorithms have been implemented on SIMD architectures such as the Connection Machine or MasPar, or MIMD machines such as the Intel Touchstone Delta;other algorithms have been developed for the PRAM model of computation. © 1994 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

CONTRIBUTION OF thE POLARIZATION DIVERSITY IN HF DIRECTION FINDING SYSTEMS

CONTRIBUTION OF THE POLARIZATION DIVERSITY IN HF DIRECTION F...

引用

5th SPIE conference on Advanced Signal processing - algorithms, architectures, and Implementations

作者： ERHEL, Y EDJEOU, A BERTEL, L CTR RECH ECOLES COETQUIDAN F-56381 GUERFRANCE

ISBN: (纸本)0819416207

the aim of the paper is to estimate the contribution of the polarization diversity in high frequency (3 - 30 MHz) direction finding systems. We first describe the peculiarities of H.F. propagation and the resulting signal model involved in computer simulations. Next, we analyze the behavior of some particular direction finding systems using linear and circular geometries and polarization diversity. Some algorithms (non linear frequential analysis, M.U.S.I.C.) are tested in several conditions (narrowband or broadband signals, polarization filtering reiterated or no, sub-sampling). theoretical and experimental results show that polarization diversity based upon the knowledge of the antenna complex responses improves greatly the efficiency of direction finding.

关键词： DIRECTION FINDING POLARIZATION ARRAY processing HIGH RESOLUTION algorithms HF PROPAGATION

来源：评论

学校读者我要写书评

暂无评论

Communication and computation patterns of large scale image convolutions on parallel architectures

Communication and computation patterns of large scale image ...

引用

Proceedings of the 8th international parallel processing Symposium

作者： Dykes, Sandra G. Zhang, Xiaodong Zhou, Yan Yang, Haixu The Univ of Texas at San Antonio San Antonio United States

ISBN: (纸本)0818656026

Segmentation and other image processing operations rely on convolution calculations with heavy computational and memory access demands. this paper presents an analysis of a texture segmentation application containing a 96x96 convolution. Sequential execution required several hours on single processors systems with over 99% of the time spent performing the large convolution. 70% to 75% of execution time is attributable to cache misses within the convolution. We implemented the same application on CM-5, iPSC/860 and PVM distributed memory multicomputers, tailoring the parallel algorithms to each machine's architectures. parallelization significantly reduced execution time, taking 49 second on a 512 node CM-5 and 6.5 minutes on a 32 node iPSC/860.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

DESIGN OF A MIMD NEURAL-NETWORK PROCESSOR 5

DESIGN OF A MIMD NEURAL-NETWORK PROCESSOR

引用

5th international conference on Applications of Artificial Neural Networks

作者： SAEKS, RE PRIDDY, KL PAP, RM STOWELL, S ACCURATE AUTOMAT CORP CHATTANOOGATN 37421

ISBN: (纸本)0819415472

the Accurate Automation Corporation (AAC) neural network processor (NNP) module is a fully programmable multiple instruction multiple data (MIMD) parallel processor optimized for the implementation of neural networks. the AAC NNP design fully exploits the intrinsic sparseness of neural network topologies. Moreover, by using a MIMD parallel processing architecture one can update multiple neurons in parallel with efficiency approaching 100 percent as the size of the network increases. Each AAC NNP module has 8 K neurons and 32 K interconnections and is capable of 140,000,000 connections per second with an eight processor array capable of over one billion connections per second.

关键词： Neurons Neural networks parallel processing Data processing Network architectures Clocks Array processing Computer architecture Fermium parallel computing

来源：评论

学校读者我要写书评

暂无评论

ProperPLACE: a portable parallel algorithm for standard cell placement

ProperPLACE: a portable parallel algorithm for standard cell...

引用

Proceedings of the 8th international parallel processing Symposium

作者： Kim, Sungho Chandy, John A. Parkes, Steven Ramkumar, Balkrishna Banerjee, Prithviraj LSI Logic Corp Milpitas United States

ISBN: (纸本)0818656026

parallel algorithms developed for CAD problems today suffer from three important drawbacks. first, they are machine specific and tend to perform poorly on architectures other than the one for which they were designed. Second, they cannot use the latest advances in improved versions of the sequential algorithms for solving the problem. third, the quality of results degrade significantly during parallel execution. In this paper we address these three problems for an important CAD application: standard cell placement. We have developed a new parallel placement algorithm that is portable across a range of MIMD parallel architectures. the algorithm is part of the ProperCAD project which allows the development and implementation of a parallel algorithm such that it can be executed on a wide variety of parallel machines without any change to the source. the parallel placement algorithm is based on an existing implementation of the sequential simulated annealing algorithm, TimberWolfSC 6.0 [1].

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共330页 << < 299 300 301 302 303 304 305 306 307 308 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：