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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

544 篇 会议
28 篇 期刊文献
16 册 图书

馆藏范围

588 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

415 篇 工学
- 360 篇 计算机科学与技术...
- 303 篇 软件工程
- 44 篇 电气工程
- 41 篇 信息与通信工程
- 34 篇 控制科学与工程
- 16 篇 电子科学与技术（可...
- 14 篇 机械工程
- 8 篇 建筑学
- 8 篇 安全科学与工程
- 7 篇 动力工程及工程热...
- 6 篇 力学（可授工学、理...
- 6 篇 材料科学与工程（可...
- 5 篇 仪器科学与技术
- 4 篇 光学工程
- 4 篇 环境科学与工程（可...
- 4 篇 生物工程
- 3 篇 化学工程与技术
110 篇 理学
- 76 篇 数学
- 15 篇 系统科学
- 12 篇 化学
- 11 篇 物理学
- 8 篇 生物学
- 7 篇 统计学（可授理学、...
68 篇 管理学
- 49 篇 管理科学与工程(可...
- 24 篇 图书情报与档案管...
- 23 篇 工商管理
10 篇 教育学
- 10 篇 教育学
6 篇 经济学
- 6 篇 应用经济学
6 篇 法学
- 6 篇 社会学
4 篇 医学
- 4 篇 临床医学
1 篇 历史学
1 篇 农学
1 篇 艺术学

主题

46 篇 software enginee...
26 篇 distributed comp...
20 篇 application soft...
19 篇 distributed comp...
16 篇 parallel program...
16 篇 software design
15 篇 parallel process...
14 篇 parallel process...
13 篇 concurrent compu...
11 篇 computer communi...
11 篇 computer aided s...
11 篇 software
10 篇 message passing
10 篇 computational mo...
8 篇 information syst...
8 篇 object oriented ...
8 篇 computer network...
7 篇 parallel algorit...
7 篇 computer archite...
7 篇 grid computing

机构

4 篇 rwth aachen univ...
4 篇 universidad carl...
3 篇 vienna universit...
3 篇 tennessee tech u...
3 篇 inria rennes
3 篇 inria rennes - b...
3 篇 tu vienna austri...
3 篇 university magna...
2 篇 universitat jaum...
2 篇 imdea software i...
2 篇 duke univ durham...
2 篇 parallel and dis...
2 篇 department of so...
2 篇 university of na...
2 篇 academic compute...
2 篇 universitat poli...
2 篇 specification of...
2 篇 ibm haifa resear...
2 篇 capgemini munich
2 篇 tu münchen garch...

作者

4 篇 michael alexande...
4 篇 alexandru costan
4 篇 vittorio scarano
4 篇 stephen l. scott
4 篇 laura ricci
3 篇 pflüger dirk
3 篇 dustdar schahram
3 篇 hochstein lorin
3 篇 gabor kecskemeti
3 篇 mario cannataro
3 篇 siegfried benkne...
3 篇 sascha hunold
3 篇 stefan lankes
3 篇 damian daniela
2 篇 parashar m
2 篇 paasivaara maria
2 篇 wang lei
2 篇 marta garcia-gas...
2 篇 sarah neuwirth
2 篇 morris k.

语言

585 篇 英文
2 篇 其他
1 篇 中文

检索条件"任意字段=2nd International Workshop on Software Engineering for Parallel and Distributed Systems"

共 588 条记录，以下是511-520 订阅

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

详细简洁

排序：

Adaptive parallel algorithms for the synthesis of real-time computer systems

Adaptive parallel algorithms for the synthesis of real-time ...

引用

IEEE international Conference on engineering of Complex Computer systems

作者： A. Abualsamid P. Ramanathan Department of Electrical and Computer Engineering University of Wisconsin Madison Madison WI USA

distributed computing systems are widely used in mission-critical real-time applications like missile defense systems, aircraft control and sonar applications. Designing a low cost distributed computing system which satisfies all the stringent requirements of a given application is a difficult problem. This problem can be alleviated using Computer-Aided Synthesis (CAS) tools. Due to the large number of design alternatives, the CAS tools are compute intensive and can take a considerably long time even for medium sized real-time applications. In this paper we describe a set of parallel synthesis algorithms which dynamically adapt to the number of available processors in a parallel computer system to substantially reduce the total turn-around time of the synthesis process.

关键词： parallel algorithms Application software Control system synthesis distributed computing Content addressable storage Mission critical systems Real time systems Missiles Aerospace control Sonar applications

来源：评论

学校读者我要写书评

暂无评论

parallel computations with large atmospheric models 2nd

Parallel computations with large atmospheric models

引用

2nd international workshop on Applied parallel Computing in Computations in Physics, Chemistry and engineering Science, PARA 1995

作者： Zlatev, Z. Dimov, I. Georgiev, K. Waśniewski, J. National Environmental Research Institute Frederiksborgvej 399 P.O. Box 358 RoskildeDK-4000 Denmark Institute of Informatics and Computer Technology Bulgarian Academy of Sciences Akad. G. Bonchev str. Bl. 25-A Sofia1113 Bulgaria Institute of Informatics and Computer Technology Bulgarian Academy of Sciences Akad. G. Bonchev str. Bl. 25-A Sofia1113 Bulgaria DTU Bldg. 304 LyngbyDK-2800 Denmark

ISBN: (纸本)3540609024

Large atmospheric models appear often in important applications. Long-range transport of air pollutants is one of the phenomena that can be studied by using such models. These models lead, after some kind of discretization, to very huge systems of ordinary differential equations (up to order of 10**6). The use of modern parallel and/or vector machines is a necessary condition in the efforts to handle successfully big air pollution models. However, this is often far from sufficient. One should also optimize the code in order to be able to exploit fully the great potential power of the modern high-speed computers. The air pollution code developed at the National Environmental Research Institute has been optimized for several different types of high-speed computers (vector machines, parallel computers with shared memory and parallel computers with distributed memory;including in the last group the massively parallel computers). Results obtained on two computers will be discussed in this paper. The first computer is a vector processor, a CRAY Y-MP C90A computer. The second one is a parallel computer with shared memory, a POWER CHALENGE product of Silicon Graphics. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

Comparison of two image-space subdivision algorithms for direct volume rendering on distributed-memory multicomputers 2nd

Comparison of two image-space subdivision algorithms for dir...

引用

2nd international workshop on Applied parallel Computing in Computations in Physics, Chemistry and engineering Science, PARA 1995

作者： Tanin, Egemen Kurç, Tahsin M. Aykanat, Cevdet Özgüç, Bülent Dept. of Computer Eng. and Information Sci. Bilkent University Bilkent Ankara06533 Turkey

ISBN: (纸本)3540609024

Direct Volume Rendering (DVR) is a powerful technique for visualizing volumetric data sets. However, it involves intensive computations. In addition, most of the volumetric data sets consist of large number of 3D sampling points. Therefore, visualization of such data sets also requires large computer memory space. Hence, DVR is a good candidate for parallelization on distributed-memory multicomputers. In this work, image-space parallelization of Raycasting based DVR for unstructured grids on distributed-memory multicomputers is presented and discussed. In order to visualize unstructured volumetric datasets where grid points of the dataset are irregularly distributed over the 3D space, the underlying algorithms should resolve the point location and view sort problems of the 3D grid points. In this paper, these problems are solved using a Scanline Z-buffer based algorithm. Two image space subdivision heuristics, namely horizontal and recursive rectangular subdivision heuristics, are utilized to distribute the computations evenly among the processors in the rendering phase. The horizontal subdivision algorithm divides the image space into horizontal bands composed of consecutive scanlines. In the recursive subdivision algorithm, the image space is divided into rectangular subregions recursively. The experimental performance evaluation of the horizontal and recursive subdivision algorithms on an IBM SP2 system are presented and discussed. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Volume rendering

来源：评论

学校读者我要写书评

暂无评论

Booster: a WWW-based prototype of the global software highway

Booster: a WWW-based prototype of the global software highwa...

引用

Proceedings of the 2nd international workshop on Services in distributed and Networked Environments

作者： Baentsch, Michael Molter, Georg Sturm, Peter Univ of Kaiserslautern Kaiserslautern Germany

In this paper, a framework for globally distributed software development and management environments, which we call Booster is presented. Additionally, the first experiences with WebMake, an application developed to serve as an experimental platform for a software development environment based on the World Wide Web and the Booster framework is introduced. Booster encompasses the basic building blocks and mechanisms necessary to support a truly cooperative distributed software development from the very beginning to the last steps in a software life cycle. It is thus a precursor of the Global software Highway, in which providers and users can meet for the development, management, exchange and usage of all kind of software.

关键词： Computer aided software engineering

来源：评论

学校读者我要写书评

暂无评论

Facilitating the development of portable parallel applications on distributed memory systems

Facilitating the development of portable parallel applicatio...

引用

Proceedings of the 1995 2nd international Conference on Programming Models for Massively parallel Computers

作者： Voliotis, C. Manis, G. Thanos, A. Tsanakas, P. Papakonstantinou, G. Natl Technical Univ of Athens Athens Greece

In this paper, two programming tools are presented, facilitating the development of portable parallel applications on distributed memory systems. The Orchid system is a software platform, i.e. a set of facilities for parallel programming. It consists of mechanisms for transparent message passing and a set of primitive functions to support the distributed shared memory programming model. In order to free the user from the tedius task of parallel programming, a new environment for logic programming is introduced: the Daffodil framework. Daffodil, implemented on top of Orchid, evaluates pure PROLOG programs, exploiting the inherent And/OR parallelism. Both systems have been implemented and evaluated on various platforms, since the layered structure of Orchid ensures portability only by re-engineering a small part of the code.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

2nd international workshop on parallel Algorithms for Irregularly Structured Problems, IRREGULAR 1995

2nd International Workshop on Parallel Algorithms for Irregu...

引用

2nd international workshop on parallel Algorithms for Irregularly Structured Problems, IRREGULAR 1995

ISBN: (纸本)3540603212

The proceedings contain 31 papers. The special focus in this conference is on Programming Methods, Compiling Techniques, Mapping and Scheduling. The topics include: Regular versus irregular problems and algorithms;algorithmic skeletons for adaptive multigrid methods;run-time techniques for parallelizing sparse matrix problems;fast execution of irregularly structured programs with low communication frequency on the hypercube;run-time parallelization of irregular do across loops;instruction scheduling and global register allocation for SIMD multiprocessors;general bounds for the assignment of irregular dependency graphs;a new scheme for dynamic processor assignment for irregular problems;an efficient mean field annealing formulation for mapping unstructured domains to hypercubes;partitioning and mapping of unstructured meshes to parallel machine topologies;integrating software pipelining and graph scheduling for iterative scientific computations;on the scope of applicability of the ETF algorithm;optimal mapping of neighbourhood-constrained systems;parallel processing in DNA analysis;solving computational fluid dynamics problems on unstructured grids with distributed parallel processing;parallel decomposition of unstructured fem-meshes;a parallel processing paradigm for irregular applications;load balancing strategies for a parallel system of particles;a reconfigurable parallel algorithm for sparse cholesky factorization;adapted wavelet analysis on moderate parallel distributed memory MIMD architectures;a new parallel approach to the constrained two-dimensional cutting stock problem;parallel search for combinatorial optimization;better algorithms for parallel backtracking;parallel game tree search on SIMD machines;asynchronous parallel branch and bound and anomalies and fast priority queues for parallel branch-and-bound.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Integrating software pipelining and graph scheduling for iterative scientific computations 2nd

Integrating software pipelining and graph scheduling for ite...

引用

2nd international workshop on parallel Algorithms for Irregularly Structured Problems, IRREGULAR 1995

作者： Fu, Cong Yang, Tao Gerasoulis, Apostolos Dept. Of Computer Science University of California Santa Barbara CA93106 United States Dept. Of Computer Science Rutgers University New Brunswick NJ08903 United States

ISBN: (纸本)3540603212

Graph scheduling has been shown effective for solving irregular problems represented as directed acyclic graphs(DAGs) on distributed memory systems. Many scientific applications can also be modeled as iterative task graphs(ITGs). In this paper, we model the SOR computation for solving sparse matrix systems in terms of ITGs and address the optimization issues for scheduling ITGs when communication overhead is not zero. We present an approach that incorporates techniques of software pipelining and graph scheduling. We demonstrate the effectiveness of our approach in mapping SOR computation and compare it with the multi-coloring method. © Springer-Verlag Berlin Heidelberg 1995.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

An efficient mean field annealing formulation for mapping unstructured domains to hypercubes 2nd

An efficient mean field annealing formulation for mapping un...

引用

2nd international workshop on parallel Algorithms for Irregularly Structured Problems, IRREGULAR 1995

作者： Aykanat, Cevdet Haritaoglu, Ismail Computer Engineering Department Bilkent University Ankara Turkey

ISBN: (纸本)3540603212

We propose an efficient MFA formulation for mapping unstructured domains to hypercube-connected distributed-memory architectures. In the general MFA formulation, NxP spin variables are maintained and an individual MFA iteration requires ϴ(davgP+P2) time for the mapping of a sparse domain graph with N vertices and average vertex degree of davg to a parallel architecture with P processors. The proposed hypercube-specific MFA formulation asymptotically reduces the number of spin variables and the computational complexity of an individual MFA iteration to Nlg2P and ϴ(davglg2P+ Plg2P), respectively, by exploiting the topological properties of hypercubes. © Springer-Verlag Berlin Heidelberg 1995.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

A fast homophonie coding algorithm based on arithmetic coding 2nd

引用

2nd international workshop on Fast software Encryption, 1994

作者： Penzhorn, W.T. Department of Electrical and Electronic Engineering University of Pretoria Pretoria0002 South Africa

ISBN: (纸本)3540605908

We present a practical algorithm for the homophonic coding of a message source, as required for cryptographic purposes. The purpose of homophonic coding is to transform the output of a non-uniformly distributed message source into a sequence of uniformly distributed symbols. This is achieved by randomly mapping each source symbol into one of a set of homophones. The selected homophones are then encoded by means of arithmetic coding, after which they can be encrypted with a suitable cryptographic algorithm. The advantage of homophonic coding above source coding is that source coding merely protects against a ciphertext-only attack, whereas homophonic coding provides additional protection against known-plaintext and chosen-plaintext attacks. This paper introduces a fast algorithm for homophonic coding based on arithmetic coding, termed the shift-and-add algorithm, which makes use of the fact that the set of homophones are chosen according to a dyadic probability distribution. This leads to a particularly simple, efficient implementation, requiring no multiplications but only shifts and additions. The usefulness of the algorithm is demonstrated by the homophonic coding of an ASCII textfile. The simulation results show that homophonic coding increases the entropy by less than 2 bits per symbol, and also provides source encoding (data compression). © Springer-Verlag Berlin Heidelberg 1995.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Constructive development environment for parallel and distributed programs

Constructive development environment for parallel and distri...

引用

Proceedings of the 2nd international workshop on Configurable distributed systems

作者： Magee, Jeff Dulay, Naranker Kramer, Jeff Imperial College London United Kingdom

ISBN: (纸本)0818653906

The emphasis is on constructing programs from multiple parallel computational components which cooperate to achieve the overall goal. The environment is designed to easily accommodate multiple communication mechanisms and primitives. Both the computational and communication elements of Regis programs are programmed in the Object Oriented programming language C+PLU. The elements are combined into parallel and distributed programs using the configuration language Darwin. the paper describes programming in Regis through a set of small example program.

关键词： software engineering

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共59页 << < 48 49 50 51 52 53 54 55 56 57 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：