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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,990 篇 会议
32 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

429 篇 real time system...
321 篇 real-time system...
180 篇 embedded systems
137 篇 processor schedu...
105 篇 timing
103 篇 embedded system
101 篇 hardware
90 篇 computational mo...
82 篇 embedded computi...
74 篇 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.

语言

1,961 篇 英文
60 篇 其他
2 篇 中文

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

共 2023 条记录，以下是1031-1040 订阅

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

详细简洁

排序：

Energy budget management for energy harvesting embedded systems

Energy budget management for energy harvesting embedded syst...

引用

18th ieee international conference on embedded and real-time computing systems and applications, RTCSA 2012

作者： Kooti, Hessam Dang, Nga Mishra, Deepak Bozorgzadeh, Eli Computer Sciences Department University of California Irvine Irvine CA United States

ISBN: (纸本)9781467330176

In battery-powered embedded systems, the limit of battery charge creates a challenge in scheduling tasks to meet both their deadlines and Quality of Service (QoS) requirements. Harvesting energy from the surrounding environment continuously eliminates the concern of limited battery charge. However, the uncertainty in availability of energy brings challenges in embedded systems. In this paper, we propose an energy management technique to maximize QoS of the system. Our technique is composed of two steps: an offline step and an online step. In the offline step we use frame-based energy harvesting prediction in one harvesting period, in order to find the best QoS level for the tasks and maximize the energy utilization. the information provided from the offline step guides the online scheduler to decide about job scheduling at run-time to minimize the QoS violation. We compared our scheduler with other approaches and on average we reduce the violation count by 22%. © 2012 ieee.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Software controlled memories for scalable many-core architectures

Software controlled memories for scalable many-core architec...

引用

18th ieee international conference on embedded and real-time computing systems and applications, RTCSA 2012

作者： Bathen, Luis Angel D. Dutt, Nikil D. Center for Embedded Computer Systems University of California Irvine CA United States

ISBN: (纸本)9781467330176

Technology scaling along with the ever evolving demand for media-rich software stacks have motivated the need for many-core platforms. With the increase in compute power and its inherent demand for high memory bandwidth comes the need for vast amounts of on-chip memory space. thus, designers must carefully provision the memory real-estate to meet their application's needs. It has been shown in the embedded systems domain that both software controlled memories (e.g., scratchpad memories) and hardware-controlled memories (e.g., caches) have their pros and cons, some application domains such as multimedia fit very well in the software-controlled memory model, while other domains such as databases work well with caches. As a result, efficient memory management is extremely critical as it has a great impact on the system's power consumption and throughput. Traditional memory hierarchies primarily consist of SRAM-based on-chip caches, however, with the emergence of non-volatile memories (NVMs) and mixed-criticality systems, on-chip memories will be heterogeneous, not only in type (cache vs. scratchpad) but also in technology (e.g., SRAM vs. NVM). this paper surveys the state of the art in memory subsystems for many-core platforms, and presents strategies for efficiently managing software-controlled memories in the many-core domain, while addressing the various challenges designers face in deploying such memory subsystems (e.g., sharing the memory resources, accounting for variations in the subsystem, etc.). © 2012 ieee.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

Efficiency of concurrent processing of sort using CSP

Efficiency of concurrent processing of sort using CSP

引用

13th ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed computing, SNPD 2012

作者： Shiono, Yasunori Noguchi, Shohei Mochida, Mitsumasa Sumida, Tomoo Mori, Hideki Ohmaki, Kazuhito Tsuchida, Kensei Department of Information Sciences and Arts Toyo University Kawagoe-shi Saitama Japan Open Information Systems Toyo University Kawagoe-shi Saitama Japan Liberal Arts Education Center Toyo Gakuen University Bunkyo-ku Tokyo Japan

ISBN: (纸本)9780769547619

