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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是4571-4580 订阅

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

详细简洁

排序：

parallel simulation of group behaviors 04

Parallel simulation of group behaviors

引用

Simulation Winter Conference

作者： B. Zhou S. Zhou School of Computer Engineering Nanyang Technological University Singapore

ISBN: (纸本)9780780387867

Group behaviors, e.g. birds flocking, are widely used in virtual reality, computer games, robotics and artificial life. While many methods to simulate group behaviors have been proposed, these methods are usually applied to sequential computing. Since the computational load of these methods is exponential to the number of group members, it is difficult to simulate a large group in real-time using these methods. In this paper, we propose a parallel algorithm to simulate the flocking behavior of a large group. The new partitioning and communication mechanisms in the parallel algorithm make the flocking simulation more efficient. Experimental results show that the proposed parallel algorithm provides good speedup in generating flocking behaviors compared with the sequential simulation.

关键词： Computational modeling Birds parallel algorithms Virtual reality Robots Aggregates Computer simulation Animation Global communication Load management

来源：评论

学校读者我要写书评

暂无评论

parallel computing for the longest common subsequences in network intrusion detection system

Parallel computing for the longest common subsequences in ne...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Cheng Zhong Guo-Ling Chen Jia-Hua He Department of Computer Science and Technology University of Science and Technology Hefei China School of Computer and Electronics and Information Guangxi University Nanning China

ISBN: (纸本)0780384032

The longest common subsequence problem has been applied to network instruction detection system, bioinformatics and e-commerce, etc. This paper proposes an extended longest common subsequence problem called (K,1)-LCS problem, designs a parallel algorithm to solve (K,1)-LCS problem on SMP machine by the divide and conquer strategy and the tournament tree, and then presents a parallel algorithm for solving (K,1)-LCS problem on SMP clusters by applying the k-selection technique based on mesh-connected network. The theoretical analysis and experiments on Dawning-2000 parallel computer show that the parallel algorithm obtains a linear speedup and has a very good scalability.

关键词： parallel processing Intelligent networks Intrusion detection parallel algorithms Concurrent computing Algorithm design and analysis Clustering algorithms Phase change random access memory Helium Computer aided instruction

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel algorithm for isosurface visualization from large-scale scientific simulation data

An efficient parallel algorithm for isosurface visualization...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： C. Li P.E. Plassmann Department of Computer Science and Engineering Pennsylvania State University University Park PA USA

Summary form only given. The tremendous amount of data generated by large-scale, parallel scientific and engineering simulations make the archive and analysis of this data difficult. To address this problem we, in previous work, developed an efficient archival scheme based on the functional representation of simulation data-this approximation scheme can reduce storage requirement significantly. However, common visualization tools such as the marching cubes algorithm for isosurface generation cannot be directly applied in this representation. Thus, we propose a new efficient isosurface visualization approach that takes full advantage of the functional approximation of simulation data. This method is fundamentally different from the marching cubes approach in that the visualization of isosurfaces is achieved through the solution of sets of ordinary differential equations. We present computational results detailing the effectiveness of this new approach for a simulation modeling the fluid dynamics of a turbulent reacting flow. The results demonstrate that the method is efficient in a parallel environment and represents a promising approach for the visualization of isosurfaces in simulation data from large-scale scientific applications.

关键词： parallel algorithms Isosurfaces Data visualization Large-scale systems Computational modeling Data engineering Analytical models Data analysis Differential equations Fluid dynamics

来源：评论

学校读者我要写书评

暂无评论

A parallel QR factorization algorithm for solving Toeplitz tridiagonal systems

A parallel QR factorization algorithm for solving Toeplitz t...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： R.E. Shaw L.E. Garey A.M. White Department of Computer Science & Applied Statistics University of New Brunswick Saint John's NB Canada

Summary form only given. QR methods for solving Toeplitz tridiagonal systems are well developed with applications in numerous interdisciplinary fields. There is a strong motivation to develop faster, more efficient and, more importantly, scalable algorithms to factor such systems due to their significance in many scientific applications. We present two parallel QR factorization algorithms used to solve Toeplitz tridiagonal systems. QR factorization is accomplished using Householder reflections and Givens rotations. These parallel algorithms exhibit high scalability and near linear to superlinear speedup on large system sizes when implemented on a distributed system.

关键词： Signal processing algorithms parallel algorithms Scalability Equations Least squares methods Computer science Statistics Niobium Application software Reflection

来源：评论

学校读者我要写书评

暂无评论

A domain decomposition method for the solution of large electromagnetic problems using a massively parallel hybrid finite element - integral equation MLFMA [multilevel fast multipole algorithm]

A domain decomposition method for the solution of large elec...

引用

Antennas and Propagation Society International Symposium

作者： D. Goudin M. Mandallena K. Mer-Nkonga B. Stupfel CEA/CESTA France

For scattering and antenna design problems the electromagnetic field must be computed around and inside 3D complex targets, constituted with inhomogeneous media. To this end, "exact" numerical methods can be employed to solve Maxwell's equations in the frequency domain. Here, we consider the hybrid boundary integral equation and the finite element technique. For some of our applications, this numerical approach tends to be insufficient in terms of number of degrees of freedom. In order to solve these very large problems, we have combined an original numerical method based on a domain decomposition method and very efficient parallel algorithms.

关键词： Finite element methods Integral equations Maxwell equations Electromagnetic scattering Concurrent computing Nonhomogeneous media Electromagnetic fields parallel algorithms Iterative algorithms Linear systems

来源：评论

学校读者我要写书评

暂无评论

HLogGP: a new parallel computational model for heterogeneous clusters 04

HLogGP: a new parallel computational model for heterogeneous...

引用

IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID)

