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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A BSP/CGM algorithm for computing Euler tours in graphs

A BSP/CGM algorithm for computing Euler tours in graphs

引用

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

作者： E.N. Caceres C.Y. Nasu Universidade Federal de Mato Grosso do Sul Campo Grande Mato Grosso do Sul Brazil

We describe a parallel algorithm using the BSP/CGM model (Bulk Synchronous parallel/Coarse Grained Multicomputer) to obtain the Euler tours in graphs. It is based on the PRAM (parallel random access machine) algorithm by Caceres et al. For an input graph of n vertices and m edges, the algorithm requires local computation time of O((m+n)/p), O((m+n'p) memory and O(logp) communication rounds, where p is the number of processors. To our knowledge there are no other parallel algorithms under the coarse-grained models for the Euler tours in graphs. The proposed algorithm is implemented using MPI (message passing interface) and the C language. The parallel program runs on a Beowulf with 66 nodes. The implementation results confirm the theoretical complexity results of the algorithm.

关键词： User-generated content Bridges parallel algorithms Phase change random access memory Cities and towns Message passing Graph theory Rivers Search methods Data structures

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of an acyclic stable matching scheduler

Design and implementation of an acyclic stable matching sche...

引用

GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)

作者： Enyue Lu Mei Yang Yi Zhang S.Q. Zheng Department of Computer Science University of Texas Dallas Richardson TX USA Department of Computer Science Columbus State University Columbus GA USA Department of Electrical Engineering University of Texas Dallas Richardson TX USA

Applications of stable matching in switch scheduling have been proposed. However, the classical GS (Gale and Shapley) stable matching algorithm is infeasible for high-speed implementation due to its high complexity. Instead, acyclic stable matching algorithms have been shown useful in implementing scheduling for high-speed switches/routers. We model the acyclic stable matching problem as the dominating set problem for a rooted dependency graph, and propose a parallel algorithm for finding the dominating set in O(n log n) time. We design and implement a scheduler based on the proposed algorithm in hardware. Simulation results show that the number of 2-input NAND gates and the timing of our design are proportional to n/sup 2/ and n respectively, making it feasible to implement the scheduler at high speed with current CMOS technologies.

关键词： Switches Scheduling algorithm Processor scheduling Hardware Computer science parallel algorithms Algorithm design and analysis CMOS technology Packet switching Traffic control

来源：评论

学校读者我要写书评

暂无评论

Packet classification using independent sets

Packet classification using independent sets

引用

IEEE Symposium on Computers and Communications (ISCC)

作者： Xuehong Sun Y.Q. Zhao School of Mathematics and Statistics Carleton University Ottawa ONT Canada

This paper describes a new algorithm for packet classification using the concept of independent sets. The algorithm has very small memory requirements. The search speed is neither sensitive to the rule table nor to the percentage of wildcards in the fields. It also scales well from two dimensional classifiers to high dimensional ones. In particular, the algorithm is inherently parallel. Hardware tailored to this algorithm can achieve very fast search speed.

关键词： Random access memory Hardware Classification algorithms Wire Sun Mathematics Statistics Electronic mail Web and internet services parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

A BSP/CGM algorithm for the all-substrings longest common subsequence problem

A BSP/CGM algorithm for the all-substrings longest common su...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： C.E.R. Alves E.N. Caceres S.W. Song University São Judas Tadeu Sao Paulo Brazil University Federal Mato Grosso do Sul Campo Grande Brazil Universidade de Sáo Paulo Sao Paulo Brazil

Given two strings X and Y of lengths m and n, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to X and any substring of Y. The sequential algorithm takes O(mn) time and O(n) space. We present a parallel algorithm for ALCS on a coarse-grained multicomputer (BSP/CGM) model with p < /spl radic/m processors that takes O(mn/p) time and O(n/spl radic/m) space per processor, with O(log p) communication rounds. The proposed parallel algorithm also solves the well-known LCS problem. To our knowledge this is the best BSP/CGM algorithm for the ALCS problem in the literature.

关键词： User-generated content Automatic logic units Character generation parallel algorithms Chromium Phase change random access memory DNA Sequences Data compression Pattern matching

来源：评论

学校读者我要写书评

暂无评论

Unions of slices are not slices

Unions of slices are not slices

引用

(CSMR) European Conference on Software Maintenance and Reengineering

作者： A. De Lucia M. Harman R. Hierons J. Krinke Research Centre on Software Technology University of Sannio Italy Department of Information Systems and Computing Brunei University UK Lehrstuhl Softwaresysteme Universität Passau Germany

Many approaches to slicing rely upon the 'fact' that the union of two static slices is a valid slice. It is known that static slices constructed using program dependence graph algorithms are valid slices (Reps and Yang, 1988). However, this is not true for other forms of slicing. For example, it has been established that the union of two dynamic slices is not necessarily a valid dynamic slice (Hall, 1995). In this paper this result is extended to show that the union of two static slices is not necessarily a valid slice, based on Weiser's definition of a (static) slice. We also analyse the properties that make the union of different forms of slices a valid slice.

关键词： Information systems parallel algorithms Application software Software algorithms Software engineering Flow graphs

来源：评论

学校读者我要写书评

暂无评论

A modified FFT-based algorithm for real-time computation of discrete wavelet transform

A modified FFT-based algorithm for real-time computation of ...

引用

IEEE Region 10 International Conference TENCON

作者： V.P. Dinesh Kumar T. Thomas Department of Electronics Cochin University of Science and Technology Cochin Kerala India

In this paper, an efficient FFT-based algorithm is proposed for fast computation of discrete wavelet transform (DWT). By virtue of the Fourier-space operations, significant saving in computational complexity is achieved. The Fourier-domain subsampling results in single IFFT operation at the intermediate level thus reducing the computational burden. The Fourier-domain subsampling and the Hermitian symmetry property of the Fourier-transform of a real function provides significant reduction in overall computations. The comparison of the computational complexity of an FFT-based fast wavelet transform (FWT) algorithm with the proposed algorithm for various cases of decomposition levels and wavelet kernel size is done. We found that the proposed algorithm reduces the number of multiplications per point by 22% and by 35% in the case of additions for 'db8' wavelet at a of five. This gain is of practical interest in computationally intensive applications.

关键词： Discrete wavelet transforms Signal processing algorithms Finite impulse response filter Filter bank Wavelet transforms Computational complexity Kernel Convolution Computer applications parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Mining association rules with linguistic terms

Mining association rules with linguistic terms

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Jianjiang Lu Baowen Xu Lei Xu Dazhou Kang Huowang Chen Hongji Yang Department of Computer Science and Engineering South-East University Nanjing China PLA University of Science and Technology Nanjing China Jiangsu Institute of Software Quality Nanjing China School of Computer Science National University of Defense Technology Changsha China School of Computing De Montfort University Leicester UK

ISBN: (纸本)0769520383

Some problems of mining association rules with linguistic terms are discussed. First, an incremental updating algorithm of association rules with linguistic terms is presented. The collection of frequent linguistic attribute sets and its negative border along with their support count are maintained, which makes scan the entire database once at most in the process of updating association rules. The experiment shows that the updating algorithm can not only update association rules effectively but also avoid the repeated cost. Secondly, the parallel algorithm for mining association rules with linguistic terms is presented. The Boolean parallel mining algorithm is improved to discover frequent linguistic attribute sets, and the association rules with at least confidence are generated on all processors. This parallel mining algorithm has fine scale-up, size-up and speed-up.

关键词： Data mining Association rules Partitioning algorithms Fuzzy sets Computer science Educational technology Laboratories Costs parallel algorithms Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

FPGA implementation of CPFSK modulation techniques for HF data communication

FPGA implementation of CPFSK modulation techniques for HF da...

引用

Asia-Pacific Conference on Communications

作者： F.D. Jaswar A.Z. Sha'ameri Faculty of Elect. Engr. Universiti Teknologi Malaysia Skudai Malaysia Digital Signal Process. Lab Univ. Teknologi Malaysia Skudai Malaysia

Digital modulation based on FSK is widely used in HF data communication. This is due to simplicity in implementation by noncoherent detection and robustness due noise and phase synchronization error. Hardware based design using FPGA can reduced system size. The proposed modulation integrates both the transmitter and receiver modules into a single FPGA. Further reduction in components is achieved by adopting a multiplierless and parallel algorithm at the receiver module. This is proven by comparing with conventional noncoherent detection algorithm.

关键词： Field programmable gate arrays Data communication Digital modulation Frequency shift keying Phase detection Noise robustness Phase noise Hardware Transmitters parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallelization of subdomain methods with overlapping for linear and nonlinear convection-diffusion problems

Parallelization of subdomain methods with overlapping for li...

引用

Euromicro Conference on parallel, Distributed and Network-Based Processing

作者： P. Spiteri R. Guivarch D. El Baz Chau Ming ENSEEIHT-LIMA-IRIT Toulouse France L.A.A.S. du C.N.R.S. Toulouse France

Linear and nonlinear convection-diffusion problems are considered. The numerical solution of these problems via the Schwarz alternating method is studied A new class of parallel asynchronous iterative methods with flexible communication is applied. The implementation of parallel asynchronous and synchronous algorithms on distributed memory multiprocessors is described. Experimental results obtained on an IBM SP2 by using PVM are presented and analyzed. The interest of asynchronous iterative methods with flexible communication is clearly shown.

关键词： Iterative algorithms Iterative methods Context Boundary value problems Finance Large-scale systems Nonlinear equations parallel algorithms Communication standards Convergence

来源：评论

学校读者我要写书评

暂无评论

Adaptive 3D beamforming for ultrasound systems deploying linear and planar phased array probes

Adaptive 3D beamforming for ultrasound systems deploying lin...

引用

IEEE Symposium (IUS) Ultrasonics

作者： A. Dhanantwari S. Stergiopoulos C. Parodi F. Bertora P. Pellegretti A. Questa CANAMET Inc. Toronto ONT Canada Department of Biophysical and Electronic Engineering University of Genoa Italy Esaote S.p.A. Genoa Italy

The present work is part of the European Commission project ADUMS (IST-2001-34088) aimed at developing a fully digital 4D ultrasound system for medical imaging applications. The system is based on adaptive beamforming, which provides better resolution with respect to conventional beamforming. The parallel algorithm adopted allows for decomposing the planar array beamforming into two linear steps, and for implementation on a parallel computing architecture. The present paper describes the testing results of our adaptive beamforming structure, on both simulated and real data. Comparisons with conventional beamforming, under the same operating conditions are also shown.

关键词： Phased arrays Array signal processing Ultrasonic imaging Adaptive arrays Probes Biomedical imaging parallel algorithms Planar arrays parallel processing Computer architecture

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 481 482 483 484 485 486 487 488 489 490 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：