embedded systems have become an essential technology in fields that require electronic control. these technologies must work in real time and have high reliability and low cost. Among them, safety verification of embedded systems is very important in fields related to human life. In addition, as multi-core and multiprocessors have spread, the processing power of the hardware has been improved. As a result, concurrent processing has become necessary. In developing concurrent embedded systems, Communicating Sequential Processes (CSP) is regarded as useful. the purpose of this study is to verify, implement, and evaluate the concurrent sorting algorithm using the characteristics of CSP. In this study, we use two characteristics of CSP: synchronous communication and verification based on the formal method. In addition, we describe the extended improvement concurrent sorting algorithm. © 2012 ieee.

关键词： embedded systems

来源：评论

学校读者我要写书评

暂无评论

Security Enhancement in Wireless Sensor Networks using Machine Learning

Security Enhancement in Wireless Sensor Networks using Machi...

引用

14th ieee international conference on High Performance computing and Communications (HPCC) / ieee 9th international conference on embedded Software and systems (ICESS)

作者： Raj, Aswathy B. Ramesh, Maneesha V. Kulkarni, Raghavendra V. Hemalatha, T. Amrita Center for Wireless Networks and Applications Amrita Vishwa Vidyapeetham Kerala India

ISBN: (纸本)9780769547497

Ensuring the security of wireless sensor networks (WSNs) is vital for monitoring real-time systems. One of the major security flaws experienced by WSNs is denial of service (DoS) which can even lead to the breakdown of the complete system or to wrong decisions being made by the system that can cause adverse results. this research work focuses on two techniques for detecting a DoS attack at a medium access control (MAC) layer. Our research compares and evaluates the performance of two major machine learning techniques: neural network (NN) and support vector machine (SVM). Vanderbilt Prowler is used for simulating the scenarios. In the simulations, normalized critical parameters and their corresponding probabilities of DoS attack are computed in 50 trial runs. these normalized critical parameters and their corresponding probabilities of DoS attack are used as training inputs in NN and SVM approaches. the simulation results clearly show that SVM provides better accuracy compared to NN, 97% accuracy by SVM and 91% accuracy by NN. the simulation also shows that SVM takes much less time to detect and determine the probability of a DoS attack, 0.25 seconds by SVM and 0.75 seconds by NN. All these results clearly show that SVM performs better than NN when used for detecting the probability of DoS attack in WSNs.

关键词： Wireless Sensor Networks Security Denial of Service Neural Network Support Vector Machine

来源：评论

学校读者我要写书评

暂无评论

Schedulability analysis for processors with aging-aware autonomic frequency scaling

Schedulability analysis for processors with aging-aware auto...

引用

18th ieee international conference on embedded and real-time computing systems and applications, RTCSA 2012

作者： Masrur, Alejandro Kindt, Philipp Becker, Martin Chakraborty, Samarjit Kleeberger, Veit Barke, Martin Schlichtmann, Ulf Institute for Real-Time Computer Systems TU Munich Germany Institute for Electronic Design Automation TU Munich Germany

ISBN: (纸本)9781467330176

With the rapid progress in semiconductor technology and the shrinking of device geometries, the resulting processors are increasingly becoming prone to effects like aging and soft errors. As a processor ages, its electrical characteristics degrade, i.e., the switching times of its transistors increase. Hence, the processor cannot continue error-free operation at the same clock frequency and/or voltage for which it was originally designed. In order to mitigate such effects, recent research proposes to equip processors with special circuitry that automatically adapts its clock frequency in response to changes in its circuit-level timing properties (arising from changes in its electrical characteristics). From the point of view of tasks running on these processors, such autonomic frequency scaling(AFS) processors become slower as they gradually age. this leads to additional execution delay for tasks, which needs to be analyzed carefully, particularly in the context of hard real time or safety-critical systems. Hence, for real-time systems based on AFS processors, the associated schedulability analysis should be aging-aware which is a relatively unexplored topic so far. In this paper we propose a schedulability analysis framework that accounts such aging-induced degradation and changes in timing properties of the processor, when designing hard real-time systems. In particular, we address the schedulability and task mapping problem by taking a lifetime constraint of the system into account. In other words, the system should be designed to be fully operational (i.e., meet all deadlines) till a given minimum period of time (i.e., its lifetime). the proposed framework is based on an aging model of the processor which we discuss in detail. In addition to studying the effects of aging on the schedulability of real-time tasks, we also discuss its impact on task mapping and resource dimensioning. © 2012 ieee.

