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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 期刊文献
41 篇 学位论文
4 册 图书
1 篇 资讯

馆藏范围

9,174 篇 电子文献
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,174 篇 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,733 篇 英文
361 篇 其他
60 篇 中文
9 篇 俄文
4 篇 德文
3 篇 西班牙文
2 篇 法文

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

共 9174 条记录，以下是4791-4800 订阅

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

详细简洁

排序：

parallel discrete-event simulation framework

Parallel discrete-event simulation framework

引用

Computer Science Society (SCCC) International Conference Chilean FLAGGED

作者： M. Mann R. Miranda A. Alavarado Comput. Dept. Univ. of Magallanes Casilla Punta Arenas Chile Computing Department University of Magallanes Casilla Punta Arenas CHILE

This paper describes a software environment devised to support parallel and sequential discrete-event simulation. It provides assistance to the user in issues such as selection of the synchronization protocol to be used in the execution of the simulation of the model. The software framework has been built upon the bulk-synchronous model of parallel computing. The well-defined structure of this model allowed us to predict the running time cost of synchronization protocols in accordance with the particular work-load generated by the execution of the simulation model. We exploit this feature to automatically generate the simulation program.

关键词： Discrete event simulation Computational modeling Predictive models Concurrent computing Protocols parallel processing Costs Software algorithms parallel algorithms Software performance

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm and architecture for object recognition in images

A parallel algorithm and architecture for object recognition...

引用

Computer Architectures for Machine Perception (CAMP)

作者： K. Sitaraman A. Ejnioui N. Ranganathan Department of Computer Science and Engineering University of South Florida Tampa FL USA

The problem of tree pattern matching for object recognition in images is computationally intensive in nature. In two-dimensional images, the objects can be represented through multiscale decomposition as tree structures. The pattern tree representing an object can be matched with a subject tree representing an image in order to detect the objects within the image. Several sequential, parallel and hardware algorithms exist in the literature for tree pattern matching. In this paper, we describe a new parallel algorithm and its realization as a VLSI chip for tree pattern matching. The hardware algorithm is based on a linear array of processing elements (PEs) where the pattern matching is done in a pipelined fashion relying on nearest-neighbor communication between the PE's and the subject and pattern trees of arbitrary length can be processed using a fixed size PE array. The algorithm has an improved execution time of O(lceilm/arceiln) required to perform the matching where m, a and n are the sizes of the pattern tree, processor array, subject tree respectively. A prototype CMOS VLSI chip implementing the proposed algorithm has been designed and verified. It is shown that the hardware algorithm proposed in this work represent a sign improvement in terms of computational complexity, data flow, and architecture over the ones previously proposed for this problem

关键词： parallel algorithms Object recognition Pattern matching Hardware Computer architecture Very large scale integration Tree data structures Object detection Prototypes Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm for enumerating combinations

A parallel algorithm for enumerating combinations

引用

International Conference on parallel Processing (ICPP)

作者： M. Torres A. Goldman J. Barrera Departamento de Ciência da Computaçãao Universidade de São Paulo Sao Paulo Brazil

We propose an efficient parallel algorithm with simple static and dynamic scheduling for generating combinations. It can use any number of processors (NPlesn-m+1) in order to generate the set of all combinations of C(n,m). The main characteristic of this algorithm is to require no integer larger than n during the whole computation. The performance results show that even without a perfect load balance, this algorithm has very good performance, mainly when n is large. Besides, the dynamic algorithm presents a good performance on heterogeneous parallel platforms

关键词： parallel algorithms Scheduling algorithm Dynamic scheduling Application software Adaptive algorithm Concurrent computing Heuristic algorithms Gold Computer science Genetics

来源：评论

学校读者我要写书评

暂无评论

parallel computation of beam-beam interactions including longitudinal motion

Parallel computation of beam-beam interactions including lon...

引用

IEEE Conference on Particle Accelerator

作者： F.W. Jones W. Herr TRIUMF Vancouver Canada CERN Geneva Switzerland

In beam-beam macroparticle simulations for collider rings, the accurate determination of the incoherent spectrum and potentially unstable coherent modes requires (1) large numbers of collisions, and (2) accurate electric field solutions at each collision. On a single processor, a selfconsistent simulation typically uses a 2D model of the beam-beam interaction in order to achieve a reasonable computation time, however for the long (~0.3 m) bunches in the LHC we wish to include the third dimension in order to account for effects such as longitudinal motion, crossing angle, and the beam size and density variations. We describe here a parallel algorithm, developed with MPI on a small commodity Linux cluster, to extend our simulation code BeamX from 2D to 3D using longitudinal subdivision (slicing) of the bunches. Although this paper concentrates on the computing methods, some performance trials and example results will also be shown

关键词： Concurrent computing Computational modeling Large Hadron Collider Master-slave parallel algorithms Linux Damping Distributed computing Grid computing Optical coupling

来源：评论

学校读者我要写书评

暂无评论

GCA: a massively parallel model

GCA: a massively parallel model

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： R. Hoffmann K.P. Volkmann W. Heenes Computer Architecture Group Darmstadt University of Technology Darmstadt Germany

We have previously introduced the massively parallel global cellular automata (GCA) model. parallel algorithms derived from applications can be mapped straightforward onto this model. In this model a cell in the cell field is dynamically connected (access pattern, dynamic neighbourhood) to other cells. The model can be implemented by pointers stored in the cell state. Via these pointers, each cell has read access to any other cell in the cell field, and the pointers may be changed from generation to generation. We have investigated different types of the model in order of minimize hardware/software implementation cost. So we have classified the GCA into types with respect to space, time or data dependency of the access pattern. We have investigated a number of different GCA algorithms and found out, that in most cases a time dependent access pattern is sufficient. To find out the usefulness of the data dependent access pattern we constructed a sophisticated merge sort algorithm, in which the target addresses are computed in contrast to classical algorithms where the data elements are moved. It turned out, that we could not achieve a speed up which we expected compared to an algorithm implemented on the more simple time dependent model. This is another confirmation that it is sufficient to implement only the time and space dependent model and thus reduce the hardware/software implementation cost.

