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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

161 篇 会议
30 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

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

主题

58 篇 real time system...
56 篇 laboratories
30 篇 delay
26 篇 control systems
25 篇 distributed comp...
24 篇 application soft...
22 篇 processor schedu...
20 篇 hardware
19 篇 timing
15 篇 fault tolerance
14 篇 routing
14 篇 protocols
13 篇 computer archite...
13 篇 bandwidth
13 篇 job shop schedul...
12 篇 scheduling algor...
12 篇 intelligent netw...
11 篇 computer network...
11 篇 telecommunicatio...
10 篇 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 篇 real-time comput...
2 篇 real-time comput...
2 篇 real-time comput...
2 篇 real-time comput...
2 篇 electrical engin...
1 篇 department of el...
1 篇 department of co...
1 篇 ieee computer so...
1 篇 laboratoire univ...
1 篇 physics departme...

作者

86 篇 k.g. shin
30 篇 shin kang g.
24 篇 kang g. shin
21 篇 shin kg
8 篇 f. jahanian
6 篇 s. kodase
6 篇 j. rexford
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 篇 seungjae han
4 篇 shin k.g.
4 篇 ching-chih han
3 篇 chou cc

语言

184 篇 英文
7 篇 其他

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

共 191 条记录，以下是11-20 订阅

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

详细简洁

排序：

Scheduling of Battery Charge, Discharge, and Rest

Scheduling of Battery Charge, Discharge, and Rest

引用

Real-time Systems Symposium (RTSS)

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

Electric vehicles operate inefficiently with a naive battery management system that charges or discharges battery cells in a pack based solely on application load demands. The battery pack's operation-time and lifetime can be extended significantly by effectively scheduling (the cyber part) battery charge, discharge, and rest activities, based on the battery characteristics (the physical part). We propose a set of policies for scheduling battery-cell activities, called the weighted-k round-robin (kRR) scheduling framework. This framework dynamically adapts battery-cell activities to load demands and the condition of individual cells, thereby extending the battery pack's operation-time and making them robust to anomalous voltage-imbalances. The framework comprises two key components. First, an adaptive filter estimates the upcoming load demand. Then, based on the estimated load demand, the kRR scheduler determines the number of parallel-connected cells to be discharged simultaneously. The scheduler also effectively partitions the cells in the pack, allowing the cells to be simultaneously charged and discharged in coordination with the battery reconfiguration system we developed earlier [17]. Besides the kRR scheduling framework, we characterize the discharge and recovery efficiency of a Lithium-ion battery cell. The kRR scheduling framework is shown to outperform three alternative scheduling mechanisms with respect to the operation-time by 7-56%, and improve the tolerance of voltage-imbalance by up to 50%.

关键词： Real time systems Robustness Global warming Threshold voltage Processor scheduling Laboratories Battery powered vehicles Battery management systems Application software Adaptive filters

来源：评论

学校读者我要写书评

暂无评论

On Dynamic Reconfiguration of a Large-Scale Battery System

On Dynamic Reconfiguration of a Large-Scale Battery System

引用

IEEE Symposium on Real-time and Embedded Technology and Applications

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

Electric vehicles powered with large-scale battery packs are gaining popularity as gasoline price soars. Large-scale battery packs usually consist of an estimated 12,000 battery cells connected in series and parallel, which are susceptible to battery-cell failures. Unfortunately, current battery-management systems are unable to handle the inevitable battery-cell failures very well. To address this problem, we propose a dynamic reconfiguration framework that monitors, reconfigures, and controls large-scale battery packs online. The framework is built upon a syntactic bypassing mechanism that provides a set of rules for changing the battery-pack configuration, and a semantic bypassing mechanism by which the battery-cell connectivity is reconfigured to recover from a battery-cell failure. In particular, the semantic bypassing mechanism is dictated by constant-voltage-keeping and dynamic-voltage-allowing policies. The former policy is effective in preventing unavoidable voltage drops during the battery discharge, while the latter policy is effective in supplying different amounts of power to meet a wide-range of application requirements. Our experimental evaluation has shown the proposed framework to enable the battery packs to be 9 times as fault-tolerant as a legacy scheme.

关键词： Large-scale systems Vehicle dynamics Centralized control Control systems Voltage Real time systems Battery management systems Application software Embedded computing Power engineering computing

来源：评论

学校读者我要写书评

暂无评论

Fast discovery of spectrum opportunities in cognitive radio networks

Fast discovery of spectrum opportunities in cognitive radio ...

引用

2008 3rd IEEE Symposium on New Frontiers in Dynamic Spectrum Access Networks, DySPAN 2008

作者： Kim, Hyoil Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109-2121 United States

ISBN: (纸本)9781424420179

