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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,668 篇 会议
194 篇 期刊文献
25 册 图书

馆藏范围

4,887 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,499 篇 工学
- 2,385 篇 计算机科学与技术...
- 1,470 篇 软件工程
- 419 篇 信息与通信工程
- 385 篇 电气工程
- 193 篇 控制科学与工程
- 159 篇 电子科学与技术（可...
- 75 篇 网络空间安全
- 33 篇 材料科学与工程（可...
- 33 篇 生物医学工程（可授...
- 26 篇 机械工程
- 26 篇 安全科学与工程
- 21 篇 光学工程
- 21 篇 动力工程及工程热...
- 21 篇 生物工程
- 20 篇 建筑学
- 19 篇 土木工程
- 17 篇 力学（可授工学、理...
- 17 篇 环境科学与工程（可...
- 15 篇 交通运输工程
792 篇 理学
- 669 篇 数学
- 103 篇 统计学（可授理学、...
- 89 篇 系统科学
- 66 篇 物理学
- 29 篇 生物学
- 19 篇 化学
451 篇 管理学
- 322 篇 管理科学与工程(可...
- 229 篇 工商管理
- 153 篇 图书情报与档案管...
51 篇 经济学
- 51 篇 应用经济学
18 篇 法学
- 17 篇 社会学
15 篇 医学
9 篇 教育学
9 篇 农学
5 篇 文学
4 篇 军事学

主题

564 篇 distributed comp...
540 篇 computer science
490 篇 parallel process...
485 篇 concurrent compu...
410 篇 parallel process...
379 篇 application soft...
342 篇 distributed data...
335 篇 distributed comp...
310 篇 databases
288 篇 computer archite...
249 篇 database systems
222 篇 computational mo...
220 篇 delay
215 篇 hardware
211 篇 costs
188 篇 processor schedu...
172 篇 protocols
170 篇 computer network...
162 篇 large-scale syst...
152 篇 parallel program...

机构

20 篇 ibm thomas j. wa...
11 篇 department of co...
10 篇 department of co...
8 篇 school of comput...
8 篇 department of co...
8 篇 department of co...
7 篇 ieee
7 篇 department of co...
7 篇 department of ee...
7 篇 department of co...
7 篇 college of compu...
7 篇 hewlett packard ...
7 篇 northwestern uni...
6 篇 department of co...
6 篇 syracuse univ sy...
6 篇 department of co...
6 篇 department of co...
6 篇 lawrence berkele...
6 篇 college of compu...
6 篇 univ of californ...

作者

20 篇 a. choudhary
16 篇 a. boukerche
10 篇 s.k. das
10 篇 boukerche azzedi...
10 篇 choudhary a
10 篇 li keqin
9 篇 j. saltz
9 篇 sun xian-he
9 篇 choudhary alok
9 篇 k. schwan
9 篇 das sajal k.
8 篇 l.r. welch
8 篇 a. makinouchi
8 篇 chen haibo
8 篇 anon
8 篇 a.a. chien
7 篇 c. katsinis
7 篇 t. kurc
7 篇 d.k. panda
7 篇 keqin li

语言

4,874 篇 英文
11 篇 其他
2 篇 中文

检索条件"任意字段=Proceedings International Symposium on Databases in Parallel and Distributed Systems"

共 4887 条记录，以下是4731-4740 订阅

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

详细简洁

排序：

VLSI parallel and distributed processing algorithms for multidimensional discrete cosine transforms

VLSI parallel and distributed processing algorithms for mult...

引用

international Conference on databases, parallel Architectures and Their Applications

作者： Tze-Yun Sung Telecommunication Laboratories Ministry of Communications Chungli Taiwan

A VLSI parallel and distributed computation algorithm has been proposed and mapped onto a VLSI architecture for a 1-D discrete cosine transform (DCT) involving the symmetry property. In this 1-D DCT processor architecture, there are (log/sub 2/2N) DCT processor units (PUs) required for computation of a frame of N-point data with a time complexity of O(N). Further, a proposed 2-D DCT processor architecture requires (M(log/sub 2/2N)+N(log/sub 2/2M)) PUs with a time complexity of O(M+N). An optimal architecture for computation of a multidimensional DCT has been proposed. The 3-D DCT processor architecture requires NL log/sub 2/2M+LM log/sub 2/2N+MN log/sub 2/2L PUs with a time complexity of O(M+N+L). All architectures can be controlled by firmware; hence they are more flexible, efficient, and fault-tolerant and therefore very suitable for VLSI implementation.< >

关键词： Very large scale integration distributed processing Multidimensional systems Discrete cosine transforms Discrete transforms Computer architecture Kernel Concurrent computing distributed computing Linear predictive coding

来源：评论

学校读者我要写书评

暂无评论

Fault tolerance of message delivery with cascading copies

Fault tolerance of message delivery with cascading copies

引用

international Conference on databases, parallel Architectures and Their Applications

作者： H. Al-Jaber S. Rotenstreich Dept. of Electr. Eng. & Comput. Sci. George Washington Univ. Washington DC USA Department of EE&CS School of Engineering and Applied Science George Washington University Washington D.C. DC USA

The authors present a fault-tolerance algorithm that guarantees the delivery of a message to its destination despite faults in one or more nodes in a system of loosely coupled processors. This algorithm is distinguished by not using the extra hardware or checkpoint facilities that are common to many algorithms of its type. Instead, it maintains an appropriate number of copies of the message in the nodes through which the message passes. In the case of a fault, the algorithm locates a copy of the message closest to the destination and resumes delivery of the message from this location. Failure detection and recovery are automatic and transparent to the users. The algorithm can be implemented on diskless systems, such as specialized real-time systems or parallel processing systems that use interconnection networks (e.g. a hypercube).< >

关键词： Fault tolerance Fault tolerant systems Hardware Message passing Message systems Resumes Real time systems parallel processing Multiprocessor interconnection networks distributed computing

来源：评论

学校读者我要写书评

暂无评论

parallel distributed robot navigation in the presence of obstacles

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

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： E. Prassler E. Milios Res. Inst. for Appl. Knowledge Processing Ulm Germany Department of Computer Sciences University of Toronto Toronto Canada

The authors 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.< >

关键词： parallel robots Navigation Path planning Robot sensing systems Real time systems Control systems Computer science distributed processing Concurrent computing Grid computing

来源：评论

学校读者我要写书评

暂无评论

High-speed propagation of link status routing control information

High-speed propagation of link status routing control inform...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： D.E. Comer R. Yavatkar Department of Computer Sciences Purdue University West Lafayette IN USA Department of Computer Sciences University of Kentucky Lexington KY USA

A link status routing algorithm required each node to know the current status of all the links in the network. Nodes use a link status update protocol that helps in keeping the database at each node up-to-date. The authors describe a link status update protocol designed for a highspeed network. The protocol uses the best-effort model of packet delivery, but is fault-tolerant. It uses an algorithm for fast propagation of link status updates that is optimized for the expected case when no update packets are lost, and no link or node failures occur. The protocol uses a separate mechanism to detect and recover from errors caused by loss of updates and failure of nodes or links.< >

关键词： databases Tellurium Computer science Error correction ARPANET Intelligent networks Fault tolerance Routing protocols Computer errors Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Fault tolerant distributed shared memory algorithms

Fault tolerant distributed shared memory algorithms

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： M. Stumm Songnian Zhou University of Toronto Toronto Canada

distributed shared memory (DSM) has received increased attention as a mechanism for interprocess communication in loosely-coupled distributed systems because of its perceived advantages over direct use of message passing or remote procedure calls. One problem with most DSM algorithms proposed to date, however, is that they do not tolerate faults. The paper extends four basic DSM algorithms to tolerate single host failures and argues that this degree of fault tolerance is sufficient for most applications. It analyzes the performance behavior of the fault tolerant DSM algorithms and shows that for some algorithms the additional overhead for fault tolerance is quite small, but that for other algorithms the extra overhead can be substantial and even unpredictable.< >

关键词： Fault tolerance Message passing Clustering algorithms Costs Performance analysis Algorithm design and analysis Fault tolerant systems Read-write memory Application software Workstations

来源：评论

学校读者我要写书评

暂无评论

Object migration mechanisms to support updates in object-oriented databases

Object migration mechanisms to support updates in object-ori...

引用

international Conference on databases, parallel Architectures and Their Applications

作者： M.E. El-Sharkawi Y. Kambayashi Department of Computer Sciences and Communication Engineering Faculty of Engineering Kyushu University Fukuoka Japan

Updates in object-oriented database systems are studied. It is pointed out that, owing to the richness of the object-oriented data model, updating an object may affect the object's position in the class lattice. Three types of update operations on objects are considered: adding, dropping, and modifying instance variables. An update may cause object migration, that is, the updated object may change its current class. As the user may not be aware of the side effects of the update, the system has to take some actions to complete the user's update. Classes in a database schema are classified into three types: static, partially dynamic, and dynamic. This classification is based on the way in which an object in a class may migrate. It is shown that the notion of object migration affects answering queries in temporal object-oriented databases. The history of an object will be distributed among several classes in the scheme. Two approaches to determine the class of an object's version are presented.< >

关键词： Object oriented databases Data models Object oriented modeling Spatial databases Lattices Database systems Relational databases Design automation Image databases Data engineering

来源：评论

学校读者我要写书评

暂无评论

Using SIMD parallelism to support rule-based systems

Using SIMD parallelism to support rule-based systems

引用

international Conference on databases, parallel Architectures and Their Applications

作者： N.N. Kamel Databaw Research and Development Center and Computer and Information Sciences Department University of Florida Gainesville FL USA

A parallel algorithm for the implementation of Rete networks on a parallel array processor is proposed. Although special-purpose architectures have been proposed for directly implementing production systems, the availability of such machines is very limited. Proposed implementation algorithms, which take advantage of more widely available parallel machines, are more practical. Such an approach was taken in a previous work where a number of workstations connected via a local area network were considered. Here an SIMD (single instruction, multiple data) array processor is used. The Rete network is functionally divided into two subnetworks: the discrimination network and the join network. It is the join network where most of the processing load is carried out. The operation of the join network is the main objective of the SIMD implementation. The proposed algorithm emphasizes data parallelism as opposed to functional parallelism. In this type of parallelism, the data are partitioned into sets of approximately equal size and distributed among several processors. The data are then operated upon simultaneously by similar operators. The underlying architecture is described.< >

关键词： Knowledge based systems parallel processing Production systems Communication system control Computer architecture Partitioning algorithms Research and development Computer networks Expert systems Delay

来源：评论

学校读者我要写书评

暂无评论

parallel join processing using nonclustered indexes for a shared memory multiprocessor

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

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： E. Omiecinski R. Shonkwiler College of Computing Georgia Institute of Technology Atlanta GA USA School of Mathematics Georgia Institute of Technology Atlanta GA USA

Examines 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. Two algorithms based on simple heuristics and a third algorithm based on the Monte Carlo optimization technique called simulated annealing are given. Experiments are performed to compare the various algorithms with an algorithm that recently appeared in the literature.< >

关键词： parallel processing Buffer storage Educational institutions Concurrent computing Database systems Monte Carlo methods Simulated annealing Context Message passing Mathematics

来源：评论

学校读者我要写书评

暂无评论

Analysis of parallel algorithms using continuous job profiles

Analysis of parallel algorithms using continuous job profile...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： M.L. Weems N. Ullah M.J. Gonzalez Computer Engineering Research Center Department of Electrical and Computer Engineering University of Texas Austin Austin TX USA

The increased use of parallelism in computer systems has created the need for models which can be used to evaluate the performance of jobs executing on multiple processor systems. The paper proposes a geometric model, referred to as the continuous job profile, which reflects the allocation of resources needed to process a job. Continuous job profiles are geometric models of a job which can be used to determine how a job's structure limits its potential speedup when executed on a multiple processor system. Job classes are analyzed and shown to provide additional information which is specific to certain classes of problems.< >

关键词： Algorithm design and analysis parallel algorithms parallel processing Concurrent computing Power engineering computing Resource management Solid modeling Computer architecture Shape Information analysis

来源：评论

学校读者我要写书评

暂无评论

An approach to study performance properties of distributed simulation

An approach to study performance properties of distributed s...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： D. Kumar S. Harous Department of Computer Engineering and Science Case Western Reserve University Cleveland OH USA

The authors present the results of an experimental performance study of distributed simulation of a particular queuing network using a minor variation of the NULL message based algorithm of Chandy and Misra. One major part of this study is to determine the effect of overhead on distributed simulation. The authors present a simple and novel approach to study the relationship between amount of overhead and performance. They define and measure certain refined notions of 'ideal speed up ratio'-these ratios are more refined (as opposed to just the number of processors) in the sense that they capture the potentially achievable speed ups of distributed simulation more closely.< >

关键词： Computational modeling Delay Computer simulation Concurrent computing Clocks Computer networks distributed computing Velocity measurement Uninterruptible power systems Communication system control

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共489页 << < 470 471 472 473 474 475 476 477 478 479 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：