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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Neighborhood property of OTIS-mesh optoelectronic computer

Neighborhood property of OTIS-mesh optoelectronic computer

引用

International Symposium on parallel Architectures, algorithms and Networks (ISPAN)

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

It is well known that 4 or 8-neighborhood property has an important role in many algorithms, for example, image processing, solving partial differential equation (PDE) etc. In this paper, we establish these properties on an OTIS-Mesh, an optoelectronic parallel computer. We show that these properties can be established in constant time with the help of a new indexing scheme called processor data index (PDI), proposed in this paper.

关键词： Image processing Concurrent computing parallel algorithms Indexing Optical fiber communication Optical crosstalk Optical interconnections parallel architectures Filtering algorithms GSM

来源：评论

学校读者我要写书评

暂无评论

A hybrid Ling carry-select adder

A hybrid Ling carry-select adder

引用

Asilomar Conference on Signals, Systems & Computers

作者： J. Grad J.E. Stine Department of Electrical and Computer Engineering Illinois Institute of Technology Chicago IL USA

Hybrid adders, combining a sparse carry-lookahead tree and a carry-select output stage are a well-known implementation form of high-speed adders. In this paper, a hybrid Ling carry-select adder is presented. It is shown how a carry-select output stage can be used to eliminate the entire conversion of all pseudo-carries. The adder is implemented in enhanced multiple output domino logic (EMODL). A technique is presented to avoid false discharge paths, which present impairment to EMODL, in the sum selection multiplexer.

关键词： Adders Logic Delay Concurrent computing Multiplexing Signal generators Digital systems parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Translating submachine locality into locality of reference

Translating submachine locality into locality of reference

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： C. Fantozzi A. Pietracaprina G. Pucci Department of Information Engineering University of Padova Padova Italy

Summary form only given. The design of algorithms exhibiting a high degree of temporal and spatial locality of reference is crucial to attain good performance on current and foreseeable computing systems featuring ever deeper memory hierarchies. Previous work has demonstrated that task parallelism can be efficiently transformed into locality of reference in two-level hierarchies. Recently, we moved a step forward and showed how the more structured type of parallelism exposed by submachine locality can be efficiently turned into temporal locality on arbitrarily deep hierarchies. We complete and extend the above result by encompassing also spatial locality. Specifically, we present a scheme to simulate parallel algorithms designed for the decomposable BSP (a BSP variant which captures submachine locality) on the hierarchical memory model with block transfer. The simulation yields good hierarchy-conscious sequential algorithms from parallel ones, and provides evidence of the strict relation between submachine locality in parallel computation and locality of reference (both temporal and spatial) in the hierarchical memory setting.

关键词： Hidden Markov models Computational modeling Random access memory Algorithm design and analysis parallel processing parallel algorithms Concurrent computing Costs Phase change random access memory Design engineering

来源：评论

学校读者我要写书评

暂无评论

A large scale Monte Carlo simulator for cellular microphysiology

A large scale Monte Carlo simulator for cellular microphysio...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： G.T. Balls S.B. Baden T. Kispersky T.M. Bartol T.J. Sejnowski Department of Computer Science and Engineering University of California San Diego La Jolla CA USA Salk Institute La Jolla CA USA

Summary form only given. Biological structures are extremely complex at the cellular level. The MCell project has been highly successful in simulating the microphysiology of systems of modest size, but many larger problems require too much storage and computation time to be simulated on a single workstation. MCell-K, a new parallel variant of MCell, has been implemented using the KeLP framework and is running on NPACl's Blue Horizon. MCell-K not only produces validated results consistent with the serial version of MCell but does so with unprecedented scalability. We have thus found a level of description and a way to simulate cellular systems that can approach the complexity of nature on its own terms. At the heart of MCell is a 3D random walk that models diffusion using a Monte Carlo method. We discuss two challenging issues that arose in parallelizing the diffusion process - detecting time-step termination efficiently and performing parallel diffusion of particles in a biophysically accurate way. We explore the scalability limits of the present parallel algorithm and discuss ways to improve upon these limits.

关键词： Large-scale systems Monte Carlo methods Biological system modeling Computational modeling Scalability Biology computing Workstations Heart Diffusion processes parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

algorithms for the problem of K maximum sums and a VLSI algorithm for the K maximum subarrays problem

Algorithms for the problem of K maximum sums and a VLSI algo...

引用

International Symposium on parallel Architectures, algorithms and Networks (ISPAN)

作者： Sung Eun Bae Tadao Takaoka Department of Computer Science University of Canterbury Christchurch New Zealand

ISBN: (纸本)0769521355

Given an array of positive and negative values, we consider the problem of K maximum sums. When an overlapping property needs to be observed, previous algorithms for the maximum sum are not directly applicable. We designed an O(K * n) algorithm for the K maximum subsequences problem. This was then modified to solve the K maximum subarrays problem in O(K * n/sup 3/) time. Finally, we present a VLSI K maximum subarrays algorithm with O(K * n) steps and a circuit size of O(n/sup 2/), which is cost-optimal in parallelisation of the sequential algorithm.

关键词： Very large scale integration Circuits Phase change random access memory parallel algorithms Computer science Algorithm design and analysis Pattern recognition Image processing Data mining Data analysis

来源：评论

学校读者我要写书评

暂无评论

Efficient simulation of the acyclic DR-Mesh on the LR-Mesh

Efficient simulation of the acyclic DR-Mesh on the LR-Mesh

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： J.A. Fernandez-Zepeda D. Fajardo-Delgado J.A. Cardenas-Haro A.G. Bourgeois Department of Computer Science Center for Scientific Research and Higher Education of Ensenada Ensenada Baja California Mexico Facultad de Ingeniería Universidad Autónoma de Baja California Mexicali Baja California Mexico Department of Computer Science Georgia State University Atlanta GA USA