We address the problem of rapidly discovering spectrum opportunities for seamless service provisioning for secondary users (SUs) in cognitive radio networks (CRNs). Specifically, we propose an efficient sensing-sequence that incurs a small opportunity-discovery delay by considering (1) the probability that a spectrum band (or a channel) may be available at the time of sensing, (2) the duration of sensing on a channel, and (3) the channel capacity. We derive the optimal sensing-sequence for channels with homogeneous capacities, and a suboptimal sequence for channels with heterogeneous capacities for which the problem of finding the optimal sensing-sequence is shown to be NP-hard. To support the proposed sensing-sequence, we also propose a channel-management strategy that optimally selects and updates the list of backup channels. A hybrid of maximum likelihood (ML) and Bayesian inference is also introduced for flexible estimation of ON/OFF channel-usage patterns and prediction of channel availability when sensing produces infrequent samples. The proposed schemes are evaluated via in-depth simulation. For the scenarios we considered, the proposed suboptimal sequence is shown to achieve close-to-optimal performance, reducing the opportunity-discovery delay by up to 47% over an existing probability-based sequence. The hybrid estimation strategy is also shown to outperform the ML-only strategy by reducing the overall opportunity-discovery delay by up to 34%. ©2008 IEEE.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

ARCMA: Attack-resilient collaborative message authentication in Wireless Sensor Networks 08

ARCMA: Attack-resilient collaborative message authentication...

引用

4th International Conference on Security and Privacy in Communication Networks, SecureComm'08

作者： Cho, Min-Gyu Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109-2121 United States

ISBN: (纸本)9781605582412

Data Centric Storage (DCS) is a well-known data storage and query processing mechanism for Wireless Sensor Networks (WSNs), storing sensed data or their metadata at pre-specified locations. Queries issued by mobile users are sent to, and processed at, such storage nodes. However, securing DCS is very difficult because WSNs usually operate in an unattended environment and hence are subject to node-capture attacks. Even after capturing a single node, an attacker may be able to subvert the entire system by using the keying material extracted from the captured node. To remedy/alleviate the above problem, we propose Attack-Resilient Collaborative Message Authentication (ARCMA), in which sensor nodes collaboratively authenticate messages to be sent to, or received from, remote nodes. In ARCMA, each node belongs to one of k groups, and constructs an Authentication Tree (AT) which is formed with k nodes, each from a distinct group. Each node collaborates with the other nodes in its AT to authenticate messages. We propose two heuristics, called MIN and OPT, to construct ATs. Our analysis shows that the security of ARCMA does not degrade until the attacker capture k or more nodes. We also evaluate the overhead of constructing ATs and the cost of authenticating messages using ATs. Copyright 2008 ACM.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Fast Discovery of Spectrum Opportunities in Cognitive Radio Networks

Fast Discovery of Spectrum Opportunities in Cognitive Radio ...

引用

IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, DySPAN

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

关键词： Sensors Channel capacity Delay Algorithm design and analysis Availability Channel estimation Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware Scheduling of Real-time Tasks in Wireless Networked Embedded Systems

Energy-Aware Scheduling of Real-Time Tasks in Wireless Netwo...

引用

Real-time Systems Symposium (RTSS)

作者： G. Sudha Anil Kumar G. Manimaran Z. Wang Real-Time Computing and Networking Laboratory Department of Electrical and Computer Engineering Iowa State University Ames IA USA

Recent technological advances have opened up several distributed real-time applications involving battery-driven embedded devices with local processing and wireless communication capabilities. Energy management is the key issue in the design and operation of such systems. In this paper, we consider a single-hop networked real-time embedded system where each node supports both dynamic voltage scaling (DVS) and dynamic modulation scaling (DMS) power management techniques to tradeoff time for energy savings. In this model, we address the problem of scheduling periodic complex tasks where each task consists of several precedence constrained message passing sub-tasks. Our contributions towards this problem are twofold. First, we analyze the system level energy-time tradeoffs considering both the computation and communication workloads by defining a novel energy gain metric. We then present static (centralized) and dynamic (distributed) energy gain based slack allocation algorithms which reduce the total energy consumption, while guaranteeing the ready time, deadline and precedence constraints. We compare the performance of the proposed algorithms with several baseline algorithms through simulation studies. Our results show that the proposed algorithms perform significantly better than the baseline algorithms for the simulated conditions. Finally, we identify several interesting energy-aware research problems in the area of networked real-time embedded systems.

关键词： Real time systems Embedded system Energy management Wireless communication Dynamic voltage scaling Voltage control computer network management Power system management Power system modeling Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Energy-aware scheduling with deadline and reliability constraints in wireless networks

Energy-aware scheduling with deadline and reliability constr...

引用

International Conference on Broadband Networks (BroadNets)

