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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

163 篇 会议
28 篇 期刊文献

馆藏范围

191 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

62 篇 工学
- 49 篇 计算机科学与技术...
- 26 篇 软件工程
- 24 篇 电气工程
- 14 篇 控制科学与工程
- 12 篇 信息与通信工程
- 4 篇 机械工程
- 4 篇 电子科学与技术（可...
- 3 篇 安全科学与工程
- 2 篇 交通运输工程
- 2 篇 生物工程
- 1 篇 光学工程
- 1 篇 冶金工程
- 1 篇 土木工程
- 1 篇 生物医学工程（可授...
- 1 篇 网络空间安全
21 篇 理学
- 18 篇 数学
- 4 篇 统计学（可授理学、...
- 2 篇 生物学
- 1 篇 物理学
- 1 篇 系统科学
6 篇 管理学
- 5 篇 管理科学与工程(可...
- 4 篇 工商管理
- 1 篇 图书情报与档案管...

主题

59 篇 real time system...
55 篇 laboratories
32 篇 delay
27 篇 control systems
25 篇 application soft...
25 篇 distributed comp...
22 篇 timing
20 篇 processor schedu...
18 篇 hardware
17 篇 fault tolerance
15 篇 bandwidth
14 篇 routing
13 篇 computer archite...
13 篇 protocols
13 篇 job shop schedul...
13 篇 telecommunicatio...
12 篇 intelligent netw...
12 篇 fault tolerant s...
11 篇 scheduling algor...
11 篇 traffic control

机构

94 篇 real-time comput...
18 篇 real-time comput...
6 篇 department of el...
5 篇 real time comput...
5 篇 real-time comput...
5 篇 real-time comput...
4 篇 real-time comput...
4 篇 real-time comput...
4 篇 real-time comput...
3 篇 real-time comput...
2 篇 department of el...
2 篇 real-time comput...
2 篇 real-time comput...
2 篇 real-time comput...
2 篇 real-time comput...
2 篇 real-time comput...
2 篇 real-time comput...
2 篇 electrical engin...
2 篇 department of el...
1 篇 department of el...

作者

89 篇 k.g. shin
29 篇 shin kang g.
24 篇 kang g. shin
21 篇 shin kg
8 篇 f. jahanian
6 篇 s. kodase
6 篇 j. rexford
6 篇 ching-chih han
5 篇 hagbae kim
5 篇 shige wang
5 篇 s. dawson
5 篇 q. zheng
5 篇 k.m. zuberi
4 篇 hahnsang kim
4 篇 a. mehra
4 篇 zheng q
4 篇 zonghua gu
4 篇 t. mitton
4 篇 shin k.g.
3 篇 chou cc

语言

184 篇 英文
7 篇 其他

检索条件"机构=Real-Time Computing Laboratory Department of Electrical Engineering and Comput. Science"

共 191 条记录，以下是171-180 订阅

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

详细简洁

排序：

Shortest path planning with dominance relation

Shortest path planning with dominance relation

引用

IEEE International Conference on Robotics and Automation (ICRA)

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

A method of partitioning a workspace using rectilinear visibility in 3-D or higher space is presented. Unlike the case of 2-D space, where the space of a partition is a rectangle, the shape of a partition in 3-D or higher space is arbitrary. In spite of the arbitrary shape of partitioned regions, it is proved that there exist dominance relations between regions. This relation is then utilized to solve efficiently the shortest path planning problem in 3-D or higher space.< >

关键词： Path planning Shape Costs Application software Manipulators Laboratories Remotely operated vehicles Mobile robots Routing Very large scale integration

来源：评论

学校读者我要写书评

暂无评论

Scheduling job operations in an automatic assembly line

Scheduling job operations in an automatic assembly line

引用

IEEE International Conference on Robotics and Automation (ICRA)

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

The problem of scheduling job operations in an automatic assembly line used for manufacturing a small to medium volume of mixed workparts is addressed. The assembly line model differs from the classical flow shop model in the following three aspects: (1) there are no buffers at machine stations, (2) constraints associated with the material transport system are included, and (3) for each batch production, workparts are distinguished in groups, rather than individually. An optimal algorithm that requires very little comput.tion is derived by minimizing the total finish time for two machine assembly lines. This result is generalized to the problem of scheduling an assembly line with m>2 machines processing single-operation jobs. In order to reduce the comput.tional complexity of the latter problem, heuristic algorithms are also proposed and shown to work quite well for all the cases considered. The solution to the problem of scheduling an assembly line with m>2 machines processing multioperation jobs is discussed.< >

关键词： Assembly Job shop scheduling Processor scheduling Pulp manufacturing Flexible manufacturing systems Optimal scheduling Manufacturing automation Heuristic algorithms Scheduling algorithm Laboratories

来源：评论

学校读者我要写书评

暂无评论

Analysis of three contention protocols in distributed real-time systems

Analysis of three contention protocols in distributed real-t...

引用

real-time Systems Symposium (RTSS)

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

The probability of a station/node failing to deliver packets before their deadlines, called the probability of dynamic failure, P/sub dyn/, and the in -bounded delivery time, which is defined as the time period between the arrival of a packet and its delivery with probability greater than 1- in , are important performance parameters for the communication subsystems of a distributed real-time system. The parameters are derived and are used to evaluate the token passing protocol, the token ring scheduling protocol, and the P/sub i/-persistent protocol and a priority-based variation thereof. The communication subsystem equipped with different contention protocols as embedded Markov chains is modeled. The probability distributions of the access delay are then derived, from which P/sub dyn/ and T/sub in / can be calculated. Using P/sub dyn/ and I/sub in / as indices, the performances of these contention protocols are evaluated and compared over a wide range of traffic.< >

关键词： real time systems Access protocols Token networks Delay Timing Distributed computing Throughput Multiaccess communication Chaotic communication Laboratories

来源：评论

学校读者我要写书评

暂无评论

Optimal multiple syndrome probabilistic diagnosis

Optimal multiple syndrome probabilistic diagnosis

引用

International Symposium on Fault-Tolerant computing (FTCS)

作者： S. Lee K.G. Shin Department of Electrical Engineering University of Delaware Newark DE USA Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

The authors discuss the distributed self-diagnosis of a multiprocessor/multicomput.r system based on interprocessor tests with imperfect fault coverage (thus also permitting intermittently fault processors). It is shown that by using multiple fault syndromes, it is possible to achieve significantly better diagnosis than by using a single fault syndrome, even when the amount of time devoted to testing is the same. The authors derive a multiple syndrome diagnosis algorithm that is optimal in the level of diagnostic accuracy achieved (among diagnosis algorithms of a certain type to be defined) and produces good results even with sparse interconnection networks and interprocessor test with low fault coverage. Furthermore, they prove upper and lower bounds are proved on the number of fault syndromes required to produce asymptotically a 100% correct diagnostic as N to infinity . Their solution and another multiple syndrome diagnosis solution by D. Fussell and S. Rangarajan are evaluated both analytically and with simulations.< >

关键词： Fault diagnosis System testing Upper bound Multiprocessing systems Automatic testing Multiprocessor interconnection networks Analytical models Algorithm design and analysis H infinity control Laboratories

来源：评论

学校读者我要写书评

暂无评论

A Bayesian approach to fault classification 90

A Bayesian approach to fault classification

引用

Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of comput.r systems

作者： Tein-Hsiang Lin Kang G. Shin Department of Electrical and Computer Engineering State University of New York at Buffalo Buffalo New York Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science The University of Michigan Ann Arbor Michigan

ISBN: (纸本)9780897913591

According to their temporal behavior, faults in comput.r systems are classified into permanent, intermittent, and transient faults. Since it is impossible to identify the type of a fault upon its first detection, the common practice is to retry the failed instruction one or more times and then use other fault recovery methods, such as rollback or restart, if the retry is not successful. To determine an “optimal” (in some sense) number of retries, we need to know several fault parameters, which can be estimated only after classifying all the faults detected in the *** this paper we propose a new fault classification scheme which assigns a fault type to each detected fault based on its detection time, the outcome of retry, and its detection symptom. This classification procedure utilizes the Bayesian decision theory to sequentially update the estimation of fault parameters whenever a detected fault is classified. An important advantage of this classification is the early identification of presence of an intermittent fault so that appropriate measures can be taken before it causes a serious damage to the system. To assess the goodness of the proposed scheme, the probability of incorrect classification is also analyzed and compared with simulation results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Message routing in HARTS with faulty components

Message routing in HARTS with faulty components

引用

International Symposium on Fault-Tolerant computing (FTCS)

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

The authors develop a routing scheme in two steps for a wrapped hexagonal mesh, called HARTS (hexagonal architecture for real-time systems), which ensures the delivery of every message as long as there is a path between its source and destination. The scheme can also detect the nonexistence of a path between a pair of nodes in a finite amount of time. Moreover, the scheme requires each node in HARTS to know only the state (faulty or not) of each of its own links. The performance of the simple routing scheme is simulated for three- and five-dimensional H-meshes while the physical distribution of faulty components is varied. It is shown that a shortest path between the source and the destination of each message is taken with a high probability, and a path, if one exists, is usually found very quickly.< >

关键词： Routing Laboratories Fault tolerant systems comput.tional modeling Distributed computing Parallel processing Hypercubes Broadcasting NASA Contracts

来源：评论

学校读者我要写书评

暂无评论

A module-sliced approach for high yield VLSI/WSI processors

A module-sliced approach for high yield VLSI/WSI processors

引用

IEEE International Conference on comput.r Design: VLSI in comput.rs and Processors, (ICCD)

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

The module-sliced approach is realized in a reconfigurable fault-tolerant segmented array processor (RFTSAP). The basic building block of RFTSAP is a node which consists of a processor, local memory, and a programmable I/O unit (PIOU). The PIOU allows any group of processors to be combined to perform the functions of a large processor module. The yield of a large processor module can be improved 2 to 4 times compared to that of approaches not using the module-sliced method.< >

关键词： Very large scale integration Switches Microprocessors Fault tolerance Registers Strontium Laboratories Redundancy Process control comput.r architecture

来源：评论

学校读者我要写书评

暂无评论

Minimum time trajectory planning for dual robot systems

Minimum time trajectory planning for dual robot systems

引用

IEEE Conference on Decision and Control

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

The problem of planning minimum time collision-free trajectories for a dual robot system is addressed. It is shown that this problem can be solved by first planning the minimum time trajectory for each robot without considering the existence of the other and then combining the two individual trajectories. This combination is accomplished by delaying one of the two trajectories in such a way that the time required for the coordinated motion of the two robots is minimized while avoiding collision between them. The optimality of the method is rigorously proved, the practical aspects of its realization are discussed, and example is presented.< >

关键词： Trajectory Robot kinematics Path planning Robot sensing systems Motion planning Laboratories comput.r science Delay effects Artificial intelligence Productivity

来源：评论

学校读者我要写书评

暂无评论

An efficient design of embedded memories and their testability analysis using Markov chains

An efficient design of embedded memories and their testabili...

引用

International Conference on Wafer Scale Integration

作者： P. Mazumder Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

A design strategy for efficient and comprehensive random testing of embedded random-access memory (RAM), where the address, read/write, and data input lines are not directly controllable and the data output lines are not externally observable, is presented. Unlike conventional approaches which use a linear feedback shift register (LFSR) to generate a signature and a register to store the reference fault-free signature, this technique uses a testable design which both accelerates the test by a factor of 0.5 square root n in an n-bit RAM and improves the test reliability by eliminating the LFSR. The problem of memory initialization has been elegantly circumvented by using word-line flag registers. An in-depth and comprehensive analysis of the functional faults, such as stuck-at, coupling, and pattern-sensitive, is performed. The analysis shows that, in order to test a 1-Mb RAM for common functional faults, the technique needs only 1 s, as opposed to about an hour needed by the conventional random testing.< >

关键词： Random access memory Circuit testing Read-write memory Circuit faults Registers Built-in self-test Life estimation Vectors Gold Sequential analysis

来源：评论

学校读者我要写书评

暂无评论

Message communications in a distributed real-time system with a polled bus

Message communications in a distributed real-time system wit...

引用

Annual Hawaii International Conference on System sciences (HICSS)

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

High-speed message communications is addressed. Each node in the system consists of multiple processors interconnected by a broadcast bus, but the individual nodes are interconnected by an arbitrary network. The concept of a poll number is proposed to control the access to an intranode bus, minimizing the probability of real-time messages missing their deadlines. When a task generates a time-constrained message, a poll number associated with the message is comput.d on the basis of the message deadline and the task priority. When the bus is free, the various tasks at a node which desire to use the bus write the poll number onto the bus and read it back, one bit at a time, starting from the most significant bit. If at any time the bit read back is different from the bit written, then that particular task drops out of the competition for the bus. The mechanism provides for not only decentralized control of the intranode bus, but also a high degree of flexibility in scheduling messages by different ways of generating poll numbers. The probability of a message missing its deadline in a token bus is found to be much higher than in a polled bus.< >

关键词： real time systems Communication system control Control systems time factors Automatic control Process control Laboratories Broadcasting Distributed control Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共20页 << < 11 12 13 14 15 16 17 18 19 20 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：