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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,672 篇 会议
3,456 篇 期刊文献
42 篇 学位论文
4 册 图书
1 篇 资讯

馆藏范围

9,175 篇 电子文献
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,404 篇 理学
- 1,984 篇 数学
- 311 篇 物理学
- 149 篇 统计学（可授理学、...
- 113 篇 系统科学
- 97 篇 生物学
- 89 篇 化学
506 篇 管理学
- 390 篇 管理科学与工程(可...
- 123 篇 图书情报与档案管...
- 76 篇 工商管理
81 篇 医学
- 58 篇 临床医学
68 篇 农学
- 62 篇 作物学
34 篇 经济学
- 32 篇 应用经济学
28 篇 法学
13 篇 文学
7 篇 教育学
5 篇 艺术学
4 篇 军事学

主题

9,175 篇 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,734 篇 英文
361 篇 其他
60 篇 中文
9 篇 俄文
4 篇 德文
3 篇 西班牙文
2 篇 法文

检索条件"主题词=PARALLEL algorithms"

共 9175 条记录，以下是401-410 订阅

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

详细简洁

排序：

NEW parallel algorithms FOR CONVEX-HULL AND TRIANGULATION IN 3-DIMENSIONAL SPACE 17th

NEW PARALLEL ALGORITHMS FOR CONVEX-HULL AND TRIANGULATION IN...

引用

17TH INTERNATIONAL SYMP ON MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE ( MFCS 92 )

作者： PREILOWSKI, W DAHLHAUS, E WECHSUNG, G Department of Mathematics and Computer Science University of Paderborn Germany Department of Computer Science University of Sidney Australia Department of Mathematics Friedrich-Schiller-University of Jena Germany

ISBN: (纸本)354055808X

Let 5 be a set of n given points in 3-dimensional space. We present parallel algorithms for the construction of the convex hull and for triangulation of 5 on a CREW-PRAM. For 3-dim. convex hull our algorithm is time-optimal and uses time O(1/ϵ · log(n)) with O(n^1+ϵ) processors. By duality parallel convex hull algorithms induce new ones for Voronoi-diagrams in the plane, using the same time and processor bounds. A second parallel algorithm for Voronoi-diagrams presented here uses time O(log(n)²) with O(n) processors. For 3-dim. triangulation of S we give the first parallel algorithm for the generalized problem, using time O(log(n)²) with O(n^1+ϵ) processors. For the tangential-plane problem we give a parallel algorithm, needing time O(log(n)) with O(n) processors. © 1992, Springer Verlag. All rights reserved.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Dendro: parallel algorithms for multigrid and AMR methods on 2:1 balanced octrees

Dendro: Parallel algorithms for multigrid and AMR methods on...

引用

International Conference for High Performance Computing, Networking, Storage and Analysis

作者： Sampath, Rahul S. Adavani, Santi S. Sundar, Hari Lashuk, Ilya Biros, George Georgia Inst Technol Atlanta GA 30332 USA Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781424428342

In this article, we present Dendro, a suite of parallel algorithms for the discretization and solution of partial differential equations (PDEs) involving second-order elliptic operators. Dendro uses trilinear finite element discretizations constructed using octrees. Dendro, comprises four main modules: a bottom-up octree generation and 2:1 balancing module, a meshing module, a geometric multiplicative multigrid module, and a module for adaptive mesh refinement (AMR). Here, we focus on the multigrid and AMR modules. The key features of Dendro are coarsening/refinement, inter-octree transfers of scalar and vector fields, and parallel partition of multilevel octree forests. We describe a bottom-up algorithm for constructing the coarser multigrid levels. The input is an arbitrary 2:1 balanced octree-based mesh, representing the fine level mesh. The output is a set of octrees and meshes that are used in the multigrid sweeps. Also, we describe matrix-free implementations for the discretized PDE operators and the intergrid transfer operations. We present results on up to 4096 CPUs on the Cray XT3 ("BigBen"), the Intel 64 system ("Abe"), and the Sun Constellation Linux cluster ("Ranger").

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Performance study of parallel algorithms of LU decomposition for dense matrices

Performance study of parallel algorithms of LU decomposition...

引用

International Conference on parallel and Distributed Processing Techniques and Applications

作者： Mikolajczak, B Eranosian, C Gallagher, C Univ Massachusetts Dept Comp & Informat Sci Dartmouth MA 02747 USA

ISBN: (纸本)1892512459

The paper presents performance results of parallel matrix LU decomposition algorithms with row-wise cyclic striping and partial pivoting implemented within several message passing distributed environments. Two environments have been chosen: message passing interface (MPI with point-to-point communication routines;environment portable and not interoperable), parallel virtual machine (PVM- a dynamic collection of potentially heterogeneous computing resources;environment portable and interoperable). The following performance measures are studied and results are presented standard speedup, scaled speedup, and efficiency. The conclusions are supported by experimental results conducted for matrix sizes up to 2000 x 2000 with 2, 4, 6, and 8 processors. From experiments it is apparent that if application is going to be developed on a massively parallel processor or on a homogeneous network, then MPI may be a choice because of its good communication performance. If an application is going to be developed on a heterogeneous network, then PVM would appear to be the preferred choice. Interoperability of PVM, comparing with MPI, comes with a price. PVM parallel programs level off with sequential programs for matrix sizes 600 x 600 and higher, comparing with MPI parallel programs which achieve the same performance result for matrices of 400 x 400.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal parallel algorithms for Dendrogram Computation and Single-Linkage Clustering 24

Optimal Parallel Algorithms for Dendrogram Computation and S...

引用

36th ACM Symposium on parallelism in algorithms and Architectures (SPAA)

作者： Dhulipala, Laxman Dong, Xiaojun Gowda, Kishen N. Gu, Yan Univ Maryland College Pk MD 20742 USA Univ Calif Riverside Riverside CA 92521 USA

ISBN: (纸本)9798400704161

Computing a Single-Linkage Dendrogram (SLD) is a key step in the classic single-linkage hierarchical clustering algorithm. Given an input edge-weighted tree), the SLD of) is a binary dendrogram that summarizes the n = 1 clusterings obtained by contracting the edges of T in order of weight. Existing algorithms for computing the SLD all require Omega(n log n) work where n = vertical bar T vertical bar. Furthermore, to the best of our knowledge no prior work provides a parallel algorithm obtaining non-trivial speedup for this problem. In this paper, we design faster parallel algorithms for computing SLDs both in theory and in practice based on new structural results about SLDs. In particular, we obtain a deterministic output-sensitive parallel algorithm based on parallel tree contraction that requires O(n log h) work and O(log(2) n log(2) h) depth, where h is the height of the output SLD. We also give a deterministic bottom-up algorithm for the problem inspired by the nearest-neighbor chain algorithm for hierarchical agglomerative clustering, and show that it achieves O(n log h) work and O(h log n) depth. Our results are based on a novel divide-and-conquer framework for building SLDs, inspired by divide-and-conquer algorithms for Cartesian trees. Our new algorithms can quickly compute the SLD on billion-scale trees, and obtain up to 150x speedup over the highly-efficient Union-Find algorithm typically used to compute SLDs in practice.

