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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

747 篇 期刊文献
594 篇 会议
14 册 图书

馆藏范围

1,355 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

839 篇 工学
- 486 篇 计算机科学与技术...
- 361 篇 软件工程
- 220 篇 信息与通信工程
- 190 篇 电气工程
- 150 篇 电子科学与技术（可...
- 106 篇 控制科学与工程
- 88 篇 光学工程
- 75 篇 生物工程
- 60 篇 材料科学与工程（可...
- 57 篇 生物医学工程（可授...
- 52 篇 化学工程与技术
- 47 篇 机械工程
- 42 篇 仪器科学与技术
- 38 篇 动力工程及工程热...
- 28 篇 航空宇航科学与技...
- 22 篇 网络空间安全
571 篇 理学
- 257 篇 物理学
- 250 篇 数学
- 91 篇 统计学（可授理学、...
- 86 篇 生物学
- 70 篇 化学
- 46 篇 系统科学
- 22 篇 地球物理学
157 篇 管理学
- 108 篇 管理科学与工程(可...
- 61 篇 工商管理
- 50 篇 图书情报与档案管...
62 篇 医学
- 54 篇 临床医学
- 46 篇 基础医学(可授医学...
- 22 篇 药学(可授医学、理...
21 篇 法学
14 篇 经济学
11 篇 农学
7 篇 教育学
4 篇 军事学

主题

90 篇 laboratories
64 篇 real time system...
43 篇 delay
41 篇 application soft...
39 篇 distributed comp...
36 篇 computer archite...
33 篇 computational mo...
32 篇 hardware
30 篇 processor schedu...
29 篇 fault tolerance
29 篇 control systems
24 篇 computer science
22 篇 timing
20 篇 routing
20 篇 artificial intel...
20 篇 computer network...
18 篇 bandwidth
18 篇 fault tolerant s...
18 篇 protocols
18 篇 telecommunicatio...

机构

94 篇 real-time comput...
33 篇 department of ph...
33 篇 faculty of scien...
33 篇 departamento de ...
33 篇 department for p...
33 篇 department of ph...
33 篇 dipartimento di ...
33 篇 yerevan physics ...
33 篇 institute of phy...
33 篇 institute of phy...
32 篇 lehrstuhl für ex...
32 篇 west university ...
32 篇 kirchhoff-instit...
32 篇 graduate school ...
32 篇 tomsk state univ...
31 篇 department of mo...
31 篇 research center ...
31 篇 fakultät für phy...
30 篇 faculté des scie...
30 篇 department of ph...

作者

93 篇 k.g. shin
37 篇 niyato dusit
25 篇 f. buehrer
25 篇 m. khader
25 篇 a. t. law
25 篇 c. alexa
25 篇 j. d. mansour
25 篇 j. m. izen
25 篇 s. veneziano
25 篇 d. di valentino
25 篇 g. bella
25 篇 j. strandberg
25 篇 d. calvet
25 篇 c. amelung
25 篇 a. grummer
25 篇 k. j. r. cormier
25 篇 n. orlando
25 篇 c. gumpert
25 篇 f. a. förster
25 篇 h. a. gordon

语言

1,234 篇 英文
108 篇 其他
13 篇 中文

检索条件"机构=Red-Time Computing Laboratory Department of Electrical Engineering and Computer Science"

共 1355 条记录，以下是1241-1250 订阅

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

详细简洁

排序：

Adaptive Deadlock-Free Routing in Multicomputers Using only One Extra Virtual Channel

Adaptive Deadlock-Free Routing in Multicomputers Using only ...

引用

1993 International Conference on Parallel Processing, ICPP 1993

作者： Su, Chien-Chun Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)0849389836

We present three protocols defin ing the relationship between messages and the chan nel resources requested: request-then-hold, requestthen wait, and request-then-relinquish. Based on the three protocols, we develop an adaptive deadlockfree routing algorithm called the SP routing. The SP routing uses shortest paths and is fully-adaptive, so messages can be routed via any of the shortest paths from the source to the destination. Since it is a minimal or shortest routing, the SP routing guar antees the freedom of livelocks. The SP routing is not limited to a specific network topology. The main requirement for an applicable network topology is that there exists a deterministic, minimal, deadlock-free routing algorithm. Most ex isting network topologies are equipped with such an algorithm. In this paper, we present an adaptive deadlock-free routing agorithm for n-dimensional meshes by using the SP routing. The hardware re quired by the SP routing uses only one extra virtual channel as compared to the deterministic routing. © 1993 IEEE.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

Determination of an optimal retry time in multiple-module computing systems 2

Determination of an optimal retry time in multiple-module co...

引用

2nd International Symposium on Uncertainty Modeling and Analysis, ISUMA 1993

作者： Hou, C.-J.J. Shin, K.G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)0818638508

The optimal amount of time used for retrying an instruction on detection of an error in a computing system is usually determined under the assumption that the system is composed of a single module, within which all fault activities are confined until some module-replacement action is taken. The authors consider fault activities in multiple-module systems. They first relax the single-module assumption and model the fault activities in a multiple-module system as a Markov process. The randomization approach is applied to decompose the Markov process into a discrete-time Markov chain subordinated to a Poisson process. Using this decomposition, several interesting measures can be derived such as the conditional probability of successful retry given a retry period and the fact that a non-permanent fault has occurred, and the mean time until which all modules in the system enter a fault-free state. All the measures derived are used to determine, along with the parameters characterizing fault activities and costs of recovery techniques, whether or not retry should be used as a first-step recovery means on detection of an error;and the best retry period subject to a specific probability of successful retry. © 1993 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Software fault injection and its application in distributed systems

Software fault injection and its application in distributed ...

引用

International Symposium on Fault-Tolerant computing (FTCS)

作者： H.A. Rosenberg K.G. Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

The authors describe a software fault injector (SFI) developed to facilitate the validation of dependability mechanisms on an experimental distributed real-time system called HARTS. SFI introduces a number of extensions to previous work done on fault injection tools. In particular, it allows combinations of fault types to be injected in the nodes of a distributed system. It also allows control of all timing parameters of the injection at each node. A description is given of the features and implementation of SFI. As a demonstration of the utility of SFI, the results of some sample experiments are presented.

关键词： Application software Hardware Aerodynamics Fault tolerance System testing Fault tolerant systems Acceleration Laboratories Real time systems Timing

来源：评论

学校读者我要写书评

暂无评论

Adaptive Deadlock-Free Routing in Multicomputers Using Only One Extra Virtual Channel

Adaptive Deadlock-Free Routing in Multicomputers Using Only ...

引用

International Conference on Parallel Processing (ICPP)

作者： Chien-Chun Su Kang G. Shin Real-Time computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

关键词： System recovery Network topology Parallel processing Routing protocols Hardware Delay Throughput Hypercubes Concurrent computing Laboratories

来源：评论

学校读者我要写书评

暂无评论

Intelligent disruption recovery for decentralized manufacturing systems

Intelligent disruption recovery for decentralized manufactur...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： T. Tsukada K.G. Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

The problems of intelligent response to disruptions in a decentralized manufacturing system are considered. In the absence of intelligent coordination, the response to a disruption of one part of the system may cause a disruption in another part of the system. A model for the problem of recovering from this kind of disruption is given. A solution approach based on the idea of negotiation from the field of distributed artificial intelligence is presented. The model and solution approach are evaluated in the domain of job shop rescheduling.< >

关键词： Manufacturing systems computer aided manufacturing Distributed computing Job shop scheduling Cellular manufacturing Artificial intelligence Control systems Real time systems Laboratories Power system modeling

来源：评论

学校读者我要写书评

暂无评论

Determination of an optimal retry time in multiple-module computing systems

Determination of an optimal retry time in multiple-module co...

引用

International Symposium on Uncertainty Modeling and Analysis (ISUMA)

作者： C.-J.J. Hou K.G. Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

The optimal amount of time used for retrying an instruction on detection of an error in a computing system is usually determined under the assumption that the system is composed of a single module, within which all fault activities are confined until some module-replacement action is taken. The authors consider fault activities in multiple-module systems. They first relax the single-module assumption and model the fault activities in a multiple-module system as a Markov process. The randomization approach is applied to decompose the Markov process into a discrete-time Markov chain subordinated to a Poisson process. Using this decomposition, several interesting measures can be derived such as the conditional probability of successful retry given a retry period and the fact that a non-permanent fault has occurred, and the mean time until which all modules in the system enter a fault-free state. All the measures derived are used to determine, along with the parameters characterizing fault activities and costs of recovery techniques, whether or not retry should be used as a first-step recovery means on detection of an error; and the best retry period subject to a specific probability of successful retry.< >

关键词： computer aided instruction Markov processes Chaos Real time systems Laboratories computer science electrical fault detection computer errors Position measurement time measurement

来源：评论

学校读者我要写书评

暂无评论

Incorporation of optimal timeouts into distributed real-time load sharing

Incorporation of optimal timeouts into distributed real-time...

引用

Annual Hawaii International Conference on System sciences (HICSS)

作者： C.-J. Hou K.G. Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

The authors address the problem of designing and incorporating a timeout mechanism into load sharing (LS) with state-region change broadcasts in the presence of node failures in a distributed real-time system. They formulate the problem of determining the best timeout period T/sub out//sup / for node i as a hypothesis testing problem, and maximize the probability of detecting node failures subject to a prespecified probability of falsely diagnosing a healthy node as faulty. They outline the LS algorithm and the proposed timeout mechanism and establish a theoretical basis for the calculation of optimal T/sub out//sup /. The simulation results show that the LS algorithm, which combines online parameter estimation, the timeout mechanism, and a few extra, timely broadcasts, can significantly reduce the probability of missing task deadlines.< >

关键词： Broadcasting Real time systems Distributed computing Chaotic communication time sharing computer systems Laboratories Testing Fault detection Bayesian methods Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

Transmission of compressed motion video over computer networks

Transmission of compressed motion video over computer networ...

引用

IEEE Compcon

作者： Q. Zheng K.G. Shin E. Abram-Profeta Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

The authors present an enhanced version of the real-time channel protocol for the transmission of compressed digital motion video over computer networks. This protocol can guarantee the timely delivery of video frames without wasting network bandwidth. Extensive simulation results have shown the protocol's superiority over the ordinary circuit/packet switching protocols.< >

关键词： Video compression computer networks Bandwidth Circuits Packet switching Protocols Delay Laboratories Electronic mail Costs

来源：评论

学校读者我要写书评

暂无评论

Generalized agreement between concurrent fail-stop processes 7th

引用

7th International Workshop on Distributed Algorithms, WDAG 1993

作者： Burns, James E. Cruz, Rolando I. Loui, Michael C. College of Computing Georgia Institute of Technology AtlantaGA30332 United States ATS&T Bell Laboratories NapervilleIL60566 United States Department of Electrical and Computer Engineering Coordinated Science Laboratory University of Illinois at Urbane-Champaign UrbanaIL61801 United States Bell Communications Research Red BankNJ07701 United States

ISBN: (纸本)9783540572718

For a system of concurrent processes that can fail by stopping, we study a generalization of the traditional binary agreement problem having more than two possible input values. We provide bounds on the number of possible inputs for which agreement is possible in a system of n concurrent processes that communicate using read-modify-write operations on m shared memory cells of sizes r1,…,rm. Let V be the set of input values. We present an agreement protocol for two processes with (formula presented), where rm=maxj,{rj}. For m=1 and m=2, we prove that this upper bound on |V| is the best possible. A protocol for n processes is fully resilient if it tolerates up to n−1 failures;a fully resilient protocol is wait-free, because no process needs to wait for any other. In a write-once protocol, each memory cell changes value at most once during each execution of the protocol. We present a fully resilient write-once agreement protocol for (formula presented). We show that no fully resilient write-once agreement protocol exists when (formula presented) and n≥m. © Springer-Verlag Berlin Heidelberg 1993.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

A portable parallel algorithm for VLSI circuit extraction

A portable parallel algorithm for VLSI circuit extraction

引用

International Symposium on Parallel Processing

作者： B. Ramkumar P. Banerjee Department of Electrical & Computer Engineering University of Iowa USA Center for Reliable and High-Perf Computing Coordinated Science Laboratory University of Illinois USA

The authors describe a new portable algorithm for parallel circuit extraction. The algorithm is built as part of the ongoing ProperCAD project: a portable object-oriented parallel environment for CAD applications that is built on top of the CHARM system. The algorithm, unlike prior approaches like PACE is asynchronous and is based on a coarse-grained dataflow execution model. Performance of circuit extraction is presented on four parallel machines: an Encore Multimax, a Sequent Symmetry, a NCUBE 2 hypercube, and a network of Sun Sparc workstations. The extractor runs unchanged on all these machines.< >

关键词： Parallel algorithms Very large scale integration Object oriented modeling Concurrent computing Workstations Circuit testing Runtime library Portable computers Application software Parallel machines

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共136页 << < 121 122 123 124 125 126 127 128 129 130 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：