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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

41 篇 会议
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

26 篇 理学
- 20 篇 数学
- 7 篇 物理学
- 2 篇 统计学（可授理学、...
- 1 篇 天文学
- 1 篇 地球物理学
22 篇 工学
- 19 篇 计算机科学与技术...
- 14 篇 软件工程
- 2 篇 控制科学与工程
- 2 篇 交通运输工程
- 1 篇 信息与通信工程
- 1 篇 核科学与技术
2 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...

主题

10 篇 concurrent compu...
5 篇 postal services
5 篇 parallel program...
4 篇 costs
4 篇 cost function
4 篇 geometry
3 篇 parallel machine...
3 篇 navigation
3 篇 vehicles
2 篇 computer simulat...
2 篇 parallel algorit...
2 篇 parallel process...
2 篇 lattices
2 篇 space vehicles
2 篇 motion planning
2 篇 target tracking
2 篇 remotely operate...
2 篇 program processo...
2 篇 computational mo...
2 篇 numerical simula...

机构

9 篇 caltech concurre...
7 篇 caltech concurre...
5 篇 caltech concurre...
4 篇 caltech concurre...
2 篇 caltech concurre...
2 篇 caltech concurre...
1 篇 caltech concurre...
1 篇 nrcn
1 篇 caltech concurre...
1 篇 caltech concurre...
1 篇 northeast parall...
1 篇 ece dept univers...
1 篇 caltech concurre...
1 篇 parasoft corpora...
1 篇 caltech concurre...
1 篇 caltech concurre...
1 篇 caltech concurre...
1 篇 180-500 jet prop...
1 篇 dept. of compute...
1 篇 caltech concurre...

作者

6 篇 g. fox
5 篇 fox geoffrey
5 篇 e. gurewitz
5 篇 yiu-fai wong
4 篇 felten edward w.
4 篇 fox geoffrey c.
4 篇 gurewitz eitan
3 篇 gurewitz e.
3 篇 otto steve w.
3 篇 c.f. baillie
3 篇 fox g.c.
3 篇 fox g.
2 篇 wong yiu-fai
2 篇 g.c. fox
2 篇 walker david w.
2 篇 k. rose
2 篇 kolawa a.
2 篇 rose kenneth
2 篇 baillie c.f.
2 篇 furmanski wojtek

语言

47 篇 英文

检索条件"机构=Caltech Concurrent Computation Program"

共 47 条记录，以下是11-20 订阅

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

详细简洁

排序：

Optimal matrix algorithms on homogeneous hypercubes 3

Optimal matrix algorithms on homogeneous hypercubes

引用

3rd Conference on Hypercube concurrent Computers and Applications, C3P 1988

作者： Fox, Geoffrey C. Furmanski, Wojtek Walker, David W. Caltech Concurrent Computation Program California Institute of Technology 206-49 PasadenaCA91125 United States

ISBN: (纸本)0897912780