关键词： Single-Linkage Clustering Hierarchical Graph Clustering HAC Dendrograms parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Space and time efficient parallel algorithms and software for EST clustering

Space and time efficient parallel algorithms and software fo...

引用

31st International Conference on parallel Processing (ICPP 2002)

作者： Kalyanaraman, A Aluru, S Kothari, S Iowa State Univ Dept CS Ames IA 50011 USA

ISBN: (纸本)0769516777

Expressed sequence tags, abbreviated ESTs, are DNA molecules experimentally derived from expressed portions of genes. Clustering of ESTs is essential for gene recognition and understanding important genetic variations such as those resulting in diseases. In this paper, we present the design and development of a parallel software system for EST clustering. To our knowledge, this is the first such effort to address the problem of EST clustering in parallel. The novel features of our approach include 1) design of space efficient algorithms to keep the space requirement linear in the size of the input data set, 2) a combination of algorithmic techniques to reduce the total work without sacrificing the quality of EST clustering, and 3) use of parallel processing to reduce the run-time and facilitate the clustering of large data sets. Using a combination of these techniques, we report the clustering of 81,414 Arabidopsis ESTs in under 2.5 minutes on a 64-processor IBM SP, a problem that is estimated to take 9 hours of run-time with a state-of-the-art software, provided the memory required to run the software can be made available.

关键词： Algorithm design and analysis Clustering algorithms Diseases DNA Genetics parallel algorithms parallel processing Runtime Sequences Software systems

来源：评论

学校读者我要写书评

暂无评论

The High-Performance parallel algorithms for the Numerical Solution of Boundary Value Problems 11th

The High-Performance Parallel Algorithms for the Numerical S...

引用

11th International Scientific Conference on parallel Computational Technologies (PCT)

作者： Volokhov, Vadim Martynenko, Sergey Toktaliev, Pavel Yanovskiy, Leonid Varlamov, Dmitriy Volokhov, Alexander RAS Inst Problems Chem Phys Academician Semenov Ave 1 Chernogolovka 142432 Moscow Region Russia Cent Inst Aviat Motors Aviamotornaya 2 Moscow 111116 Russia

ISBN: (纸本)9783319670355;9783319670348

The boundary and the initial boundary value problems form the basis of numerous mathematical models. Ultimately, the discrete (linearized) boundary and the initial boundary value problems are reduced to the systems of linear algebraic equations with sparse and ill-conditioned coefficient matrix. In modern applications (such as computational fluid dynamics) the number of equations in the system can reach about 10(12) and higher. Just the numerical solution of such systems requires significant computational effort, so an actual problem of modern computational mathematics is working-out, theoretical analysis and testing of high-performance parallel algorithms. The article discusses algebraic, geometric and combined ways to formation of the parallel algorithms. In this work we presented advantages and disadvantages of each ways, the estimate of parallelism's acceleration and efficiency, the comparison of volume of computational work compared with the optimal sequential algorithm, and the results of computational experiments. The peculiarities of parallel algorithms' implementation by using of software and hardware structures for parallel programming were discussed in this work.