关键词： real time systems

来源：评论

学校读者我要写书评

暂无评论

Mobile data stream mining: From algorithms to applications

Mobile data stream mining: From algorithms to applications

引用

2012 ieee 13th international conference on Mobile Data Management, MDM 2012

作者： Krishnaswamy, Shonali Gama, Joao Gaber, Mohamed Medhat Singapore Singapore Faculty of IT Monash University Australia Laboratory of Artificial Intelligence and Decision Support University of Porto Portugal School of Computing University of Portsmouth United Kingdom

ISBN: (纸本)9780769547138

this paper presents an overview of the current state-of-the-art in mobile data stream mining. this area of mobile data stream mining is significant for a number of new application domains such as mobile crowd sensing and mobile activity recognition. the paper presents the strategies and techniques for adaptation that are essential in order to perform real-time, continuous data mining on mobile devices. We present an overview of the algorithms research in this area. Finally, we discuss the key toolkits, systems and applications of mobile data stream mining. © 2012 ieee.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

the fixed priority scheduling problem for energy harvesting real-time systems

The fixed priority scheduling problem for energy harvesting ...

引用

18th ieee international conference on embedded and real-time computing systems and applications, RTCSA 2012

作者： Chandarli, Younès Abdeddaïm, Yasmina Masson, Damien Université Paris-Est LIGM UMR CNRS 8049 ESIEE Paris 2 bld Blaise Pascal 93162 Noisy-le-Grand Cedex France Université Paris-Est LIGM UMR CNRS 8049 Université Paris-Est Marne-la-vallée 5 bld Descartes 77454 Marne-la-Vallée Cedex 2 France

ISBN: (纸本)9781467330176

Energy harvesting is the process of generating electrical energy from environmental sources such as solar panels. In recent years, this term has been frequently applied in the context of small autonomous devices such as wireless sensor nodes. the classical scheduling theory is insufficient for this kind of systems and new scheduling problems arise in this context. Until now, the research on this area focused in trying to improve the efficiency of existing algorithms. Our approach is to complete these efforts by a feasibility theory allowing us to understand why classical optimal algorithms are not efficient anymore with energy constraints. In this paper, we try to establish a schedulability test for a fixed priority real-time scheduling problem with energy constraints. We first introduce the problem and describe the model. then, to illustrate the difficulty of the problem, we focus on a preemptive fixed priority scheduling policy where all the executions are postponed as long as possible. this policy lets the harvester the maximal amount of time to refill the battery. We call this policy PFPALAP for As Late As Possible. We try to define sufficient and/or necessary schedulability conditions and discuss its potential optimality under some additional assumptions. then, through simple counter examples, we show that intuitive assumptions are wrong for this scheduling problem, making it very interesting to study. © 2012 ieee.

关键词： Energy harvesting

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 13th international conference on Parallel and Distributed computing, applications, and Technologies, PDCAT 2012

Proceedings - 13th International Conference on Parallel and ...

引用

13th international conference on Parallel and Distributed computing, applications, and Technologies, PDCAT 2012

ISBN: (纸本)9780769548791

the proceedings contain 130 papers. the topics discussed include: an energy driven architecture for wireless sensor networks;a component based hybrid embedded framework for mobile robot;lightweight dynamic partitioning for last level cache of multicore processor on real system;a virtual sample generation approach for speculative multithreading using feature sets and abstract syntax trees;layered models for general parallel computation based on heterogeneous system;can we make it faster? efficient may-happen-in-parallel analysis revisited;solving parameter selection problem of helper thread prefetching via real-time hardware performance monitoring;a non-blocking self-organizing linked list algorithm;a smart-card-based remote user authentication protocol with privacy support;length-constrained and connected tours for sensor networks;and an efficient mobile social network for enhancing contents sharing over mobile ad-hoc networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improving interactivity via VT-CFS and framework-assisted task characterization for Linux/android smartphones