作者： G. Sudha Anil Kumar G. Manimaran Z. Wang Real Time Computing and Networking Laboratory Department of Electrical and Computer Engineering Iowa State University Ames IA USA

ISBN: (纸本)9781424414321

In this paper, we address the problem of scheduling a set of periodic real-time messages in a wireless network with the objective of minimizing the total energy consumption while meeting deadline and reliability constraints. We formally prove that this problem is NP-hard and solve it in two stages. First, we consider a simple model that assumes that the wireless channel is completely reliable and the network is fully provisioned. Using the technique of employing multiple hop-by-hop transmissions instead of a single direct hop transmission as the basis, we prove that the strategy of choosing the hop distances such that they are equidistant is optimal in terms of energy consumption under the deadline constraint. Based on the intuition provided by the optimal strategy, we present heuristic scheduling algorithms for a more realistic wireless channel model and network condition. Our simulation results show that the proposed scheduling algorithms provide significant energy savings over the baseline algorithms

关键词： Wireless networks Energy consumption Scheduling algorithm Wireless application protocol Throughput Access protocols Streaming media Resource management Processor scheduling computer network reliability

来源：评论

学校读者我要写书评

暂无评论

On accurate measurement of link quality in multi-hop wireless mesh networks

On accurate measurement of link quality in multi-hop wireles...

引用

12th Annual International Conference on Mobile computing and Networking, MOBICOM 2006

作者： Kim, Kyu-Han Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109-2121 United States

ISBN: (纸本)1595932860

This paper presents a highly efficient and accurate link-quality measurement framework, called EAR (Efficient and Accurate link-quality monitoR), for multi-hop wireless mesh networks, that has several salient features. First, it exploits three complementary measurement schemes: passive, cooperative, and active monitoring. EAR maximizes the measurement accuracy by (i) dynamically and adaptively adopting one of these schemes and (ii) opportunistically exploiting the unicast application traffic present in the network, while minimizing the measurement overhead. Second, EAR effectively identifies the existence of wireless link asymmetry by measuring the quality of each link in both directions of the link, thus improving the utilization of network capacity by up to 114%. Finally, its reliance on both the network layer and the IEEE 802.11-based device driver solutions makes EAR easily deployable in existing multi-hop wireless mesh networks without system recompilation or MAC firmware modification. EAR has been evaluated extensively via both n.s-2-based simulation and experimentation on our Linux-based implementation. Both simulation and experimentation results have shown EAR to provide highly accurate link-quality measurements with minimum overhead. Copyright 2006 ACM.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

SMRP: Fast restoration of multicast sessions from persistent failures

SMRP: Fast restoration of multicast sessions from persistent...

引用

2005 International Conference on Dependable Systems and Networks

作者： Wu, Jian Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan

The growing reliance of networked applications on timely and reliable data transfer requires the underlying networking infrastructure to provide adequate services even in the presence of "persistent" failures (e.g., broken links/routers). It is much more difficult to meet this requirement for multicast sessions than for unicast communications because any on-tree component failure may often cause simultaneous service disruptions to multiple receivers. This paper presents a new multicast routing protocol, called the Survivable Multicast Routing Protocol (SMRP), which facilitates fast recovery of multicast sessions in face of persistent failures via local detour paths. Our evaluation results show that SMRP trades end-to-end delay and resource usage for short, and hence fast, recovery paths. For example, under a certain set of parameter values, SMRP shortens the recovery path by 20% with only a 5% increase of end-to-end delay and resource usage. Moreover, several design enhancements have made SMRP efficient, robust, flexible and scalable. © 2005 IEEE.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

Priority refinement for dependent tasks in large embedded real-time software

Priority refinement for dependent tasks in large embedded re...

引用

11th IEEE Real-time and Embedded Technology and Applications Symposium, RTAS 2005

作者： Merrick, Jeffrey R. Wang, Shige Shin, Kong G. Song, Jing Milam, William Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109-2122 Ford Motor Company

In a large embedded real-time system, priority assignment can greatly affect the timing behavior - which can consequently affect the overall behavior - of the system. Thus, it is crucial for model-based design of a large embedded real-time system to be able to intelligently assign priorities such that tasks can meet their deadlines. In this paper, we propose a priority-refinement method for dependent tasks distributed throughout a heterogeneous multiprocessor environment. In this method, we refine an initial priority assignment iteratively using the simulated annealing technique with tasks' latest completion times (LCT). Our evaluations, based on randomly-generated models, have shown that the refinement method outperforms other priority-assignment schemes and scales well for large, complex, real-time systems. This method has been implemented in the Automatic Integration of Reusable Embedded Software (AIRES) toolkit and has been successfully applied to a vehicle system control application. © 2005 IEEE.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共20页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：