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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

161 篇 会议
4 篇 期刊文献

馆藏范围

165 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

143 篇 工学
- 133 篇 计算机科学与技术...
- 66 篇 软件工程
- 24 篇 信息与通信工程
- 13 篇 电气工程
- 10 篇 材料科学与工程（可...
- 8 篇 电子科学与技术（可...
- 8 篇 控制科学与工程
- 6 篇 机械工程
- 6 篇 网络空间安全
- 5 篇 农业工程
- 3 篇 力学（可授工学、理...
- 3 篇 建筑学
- 3 篇 生物医学工程（可授...
- 3 篇 生物工程
- 2 篇 土木工程
- 1 篇 光学工程
- 1 篇 仪器科学与技术
- 1 篇 冶金工程
- 1 篇 化学工程与技术
57 篇 理学
- 50 篇 数学
- 7 篇 统计学（可授理学、...
- 5 篇 系统科学
- 3 篇 生物学
- 2 篇 物理学
- 1 篇 化学
14 篇 管理学
- 11 篇 管理科学与工程(可...
- 6 篇 工商管理
- 3 篇 图书情报与档案管...
5 篇 农学
- 5 篇 作物学
1 篇 经济学
- 1 篇 应用经济学
1 篇 医学

主题

11 篇 parallel process...
8 篇 parallel process...
8 篇 distributed comp...
7 篇 concurrent compu...
7 篇 grid computing
6 篇 parallel archite...
6 篇 database systems
4 篇 parallel algorit...
4 篇 application soft...
4 篇 fault tolerance
4 篇 parallel program...
4 篇 computer network...
3 篇 computer systems...
3 篇 high performance...
3 篇 distributed comp...
2 篇 memory managemen...
2 篇 encoding (symbol...
2 篇 merging
2 篇 research and dev...
2 篇 graphics process...

机构

2 篇 hong kong polyte...
2 篇 school of comput...
2 篇 illinois institu...
2 篇 tohoku univ info...
2 篇 tohoku univ grad...
2 篇 department of co...
2 篇 ibm corporation ...
2 篇 louisiana state ...
2 篇 national laborat...
2 篇 department of co...
1 篇 department of el...
1 篇 department of in...
1 篇 school of inform...
1 篇 merit technology...
1 篇 pc2-paderborn ce...
1 篇 nanyang technol ...
1 篇 school of comput...
1 篇 acad sinica inst...
1 篇 computer science...
1 篇 univ politecn ca...

作者

4 篇 zheng wm
2 篇 chang zhi-ming
2 篇 wang cho-li
2 篇 lakshmivarahan s...
2 篇 wojcik zbigniew ...
2 篇 bernard t
2 篇 bui a
2 篇 cao jn
2 篇 shu jw
2 篇 wojcik barbara e...
2 篇 ghafoor arif
2 篇 wang tianqi
2 篇 raad peter e.
2 篇 lau francis c. m...
2 篇 olariu s.
2 篇 jiang yan-huang
2 篇 dhall s.k.
2 篇 yang xue-jun
2 篇 zheng s.q.
1 篇 deen sm

语言

165 篇 英文

检索条件"任意字段=2nd IEEE Symposium on Parallel and Distributed Processing, SPDP 1990"

共 165 条记录，以下是41-50 订阅

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

详细简洁

排序：

Accelerated learning on the connection machine 2

Accelerated learning on the connection machine

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Cook, Diane J. Holder, Lawrence B. Beckman Institute University of Illinois 405 North Mathews UrbanaIL61801 United States

ISBN: (纸本)0818620870

The complexity of most machine learning techniques can be improved by transforming iterative components into their parallel equivalent. Although this parallelization has been considered in theory, few implementations have been performed on existing parallel machines. The parallel architecture of the Connection Machine provides a platform for the implementation and evaluation of parallel learning techniques. The architecture of the Connection Machine is described along with limitations of the language interface that constrain the implementation of learning programs. Connection Machine implementations of two learning programs, Perceptron and AQ, are described, and their computational complexity is compared to that of the corresponding sequential versions using actual runs on the Connection Machine. Techniques for parallelizing ID3 are also analyzed, and the advantages and disadvantages of parallel implementation on the Connection Machine are discussed in the context of machine learning. © 1990 ieee.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

parallel join processing using nonclustered indexes for a shared memory multiprocessor 2

Parallel join processing using nonclustered indexes for a sh...

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Omiecinski, Edward Shonkwiler, Ron College of Computing Georgia Institute of Technology AtlantaGA30332 United States School of Mathematics Georgia Institute of Technology AtlantaGA30332 United States

ISBN: (纸本)0818620870

For a database system executing on a multiprocessor system, performance can be improved by inter-query parallelism as well as by intra-query parallelism. Since database applications tend to be 1/0 bound, it is important to minimize disk accesses, which reduce disk contention and improve performance from the context of interquery parallelism. On the other hand it is important to reduce the overall processing time of a query, which improves performance by intraquery parallelism. In this paper we examine the problem of efficient join processing on a shared memory multiprocessor, when the available access paths that are chosen (by the query optimizer) are nonclustered indexes on the joining attributes. We present two algorithms based on simple heuristics and a third algorithm based on the Monte Carlo optimization technique called simulated annealing. Experiments are performed to compare the various algorithms with an algorithm that recently appeared in the literature. © 1990 ieee.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

A parallel architecture for data compression 2

A parallel architecture for data compression

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Henriques, Selwyn Ranganathan, N. Center for Microelectronics Research Department of Computer Science and Engineering University of South Florida TampaFL33620 United States

ISBN: (纸本)0818620870

In this paper we describe a parallel algorithm and architecture for implementing the LZ technique for data compression. Data compression is the reduction of redundancy in data representation in order to decrease storage and communication costs. The LZ-based compression method is a very powerful technique and gives very high compression efficiency for text as well as image data. The proposed architecture is systolic and uses the principles of pipelining and parallelism in order to obtain high speed and throughput. The order of complexity of the computations is reduced from n2 to n. The data compression hardware can be integrated into real time systems so that data can be compressed and decompressed on-the-fly. The basic processor cell for the systolic array is currently being implemented using CMOS VLSI technology. © 1990 ieee.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

parallel distributed robot navigation in the presence of obstacles 2

Parallel distributed robot navigation in the presence of obs...

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Prafiler, Erwin Milios, Evangelos P.O. Box 2060 UlmD-7900 Germany Department of Computer Science University of Toronto TorontoM5S 1A4 Canada

ISBN: (纸本)0818620870

We present a parallel distributed processing approach to robot navigation and path planning in unknown terrains. The method is based on massively parallel computations in a grid of simple processing elements, called cells. In the course of a relaxation process a potential distribution is created in the grid with exhibits a monotonous slope from a start cell to a cell corresponding to the robot's destination position. A shortest path is determined by means of a gradient descent criterion which settles on the steepest descent in the potential distribution. Like high-level path planning algorithms the approach is capable of planning shortest paths through an arbitrary large-scale terrain on the basis of its current internal map. Unlike these algorithms, the approach is also high responsive to new obstacles encountered in the terrain. Obstacles immediately affect the ongoing relaxation process and cause distortions in the potential distribution which are free of local minima and lead the robot on safe detours around obstacles. © 1990 ieee.

关键词： Relaxation processes

来源：评论

学校读者我要写书评

暂无评论

On linear speedup of a class of neighborhood functions in an array processor 2

On linear speedup of a class of neighborhood functions in an...

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Lee, D.-L. Davis, W.A. Department of Computer Science York University North YorkONM3J 1P3 Canada Department of Computing Science University of Alberta EdmontonABT6G 2H1 Canada

ISBN: (纸本)0818620870

Linear speedup of two-dimensional neighborhood functions requires that the underlying processor perform iterative operations and solve the window border problem simultaneously. The authors illustrate a solution to the window border problem using an array processor that provides conflict-free access and alignment of two types of square block vectors of two-dimensional arrays. They give a parallel algorithm embodying this solution, which can speedup a class of neighborhood functions by a factor directly proportional to the number of processing elements in the array processor. © 1990 ieee.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Fault tolerant distributed computing using atomic send-receive checkpoints 2

Fault tolerant distributed computing using atomic send-recei...

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Wojcik, Zbigniew M. Wojcik, Barbara E. Division of Mathematics University of Texas a T San Antonio Computer Science and Statistics San AntonioTX78285 United States

ISBN: (纸本)0818620870

The paper presents a deadlock free fault recovery algorithm for an entirely distributed system in which the messages do not need to arrive in the order they have been sent. The method is based on the asynchronous, atomic checkpointing of the sender and receiver of a message. Messages not balanced in the last permanent checkpoints are recorded in the new checkpoints. The fault recovery is based on: (a) repetition of all messages lost according to a record of unbalanced messages in the last permanent checkpoints, and on (b) undoing every message re-sent during the fault recovery, or undoing of a computation repeated according to a record of unbalanced messages in the last permanent checkpoints. A fault recovery involves only processes which communicated before a failure. A distributed computation may be split into a few segments without affecting transaction consistency. The algorithm involves the minimum number of messages. Proof of the resilience of the fault recovery algorithm is presented. © 1990 ieee.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

parallel dynamic programming 2

Parallel dynamic programming

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Viswanathan, Venkatraman Huang, Shou-Hsuan Stephen Liu, Hongfei Department of Computer Science University of Houston HoustonTX77204 United States

ISBN: (纸本)0818620870

Recurrence formulations for various problems such as finding an optimal order of matrix multiplication, finding an optimal binary search tree and optimal triangulation of polygons assume a similar form. A CREW PRAM algorithm has been given to solve such dynamic programming problems. The algorithm uses O(n6/log n) processors and runs in O(log2 n)time. A modified algorithm is presented which reduces the processor requirement to O(n6/log5n) while maintaining the same time complexity of O(log2 n). © 1990 ieee.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Multi-level VLSI simulator for general purpose parallel machines 2

Multi-level VLSI simulator for general purpose parallel mach...

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Aposporidis, E. Lohnert, F. Mehring, P. Research Institute Berlin Daimler-Benz AG Alt-Moabit 91b Berlin 21D-1000 Germany

ISBN: (纸本)0818620870

Simulation is a key element in modem and future digital circuit design. However, simulation becomes a bottleneck with increasing design complexity. There are mainly two ways to deal with this problem: reduction of the simulation load through multi-level simulation and acceleration of the simulation through exploitation of parallelism. This paper reports of a new parallel Multi-Level VLSI Simulator (PMLS) for general purpose message-passing parallel machines which combines multi-leveling and exploitation of parallelism at the circuit level. The VLSf simulator is implemented in the ob-ject-oriented language POOL and runs on the parallel DOOM machine. Implementations on iPSC/2 and on a Transputer-Network are in progress. The paper surveys briefly the principles of digital-circuit simulation, the possibilities of exploiting parallelism, and describes the design and implementation of the simulator. Performance figures are also given. © 1990 ieee.

关键词： Simulators

来源：评论

学校读者我要写书评

暂无评论

The maximum weight perfect matching problem for complete weighted graphs is in PC 2

The maximum weight perfect matching problem for complete wei...

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Osiakwan, C.N.K. Akl, S.G. Department of Computing and Information Science Queen's University KingstonONK7L 3N6 Canada

ISBN: (纸本)0818620870

There are efficient sequential algorithms that use linear programming (LP) for computing maximum weight matchings. Finding a deterministic parallel algorithm for computing maximum weight matchings in complete graphs has been an open problem for some time. Since LP is known to be P-complete, then, by the parallel computation thesis, it is unlikely that there exists an NC algorithm that uses LP to solve the maximum weight matching problem. The authors present an LP-based parallel algorithm for maximum weight matching in a complete weighted graph. The algorithm is designed for the EREW PRAM model of parallel computation, and runs in O(n3/p+n2logn) time for p3) sequential LP-based solution of Gabow (1974) or Lawler (1976), for p © 1990 ieee.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel time complexity of a heuristic algorithm for the k-center problem with usage weights 2

Parallel time complexity of a heuristic algorithm for the k-...

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Wang, Qingzhou Cheng, Kam Hoi Department of Computer Science University of Houston HoustonTX77204-3475 United States

ISBN: (纸本)0818620870

In this paper we analyze the parallel time-complexity of a heuristic algorithm for solving the NP-hard k-center problem with usage weights. The problem is to choose k vertices as service centers so that the maximum weighted service delivery distance to any vertex is minimized. The algorithm uses a greedy strategy to choose the vertex with maximum usage weights as the next service vertex. It generates results that are guaranteed to be no greater than twice the optimal solution values, which is the best possible polynomial time heuristic unless P=NP, and its uniprocessor time complexity is O(n3). The authors show that the algorithm may be implemented on a multiprocessor system in O(n log2 n) time, where n is the total number of vertices. They further show that even with unlimited parallelism, this algorithm will have higher than polylogarithmic time complexity unless polylogspace=P. © 1990 ieee.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共17页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：