Improving interactivity via VT-CFS and framework-assisted ta...

引用

18th ieee international conference on embedded and real-time computing systems and applications, RTCSA 2012

作者： Huh, Sungju Yoo, Jonghun Hong, Seongsoo Department of Intelligent Convergence Systems Graduate School of Convergence Science and Technology Seoul National University Seoul Korea Republic of School of Electrical and Computer Engineering Seoul National University Seoul Korea Republic of

ISBN: (纸本)9781467330176

Android smart phones are often reported to suffer from sluggish user interactions due to poor interactivity. this is because the Linux kernel may incur perceptibly long response time to user interactive tasks. Particularly, the completely fair scheduler (CFS) of Linux cannot systematically favor a user interactive task over background tasks since it fails to effectively distinguish between them. Even if a user interactive task is successfully identified, such a task can suffer from a high scheduling latency due to the non-preemptive nature of CFS. this paper presents a framework-assisted task characterization and virtual runtime-based CFS (VT-CFS) to address these problems. the former is a cooperative mechanism between the Android application framework and the kernel. It identifies a user interactive task at the framework level and then enables the task scheduler to selectively promote the priority of the identified task at the kernel level. VT-CFS is an extension of the CFS. It allows a task to be preempted at any preemption tick so that the scheduling latency of a user interactive task is bounded by the tick interval. We have implemented our approach into Android 2.2 running with Linux kernel 2.6.32. Experimental results show that the response time of a user interactive task is reduced by up to 31.4% while incurring only 0.9% more run-time overhead than the legacy system. © 2012 ieee.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Separated Linux process logging mechanism for embedded systems

Separated Linux process logging mechanism for embedded syste...

引用

18th ieee international conference on embedded and real-time computing systems and applications, RTCSA 2012

作者： Amontamavut, Praween Nakagawa, Yuki Hayakawa, Eiichi Graduate School of Engineering Electronics and Information Science Takushoku University Japan Department of Computer Science Takushoku University Japan

ISBN: (纸本)9781467330176

this paper describes a low-overhead and prolonged Linux process logging mechanism that is separated into networks for embedded systems with small memory. It is useful to log the behavior of Linux processes in Android in order to debug, test, and learn about the embedded systems. However, the logging system interferes with process scheduling and requires huge storage to capture the process behavior. We propose a separated Linux process logging mechanism to solve these problems. Two features are utilized to develop the mechanism. the first is an improved logging performance. When acquiring context switch log data from an operating system, some data may be lost because of limited memory. To solve this problem, we propose a low-overhead data generating, low-latency data gathering and sending mechanism. this has a lightweight binary and string data format that uses a context-dependent log compression algorithm. the second feature is the construction of a log data management system that is available over a network. the logging mechanism is separated into two parts - a Logging Environment (LE) and a Logging Monitoring Environment (LME) - to reduce the effect of the target device and increase the volume of log data stored area. the LE consists of a log generation part in the target embedded device and a log collection part on the server. the LME consists of various monitoring and debugging tools, such as a log analyzer or log visualizer. In order to utilize the tools on the LME, the generated log data is exported to the log collection server via the network by an embedded device. the collected log data can be converted to an application-friendly format, such as Common Trace Format (CTF) or JavaScript Object Notation (JSON), on the log collection server to reduce the overhead of the embedded device in the LE and be easily available to the LME tools. We utilize an HTTP-based communication protocol between the LE and LME. As a result of an evaluation, the latency of data gathe

关键词： embedded systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共203页 << < 100 101 102 103 104 105 106 107 108 109 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：