作者： J.L. Bosque L.P. Perez Universidad Rey Juan Carlos de Madrid Madrid Spain

ISBN: (纸本)9780780384309

Heterogeneous clusters claim for new models and algorithms. In this paper a new parallel computational model is presented. The model, based on the LogGP model, has been extended to be able to deal with heterogeneous parallel systems. For that purpose, the LogGP's scalar parameters have been replaced by vector and matrix parameters to take into account the different node's features. The work presented here includes the parameterization of a real cluster which illustrates the impact of node heterogeneity over the model's parameters. Finally, the paper presents some experiments performed in a real heterogeneous cluster that can be used for assessing the method's validity, together with the main conclusions and future work.

关键词： Concurrent computing Computational modeling Phase change random access memory Algorithm design and analysis Delay Hardware Clustering algorithms Portable computers parallel algorithms Communication networks

来源：评论

学校读者我要写书评

暂无评论

Improved parallel prefix computation on optical multi-trees

Improved parallel prefix computation on optical multi-trees

引用

IEEE India Conference (INDICON)

作者： P.K. Jana Department of Computer Science and Engineering Indian School of Mines University Dhanbad India

A parallel algorithm for prefix computation was reported on a recently proposed interconnection network called optical multi-trees (OMULT). Using 2n/sup 3/-n/sup 2/ processors, the algorithm was shown to run in O(log n)/sup A/ electronic moves +5 optical moves for n/sup 2/ data points. In this paper we present a new and improved parallel algorithm for prefix computation on the same network. Although the algorithm requires O(log n) electronic moves +4 optical moves using the same number of processors, the number of data points involved in our algorithm is n/sup 3/ in contrast to n/sup 2/.

关键词： Optical computing Concurrent computing Optical interconnections parallel algorithms Computer networks Optical fiber networks Power system interconnection Binary trees Multiprocessor interconnection networks Electronics packaging

来源：评论

学校读者我要写书评

暂无评论

New parallel algorithm for mitigating the frequency offset of OFDM systems

New parallel algorithm for mitigating the frequency offset o...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Hen-Geul Yeh C.C. Wang Electrical Engineering Department California State University Long Beach Long Beach CA USA Aerospace Corporation El Segundo CA USA

We study the problem of frequency offset due to the Doppler velocity of orthogonal frequency division multiplexing (OFDM) systems. A regular OFDM has an IFFT at the transmitter and an FFT at the receiver. The proposed parallel algorithm employs an FFT at the transmitter and an IFFT at the receiver. The regular OFDM samples, which are generated by the IFFT, are transmitted as the first block, and the FFT outputs are transmitted as the second block. At the receiver, the results of the first output generated by the FFT are combined with the second output generated by the IFFT. This combined operation forms a parallel intercarrier interference (ICI) cancellation scheme for mitigating frequency offsets of OFDM systems. It provides: (1) a robust OFDM system in the presence of relative velocity, also known as Doppler frequency offset; (2) high signal to ICI ratio (7 dB better than that of the linear self-cancellation algorithms at N=1024 and /spl Delta/fT/spl les/1% of subcarrier frequency spacing); (3) backward compatibility with the existing OFDM system; (4) better BER performance in both additive white Gaussian noise (AWGN) and fading channels.

关键词： parallel algorithms OFDM AWGN Frequency estimation Radio transmitters Interference Additive white noise Fading Crosstalk Aerospace engineering

来源：评论

学校读者我要写书评

暂无评论

A new algorithm for computing the Smith normal form and its implementation on parallel machines

A new algorithm for computing the Smith normal form and its ...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： G. Jager Mathematisches Seminar Christian-Albrechts-Universität Kiel Kiel Germany

Summary form only given. Smith normal form computation is important in many topics, e.g. group theory and number theory. For matrices over the rings Z and F/sub 2/[x], we introduce a new Smith normal form algorithm, called triangular band matrix algorithm, which first computes the Hermite normal form and then step by step the diagonal form and the Smith normal form. In comparison to the Kannan Bachem algorithm, which computes the Smith normal form by alternately computing the Hermite normal form and the left Hermite normal form, the theoretical advantage is, that we only once apply the expensive Hermite normal form step. We parallelize the triangular band matrix algorithm and get a better complexity analysis than for previous parallel algorithms, like the Kannan Bachem algorithm and the Hartley Hawkes algorithm. In the part, which is different to the Kannan Bachem algorithm, the triangular band matrix algorithm leads to a better efficiency and smaller execution times, even for large example matrices.

关键词： Concurrent computing parallel machines Algorithm design and analysis Seminars parallel algorithms Lead Distributed computing Distributed processing

来源：评论

学校读者我要写书评

暂无评论

Improving parallel execution time of sorting on heterogeneous clusters

Improving parallel execution time of sorting on heterogeneou...

引用

International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)

作者： C. Cerin M. Koskas H. Fkaier M. Jemni LaRIA Université de Picardie Jules-Verne Amiens France LaMFA/CNRS UMR 6140 Université de Picardie Jules-Verne Amiens France Unité de recherche UTIC École Supérieure des Sciences et des Techniques de Tunis Tunis Tunisia

The aim of the paper is to introduce techniques in order to optimize the parallel execution time of sorting on heterogeneous platforms (processors speeds are related by a constant factor). We develop a constant time technique for mastering processor load balancing and execution time in an heterogeneous environment. We develop an analytical model for the parallel execution time, sustained by preliminary experimental results in the case of a 2-processors systems. The computation of the solution is independent of the problem size. Consequently, there is no overhead regarding the sorting problem.

关键词： Sorting Clustering algorithms Load management Concurrent computing Analytical models Partitioning algorithms parallel algorithms parallel processing Computer architecture High performance computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 454 455 456 457 458 459 460 461 462 463 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：