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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

852 篇 会议
791 篇 期刊文献
14 册 图书

馆藏范围

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

日期分布

学科分类号

969 篇 工学
- 584 篇 计算机科学与技术...
- 430 篇 软件工程
- 248 篇 信息与通信工程
- 227 篇 电气工程
- 175 篇 电子科学与技术（可...
- 144 篇 控制科学与工程
- 92 篇 光学工程
- 82 篇 生物工程
- 64 篇 生物医学工程（可授...
- 62 篇 材料科学与工程（可...
- 59 篇 化学工程与技术
- 58 篇 机械工程
- 54 篇 仪器科学与技术
- 52 篇 动力工程及工程热...
- 32 篇 航空宇航科学与技...
- 24 篇 安全科学与工程
- 24 篇 网络空间安全
648 篇 理学
- 298 篇 数学
- 277 篇 物理学
- 100 篇 统计学（可授理学、...
- 98 篇 生物学
- 76 篇 化学
- 53 篇 系统科学
- 28 篇 地球物理学
183 篇 管理学
- 133 篇 管理科学与工程(可...
- 73 篇 工商管理
- 52 篇 图书情报与档案管...
64 篇 医学
- 55 篇 临床医学
- 49 篇 基础医学(可授医学...
25 篇 法学
17 篇 经济学
12 篇 农学
9 篇 教育学
4 篇 军事学

主题

120 篇 real time system...
109 篇 laboratories
63 篇 control systems
58 篇 application soft...
53 篇 processor schedu...
53 篇 delay
48 篇 computer archite...
47 篇 distributed comp...
41 篇 hardware
40 篇 power systems
39 篇 computational mo...
38 篇 computer science
36 篇 fault tolerance
34 篇 timing
31 篇 neural networks
29 篇 scheduling algor...
29 篇 particle swarm o...
26 篇 protocols
25 篇 resource managem...
25 篇 artificial intel...

机构

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

作者

106 篇 k.g. shin
54 篇 ganesh k. venaya...
37 篇 niyato dusit
29 篇 venayagamoorthy ...
29 篇 shin kang g.
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

语言

1,526 篇 英文
114 篇 其他
17 篇 中文

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

共 1657 条记录，以下是1301-1310 订阅

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

详细简洁

排序：

Experiential telepresence: How can telepresence research be guided towards better end user experience?

Experiential telepresence: How can telepresence research be ...

引用

2003 ACM SIGMM Workshop on Experiential Telepresence, ETP '03

作者： Hayes-Roth, Barbara Henderson, Austin Jain, Ramesh Manovich, Lev Welch, Greg Pingali, Gopal Extempo Systems Inc. United States MIT United States Systems Laboratory in the Advanced Concepts and Technology Group of Pitney Bowes United States School of Electrical and Computer Engineering College of Computing Georgia Institute of Technology United States Department of Computer Science and Engineering University of Michigan Ann Arbor MI United States University of California San Diego CA United States Visual Arts Department University of California San Diego CA United States Computer Science Department University of North Carolina Chapel Hill NC United States IEEE Computer Society ACM United States IBM T.J. Watson Research Center 19 Skyline Drive Hawthorne NY 10532 United States

来源：评论

学校读者我要写书评

暂无评论

real-time embedded system support for the BTeV level 1 muon trigger

Real-time embedded system support for the BTeV level 1 muon ...

引用

2003 IEEE Nuclear science Symposium Conference Record - Nuclear science Symposium, Medical Imaging Conference

作者： Haney, Michael J. Beauregard, D. Iyer, R. Kalbarczyk, Z. Liu, Q. Wang, L. Haney, M. Selen, M. Mosse, D. Shigiltchoff, O. Chopade, R. Hovey, L. Jung, M. Messie, D. Oh, J. Stone, S. Bapty, T. Neema, S. Nordstrom, S. Shetty, S. Vashishtha, S. Yao, D. Sheldon, P. Vaandering, E. Butler, J. Gottschalk, E. Kowalkowski, J. Votava, M. Appel, J. University of Illinois Urbana IL 61801 United States Des./Validation Reliable N.S.R.G. University of Illinois High Energy Physics Group Department of Physics University of Illinois Department of Computer Science Coll. in High Sch. Educ. Program University of Pittsburgh Department of Electrical Engineering Syracuse University High Energy Physics Group Department of Physics Syracuse University Inst. for Software Intgd. Systems Vanderbilt University Department of Physics BTeV Group Vanderbilt University BTeV Collaboration Particle Physics Division Fermi Natl. Accelerator Laboratory Computing Division Fermi Natl. Accelerator Laboratory Fermilab Education Office Fermi Natl. Accelerator Laboratory

The Level 1 Muon Trigger subsystem for BTeV will be implemented using the same architectural building blocks as the BTeV Level 1 Pixel Trigger: pipelined field programmable gate arrays feeding a farm of dedicated processing elements. The muon trigger algorithm identifies candidate tracks, and is sensitive to the muon charge (sign);candidate dimuon events are identified by complementary charge track-pairs. To insure that the trigger is operating effectively, the trigger development team is actively collaborating in an independent multi-university research program for reliable, self-aware, fault adaptive behavior in real-time embedded systems (RTES). Key elements of the architecture, algorithm, performance, and engineered reliability are presented.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

Improving wait-free algorithms for interprocess communication in embedded real-time systems

Improving wait-free algorithms for interprocess communicatio...

引用

2002 USENIX Annual Technical Conference

作者： Huang, Hai Pillai, Padmanabhan Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)1880446006

Concurrency management is a basic requirement for interprocess communication in any multitasking system. This usually takes the form of lock-based or other blocking algorithms. In real-time and/or time-sensitive systems, the less-predictable timing behavior of lock-based mechanisms and the additional task-execution dependency make synchronization undesirable. Recent research has provided non-blocking and wait-free algorithms for interprocess communication, particularly in the domain of single-writer, multiple-reader semantics, but these algorithms typically incur high costs in terms of computation or space complexity, or both. In this paper, we propose a general transformation mechanism that takes advantage of temporal characteristics of the system to reduce both time and space overheads of current single-writer, multiple-reader algorithms. We show a 17–66% execution time reduction along with a 14–70% memory space reduction when three wait-free algorithms are improved by applying our transformation. We present three new algorithms for wait-free, single-writer, multiple-reader communication along with detailed performance evaluation of nine algorithms under various experimental conditions. © 2002 USENIX Association. All rights reserved.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

Layer-4 service differentiation and resource isolation

Layer-4 service differentiation and resource isolation

引用

IEEE Symposium on real-time and Embedded Technology and Applications

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

While the differentiated services (DiftServ) infrastructure is scalable and robust in providing network quality of service (QoS), there are serious drawbacks with the services provided by DiffServ: (1) the services are coarse-grained and one-way only; (2) no service differentiation and resource isolation are provided to meta-data packets such as TCP SYN and ACK packets. Moreover the coarse-grained service differentiation and the lack of resource isolation at IP routers exposes its vulnerability to distributed denial of service (DDoS) attacks. Based on the concept of layer-4 service differentiation and resource isolation, where the transport-layer information is inferred from the IP headers and used for packet classification and resource management, we present a scalable fine-grained DiffServ (sf-DiffServ) architecture that provides fine-grained service differentiation and resource isolation among thinner behavior aggregates (BAs). The sf-DiffServ architecture consists of a fine-grained QoS classifier and an adaptive weight-based resource manager at IP routers. A two-stage packet classification mechanism is devised to decouple the fine-grained QoS lookup from the routing lookup at core routers. Due to its scalable QoS support for TCP control segments, sf-DiffServ supports bi-directional differentiated services for TCP sessions. Most importantly, the fine-grained resource isolation provided inside the sf-DiffServ is a powerful built-in protection mechanism to counter DDoS attacks, reducing the vulnerability of the Internet to DDoS attacks.

关键词： Quality of service TCPIP computer crime Diffserv networks Resource management Robustness Aggregates Routing Bidirectional control Protection

来源：评论

学校读者我要写书评

暂无评论

Analysis of combined adaptive bandwidth allocation and admission control in wireless networks

Analysis of combined adaptive bandwidth allocation and admis...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

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

An analytical model is developed for cellular networks with a combined adaptive bandwidth allocation and traffic-restriction mechanism. Instead of focusing only on the bandwidth utilization and forced-termination probability, we derive two important quality-of-service (QoS) metrics, degradation ratio and upgrade/degrade frequency. We show numerically that these two metrics must be taken into account in order to support the QoS specified by each client. The effects of system loads and clients' mobility on system performance are also investigated. Even under the various distributions of mobility, the simulation results are shown to match our analytical results, implying the applicability of our analytical model to more general cases.

关键词： Programmable control Adaptive control Channel allocation Admission control Wireless networks Analytical models Degradation Land mobile radio cellular systems Communication system traffic control Traffic control

来源：评论

学校读者我要写书评

暂无评论

Measurement of OS services and its application to performance modeling and analysis of integrated embedded software

Measurement of OS services and its application to performanc...

引用

IEEE Symposium on real-time and Embedded Technology and Applications

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

Performance analyses for embedded software construction with existing components require knowledge of performance characteristics of both application software and operating system (OS) services, especially those services that are critical for real-time applications. Since end users normally do not control the structure and implementation of OS services, but have to use them to meet the system-level performance constraints, it is essential and critical to characterize the performance of OS services with measurements. As such measurements are taken for performance analysis, not for comparison, the measurement methods should be different from those traditionally, used for comparison. In this paper we present an end-to-end method for measuring the performance of timing and scheduling services in selected real-time OSs for the performance modeling and analysis. The proposed method takes the factors of both OS implementations and application configurations into account to obtain the measured performance close to what applications will experience at runtime. The results have shown that the performance characteristics of OS services can be measured without instrumenting the kernel source code, and hence, can be reused for the analysis of a family of applications.

关键词： Software measurement Application software Performance analysis Embedded software Operating systems real time systems Control systems Timing Runtime Instruments

来源：评论

学校读者我要写书评

暂无评论

An efficient schedulability analysis policing technique for periodic, dynamic real-time applications 16

An efficient schedulability analysis policing technique for ...

引用

16th International Parallel and Distributed Processing Symposium, IPDPS 2002

作者： Huh, Eui-Nam Welch, L.R. Pfarr, B. Department of Computer Science Sahmyook University Seoul Korea Republic of School of Electrical Engineering and Computer Science Ohio University AthensOH45701 United States Real-Time Software Engineering Branch NASA/GSFC United States

ISBN: (纸本)0769515738

Schedulability Analysis (SA) approaches that are based on a priori information and use fixed execution times with constant workloads work well in many application domains and allow pre-deployment guarantees of real-time performance such as Rate Monotonic Analysis (RMA [2]). However, certain real-time applications must operate in highly dynamic environments, thereby precluding accurate characterization of workloads by static models. This leads to the notion that a new SA trigger for dynamic environments, in which applications experience large variations in the workload, needs to guarantee real-time performance during run-time. This paper examines the case of periodic, dynamic real-time systems, and describes an efficient SA policing technique which can trigger SA appropriately, and uses a dynamic threshold which becomes sensitive when the quality of service (QoS) of the dynamic real-time application approaches its deadline. © 2002 IEEE.

关键词： dynamic execution time quality of service real-time performance schedulability analysis workload

来源：评论

学校读者我要写书评

暂无评论

Multicast video-on-demand services

Multicast video-on-demand services

引用

作者： Ma, Huadong Shin, Kang G. College of Computer Science and Technology Beijing University of Posts and Telecomm Beijing 100876 China Real-Time Computing Laboratory Department of EECS University of Michigan Ann Arbor MI 48109-2122 United States

The server's storage I/O and network I/O bandwidths are the main bottleneck of VoD service. Multicast offers an efficient means of distributing a video program to multiple clients, thus greatly improving the VoD performance. However, there are many problems to overcome before development of multicast VoD systems. This paper critically evaluates and discusses the recent progress in developing multicast VoD systems. We first present the concept and architecture of multicast VoD, and then introduce the techniques used in multicast VoD systems. We also analyze and evaluate problems related to multicast VoD service. Finally, we present open issues on multicast VoD as possible future research directions.

关键词： Video on demand

来源：评论

学校读者我要写书评

暂无评论

A best-effort communication protocol for real-time broadcast networks

A best-effort communication protocol for real-time broadcast...

引用

International Conference on Parallel Processing (ICPP)

作者： L. Ramaswamy B. Ravindran The Bradley Department of Electrical and Computer Engineering Real-Time Systems Laboratory Blacksburg VA USA

In this paper, we present a best-effort communication protocol, called ABA, that seeks to maximize aggregate application benefit and deadline-satisfied ratio of asynchronous real-time distributed systems that use CSMA/DDCR broadcast networks. ABA considers an application model where end-to-end timeliness requirements of trans-node application tasks are expressed using Jensen's benefit functions. Furthermore, the protocol assumes that the application is designed using CSMA/DDCR feasibility conditions that is driven by a "best" possible estimate of upper bounds on message arrival densities that is possible at design-time. When such design-time postulations get violated at run-time, ABA directs message traffic so that messages that will increase applications' aggregate benefit are only transmitted, buffering others, until such time when the workloads respect their design-time postulated values. To study the performance of ABA, we consider a previously studied algorithm called RBA* as a baseline algorithm. Our experimental results indicate that ABA yields higher aggregate benefit and higher deadline-satisfied ratio than RBA* when message arrival densities increase at faster rates or at the same rates as that of process execution latencies due to the dynamics of the workload.

关键词： Protocols Broadcasting Multiaccess communication Aggregates Ethernet networks real time systems Upper bound Runtime Delay Costs

来源：评论

学校读者我要写书评

暂无评论

On decentralized proactive resource allocation in asynchronous real-time distributed systems

On decentralized proactive resource allocation in asynchrono...

引用

IEEE International Symposim on High Assurance Systems engineering

作者： T. Hegazy B. Ravindran Department of Electrical and Computer Engineering Georgia Institute of Technology USA Bradley Department of Electrical and Computer Engineering Real-Time Systems Laboratory Blacksburg VA USA

We present two classes of distributed algorithms called DRBA and DOBA, for decentralized, proactive resource allocation in asynchronous real-time distributed systems. The objective of the algorithms is to maximize aggregate application benefit and deadline-satisfied ratio for a user-specified future time interval. Since determining the optimal allocation is computationally intractable, the algorithms heuristically compute near-optimal allocations in polynomial-time. While the DRBA algorithms analyze subtask response times to determine allocation decisions which are computationally expensive, the DOBA algorithms analyze processor overloads to compute their decisions in a much faster way. Within each class, we present three algorithms that differ in the way they tolerate end-host failures: no reallocation upon failure, stateless reallocation, and stateful reallocation.

关键词： Resource management real time systems Algorithm design and analysis Quality of service Delay Runtime Distributed computing Distributed algorithms Aggregates Polynomials

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共166页 << < 127 128 129 130 131 132 133 134 135 136 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：