Summary form only given. We present a simulation of an acyclic n/spl times/n DR-Mesh on an n/spl times/n LR-Mesh. The simulation is efficient in regards to size since both models use the same number of processors. The worst execution time for this simulation is O(n/sup 2/) time, but we demonstrate that its average execution time is O(log n). The existing fastest simulation takes O(log n) time, but it uses an extremely large number of processors. On the other hand, the most efficient simulation in terms of size takes O(log/sup 2/ n) time with O(n/sup 4//log/sup 2/ n) processors. Both of the existing simulations are for the unrestricted DR-Mesh. This paper provides an important step to efficiently simulate the unrestricted DR-Mesh on weaker models such as the R-Mesh and the LR-Mesh.

关键词： Computational modeling Computer architecture Algorithm design and analysis Computer simulation Computer science Concurrent computing Computer science education Topology parallel algorithms Phase change random access memory

来源：评论

学校读者我要写书评

暂无评论

Implementation of PBS/spl ***/LMS algorithm for adaptive filters on FPGA

Implementation of PBS/spl ***/LMS algorithm for adaptive fil...

引用

IEEE Region 10 International Conference TENCON

作者： R.S. Majdar M. Eshghi Electrical & Computer engineering Faculty Shahid Beheshti University Tehran Iran

In this paper the result of implementing the PBS/spl ***/LMS algorithm is reported. Transversal adaptive filters for digital signal processing have traditionally been implemented onto DSP processors due to their ability to perform fast floating-point arithmetic operations. Motorola implemented an adaptive filter on ASICS technology (DSP56300). However, with its growing die size as well as incorporating the embedded digital signal processing blocks, the FPGA devices have become a serious contender in the signal processing market. In this paper an adaptive filter is implemented on 2V1500bg575 (Virtex-II family) and on EPIS25F1020C (Stratix family) FPGA from XiIinx and Altera companies. A comparison with this implementation shows a speed about 10:1 with respect to Motorola ASICS is achieved.

关键词： Adaptive filters Field programmable gate arrays Least squares approximation Signal processing algorithms Digital signal processing Application specific integrated circuits parallel algorithms Transversal filters Error correction Floating-point arithmetic

来源：评论

学校读者我要写书评

暂无评论

Analysis of the operational Petri nets by a distributed system

Analysis of the operational Petri nets by a distributed syst...

引用

International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science

作者： A.G. Karatkevich T. Gratkowski University of Zielona Gora Zielona Gora Poland

In This work a method of dynamic analysis of big operational Petri nets is described. A net is decomposed and its blocks are distributed within a computer network. Each block is simulated independently, and the result... 详细信息

关键词： Petri nets State-space methods Computer networks Computational modeling parallel algorithms Explosions Java Protocols Industrial control Local area networks

来源：评论

学校读者我要写书评

暂无评论

Full quantum mechanical simulation of ultra-small silicon devices in three-dimensions: physics and issues

Full quantum mechanical simulation of ultra-small silicon de...

引用

International Workshop on Computational Electronics

作者： Gilbert Ferry Department of Electrical Engineering and Solid State Electronics Research Arizona State University Tempe AZ USA

The results of a full three-dimensional, ballistic quantum transport model for a quantum wire silicon MOSFET are presented. We use the recursive scattering matrix approach for simulation of the ballistic transport through the device (Gilbert and Ferry). An efficient, three-dimensional, self-consistent quantum simulation technique (Gilbert and Ferry) was utilized with the inclusion of an adaptable non-uniform mesh to optimize the discretization of the solution space. One of the key issues surrounding the use of quantum simulations is the discretization of the solution space, as it is necessary that proper grid selection keep the corresponding energies within the artificially-created bandstructure, even when applying large bias across the device. Should the energies exceed the numerical bandstructure, then errors will result in the output. However, in addition to keeping the solutions physical, the grid must be optimized to reduce the number of grid points in order to hold the computational time, particularly at high bias (/spl sim/ 0.5 V) to acceptable levels. These constraints stipulate the use of a non-uniform mesh with finer grid spacing in the high potential regions. We apply this methodology to the simulation of a quantum wire SOI MOSFET with a narrow channel (8 nm).

关键词： Finite element methods parallel algorithms Linear systems Green function MOSFETs Semiconductor device modeling

来源：评论

学校读者我要写书评

暂无评论

Models for scheduling on large scale platforms: which policy for which application?

Models for scheduling on large scale platforms: which policy...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： P.-F. Dutot L. Eyraud G. Mounie D. Trystram ID-IMAG Montbonnot Saint Martin France

Summary form only given. In recent years, there was a huge development of low cost large scale parallel systems. The design of efficient parallel algorithms has to be reconsidered to take into account new parameters of such execution platforms which are characterized by a larger number of heterogeneous processors, often organized as hierarchical subsystems. Alternative computational models have been designed to take into account these new characteristics. parallel tasks model /spl times/ PT in short - is a promising alternative for scheduling parallel applications. Another way of looking at the problem (which is somehow a dual view) is the divisible load model (DL) where an application is considered as a collection of a large number of elementary - sequential - computing units. These two new views of the problem allow us to consider communications implicitly or to mask them, leading to more tractable problems. This paper, first, presents some approximation algorithms for the PT model with a special emphasis on new execution platforms. We show how to mix these results with the DL model to manage the resources of an actual computational grid of 600 processors.

关键词： Large-scale systems Costs Algorithm design and analysis parallel algorithms Computational modeling Processor scheduling Load modeling Approximation algorithms Resource management Grid computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 459 460 461 462 463 464 465 466 467 468 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：