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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,991 篇 会议
32 篇 期刊文献
1 册 图书

馆藏范围

2,024 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,269 篇 工学
- 1,122 篇 计算机科学与技术...
- 546 篇 软件工程
- 496 篇 电气工程
- 186 篇 控制科学与工程
- 151 篇 信息与通信工程
- 59 篇 电子科学与技术（可...
- 54 篇 动力工程及工程热...
- 37 篇 机械工程
- 32 篇 仪器科学与技术
- 22 篇 生物工程
- 22 篇 安全科学与工程
- 16 篇 光学工程
- 16 篇 交通运输工程
- 16 篇 生物医学工程（可授...
- 12 篇 网络空间安全
- 10 篇 航空宇航科学与技...
- 9 篇 力学（可授工学、理...
- 9 篇 石油与天然气工程
177 篇 管理学
- 154 篇 管理科学与工程(可...
- 83 篇 工商管理
- 37 篇 图书情报与档案管...
154 篇 理学
- 83 篇 数学
- 31 篇 系统科学
- 30 篇 物理学
- 25 篇 生物学
- 19 篇 统计学（可授理学、...
- 13 篇 化学
19 篇 医学
- 17 篇 临床医学
- 9 篇 基础医学(可授医学...
11 篇 经济学
- 11 篇 应用经济学
7 篇 法学
4 篇 农学
3 篇 军事学
2 篇 教育学
1 篇 文学

主题

429 篇 real time system...
320 篇 real-time system...
180 篇 embedded systems
137 篇 processor schedu...
105 篇 timing
103 篇 embedded system
101 篇 hardware
90 篇 computational mo...
82 篇 embedded computi...
73 篇 computer archite...
72 篇 resource managem...
68 篇 protocols
68 篇 delay
62 篇 scheduling algor...
62 篇 energy consumpti...
61 篇 program processo...
59 篇 computer science
58 篇 scheduling
57 篇 control systems
56 篇 application soft...

机构

9 篇 department of co...
8 篇 college of compu...
8 篇 city university ...
7 篇 department of co...
6 篇 department of co...
6 篇 department of co...
6 篇 malardalen univ ...
6 篇 uppsala universi...
6 篇 department of co...
6 篇 mälardalen unive...
5 篇 department of co...
5 篇 chongqing univ c...
5 篇 mälardalen real-...
5 篇 northeastern uni...
5 篇 ieee
5 篇 information and ...
5 篇 department of co...
5 篇 scuola super san...
5 篇 department of co...
5 篇 malardalen univ ...

作者

16 篇 thomas nolte
16 篇 nolte thomas
12 篇 jian-jia chen
12 篇 anderson james h...
11 篇 tei-wei kuo
11 篇 james h. anderso...
10 篇 nakajima tatsuo
10 篇 chen jian-jia
9 篇 nobuyuki yamasak...
8 篇 tovar eduardo
8 篇 chun jason xue
8 篇 nan guan
7 篇 shinpei kato
7 篇 kato shinpei
7 篇 dakai zhu
7 篇 kuo tei-wei
7 篇 xue chun jason
7 篇 tatsuo nakajima
7 篇 cheng albert m. ...
6 篇 bril reinder j.

语言

2,010 篇 英文
12 篇 其他
2 篇 中文

检索条件"任意字段=13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications"

共 2024 条记录，以下是951-960 订阅

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

详细简洁

排序：

Applying the peak over thresholds method on worst-case response time analysis of complex real-time systems

Applying the peak over thresholds method on worst-case respo...

引用

ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Meng Liu Moris Behnam thomas Nolte Mälardalen University Västerås Sweden

the predictability of timing behavior is a very important performance issue of a real-time system. As the complexity of modern industrial systems increases, analyzing the timing behaviors of those systems becomes more and more challenging. Most of the existing analysis methods depend on static and detailed information of the systems under analysis. However, sometimes only partial information of a system can be available, or it may require too much effort on obtaining those details, making those analysis methods much less feasible. Moreover, those methods usually focus on some specific system models with unrealistic assumptions, consequently, applying those methods on a complex industrial real-time system may result in overly pessimistic results. therefore, in this paper, we propose a statistical method to compute Worst-Case Response times (WCRTs) of complex real-time systems regarding soft timing constraints, which can provide a higher general applicability with less required system information. Our approach employs a Peak Over thresholds (POT) method, which is a branch of the Extreme Value theory (EVT). For the evaluation, we have applied this approach on the analysis of message transmission latencies over Controller Area Networks (CAN).

关键词： real-time systems Timing time factors Probability distribution Shape Estimation Approximation methods

来源：评论

学校读者我要写书评

暂无评论

Maximizing online service profit for time-dependent applications

Maximizing online service profit for time-dependent applicat...

引用

ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Shuhui Li Miao Song Zheng Li Shangping Ren Gang Quan Illinois Institute of Technology Chicago IL US Computer Science Department Illinois Institute of Technology Chicago IL Electrical and Computer Engineering Department Florida International University Miami FL

As computers and Internet technology advance, many time-dependent applications, such as mobile navigation and online gaming, are emerging. time-dependent applications are associated with a pair of time-dependent functions representing accrued gain at the time when tasks complete or accrued cost when tasks fail to complete, respectively. For systems that provide time-dependent services, the optimization goal is to maximize the system profit when both potential gain and potential cost exist for each request the system accepts. this paper presents two scheduling algorithms, prediction-based highest gain density first (PHGDF) and iterative PHGDF (iPHGDF) scheduling algorithms with the objective to maximize the system's total accrued profit. Simulation results provide clear evidence that, with respect to the system total accrued profit, the proposed PHGDF and iPHGDF algorithms have advantages over other commonly used scheduling algorithm, such as the Earliest Deadline First (EDF), the Generic Utility Scheduling (GUS) and the Profit and Penalty aware scheduling (PP-aware) algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On thermal utilization of periodic task sets in uni-processor systems

On thermal utilization of periodic task sets in uni-processo...

引用

ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Rehan Ahmed Parameswaran Ramanathan Kewal K. Saluja Department of Electrical and Computer Engineering University of Wisconsin Madison Madison Wisconsin

In this paper we introduce a novel characterization of real-time tasks based on their temperature impact. this characterization is used to analyze the schedulability of periodic real-time tasks in thermally constrained systems. the proposed characterization is important because thermal constraints are becoming increasingly vital due to rapid and increasing rise in power densities of modern architectures. As part of this work, we introduce the concept of “Accumulated thermal Impact” (ATI), which represents cumulative temperature increase due to execution of a given task. the concept of ATI is then used to determine thermal utilization of a periodic task set, which is somewhat analogous to traditional computation utilization, and perform schedulability analysis. We also propose a speed scaling scheme for minimizing thermal utilization/system temperature. Our results show that thermal utilization of a periodic task set is strongly correlated to its thermal feasibility. the proposed speed scaling scheme is also shown to perform significantly better than current schemes in terms of thermal utilization/temperature minimization.

关键词： Program processors real-time systems Schedules Mathematical model Steady-state Equations Timing

来源：评论

学校读者我要写书评

暂无评论

the Carousel-EDF scheduling algorithm for multiprocessor systems

The Carousel-EDF scheduling algorithm for multiprocessor sys...

引用

ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Paulo Baltarejo Sousa Pedro Souto Eduardo Tovar Konstantinos Bletsas CISTER/INESC-TEC Research Center FEUP-Faculty of Engineering University of Porto Portugal

We present Carousel-EDF, a new hierarchical scheduling algorithm for a system of identical processors, and its overhead-aware schedulability analysis based on demand bound functions. Carousel-EDF is an offshoot of NPS-F and preserves its utilization bounds, which are the highest among algorithms not based on a single dispatching queue and that have few preemptions. Furthermore, with respect to NPS-F, Carousel-EDF reduces by up to 50% the number of context switches and of preemptions caused by the high-level scheduler itself. the schedulability analysis we present in this paper is grounded on a prototype implementation of Carousel-EDF that uses a new implementation technique for the release of periodic tasks. this technique reduces the pessimism of the schedulability analysis presented and can be applied, with similar benefits, to other scheduling algorithms such as NPS-F.

关键词： Servers Program processors Scheduling algorithms Schedules Context Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Branch Prediction directed Dynamic instruction Cache Locking for embedded systems

Branch Prediction directed Dynamic instruction Cache Locking...

引用

ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Keni Qiu Mengying Zhao Chun Jason Xue Alex Orailoglu Department of Computer Science City University of Hong Kong Department of Computer Science and Engineering University of California San Diego

Cache locking is a cache management technique to preclude the replacement of locked cache contents. Cache locking is often used to improve cache access predictability in Worst-Case Execution time (WCET) analysis. Static cache locking methods have been proposed recently to improve average system performance. this paper presents an approach, Branch Prediction directed Dynamic Cache Locking (BPDCL), to improve average system performance through effective cache conflict miss reduction in different execution regions. In this proposed approach, the control flow graph of a program is partitioned into regions and memory blocks worth locking for each region are calculated during compilation time. At runtime, directed by branch predictions, locking routines are prefetched into a high-speed buffer. the pre-determined cache locking contents are loaded and locked at specific execution points during program execution. Experimental results show that the proposed BPDCL method exhibits an average improvement of 21.8% and 10.3% on cache miss rate reduction in comparison to the case with no cache locking and the static locking method respectively.

关键词： Runtime System performance Correlation Prefetching Partitioning algorithms Artificial neural networks embedded systems

来源：评论

学校读者我要写书评

暂无评论

Generalized Standby-Sparing techniques for energy-efficient fault tolerance in multiprocessor real-time systems

Generalized Standby-Sparing techniques for energy-efficient ...

引用

ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Yifeng Guo Dakai Zhu Hakan Aydin University of Texas at San Antonio San Antonio TX George Mason University Fairfax VA

the Standby-Sparing (SS) technique has been previously explored to improve energy efficiency while providing fault tolerance in dual-processor real-time systems. In this paper, by considering both transient and permanent faults, we develop energy-efficient fault tolerance techniques for real-time systems deploying an arbitrary number of identical processors. First, we study the Paired-SS technique, where processors are organized as groups of two (i.e., pairs) and SS is applied within each pair of processors directly after partitioning tasks to the pairs. then, we propose a Generalized-SS technique that partitions processors into two groups containing primary and secondary processors, respectively. the main and backup copies of tasks are executed on the primary and secondary processors under the partitioned-EDF and partitioned-EDL scheduling policies, respectively. the objective is to reduce the overlapped executions of the main and backup copies in order to improve energy savings. Our experimental evaluations show that, for a given system with fixed number of processors, typically there exists a configuration of primary and secondary processors under the Generalized-SS technique that can lead to better energy savings when compared to the Paired-SS technique.

关键词： Program processors Transient analysis real-time systems Energy consumption Voltage control Circuit faults Reliability

来源：评论

学校读者我要写书评

暂无评论

Mining Probabilistic Frequent Spatio-Temporal Sequential Patterns with Gap Constraints from Uncertain Databases

Mining Probabilistic Frequent Spatio-Temporal Sequential Pat...

引用

ieee international conference on Data Mining (ICDM)

作者： Yuxuan Li James Bailey Lars Kulik Jian Pei Department of Computing and Information Systems The University of Melbourne VIC Australia School of Computing Science Simon Fraser University Canada

ISBN: (纸本)9781479913282

Uncertainty is common in real-world applications, for example, in sensor networks and moving object tracking, resulting in much interest in item set mining for uncertain transaction databases. In this paper, we focus on pattern mining for uncertain sequences and introduce probabilistic frequent spatial-temporal sequential patterns with gap constraints. Such patterns are important for the discovery of knowledge given uncertain trajectory data. We propose a dynamic programming approach for computing the frequentness probability of these patterns, which has linear time complexity, and we explore its embedding into pattern enumeration algorithms using both breadth-first search and depth-first search strategies. Our extensive empirical study shows the efficiency and effectiveness of our methods for synthetic and real-world datasets.

关键词： Probabilistic logic Databases Data mining Trajectory Uncertainty Dynamic programming Mathematical model

来源：评论

学校读者我要写书评

暂无评论

embedded real-time Application Prototyping Using a Hybrid Multiprocessing Platform

Embedded Real-Time Application Prototyping Using a Hybrid Mu...

引用

ieee international conference on High Performance computing and Communications (HPCC)

作者： Weihua Sheng Vitaliy Volevach Rainer Leupers Gerd Ascheid Institute for Communication Technologies and Embedded Systems RWTH Aachen University Germany

ISBN: (纸本)9781479909735

Modern embedded systems require both high performance computing capability and low power/energy consumption in order to meet ever increasing customer demands. Recently, several semiconductor manufacturers have provided a new hybrid multiprocessing model which couples an FPGA with programmable processors. this constellation of processing elements in SoC platforms certainly provides needed performance while still keeping flexibility. However, several questions are yet to be answered to understand and use the platform better: What will the development flow look like to handle both software programmable processors and hardware blocks? What are the key points to map real-time applications to such platforms to achieve an optimal trade-off between performance and power? To address those issues, this paper presents a case-study of developing and mapping embedded applications to a real-life Lyrtech prototyping board consisting of a TI DSP and a Xilinx Virtex-4 FPGA. A customized development flow for programming DSP and FPGA was used in our work. the measured performance and power results for different mappings of benchmarks are demonstrated. the observations that we made are also discussed to provide some empirical guidelines on using hybrid multiprocessing platforms.

关键词： Field programmable gate arrays Digital signal processing Transform coding Benchmark testing Program processors MATLAB

来源：评论

学校读者我要写书评

暂无评论

CAPWAP protocol and context transfer to support seamless handover

CAPWAP protocol and context transfer to support seamless han...

引用

9th international conference on computing and Information Technology, IC2IT 2013

作者： Hasnan, Siti Norhaizum M. Ayu, Media A. Mantoro, Teddy Mazlan, M. Hasbullah Abobakr, M. Balfaqih, A. Haseeb, Shariq Wireless Communication Cluster MIMOS Berhad Kuala Lumpur Malaysia Department of Information Systems International Islamic University Malaysia Kuala Lumpur Malaysia Advanced Informatics School Universiti Teknologi Malaysia Kuala Lumpur Malaysia Universiti Teknologi Malaysia Johor Malaysia

ISBN: (纸本)9783642373701

Nowadays, real-time applications become immensely popular and available over wireless devices. An emerging technology ieee 802.11 Wireless Local Area Network (WLAN) has brought users to have trendy gadgets like smart phones, tablets and laptops. these applications require a fast and efficient handover that guarantee a service of security and Quality of Service (QoS). However, the users will face disruption which can cause high transition delay while running multimedia services. this paper presents an overview of Control and Provisioning Wireless Access Point (CAPWAP) protocol;a solution to overcome security problem during handover within a large network. Furthermore, we conducted a survey in this paper in order to find an algorithm that can support seamless handover in centralized architecture. Overall, the paper ends with further work by suggesting a design of CAPWAP protocol using predictive context transfer in centralized architecture. © 2013 Springer-Verlag.

关键词： Multimedia services

来源：评论

学校读者我要写书评

暂无评论

Using run-time checking to provide safety and progress for distributed cyber-physical systems

Using run-time checking to provide safety and progress for d...

引用

ieee international conference on embedded and real-time computing systems and applications (RTCSA)

作者： Stanley Bak Fardin Abdi Taghi Abad Zhenqi Huang Marco Caccamo University of Illinois at Urbana-Champaign University of Illinois at Urbana-Champaign Urbana IL US

Cyber-physical systems (CPS) may interact and manipulate objects in the physical world, and therefore ideally would have formal guarantees about their behavior. Performing static-time proofs of safety invariants, however, may be intractable for systems with distributed physical-world interactions. this is further complicated when realistic communication models are considered, for which there may not be bounds on message delays, or even that messages will eventually reach their destination. In this work, we address the challenge of proving safety and progress in distributed CPS communicating over an unreliable communication layer. this is done in two parts. First, we show that system safety can be verified by partially relying upon run-time checks, and that dropping messages if the run-time checks fail will maintain safety. Second, we use a notion of compatible action chains to guarantee system progress, despite unbounded message delays. We demonstrate the effectiveness of our approach on a multi-agent vehicle flocking system, and show that the overhead of the proposed run-time checks is not overbearing.

关键词： Safety Automata Trajectory Runtime Monitoring Delays Vehicles

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共203页 << < 92 93 94 95 96 97 98 99 100 101 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：