关键词： Initial boundary value problems parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Low-Cost parallel algorithms for 2:1 Octree Balance

Low-Cost Parallel Algorithms for 2:1 Octree Balance

引用

26th IEEE International parallel and Distributed Processing Symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Isaac, Tobin Burstedde, Carsten Ghattas, Omar Univ Texas Austin Inst Computat Engn & Sci ICES Austin TX 78712 USA

ISBN: (纸本)9780769546759

The logical structure of a forest of octrees can be used to create scalable algorithms for parallel adaptive mesh refinement (AMR), which has recently been demonstrated for several petascale applications. Among various frequently used octree-based mesh operations, including refinement, coarsening, partitioning, and enumerating nodes, ensuring a 2:1 size balance between neighboring elements has historically been the most expensive in terms of CPU time and communication volume. The 2:1 balance operation is thus a primary target to optimize. One important component of a parallel balance algorithm is the ability to determine whether any two given octants have a consistent distance/size relation. Based on new logical concepts we propose fast algorithms for making this decision for all types of 2: 1 balance conditions in 2D and 3D. Since we are able to achieve this without constructing any parent nodes in the tree that would otherwise need to be sorted and communicated, we can significantly reduce the required memory and communication volume. In addition, we propose a lightweight collective algorithm for reversing the asymmetric communication pattern induced by non-local octant interactions. We have implemented our improvements as part of the open-source "p4est" software. Benchmarking this code with both synthetic and simulation-driven adapted meshes we are able to demonstrate much reduced runtime and excellent weak and strong scalability. On our largest benchmark problem with 5.13 x 10(11) octants the new 2:1 balance algorithm executes in less than 8 seconds on 112,128 CPU cores of the Jaguar Cray XT5 supercomputer.

关键词： Octrees Adaptive mesh refinement parallel algorithms Scientific computing High performance computing

来源：评论

学校读者我要写书评

暂无评论

Distributed-Memory parallel algorithms for Generating Massive Scale-free Networks Using Preferential Attachment Model 13

Distributed-Memory Parallel Algorithms for Generating Massiv...

引用

International Conference for High Performance Computing, Networking, Storage and Analysis (SC)

作者： Alam, Maksudul Khan, Maleq Marathe, Madhav V. Virginia Tech Dept Comp Sci Blacksburg VA 24061 USA Virginia Tech Dept Comp Sci Blacksburg VA 24061 USA

ISBN: (纸本)9781450323789

Recently, there has been substantial interest in the study of various random networks as mathematical models of complex systems. As these complex systems grow larger, the ability to generate progressively large random networks becomes all the more important. This motivates the need for efficient parallel algorithms for generating such networks. Naive parallelization of the sequential algorithms for generating random networks may not work due to the dependencies among the edges and the possibility of creating duplicate (parallel) edges. In this paper, we present MPI-based distributed memory parallel algorithms for generating random scale-free networks using the preferential-attachment model. Our algorithms scale very well to a large number of processors and provide almost linear speedups. The algorithms can generate scale-free networks with 50 billion edges in 123 seconds using 768 processors.

关键词： scale-free networks Big Data high performance computing preferential attachment random networks parallel algorithms copy model

来源：评论

学校读者我要写书评

暂无评论

Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovasz Local Lemma 28

Deterministic parallel algorithms for fooling polylogarithmi...

引用

28th Annual ACM-SIAM Symposium on Discrete algorithms (SODA)

作者： Harris, David G. Univ Maryland Dept Comp Sci College Pk MD 20742 USA

ISBN: (纸本)9781611974782

Many randomized algorithms can be derandomized efficiently using either the method of conditional expectations or probability spaces with low (almost-) independence. A series of papers, beginning with work by Luby (1988) and continuing with Berger & Rompel (1991) and Chari et al. (1994), showed that these techniques can be combined to give deterministic parallel algorithms for combinatorial optimization problems involving sums of w-juntas. We improve these algorithms through derandomized variable partitioning. This reduces the processor complexity to essentially independent of w while the running time is reduced from exponential in w to linear in w. For example, we improve the time complexity of an algorithm of Berger & Rompel (1991) for rainbow hypergraph coloring by a factor of approximately log(2) n and the processor complexity by a factor of approximately m(ln2). As a major application of this, we give an NC algorithm for the Lovasz Local Lemma Previous NC algorithms, including the seminal algorithm of Moser & Tardos (2010) and the work of Chandrasekaran et. al (2013), required that (essentially) the bad-events could span only O(log n) variables;we relax this to allowing polylog(n) variables. As two applications of our new algorithm, we give algorithms for defective vertex coloring and domatic graph partition. One main sub-problem encountered in these algorithms is to generate a probability space which can "fool" a given list of GF(2) Fourier characters. Schulman (1992) gave an NC algorithm for this;we dramatically improve its efficiency to near-optimal time and processor complexity and code dimension. This leads to a new algorithm to solve the heavy-codeword problem, introduced by Naor & Naor (1993), with a near-linear processor complexity (mn)(l+o(1)).

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 37 38 39 40 41 42 43 44 45 46 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：