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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,616 篇 软件工程
- 1,420 篇 电气工程
- 448 篇 信息与通信工程
- 296 篇 控制科学与工程
- 268 篇 电子科学与技术（可...
- 94 篇 仪器科学与技术
- 75 篇 机械工程
- 74 篇 力学（可授工学、理...
- 63 篇 动力工程及工程热...
- 63 篇 化学工程与技术
- 61 篇 生物工程
- 55 篇 生物医学工程（可授...
- 51 篇 农业工程
- 45 篇 材料科学与工程（可...
- 43 篇 土木工程
- 40 篇 光学工程
- 29 篇 建筑学
2,406 篇 理学
- 1,984 篇 数学
- 312 篇 物理学
- 149 篇 统计学（可授理学、...
- 113 篇 系统科学
- 97 篇 生物学
- 89 篇 化学
508 篇 管理学
- 391 篇 管理科学与工程(可...
- 124 篇 图书情报与档案管...
- 77 篇 工商管理
81 篇 医学
- 58 篇 临床医学
67 篇 农学
- 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 条记录，以下是4191-4200 订阅

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

详细简洁

排序：

High Performance Simulations of the Cellular Potts Model

High Performance Simulations of the Cellular Potts Model

引用

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

作者： F. Piccini Cercato J.C.M. Mombach G.G.H. Cavalheiro Vale do Rio dos Sinos University Sao Leopoldo Rio Grande do Sul Brazil

The lattice cellular Potts model is widely used to represent physical and biological cellular systems. Standard implementations of this model in the literature employ inefficient Monte Carlo protocols to select elements (labels) of the lattice storing the investigated system. Recently, we proposed a new parallel algorithm, the Random Walker algorithm (RW), that can generate speedups from 3 to 10 times in simulations of this model. In this paper we present a distributed implementation of the RW algorithm exploiting parallel architectures. Our tests in a computer cluster show speedups between 5.7 and 15.6 in relation to the distributed standard algorithm.

关键词： Biological system modeling Clustering algorithms Lattices Monte Carlo methods Protocols parallel algorithms Computational modeling parallel architectures Testing Distributed computing

来源：评论

学校读者我要写书评

暂无评论

parallelization of Similarity Search in Large Time Series Databases

Parallelization of Similarity Search in Large Time Series Da...

引用

International Multi-Symposiums on Computer and Computational Sciences (IMSCCS)

作者： Jonathan Qiao Yang Ye Chaoyang Zhang Converse College Spartanburg SC USA University of Southern Mississippi Hattiesburg MS USA

In this paper, an efficient parallel algorithm to search large time series databases is proposed. There are existing parallel algorithms for performing such tasks, which generally utilize multidimensional tree structures and thus are subjected to the performance of multidimensional trees. On the other hand, there have been a number of serial algorithms proposed in the past decade. Most of them use certain transformation techniques to reduce the dimensionality and then build an index to facilitate the search process. This again results in performance degradation. This work develops a parallel algorithm to process range query and k-nearest neighbor query in parallel time series databases, assuming a shared nothing multi-processor architecture. Both analytical and experimental results show that the new approach has near linear scaleup and linear speedup with little more effort than non-index based sequential scan and thus another alternative to index based approach

关键词： Databases Information retrieval parallel algorithms Chaos Multidimensional systems Time measurement Educational institutions Tree data structures Degradation Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Blood Vessel Detection via a Multi-window Parameter Transform

Blood Vessel Detection via a Multi-window Parameter Transfor...

引用

Annual IEEE Symposium on Computer-Based Medical Systems

作者： K. Estabridis R. Defigueiredo Department of Electrical Engineering and Computer Science University of California Irvine USA

A parallel algorithm to detect retinal blood vessels has been developed for use in an automated diabetic retinopathy detection system. Localized adaptive thresholding and a multi-window Radon transform (RT) are utilized to detect the vascular system in retinal images. Multi-window parameter transforms are intrinsically parallel and offer increased performance over conventional transforms. The image is adoptively thresholded and then the multi-window RT is applied at different window sizes or partition levels. Results from each partition level are combined and morphologically processed to improve final performance. Multiple partitions are necessary to account for the size variation present in retinal blood vessels. The algorithm was tested with 20 images, 10 normal and 10 abnormal and the results demonstrate the robustness of the algorithm in the presence of noise. An average true positive rate of 86.3 % with a false positive rate of 3.9% is accomplished with this algorithm when tested against hand-labeled data

关键词： Blood vessels Biomedical imaging Retina Partitioning algorithms Testing parallel algorithms Diabetes Retinopathy Adaptive systems Noise robustness

来源：评论

学校读者我要写书评

暂无评论

A VQ compression algorithm for a multiprocessor system with a global sort collective function

A VQ compression algorithm for a multiprocessor system with ...

引用

International Conference on Computer and Information Science (ACIS)

作者： A. Wakatani Faculty of Science and Engineering Konan University Kobe Japan

One of the most expensive part of a VQ compression algorithm is a codebook generation. PNN algorithm constructs a codebook by merging the "nearest" vectors and its parallel algorithm needs "Allsort" procedure that sorts locally-sorted lists of all processors into a globally-sorted list and broadcasts the list to all processors on a multiprocessor system. We propose a new collective function, called Allsort for such a procedure and preliminarily implement the collective based on the dissemination method. We confirm the effectiveness of our proposed collective analytically and empirically. The results of our experiments show that the elapsed time of our implementation of the Allsort collective is improved by a factor of 2.0 to 2.7 compared with the combination of the ordinal MPI Allgather collective and the global sort on both power-of-2 number processors and non-power-of-2 number processors. We also show that the speedup of the aggressive PNN algorithm for a codebook generation for VQ compression is improved by around 8% to 20% on an 8 CPU cluster.

关键词： Compression algorithms Multiprocessing systems Streaming media Computational complexity Nearest neighbor searches Pipelines Yarn Merging parallel algorithms Broadcasting

来源：评论

学校读者我要写书评

暂无评论

An Improved Algorithm Based on Sub-Structures for Creating Virtual Plant

An Improved Algorithm Based on Sub-Structures for Creating V...

引用

International Conference on Artificial Reality and Telexistence (ICAT)

作者： Wei-Long Ding Wei-Tong Zhang Xiao Zhou Zhejiang University of Technology Hangzhou Zhejiang CN

L-systems are powerful rule-based languages for modeling fractal objects and their animation in the fields of virtual plant. But the efficiency of this parallel algorithm needs to be improved because many times rewriting will cost much time and waste lot of computer memory. In this article, an improved algorithm based on the idea of sub-structure is proposed to ameliorate L-systems. Those structures with same features that appear frequently during the process of production iteration are defined as different sub-structures. In the following repetitive process, when the same structure appears, the program will directly paste this sub-structure to the designated position instead of calculating again. Through this method, the storage size of the geometrical information can be decreased and the efficiency of modeling virtual plant can be improved.

关键词： Biological system modeling Solid modeling Computational modeling Animation Computer simulation Genetic algorithms Fractals parallel algorithms Concurrent computing Automation

来源：评论

学校读者我要写书评

暂无评论

LogfP - a model for small messages in InfiniBand 06

LogfP - a model for small messages in InfiniBand

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： T. Hoefler T. Mehlan F. Mietke W. Rehm Department of Computer Science Chemnitz University of Technology Chemnitz Germany

ISBN: (纸本)9781424400546

Accurate models of parallel computation are often crucial to optimize parallel algorithms for their running time. In general the easier the model's use and the smaller the number of parameters and interdependencies among them, the more inaccuracies are introduced by simplification. On the other hand a too complex model is unusable. We show that it is possible to derive a relatively accurate and easy model for small message performance over the InfiniBand network. This model allows the developer to gain knowledge about the inherent parallelism of a specific InfiniBand hardware and encourages him to use this parallelism efficiently. Several well known models hide this feature and some of them even penalize the use of parallelism because the model designers were not aware of new emerging architectures like InfiniBand

关键词： parallel processing Algorithm design and analysis Programming profession Concurrent computing parallel algorithms Hardware Computer architecture Delay Computer networks Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Two-step 1-D fast Fourier transform without inter-processor communications

Two-step 1-D fast Fourier transform without inter-processor ...

引用

Southeastern Symposium on System Theory

作者： R.A. Na'mneh D.W. Pan Department of Electrical and Computer Engineering University of Alabama Huntsville Huntsville AL USA

Computing the 1-D fast Fourier transform (FFT) using the conventional six-step FFT on parallel computers requires intensive all-to-all communication due to the necessity of transposing an array three times. This all-to-all communication significantly reduces the performance of FFT in parallel systems. In this paper, we present a two-step parallel algorithm for implementing the 1-D FFT without inter-processor communication, at the expense of extra computation as opposed to the conventional six-step FFT. The advantage of the two-step FFT algorithm over its six-step counterpart becomes obvious in systems where the cost of computation is lower that of inter-processor communication. The 32-node Beowulf cluster is such a system with fast 2 GHz processors but relatively slow inter-processor communication by using 100 Mbit/s network switches. Our simulation results show that the two-step FFT algorithm without inter-processor communication outperforms the six-step 1-D FFT on this cluster

关键词： Fast Fourier transforms Clustering algorithms Concurrent computing Switches Communication switching Hypercubes Scalability parallel algorithms Computational efficiency Telecommunication switching

来源：评论

学校读者我要写书评

暂无评论

Genetic Network Programing Considering the Evolution of Breadth and Depth

Genetic Network Programing Considering the Evolution of Brea...

引用

SICE Annual Conference

作者： Shinji Eto Shingo Mabu Kotaro Hirasawa Jingle Hu Graduate School of Information Production and Systems Waseda University Japan

Many methods of generating behavior sequences of agents by evolution have been reported. A new evolutionary computation method named genetic network programming (GNP) has also been developed recently along with these trends. In this paper, a new method for evolving GNP considering breadth and depth is proposed. The performance of the proposed method is shown from simulations using garbage collector problem

关键词： Economic indicators Genetic programming Evolutionary computation Electronic mail Production systems Computational modeling Artificial intelligence Intelligent robots Genetic algorithms parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal Design of the High Order FIR Multi-Band-Stop Filters

Optimal Design of the High Order FIR Multi-Band-Stop Filters

引用

World Congress on Intelligent Control and Automation (WCICA)

作者： Zhezhao Zeng Yibin Zhang Yaonan Wang College of Electrical and Information Engineering Changsha University of Science and Technology Changsha Hunan China College of Electrical and Information Engineering Hunan University Changsha Hunan China

This paper traverses the relations between the amplitude-frequency response of FIR filters with the linear phase and the parallel algorithm of neural network, which its activation matrix is H d - C T W , presents and proves the convergence theorem of the neural-network parallel algorithm, and gives the optimal design examples of high order FIR multi-band-stop digital filters. The results show that the parallel algorithm is efficient in the field of optimal design on the high order FIR multi-band-stop digital filters with the linear phase

关键词： Finite impulse response filter Digital filters Algorithm design and analysis Neural networks parallel algorithms Least squares methods Educational institutions Design engineering Frequency Design methodology

来源：评论

学校读者我要写书评

暂无评论

Particle Dynamics Duality Model for Multi-Agent Systems

Particle Dynamics Duality Model for Multi-Agent Systems

引用

International Conference on Services Systems and Services Management, ICSSSM

作者： Dianxun Shuai Qing Shuai Yumin Dong East China University of Science and Technology China Huazhong University of Science and Technology China Qingdao Technological University China

This paper presents a novel generalized particle duality approach (GPDA) to transform the problem-solving for multi-agent systems into the kinematics and dynamics of particles in dual force-fields. Since the resources allocation and task assignment in complex distributed network environment is a typical problem of multi-agent systems, GPDA is used to optimize the bandwidth allocation and QoS assignment in ATM networks. The construction, dynamics and properties of the GPDA and corresponding algorithm are discussed. The GPDA has many advantages in terms of the high-scale parallelism, multi-objective optimization, multi-type coordination, multi-degree autonomy, and the ability to deal randomly occurring phenomena in MAS systems

关键词： Multiagent systems Resource management Problem-solving Channel allocation Quality of service Telecommunication traffic Aggregates parallel algorithms Kinematics Bandwidth

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 416 417 418 419 420 421 422 423 424 425 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：