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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,404 篇 会议
126 篇 期刊文献
6 册 图书

馆藏范围

3,536 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,759 篇 工学
- 2,601 篇 计算机科学与技术...
- 1,584 篇 软件工程
- 533 篇 信息与通信工程
- 427 篇 电气工程
- 267 篇 控制科学与工程
- 188 篇 电子科学与技术（可...
- 174 篇 网络空间安全
- 44 篇 机械工程
- 43 篇 生物医学工程（可授...
- 37 篇 动力工程及工程热...
- 31 篇 生物工程
- 28 篇 力学（可授工学、理...
- 26 篇 建筑学
- 23 篇 安全科学与工程
- 22 篇 材料科学与工程（可...
- 21 篇 化学工程与技术
- 20 篇 仪器科学与技术
- 19 篇 土木工程
- 19 篇 交通运输工程
1,100 篇 理学
- 982 篇 数学
- 135 篇 统计学（可授理学、...
- 98 篇 物理学
- 72 篇 系统科学
- 38 篇 生物学
- 26 篇 化学
420 篇 管理学
- 326 篇 管理科学与工程(可...
- 202 篇 工商管理
- 121 篇 图书情报与档案管...
37 篇 经济学
- 37 篇 应用经济学
27 篇 法学
- 26 篇 社会学
20 篇 医学
15 篇 农学
12 篇 教育学
3 篇 文学
1 篇 军事学
1 篇 艺术学

主题

494 篇 parallel process...
276 篇 distributed comp...
216 篇 parallel process...
195 篇 distributed comp...
178 篇 concurrent compu...
170 篇 parallel algorit...
167 篇 computer science
117 篇 application soft...
112 篇 computer archite...
89 篇 parallel program...
89 篇 hardware
80 篇 computational mo...
76 篇 computer network...
72 篇 costs
72 篇 algorithm design...
65 篇 processor schedu...
64 篇 delay
55 篇 grid computing
49 篇 fault tolerance
48 篇 scalability

机构

12 篇 syracuse univ sy...
12 篇 pacific northwes...
11 篇 georgia inst of ...
9 篇 new jersey inst ...
9 篇 univ of maryland...
9 篇 national laborat...
8 篇 univ of californ...
8 篇 michigan state u...
8 篇 univ ottawa site...
7 篇 texas a&m univ c...
7 篇 ibm thomas j. wa...
7 篇 purdue univ west...
7 篇 ieee
6 篇 carleton univ sc...
6 篇 school of comput...
6 篇 shanghai jiao to...
6 篇 univ of minnesot...
6 篇 univ of central ...
6 篇 univ of illinois...
6 篇 carleton univ ot...

作者

15 篇 boukerche azzedi...
13 篇 bader david a.
11 篇 das sajal k.
9 篇 ranka sanjay
9 篇 li keqin
8 篇 sohn andrew
7 篇 panda dhabaleswa...
7 篇 prasanna viktor ...
7 篇 choudhary alok
7 篇 sato mitsuhisa
6 篇 taura kenjiro
6 篇 ibarra oscar h.
6 篇 zomaya albert y.
6 篇 yang laurence t.
6 篇 welch lonnie r.
6 篇 zhang xiaodong
6 篇 cristea valentin
6 篇 nakano koji
6 篇 sun xian-he
6 篇 boukerche a

语言

3,522 篇 英文
12 篇 其他
2 篇 中文

检索条件"任意字段=Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing"

共 3536 条记录，以下是3271-3280 订阅

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

详细简洁

排序：

Fast deterministic approximate and exact parallel sorting 93

Fast deterministic approximate and exact parallel sorting

引用

proceedings of the 5th Annual ACM symposium on parallel Algorithms and Architectures

作者： Hagerup, Torben Max-Planck-Institut Für Informatik Im Stadtwald Saarbrücken W-6600 Germany UMIACS University of Maryland College Park 20742 MD United States

ISBN: (纸本)0897915992

Padded sorting requires n input keys to be output in sorted order in an array with slightly more than n locations, unused locations being filled with a special null value. We show that a deterministic CRCW PRAM with kn processors can padded-sort n keys in f(loglog kf 2(1s-ls=+l) time, for any k with 4 < k < n, which is close to a known lower bound of Q(logn/log k). As a consequence, we are able to improve the best previous result on deterministic sublog-arithmic standard sorting. Other results include deterministic algorithms with optimal speedup for approximate prefix summation and for padded-sorting independent uniformly distributed random variables. In the first case the running time is O((loglogn)4/logloglogn), and in the second case the average running time is 0((logloglogn)4/log)n). © 1993 ACM.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Analysis of cost error in parallel simulated annealing

Analysis of cost error in parallel simulated annealing

引用

proceedings of the 5th International Conference on Tools with Artificial Intelligence TAI '93

作者： Hong, Chul-Eui Chung, II-Yong Ahn, Hee-II Computer H/W Section Daejon Korea Republic of

ISBN: (纸本)0818642009

Simulated annealing is a powerful and general algorithm for solving combinatorial optimization problems, but takes an extremely long time to execute. the resulting cost error from a reduction of the costly synchronization in distributed memory multicomputers is tolerated by the hill climbing nature of simulated annealing. this paper addresses the behavior of algorithms that contain cost error. the new cost error measurement and relaxing synchronization method predicts the amount of cost error that an algorithm will tolerate and still converge. this method also explains three interesting phenomena of the cost error statistically. Finally, this paper applies the new method to the problem composite material stock cutting. Implementation results of the parallel space-decomposition algorithm on Intel iPSC/2 are reported.

关键词： Combinatorial mathematics

来源：评论

学校读者我要写书评

暂无评论

Evaluation of mechanisms for fine-grained parallel programs in the J-Machine and the CM-5

Evaluation of mechanisms for fine-grained parallel programs ...

引用

proceedings of the 20th Annual International symposium on Computer Architecture

作者： Spertus, Ellen Goldstein, Seth Copen Schauser, Klaus Erik von Eicken, thorsten Culler, David E. Dalley, William J. MIT Artifical Intelligence Lab Cambridge MA United States

ISBN: (纸本)0818638109

this paper uses an abstract machine approach to compare the mechanisms of two parallel machines: the J-Machine and the CM-5. High-level parallel programs are translated by a single optimizing compiler to a fine-grained abstract parallel machine, TAM. A final compilation step is unique to each machine and optimizes for specifics of the architecture. By determining the cost of the primitives and weighting them by their dynamic frequency in parallel programs, we quantify the effectiveness of the following mechanisms individually and in combination. Efficient processor/network coupling proves valuable. Message dispatch is found to be less valuable without atomic operations that allow the scheduling levels to cooperate. Multiple hardware contexts are of small value when the contexts cooperate and the compiler can partition the register set. Tagged memory provides little gain. Finally, the performance of the overall system is strongly influenced by the performance of the memory system and the frequency of control operations.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel algorithm for the single function coarsest partition problem 93

An efficient parallel algorithm for the single function coar...

引用

5th Annual ACM symposium on parallel Algorithms and Architectures, SPAA 1993

作者： JáJá, Joseph F. Ryu, Kwan Woo Department of Electrical Engineering Institute for Systems Research Korea Republic of Department of Computer Engineering Kyungpook National University Daegu Korea Republic of Institute for Advanced Computer Studies University of Maryland College ParkMD20742 United States

ISBN: (纸本)0897915992

We describe an efficient parallel algorithm to solve the single function coarsest partition problem. the algorithm runs in O(logn) time using 0(n log log n) operations on the Arbitrary CRCW PRAM. the previous best known algorithm runs in 0(log2 n) time using 0(n log2 n) operations on the CREW PRAM. Another algorithm developed independently of ours runs in O(logn) time using 0(n log n) operations on the Arbitrary CRCW PRAM. Our solution is based on efficient algorithms for solving several subproblems that are of independent interest. In particular, we present efficient parallel algorithms to find a minimal starting point of a circular string with respect to lexicographic ordering and to sort lexicographically a list of strings of different lengths. © 1993 ACM.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel storage and retrieval of pixmap images

Parallel storage and retrieval of pixmap images

引用

proceedings of the 12th ieee symposium on Mass Storage Systems

作者： Hersch, Roger D. Ecole Polytechnique Federale de Lausanne Lausanne Switzerland

ISBN: (纸本)081863460X

Professionals in various fields such as medical imaging, biology and civil engineering require rapid access to huge amounts of uncompressed pixmap image data. To fulfill these requirements, a parallel image server architecture is proposed, based on arrays of intelligent disk nodes, with each disk node composed of one processor and one disk. this contribution shows how images can be partitioned into extents and efficiently distributed among available intelligent disk nodes. the image server's performance is analyzed according to various parameters such as the number of cooperating disk nodes, the sizes of image file extents, the available communication throughput and the processing power of disk node and image server processors. Important image access speed improvements are obtained by image extent caching and image part extraction in disk nodes. With T800 transputer-based technology, a system composed of eight disk nodes offers access to three full-color 512×512 pixmap image parts per second (2.4 megabytes per second). For the same configuration but with the recently announced T9000 transputer, image access throughput is eight images per second (6.8 megabytes per second).

关键词： Information retrieval systems

来源：评论

学校读者我要写书评

暂无评论

Deterministic distribution sort in shared and distributed memory multiprocessors 93

Deterministic distribution sort in shared and distributed me...

引用

proceedings of the 5th Annual ACM symposium on parallel Algorithms and Architectures

作者： Nodine, Mark H. Vitter, Jeffrey Scott Motorola Cambridge Res. Ctr. Bldg. 200 One Kendall Square Cambridge 02139 MA United States Dept. of Computer Science Duke University Box 90129 Durham 27708-0129 NC United States

ISBN: (纸本)0897915992

We present an elegant deterministic load balancing strategy for distribution sort that is applicable to a wide variety of parallel disks and parallel memory hierarchies with both single and parallel processors. the simplest application of the strategy is an optimal deterministic algorithm for external sorting with multiple disks and parallel processors. In each input/output (I/O) operation, each of the D > 1 disks can simultaneously transfer a block of B contiguous records. Our two measures of performance are the number of I/Os and the amount of work done by the CPU(s);our algorithm is simultaneously optimal for both measures. We also show how to sort deterministically in parallel memory hierarchies. When the processors are interconnected by any sort of a PRAM, our algorithms are optimal for all parallel memory hierarchies;when the interconnection network is a hypercube, our algorithms are either optimal or best-known. © 1993 ACM.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

5th International symposium on Programming Language Implementation and Logic Programming, PLILP 1993

5th International Symposium on Programming Language Implemen...

引用

5th International symposium on Programming Language Implementation and Logic Programming, PLILP 1993

ISBN: (纸本)9783540571865

the proceedings contain 33 papers. the special focus in this conference is on Programming Language Implementation and Logic Programming. the topics include: Executable specifications for language implementation;avoiding dynamic delays in functional logic programs;a debugging model for functional logic programs;a conservative approach to meta-programming in constraint logic programming;the versatility of handling disjunctions as constraints;improvements in compile-time analysis for ground prolog;a new top-down parsing algorithm for left-recursive DCGs;specification and implementation of grammar couplings using attribute grammars;programming language specification and prototyping using the MAX system;flang and its implementation;efficient lazy narrowing using demandedness analysis;a demand driven computation strategy for lazy narrowing;functional programming languages with logical variables: a linear logic view;objects with state in contextual logic programming;a novel method for parallel implementation of findall;a parallel implementation for AKL;inlining to reduce stack space;a WAM-based implementation of a logic language with sets;executing bounded quantifications on shared memory multiprocessors;a lattice of abstract graphs;higher-order chaotic iteration sequences;proving the correctness of compiler optimisations based on strictness analysis;abstract complexity of prolog based on WAM;development of rewriting strategies;narrowing approximations as an optimization for equational logic programs;a back end generator;selflog: language and implementation;embedding declarative subprograms into imperative constructs;stack management of runtime structures in distributed implementations and efficient register allocation for large basic blocks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A data distributed, parallel algorithm for ray-traced volume rendering

A data distributed, parallel algorithm for ray-traced volume...

引用

parallel Rendering symposium

作者： K.-L. Ma J.S. Painter C.D. Hansen M.F. Krogh NASA Langley Research Center ICASE Hampton VA USA Department of Computer Science University of Utah Salt Lake UT USA Advanced Computing Laboratory Los Alamos NM USA

this paper presents a divide-and-conquer ray-traced volume rendering algorithm and a parallel image compositing method, along with their implementation and performance on the Connection Machine CM-5, and networked workstations. this algorithm distributes both the data and the computations to individual processing units to achieve fast, high-quality rendering of high-resolution data. the volume data, once distributed, is left intact. the processing nodes perform local raytracing of their subvolume concurrently. No communication between processing units is needed during this locally ray-tracing process. A subimage is generated by each processing unit and the final image is obtained by compositing subimages in the proper order, which can be determined a priori. Test results on the CM-5 and a group of networked workstations demonstrate the practicality of our rendering algorithm and compositing method.

关键词： parallel algorithms Rendering (computer graphics) distributed computing Concurrent computing Data visualization Workstations Laboratories Testing parallel processing Computer graphics

来源：评论

学校读者我要写书评

暂无评论

Integrating volume data analysis and rendering on distributed memory architectures

Integrating volume data analysis and rendering on distribute...

引用

parallel Rendering symposium

作者： E. Camahort I. Chakravarty ABB HV Switchgear AB Austin TX USA AB Volvo Austin TX USA

the ability to generate visual representations of data, and the ability to enhance data into a suitable form for the purpose of visual representation, form two key components in a scientific visualization system. By a visual representation we mean the ability to render the data, using visual cues, such that the important features are readily perceived by the user. By the ability to enhance data we mean the ability to apply transformations to the data so that salient features embedded in the data become discernible and quantifiable. the rendering of data, computer graphics, and the enhancement of data, image processing, have emerged over the last twenty years into separate scientific disciplines. However, in scientific visualization and other applications of empirical data interpretation, we are increasingly confronted with the need to combine both data rendering and data transformation capabilities under one system framework. this paper describes the design issues and implementation of a program for visualizing and enhancing volume data on distributed memory architectures. Our design is motivated by the desire to interactively view, transform, and interpret volume data acquired using seismic imaging techniques. Experimental results derived from an implementation on the Connection Machine CM-5 are described.

关键词： Data analysis Memory architecture Data visualization Rendering (computer graphics) Biomedical imaging Computer graphics Numerical simulation Microwave integrated circuits Computer architecture Laboratories

来源：评论

学校读者我要写书评

暂无评论

proceedings of the 4th ieee symposium on parallel and distributed processing, SPDP 1992

Proceedings of the 4th IEEE Symposium on Parallel and Distri...

引用

4th ieee symposium on parallel and distributed processing, SPDP 1992

ISBN: (纸本)0818632003

the proceedings contain 70 papers. the topics discussed include: software caching on cache-coherent multiprocessors;cache coherent shared memory hypercube multiprocessors;efficient evaluation of arbitrary set-associative caches on multiprocessors;the scalable tree protocol-a cache coherence approach for large-scale multiprocessors;hierarchical shuffle-exchange and de Bruijn networks;efficient networks for realizing point-to-point assignments in parallel processors;a new class of interconnection networks based on alternating group;hyperweave: a fault-tolerant expandable interconnection network;and programming environment for phase-reconfigurable parallel programming on SuperNode.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共354页 << < 324 325 326 327 328 329 330 331 332 333 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：