This paper describes a set of concurrent algorithms for matrix algebra, based on a library of collective communication routines for the hypercube. We show how a systematic application of scattering reduces load imbalance. A number of examples are considered (Gaussian elimination, Gauss-Jordan matrix inversion, the power method for eigenvectors, and tridiagonalisation by Householder's method), and the concurrent efficiencies are discussed. © ACM 1988 0-89791-278-0/88/0007/1592.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Chess on a hypercube 3

Chess on a hypercube

引用

3rd Conference on Hypercube concurrent Computers and Applications, C3P 1988

作者： Felten, Edward W. Otto, Steve W. Caltech Concurrent Computation Program California Institute of Technology 206-49 PasadenaCA91125 United States

ISBN: (纸本)0897912780

We report our progress on computer chess last described at the Second Conference on Kypercubes. Our program follows the strategy of currently successful sequential chess programs: searching of an alpha-beta pruned game tree, iterative deepening, transposition and history tables, specialised endgame evaluators, and so on. The search tree is decomposed onto the hypercube (an NCUBE) using a recursive version of the principal-variationsplitting algorithm. Roughly speaking, subtrees are searched by teams of processors in a self-scheduled manner. A crucial feature of the program is the global hashtable. Hashtables are important in the sequential case, but are even more central for a parallel chess algorithm. The table not only stores knowledge but also makes the decision at each node of the chess tree whether to stay sequential OI to split up the work in parallel. In the language of Knuth and Moore, the transposition table decides whether each node of the chess tree is a type 2 or a type 3 node and acts accordingly. For this data structure the hypercube is used as a shared-memory machine. Multiple writes to the same location are resolved using a priority system which decides which entry is of more value to the program. The hashtable is implemented as "smart" shared memory. Search times for related subtrees vary widely (up to a factor of 100) so dynamic reconfiguration of processors is necessary to concentrate on such "hot spots" in the tree. A first version of the pro- gram with dynamic load balancing has recently been completed and out-performs the non-load-balancing program by a factor of three. The current speedup of the program is 101 out of a possible 256 processors. The program has played in several tournaments, facing both computers and people. Most recently it scored 2-2 in the ACM North American Computer Chess Championship. © ACM 1988.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Collective stereopsis on the hypercube 3

Collective stereopsis on the hypercube

引用

3rd Conference on Hypercube concurrent Computers and Applications, C3P 1988

作者： Battiti, Roberto Caltech Concurrent Computation Program California Institute of Technology 158-79 PasadenaCA91125 United States

ISBN: (纸本)0897912780

A cooperative algorithm for extracting disparity information from stereo image pairs has been implemented on the NCUBE hypercube computer. Software is written in C-Iangauge, using communication routines of the "Crystalline Operating System" CrOSIIIdesigned at caltech within the caltech concurrent computation program. Some tests have been done using Julesz's random-dot stereograms. Although the software is reasonably versatile and can be easily adapted for different flavours of stereo algorithms, the method used is that presented by Marr and Poggio [REF.l]. As a preliminary stage for the stereo matching problem, a "filtering" program to extract physically meaningful primitives from images of a given scene has been written and tested on various types of images. © ACM 1988.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

A safe vertex 3

A safe vertex

引用

3rd Conference on Hypercube concurrent Computers and Applications, C3P 1988

作者： Felten, Edward W. Otto, Steve W. Caltech Concurrent Computation Program California Institute of Technology 206-49 PasadenaCA91125 United States

ISBN: (纸本)0897912780

The VERTEX message passing system provided with NCUBE hypercubes is unsafe. The system can fail under high message loads. We have implemented a message passing system with the same "look and feel" as VERTEX but which is instead based upon the crystal-trouter running at clock interrupt time. The system is written mostly in C with a few bits of assembly code to run the DMA devices. This implies that safety checks (are the buffers full?) and complex error handling mechanisms can be easily implemented at the C level. A first version works, is safe, and is faster than VERTEX in the high volume limit, slower in the low volume case. At the very least, this system will be interesting for high message traffic applications, such as disk backup.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Coherent parallel C 3

Coherent parallel C

引用

3rd Conference on Hypercube concurrent Computers and Applications, C3P 1988

作者： Felten, Edward W. Otto, Steve W. Caltech Concurrent Computation Program California Institute of Technology 206-49 PasadenaCA91125 United States

ISBN: (纸本)0897912780

Coherent Parallel C (CPC) is an extension of C foi parallelism. The extensions are not simply parallel for loops;instead, a data parallel programming model is adopted. This means that one has an entire process for each data object. An example of an "object" is one mesh point in a finite element solver. How the processes are actually distributed on a parallel machine is transparent- the user is to imagine that an entire processor in a distributed-memory environment is dedicated to each process. This simplifies programming tremendously: complex if statements associated with domain boundaries disappear;problems which do not exactly match the machine size and irregular boundaries are all handled transparently. The usual communication calls are not seen at all at the user level. Variables of other processes (which may or may not be on another processor) are merely accessed (global memory). The first pass of the CPC compiler schedules the necessary communications in an efficient, coherent manner. Processes in CPC are insulated from one another and interact in a deterministic manner. This allows tractable debugging. Standard C I/O is provided, with simple extensions for parallelism. We currently have a CPC runtime system implemented on an NCUBE and have started implementing a true compiler for the language. CPC is not specific to distributed memory machines. Implementation of this language on other architectures is natural-for example, there seems to be no fundamental problem with CPC on shared-memory parallel computers.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Generalized signals: An interrupt-based communication system for hypercubes 3

Generalized signals: An interrupt-based communication system...

引用

3rd Conference on Hypercube concurrent Computers and Applications, C3P 1988

作者： Edward, W. Felten Caltech Concurrent Computation Program California Institute of Technology 206-49 PasadenaCA91125 United States

ISBN: (纸本)0897912780

This paper describes a communication system designed to support highly asynchronous application or system software on a distributed-memory multicomputer such as a hypercube. The system is called generalized signals because it is based on the signal facility in System V UNIX, with enhancements to allow signals to carry data. Any processor can send a signal to any other processor at any time. When a signal arrives, the receiving processor traps to a user-specified subroutine;when this subroutine is finished the interrupted code is resumed. Signal interrupts happen in a controlled manner, thereby simplifying the programmer's task. There is a facility for protection of critical sections in user programs. The generalized signals system has been implemented on the NCUBE hypercube. This implementation is based on a modified version of NCUBE's VERTEX message-passing system. Generalized signals can coexist with VERTEX messages and the enhancements to VERTEX are transparent to ordinary programs.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Performance of a QCD code on the NCUBE hypercube 3

Performance of a QCD code on the NCUBE hypercube

引用

3rd Conference on Hypercube concurrent Computers and Applications, C3P 1988

作者： Walker, David W. Caltech Concurrent Computation Program California Institute of Technology PasadenaCA206-49 91125 United States

ISBN: (纸本)0897912780

The performance of a puie gauge QCD code on the NCUBE hypercube is analyzed. Both load imbalance and communication contribute to the concurrent overhead, with the load imbalance term becoming dominant for sufficiently large hy-percubes. The performance model is compared with timings measured on the NCUBE using both the standard and fast versions of the CrOS III communication systems. © ACM 1988.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Parallel algorithms for one and two-vehicle navigation

Parallel algorithms for one and two-vehicle navigation

引用

1990 IEEE International Workshop on Intelligent Robots and Systems, IROS 1990

作者： Gurewitz, Eitan Fox, Geoffrey Wong, Yiu-Fai Caltech Concurrent Computation Program California Institute of Technology Mail Code 206-49 PasadenaCA91125 United States

A two vehicle navigator on a descrete space is analyzed. The concept of linking time maps as source to optimal path planning is discussed. The rules for constructing these maps are given in a cellular automata mode. The implementation of these rules on a parallel computer is presented. © 1990 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

A nonconvex cost optimization approach to tracking multiple targets by a parallel computational network 5

A nonconvex cost optimization approach to tracking multiple ...

引用

5th Distributed Memory Computing Conference, DMCC 1990

作者： Rose, K. Gurewitz, E. Fox, G. Caltech Concurrent Computation Program California Institute of Technology Mail Stop 206-49 PasadenaCA91125 United States

ISBN: (纸本)0818621133

The problem of *** multiple targets in the presence of displacement noise and clutter is formulated as a nonconvex optimization problem. The form of the suggested cost function is shown to be suitable for the Graduated Non-Convexity algorithm, which can be viewed as deterministic annealing. The mc :hod is first derived for the two-dimensional (s latial/ temporal) case, and then generalized to the multidimensional case. The complexity grows linearly with the number of targets. Computer simulations show the performance with crossing trajectories. © 1990 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

A string theory for time dependent complex systems and its application to automatic decomposition 3

A string theory for time dependent complex systems and its a...

引用

3rd Conference on Hypercube concurrent Computers and Applications, C3P 1988

作者： Fox, Geoffrey C. Furmanski, Wojtek Caltech Concurrent Computation Program California Institute of Technology Mail Code 158-79 PasadenaCA91125 United States

ISBN: (纸本)0897912780

We introduce a string or world line formalism that provides a general description of time dependent complex systems. We show that it can be applied to mapping general problems onto both sequential and parallel computers. In principle it unifies the concepts of an optimizing compiler with that of parallel decomposition. We show that it reproduces and smoothly interpolates both our original load balancing methods for loosely synchronous problems and optimal communication and combining algorithms such as index and fold. We evaluate two explicit implementations, the neural-router and neural-accumulator, which use an optimizing neural network.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共5页 << < 1 2 3 4 5 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：