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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

5,675 篇 会议
3,457 篇 期刊文献
42 篇 学位论文
4 册 图书
1 篇 资讯

馆藏范围

9,179 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

5,484 篇 工学
- 4,478 篇 计算机科学与技术...
- 1,617 篇 软件工程
- 1,420 篇 电气工程
- 448 篇 信息与通信工程
- 296 篇 控制科学与工程
- 268 篇 电子科学与技术（可...
- 94 篇 仪器科学与技术
- 75 篇 机械工程
- 74 篇 力学（可授工学、理...
- 63 篇 动力工程及工程热...
- 63 篇 化学工程与技术
- 61 篇 生物工程
- 55 篇 生物医学工程（可授...
- 51 篇 农业工程
- 45 篇 材料科学与工程（可...
- 44 篇 土木工程
- 40 篇 光学工程
- 30 篇 建筑学
2,405 篇 理学
- 1,984 篇 数学
- 312 篇 物理学
- 149 篇 统计学（可授理学、...
- 113 篇 系统科学
- 97 篇 生物学
- 89 篇 化学
508 篇 管理学
- 391 篇 管理科学与工程(可...
- 124 篇 图书情报与档案管...
- 77 篇 工商管理
81 篇 医学
- 58 篇 临床医学
68 篇 农学
- 62 篇 作物学
35 篇 经济学
- 33 篇 应用经济学
28 篇 法学
13 篇 文学
7 篇 教育学
5 篇 艺术学
4 篇 军事学

主题

9,179 篇 parallel algorit...
1,158 篇 concurrent compu...
847 篇 algorithm design...
672 篇 parallel process...
616 篇 computer science
460 篇 computational mo...
374 篇 computer archite...
289 篇 phase change ran...
233 篇 application soft...
224 篇 parallel archite...
215 篇 hypercubes
200 篇 very large scale...
198 篇 costs
196 篇 parallel program...
176 篇 sorting
175 篇 scalability
165 篇 hardware
152 篇 data mining
147 篇 routing
144 篇 clustering algor...

机构

26 篇 carnegie mellon ...
19 篇 school of electr...
17 篇 department of co...
17 篇 ibm thomas j. wa...
16 篇 department of co...
15 篇 old dominion uni...
15 篇 hiroshima univ d...
13 篇 purdue univ dept...
13 篇 univ texas dept ...
12 篇 georgia inst tec...
12 篇 univ maryland de...
12 篇 old dominion uni...
12 篇 school of comput...
11 篇 swiss fed inst t...
11 篇 univ maryland co...
11 篇 univ maryland in...
10 篇 georgia inst tec...
10 篇 department of co...
10 篇 department of co...
10 篇 eth zurich

作者

35 篇 shun julian
33 篇 olariu s
30 篇 p. banerjee
30 篇 blelloch guy e.
26 篇 nakano koji
24 篇 bader david a.
18 篇 dhulipala laxman
18 篇 gu yan
17 篇 ito yasuaki
16 篇 schwing jl
15 篇 v. kumar
15 篇 khan maleq
14 篇 sun yihan
14 篇 shi-jinn horng
14 篇 vishkin uzi
13 篇 ballard grey
13 篇 takefuji y
13 篇 banerjee p
13 篇 han yj
12 篇 ramachandran v

语言

8,732 篇 英文
367 篇 其他
61 篇 中文
9 篇 俄文
4 篇 德文
3 篇 西班牙文
2 篇 法文

检索条件"主题词=parallel Algorithms"

共 9179 条记录，以下是4981-4990 订阅

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

详细简洁

排序：

The characterization of parallel real-time optimization problems

The characterization of parallel real-time optimization prob...

引用

IEEE International Symposium on High Performance Computing Systems and Applications (HPCS)

作者： S.D. Bruda S.G. Akl Department of Computing and Information Science Queen's University Kingston ONT Canada

We identify the class of optimization problem expressible as independence systems that can be solved in real time using a parallel machine with polynomially bounded resources as being exactly the class of matroid for which the size of the optimal solution can be computed in parallel real time. We also extend previous results, showing that the solution obtained by a parallel algorithm is arbitrarily better than the solution reported by a sequential one not only for the real-time minimum-weight spanning tree (as previously known). Indeed, we show that, for all practical purposes, such a property does in fact hold for any optimization problem that falls into the aforementioned class.

关键词： Real time systems Concurrent computing parallel machines Polynomials Computational modeling Time factors Information science parallel algorithms Distributed computing Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Experimental checking of fault susceptibility in a parallel algorithm

Experimental checking of fault susceptibility in a parallel ...

引用

International Conference on parallel Computing in Electrical Engineering (PARLEC)

作者： A. Derezinska J. Sosnowski Institute of Computer Sciene Warsaw University of Technology Warsaw Poland

We deal with the problem of analyzing fault susceptibility of a parallel algorithm designed for a multiprocessor array (MIMD structure). This algorithm realizes quite a complex communication protocol in the system. We present an original methodology of the analysis based on the use of a software implemented fault injector. The considered algorithm is modeled as a multithreaded application. The experiment set up and results are presented and commented. The performed experiments proved relatively high natural robustness of the analyzed algorithm and showed further possibilities of its improvement.

关键词： parallel algorithms parallel processing

来源：评论

学校读者我要写书评

暂无评论

Exploring load balancing in a scientific SPMD parallel application

Exploring load balancing in a scientific SPMD parallel appli...

引用

International Conference on parallel Processing Workshops (ICPPW)

作者： V. Thome D. Vianna R. Costa A. Plastino O.T. da Silveira Departamento de Ciência da Computação Universidade Federal Fluminense Niterói RJ Brasil Universidade Federal Fluminense Niteroi Rio de Janeiro BR Departamento de Ciencia da Computacao Univ. Fed. Fluminense Niteroi Brazil

We report the development of an SPMD parallel application which computes the macroscopic thermal dispersion in porous media. The performance of SPMD programs is strongly affected by dynamic load imbalancing factors. The use of a suitable load balancing algorithm is essential for overcoming the effects of these imbalancing factors. We developed nine versions of the SPMD application, each one adopting a different load balancing strategy. The main contribution of this work is the performance evaluation and comparison of these nine versions. The experimental results showed the importance of using an appropriate load balancing strategy for the characteristics of this scientific parallel application.

关键词： Load management Concurrent computing parallel programming parallel processing Computer applications parallel algorithms Algorithm design and analysis Thermal loading Debugging Conferences

来源：评论

学校读者我要写书评

暂无评论

The improved CGS method for large and sparse linear systems on bulk synchronous parallel architectures

The improved CGS method for large and sparse linear systems ...

引用

IEEE International Conference on algorithms and Architectures for parallel Processing (ICAP)

作者： L.T. Yang Department of Computer Science Saint Francis Xavier University Antigonish NS Canada

We propose an improved version of the conjugate gradient squared (CGS) method for the solutions of large and sparse linear systems of equations with unsymmetric coefficient matrices. The proposed method combines elements of numerical stability and parallel algorithm design without increasing computational costs. The algorithm is derived such that all matrix-vector multiplication, inner products and vector updates of a single iteration step are independent and the communication time required for inner product can be overlapped efficiently with the computation time of vector updates. Therefore, the cost of global communication which represents the bottleneck of the performance can be significantly reduced. In this paper, the bulk synchronous parallel model is used to design a fully efficient, scalable and portable parallel proposed algorithm and to provide accurate performance prediction of the algorithm for a wide range of architectures including the Cray T3D, the Parsytec, and a cluster of workstations connected by an Ethernet. This performance model uses only a few system dependent parameters based on a simple and accurate cost modelling to provide useful insight in the time complexity of the method. The theoretical performance prediction are compared with some preliminary measured timing results of a numerical application from the ocean flow simulation.

关键词： Linear systems parallel architectures Sparse matrices Algorithm design and analysis Costs Predictive models Clustering algorithms Equations Numerical stability parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Topology and migration policy of fine-grained parallel evolutionary algorithms for numerical optimization

Topology and migration policy of fine-grained parallel evolu...

引用

Congress on Evolutionary Computation

作者： Chi-Ho Lee Sang-Ho Park Jong-Hwan Kim Department of Electrical Engineering Korea Advanced Institute of Science and Technology Taejon South Korea

This paper proposes a complete binary tree topology and two efficient migration methods in fine-grained parallel evolutionary algorithms (FGPEAs) to solve constrained numerical optimization problems. The design of effective evolutionary algorithms (EAs) is to obtain a proper balance between exploration and exploitation. The balance can be controlled by the spread rate and the migration of the best individuals. A complete binary tree topology, which slows down the spread rate, is used for exploration to solve the heavily constrained problems. Two migration methods are also employed to prevent a superior individual from taking almost all the subpopulations and to facilitate the possibility of global search. One is the restriction of migration according to the migration times and the other is the modified individual migration by the mutation operators. The simulation results indicate that FGPEA using the proposed migration methods has better performance in constrained numerical optimization problems, and the FGPEA with the tree topology and the proposed migration methods shows good performance on heavily constrained numerical optimization problems.

关键词： Topology Evolutionary computation Constraint optimization Binary trees Genetic mutations Optimization methods Computer architecture parallel processing parallel algorithms Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Deleting keys of B-trees in parallel

Deleting keys of B-trees in parallel

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： Heejin Park Kunsoo Park Yookun Cho School of Computer Science and Engineering Seoul National University Seoul South Korea

ISBN: (纸本)0769515738

The B-tree is a fundamental data structure that is used to access and update a large number of keys. In this paper we present a parallel algorithm on the EREW PRAM that deletes keys in a B-tree. Our algorithm runs in O(t(log k+log, n)) time with k processors, where n is the number of keys in the B-tree, t is the minimum degree of the B-tree, and k is the number of unsorted keys to delete, and it improves upon the previous algorithm by a factor of t.

关键词： Phase change random access memory Dictionaries Pipeline processing parallel algorithms Computer science Data engineering Data structures Distributed processing

来源：评论

学校读者我要写书评

暂无评论

PoLABACK: parallel factorization algorithms with algorithmic blocking

PoLABACK: parallel factorization algorithms with algorithmic...

引用

International Conference on High Performance Computing in the Asia-Pacific Region

作者： Jaeyoung Choi School of Computing Soongsil University Seoul South Korea

ISBN: (纸本)0769505892

Since parallel computers have different performance ratios of computation and communication, the optimal computational block sizes are different from one another to generate the maximum performance of an algorithm. Too small or large a block size makes getting good performance on a machine nearly impossible. In such a case, getting a better performance may require a complete redistribution of the data matrix. We present PoLAPACK factorization routines, including LU, QR, and Cholesky factorizations, with an "algorithmic blocking" on 2-dimensional block cyclic data distribution. With the algorithmic blocking, it is possible to obtain the near optimal performance irrespective of the physical block size. The routines are implemented on the SGI/Cray T3E and compared with the corresponding ScaLAPACK factorization routines.

关键词： Concurrent computing Distributed computing Linear algebra Scalability Physics computing parallel algorithms Libraries Runtime

来源：评论

学校读者我要写书评

暂无评论

The waveform ICGS technique for parallel transient simulation of semiconductor devices

The waveform ICGS technique for parallel transient simulatio...

引用

IEEE International Symposium on High Performance Computing Systems and Applications (HPCS)

作者： L.T. Yang Department of Computer Science Saint Francis Xavier University Antigonish NS Canada

In this paper, the parallelization aspects of the accelerated waveform relaxation algorithms for the transient simulation of semiconductor devices on parallel distributed memory computers are studied. These methods are competitive with standard pointwise methods on serial architectures, but are significantly faster on parallel computers. We make use of an improved parallel version of the conjugate gradient squared method (ICGS) combining elements of numerical stability and parallel algorithm design, for solving the resulting sequence of time-varying sparse linear differential-algebraic initial-value problems arising at each linearization step with waveform Newton. We reorganize the algorithm such that all the inner products, matrix-vector multiplications and vector updates of a single iteration step are independent and communication time required for inner product can be overlapped efficiently with computation time of vector updates. Therefore, the bottleneck of the performance, namely the cost of global communication on parallel distributed memory computers can be significantly reduced. The resulting ICGS algorithm maintains the favorable properties of the original algorithm while not increasing the computational costs.

关键词： Semiconductor devices Concurrent computing Computational modeling Distributed computing Vectors Acceleration Computer simulation Computer architecture Numerical stability parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

A parallel Smith-Waterman algorithm based on divide and conquer

A parallel Smith-Waterman algorithm based on divide and conq...

引用

IEEE International Conference on algorithms and Architectures for parallel Processing (ICAP)

作者： Fa Zhang Xiang-Zhen Qiao Zhi-Yong Liu Chinese Academy of Sciences Institute for Computing Technology Beijing China National Natural Science Foundation Beijing China

ISBN: (纸本)0769515126

Biological sequence comparison is an important tool for researchers in molecular biology. There are several algorithms for sequence comparison. The Smith-Waterman algorithm, based on dynamic programming, is one of the most fundamental algorithms in bioinformatics. However, the existing parallel Smith-Waterman algorithm needs large memory space. As the data of biological sequences expand rapidly, the memory requirement of the existing parallel Smith-Waterman algorithm has becoming a critical problem. For resolving this problem, we develop a new parallel Smith-Waterman algorithm using the method of divide and conquer, named PSW-DC. Memory space required in the new parallel algorithm is reduced significantly in comparison with existing ones. A key technique, named the C&E method, is developed for implementation of the new parallel Smith-Waterman algorithm.

关键词： Dynamic programming Sequences Biology computing Heuristic algorithms Databases Data analysis parallel algorithms High performance computing Concurrent computing Computers

来源：评论

学校读者我要写书评

暂无评论

parallel procedures for ROI identification in endoscopic images

Parallel procedures for ROI identification in endoscopic ima...

引用

International Conference on parallel Computing in Electrical Engineering (PARLEC)

作者： J. Saif H. Krawczyk Electronics Telecommunication and Informatics Faculty Gdansk University of Technology Gdansk Poland

The region of interest (ROI) matching problem is defined and its application to endoscopic diagnosis is shown. Two kinds of matching procedures are considered: random search and simulation annealing ones. The suitable... 详细信息

关键词： parallel algorithms Image matching Pixel Diseases Simulated annealing Biomedical imaging Informatics Computer architecture Application software Computational modeling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 491 492 493 494 495 496 497 498 499 500 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：