关键词： parallel algorithms Hardware Costs Synchronous generators Computer architecture Application software Global communication Distributed processing Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Communication and memory optimal parallel data cube construction

Communication and memory optimal parallel data cube construc...

引用

International Conference on parallel Processing (ICPP)

作者： Ruoming Jin Ge Yang K. Vaidyanathan G. Agrawal Department of Computer and Information Sciences Ohio State Uinversity Columbus OH USA

关键词： Concurrent computing Data warehouses Data analysis parallel algorithms Companies Performance analysis Aggregates parallel machines Clustering algorithms Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

A fast and elitist parallel evolutionary algorithm for solving systems of non-linear equations

A fast and elitist parallel evolutionary algorithm for solvi...

引用

Congress on Evolutionary Computation

作者： Zhijian Wu Lishan Kang State Key Laboratory of Sofware Engineering Wuhan University of China Wuhan Hubei China

We present a parallel elite-subspace evolutionary algorithm for solving systems of nonlinear equations. On the basis of numerical experiments, we find that our algorithm has an outstanding universal characteristics an... 详细信息

ISBN: (纸本)0780378040

关键词： Evolutionary computation Nonlinear equations Laboratories Convergence of numerical methods Iterative methods Newton method Gradient methods parallel algorithms parallel processing Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Three-dimensional digital filtering algorithm for parallel DSP implementation

Three-dimensional digital filtering algorithm for parallel D...

引用

IEEE International Conference on Image Processing

作者： M. Aziz S. Boussakta D.C. McLernon School of flectronic and Electrical Lngincering Unitersity of Leeds Thc Institute of lntegmtcd Information Systems Leeds UK The Institute of Integrated Information Systems School of Electronic and Electrical Engineering University of Leeds Leeds UK University of Leeds Leeds West Yorkshire GB Inst. of Integrated Inf. Syst. Leeds Univ. UK

In this paper we present a 3-D parallel filtering algorithm. This algorithm is highly parallel and efficient as it eliminates the overhead associated with the overlapping segments in the block-filtering approach. It also lifts the restrictions on the input size for high efficiency in the block-filtering algorithm, as both the 3-D input data and impulse response of the system are decimated into eight subsections each. These subsections can be simultaneously and independently processed. The results of the implementation of the 3-D parallel filtering algorithm on multiDSP platform is presented and discussed showing a high performance reflected by the highly parallel architecture and good memory distribution of the 3-D parallel algorithm.

关键词： Filtering algorithms Digital signal processing Signal processing algorithms Digital filters parallel algorithms parallel processing Concurrent computing Information systems parallel architectures Computer applications

来源：评论

学校读者我要写书评

暂无评论

Impact of data distribution, level of parallelism, and communication frequency on parallel data cube construction

Impact of data distribution, level of parallelism, and commu...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： Ge Yang Ruoming Jin G. Agrawal Department of Computer and Information Sciences Ohio State Uinversity Columbus OH USA

Data cube construction is a commonly used operation in data warehouses. Because of the volume of data that is stored and analyzed in a data warehouse and the amount of computation involved in data cube construction, it is natural to consider parallel machines for this operation. We have developed a set of parallel algorithms for data cube construction using a new data structure called aggregation tree. Our experience has shown that a number of performance trade-offs arise in developing a parallel data cube implementation. We focus on three important issues, which are: (1) data distribution, i.e., how the original array is distributed among the processors; (2) level of parallelism, i.e., what parts of the computation are parallelized and sequentialized; and (3) frequency of communication, i.e., does the implementation require frequent interprocessor communication (and less memory) or less frequent communication (and more memory). We present a detailed experimental study evaluating the above trade-offs. We consider parallel data cube construction with different cube sizes and sparsity levels. Our experimental results show the following: (1) In all cases, reducing the frequency of communication and using higher memory gave better performance, though the difference was relatively small. (2) Choosing data distribution to minimize communication volume made a substantial difference in the performance in most of the cases. (3) Finally, using parallelism at all levels gave better performance, even though it increases the total communication volume.

关键词： Frequency Concurrent computing parallel processing Data warehouses parallel algorithms Data analysis Distributed computing Companies Performance analysis Aggregates

来源：评论

学校读者我要写书评

暂无评论

A parallel iterative decoding algorithm for zero-tail and tail-biting convolutional codes

A parallel iterative decoding algorithm for zero-tail and ta...

引用

IEEE International Symposium on Information Theory

作者： T. Matsushima T.K. Matsushima S. Hirasawa Waseda University Shinjuku Tokyo Japan Polytechnic University Sagamihara Japan

This paper discusses the parallel propagation algorithm applied to the decoding of convolutional codes. The parallel algorithm surpasses the BCJR algorithm in parallel computational complexity and performance when it is applied to tail-biting codes. The complexity of iterative decoding algorithms depends on the calculation of posterior probability and bit error probability by using clique and number of iterations. The computational complexity of the parallel algorithm for tail-biting codes is almost the same as that for zero-tail convolutional codes.

关键词： Iterative decoding Iterative algorithms Convolutional codes parallel algorithms Algorithm design and analysis Error probability Performance analysis Concurrent computing Random variables Analytical models

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 476 477 478 479 480 481 482 483 484 485 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：