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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,157 篇 会议
72 篇 期刊文献
65 册 图书

馆藏范围

3,293 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

2,338 篇 工学
- 2,058 篇 计算机科学与技术...
- 1,036 篇 软件工程
- 414 篇 电气工程
- 326 篇 信息与通信工程
- 310 篇 电子科学与技术（可...
- 112 篇 控制科学与工程
- 69 篇 机械工程
- 67 篇 光学工程
- 67 篇 生物工程
- 62 篇 生物医学工程（可授...
- 35 篇 动力工程及工程热...
- 33 篇 仪器科学与技术
- 32 篇 建筑学
- 30 篇 材料科学与工程（可...
- 29 篇 化学工程与技术
- 25 篇 土木工程
- 21 篇 力学（可授工学、理...
721 篇 理学
- 482 篇 数学
- 174 篇 物理学
- 79 篇 生物学
- 65 篇 系统科学
- 60 篇 统计学（可授理学、...
- 36 篇 化学
246 篇 管理学
- 158 篇 管理科学与工程(可...
- 102 篇 图书情报与档案管...
- 70 篇 工商管理
63 篇 医学
- 53 篇 临床医学
- 21 篇 基础医学(可授医学...
22 篇 农学
- 19 篇 作物学
21 篇 法学
- 19 篇 社会学
15 篇 经济学
12 篇 文学
11 篇 教育学
4 篇 军事学

主题

327 篇 parallel process...
204 篇 graphics process...
203 篇 computer archite...
157 篇 parallel archite...
136 篇 parallel process...
123 篇 parallel algorit...
121 篇 graphics process...
115 篇 hardware
113 篇 image processing
86 篇 concurrent compu...
86 篇 computational mo...
76 篇 signal processin...
72 篇 parallel program...
71 篇 field programmab...
68 篇 instruction sets
68 篇 multicore proces...
67 篇 parallel computi...
65 篇 algorithm design...
58 篇 throughput
57 篇 gpu

机构

9 篇 college of compu...
9 篇 natl univ def te...
8 篇 carleton univ sc...
8 篇 national laborat...
6 篇 hosei univ dept ...
6 篇 inria rennes
6 篇 st francis xavie...
5 篇 chinese acad sci...
5 篇 univ aizu dept c...
5 篇 polish japanese ...
5 篇 computer science...
5 篇 college of compu...
5 篇 city university ...
4 篇 shanghai jiao to...
4 篇 charles univ pra...
4 篇 rwth aachen univ...
4 篇 hainan internati...
4 篇 department of co...
4 篇 university of ch...
4 篇 universidad carl...

作者

11 篇 jack dongarra
10 篇 roman wyrzykowsk...
8 篇 dongarra jack
7 篇 liu jie
7 篇 konrad karczewsk...
7 篇 quintana-orti en...
6 篇 hannig frank
6 篇 li dongsheng
6 篇 teich juergen
6 篇 li chao
6 篇 nakano koji
6 篇 peng shietung
6 篇 li yamin
6 篇 chu wanming
6 篇 krulis martin
5 篇 zhang lei
5 篇 ito yasuaki
5 篇 li kenli
5 篇 wanlei zhou
5 篇 tudruj marek

语言

3,230 篇 英文
53 篇 其他
15 篇 中文

检索条件"任意字段=5th International Conference on Algorithms and Architectures for Parallel Processing"

共 3294 条记录，以下是2971-2980 订阅

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

详细简洁

排序：

Practical algorithms for selection on coarse-grained parallel computers

Practical algorithms for selection on coarse-grained paralle...

引用

international Symposium on parallel processing

作者： I. Al-Furaih S. Aluru S. Goil S. Ranka School of Computer and Information Science and Northeast Parallel Architectures Center Syracuse University Syracuse NY USA

In this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for parallel selection. Experimental results on t... 详细信息

关键词： Concurrent computing Distributed computing

来源：评论

学校读者我要写书评

暂无评论

A time- A nd cost-optimal algorithm for overlap graphs, with applications 25

A time- A nd cost-optimal algorithm for overlap graphs, with...

引用

25th international conference on parallel processing, ICPP 1996

作者： Olariu, S. Zomaya, A.Y. Department of Computer Science Old Dominion University Norfolk VA 23529-0162 United States Parallel Computing Research Lab Dept. of Electrical and Electronic Eng Univ. of Western Austialia PerthWA6007 Australia

ISBN: (纸本)081867623X

In varioui practical applications it is convenient to associate a cer I ain graph with a family Z of intervals. One such graph is the well-known overlap graphof Z, whose vertices are the iiitervals in I , with two intervals connected by and edge if imd only if they overlap but neither of them strictly contains the other. the first main contribution of this paper is to propose time- A nd cost-optimal algorithms for computiiig the connected components of an overlap graph. the iask of computing the connected components of an overlap graph arises in numerous applications including traffic control, robot arm manipulation, segmentation of range images, routing, automated surveillance systems, recognizing polygonal configurations, and code generation for parallel niachines. We begin by showing that any sequential algo i ithm that determines the connected components of the overlap graph of a family of n intervals must take Ω(n log n) time in the algebraic tree model. Next, we show that any parallel algorithm for this problem must take Ω(log n) time in the CREW model even if an infinite numbei of processors and meinoiy cells are available. We then go on to show that both the sequential and the parallel lowei bounds are tight by providing matching algorithms running in Θ(n log n) sequential time and Θ(log n) time using n processors in the CREW model, respectively. At the same time, if the endpoints of the intervals are given in sorted ordLi. our sequential algorithm runs in Θ(n)time, improving the best previously known result. It is interesting to note t l i i L t even if the endpoints are sorted, Ω(1og n) is a time lower hound for solving the problem in the CREW model, regaicllrss of the amount of resources available. As an application, we show that our algorithm affords us a time- A nd cost-optimal solution to a restricted version of the single row routing problem. the best previously known result for routing a set of nets without interstreet crossings run5 in O(1og n log l

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

5th international Workshop on Computer Aided Systems theory- EUROCAST 1995

引用

5th international Workshop on Computer Aided Systems theory, EUROCAST 1995

ISBN: (纸本)9783540607489

the proceedings contain 42 papers. the special focus in this conference is on Systems theory and Design Environments and Tools. the topics include: On the structure of discrete systems;identification and recognition through shape in complex systems;a logical approach to system construction;task management system;toward a unified theory of discrete event systems;general systems description and implications;proving system properties by means of trigger-graph and petri nets;refinement mapping for general (discrete event) systems theory;a system-theoretic approach to planning and programming;equality of functions in CAST;basins of attraction estimation through symbolic graphical computing techniques;temporal and functional verification of a symbolic representation of complex systems;modelling differential equations by basic information technology means;system theoretic aspects of software architectures;a language for describing complex-evolutive software systems;an architecture for process modeling and execution support;a formal semantics for a graphical model representation in system design;a user-interface for a microsystems high-level simulator;CAST extensions to DASME to support generalized information theory;symbolic computing aided design of nonlinear PID controllers;discrete event simulation in an environment for temporal expert systems;TOMSPIN - a tool for modeling with stochastic petri nets;hybrid evolutionary programming;automatic induction of DEVS structures;systems engineering and infrastructures for open computer based systems;object-oriented high level modeling of complex systems;multifacetted, object oriented modeling in the transportation domain;a tool environment for the design of complex, real-time systems;systems level specification and modelling of reactive systems and control through deliberative and reactive planning.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Proceedings of SPDP '96: 8th IEEE Symposium on parallel and Distributed processing

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and ...

引用

international conference on Engineering and Technology Management (IEMC)

作者： Qingrui Xu Bin Guo Jin Chen Research Center of Management Science and Strategy Development School of Management University of Zhejiang Hangzhou China

Presents the title page of the proceedings record.

ISBN: (纸本)078033552X

Presents the title page of the proceedings record.

关键词： parallel processing distributed processing multiprocessor interconnection networks graph theory networks routing distributed systems scheduling data mapping parallel architectures graph theory wormhole routing sorting synchronisation I/O load balancing parallel algorithms languages compilers interconnection networks embedding

来源：评论

学校读者我要写书评

暂无评论

A task migration implementation of the Message-Passing Interface

A task migration implementation of the Message-Passing Inter...

引用

international Symposium on High Performance Distributed Computing

作者： J. Robinson S.H. Russ B. Flachs B. Heckel NSF Engineering Research Center for Computatiorial Field Simulation Mississippi State University USA MicroMagnetic Inc. Sunnyvale CA USA

In order to use networks of workstations in parallel processing applications, several schemes have been devised to allow processes on different, possibly heterogeneous, platforms to communicate with one another. the Message-Passing Interface (MPI) is one such scheme that allows for message-passing across different architectures. the MPI specification does not make provisions for the migration of a process between machines. this paper describes the work required to modify, an MPI implementation to allow for task migration. It also describes "Hector", our heterogeneous computing task allocator that is used to migrate tasks automatically and improve the overall performance of a parallel program.

关键词： Workstations Concurrent computing parallel processing parallel programming Computer networks Computational modeling Computer architecture Scientific computing Floating-point arithmetic Distributed computing

来源：评论

学校读者我要写书评

暂无评论

parallel implementation of Bouvka's minimum spanning tree algorithm

Parallel implementation of Bouvka's minimum spanning tree al...

引用

international Symposium on parallel processing

作者： Sun Chung A. Condon Computer Sciences Department University of Wisconsin Madison WI USA

We study parallel algorithms for the minimum spanning tree problem, based on the sequential algorithm of O. Boruvka (1926). the target architectures for our algorithm are asynchronous, distributed-memory machines. Analysis of our parallel algorithm on a simple model that is reminiscent of the LogP model, shows that in principle a speedup proportional to the number of processors can be achieved, but that communication costs can be significant. To reduce these costs, we develop a new randomized linear work pointer jumping scheme that performs better than previous linear work algorithms. We also consider empirically the effects of data imbalance on the running time. For the graphs used in our experiments, load balancing schemes result in little improvement in running times. Our implementations on sparse graphs with 64,000 vertices on thinking Machine's CM-5 achieve a speedup factor of about 4 on 16 processors. On this environment, packaging of messages turns out to be the most effective way to reduce communication costs.

关键词： Costs parallel algorithms Algorithm design and analysis Load management Packaging machines

来源：评论

学校读者我要写书评

暂无评论

parallel architecture dedicated to connected component analysis

Parallel architecture dedicated to connected component analy...

引用

international conference on Pattern Recognition

作者： E. Mozef S. Weber J. Jaber E. Tisserand Laboratoire d'hstrumentation Electronique de Nancy L.I.E.N Université de Nancy France

this paper presents the design of a dedicated parallel architecture for connected component analysis. Categorized in one-dimensional array processors, for an image of n/spl times/n pixels, the proposed architecture has n-1 linear processing elements (PEs), n/sup 2/ CAM memory modules, and a tree structure of (n/2)-1 switches allowing communication through the global bus in O(log n) unit of propagation time. Well suited for low and intermediate-level vision, this architecture allows sequential processing through its line structure which is perfectly adapted to real time image analysis from any interlaced-mode video signal. this paper presents the algorithms for connected component labeling, area and perimeter determination, all of which are in O(n log n). the performance of the proposed architecture is compared with another architecture types. the simulation results, the possibility of implementation, and future work are discussed.

关键词： parallel architectures Pixel Computer aided manufacturing CADCAM Tree data structures Switches Communication switching Image analysis Signal processing Labeling

来源：评论

学校读者我要写书评

暂无评论

Swing module scheduling: a lifetime-sensitive approach

Swing module scheduling: a lifetime-sensitive approach

引用

international conference on parallel Architecture and Compilation Techniques (PACT)

作者： J. Llosa A. Gonzalez E. Ayguade M. Valero Departament d Arquitectura de Computadors Universitat Poliltècnica de Catalunya Barcelona Spain

this paper presents a novel software pipelining approach, which is called Swing Modulo Scheduling (SMS). It generates schedules that are near optimal in terms of initiation interval, register requirements and stage count. Swing Modulo Scheduling is an heuristic approach that has a low computational cost. the paper describes the technique and evaluates it for the Perfect Club benchmark suite. SMS is compared with other heuristic methods showing that it outperforms them in terms of the quality of the obtained schedules and compilation time. SMS is also compared with an integer linear programming approach that generates optimum schedules but with a huge computational cost, which makes it feasible only for very small loops. For a set of small loops, SMS obtained the optimum initiation interval in all the cases and its schedules required only 5% more registers and a 1% higher stage count than the optimum.

关键词： Processor scheduling Pipeline processing Registers Proposals throughput Scheduling algorithm Computational efficiency Integer linear programming parallel processing Iterative algorithms

来源：评论

学校读者我要写书评

暂无评论

An incremental benchmark suite for performance tuning of parallel discrete event simulation

An incremental benchmark suite for performance tuning of par...

引用

Annual Hawaii international conference on System Sciences (HICSS)

作者： R. Ronngren L. Barriga R. Ayani Department of Teleinformatics Royal Institute of Technology Stockholm Sweden

parallel simulation has been an active research area for more than a decade, and several parallel simulation algorithms have been proposed. To evaluate parallel simulation environments, there is a need for a common benchmark suite. Such benchmarks should allow the designer of simulation kernels to: (i) evaluate how efficiently the simulation kernel runs on specific architectures; and (ii) evaluate how simulation problems scale on the kernel. A vast majority of benchmarks suggested in the literature focus on the latter problem. the first requirement is however equally important, as such benchmarks are needed to implement efficient simulation systems. In this report, we advocate an incremental benchmark methodology which is primarily intended for performance tuning. the benchmark suite is based on a small set of ping models with which it is possible to effectively isolate and estimate various overheads, contention and latencies encountered in simulation kernels. the use of the benchmark suite is illustrated by its application to performance tuning and evaluation of a time warp kernel.

关键词： Discrete event simulation Computational modeling Kernel Computer simulation Computer architecture Performance analysis Communication networks parallel processing Delay Application software

来源：评论

学校读者我要写书评

暂无评论

M-array VLSI architecture for order statistic filters

M-array VLSI architecture for order statistic filters

引用

international conference on Acoustics, Speech, and Signal processing (ICASSP)

作者： C.C. Lin C.J. Kuo Department of Electrical Engineering National Chung Cheng University Chiayi Taiwan

the order statistic filter is an important nonlinear filter for many image processing applications. We propose several simplified algorithms for the VLSI implementation of an order statistic filter. Specifically, we propose: (1) a simplified algorithm to reduce the chip area of an order statistic filter; (2) a simplified algorithm using fewer components compared with the Murthy and Swamy's (see IEEE Transactions on Signal processing, vol.40, no.5, p.1241-52, 1992) results to integrate two r-bit order statistic filters into an (r+1)-bit order statistic filter; and (3) a scheme for 2-D order statistic filter implementation. In this scheme a large ROM is replaced by very few logic components. In summary, our schemes reduce the chip area of an order statistic filter because much fewer components are used compared with the Murthy and Swamy's results.

关键词： Very large scale integration Statistics Signal processing algorithms Electronic mail Nonlinear filters Image processing Read only memory Logic Sorting parallel architectures

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共330页 << < 294 295 296 297 298 299 300 301 302 303 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：