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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

853 篇 会议
798 篇 期刊文献
14 册 图书

馆藏范围

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

日期分布

学科分类号

989 篇 工学
- 591 篇 计算机科学与技术...
- 429 篇 软件工程
- 246 篇 信息与通信工程
- 239 篇 电气工程
- 174 篇 电子科学与技术（可...
- 141 篇 控制科学与工程
- 87 篇 光学工程
- 82 篇 生物工程
- 66 篇 材料科学与工程（可...
- 64 篇 生物医学工程（可授...
- 59 篇 化学工程与技术
- 58 篇 机械工程
- 55 篇 仪器科学与技术
- 52 篇 动力工程及工程热...
- 32 篇 航空宇航科学与技...
- 26 篇 核科学与技术
- 24 篇 安全科学与工程
644 篇 理学
- 295 篇 数学
- 277 篇 物理学
- 99 篇 统计学（可授理学、...
- 96 篇 生物学
- 77 篇 化学
- 53 篇 系统科学
- 28 篇 地球物理学
182 篇 管理学
- 133 篇 管理科学与工程(可...
- 73 篇 工商管理
- 51 篇 图书情报与档案管...
63 篇 医学
- 55 篇 临床医学
- 48 篇 基础医学(可授医学...
24 篇 法学
18 篇 经济学
12 篇 农学
10 篇 教育学
4 篇 军事学

主题

123 篇 real time system...
110 篇 laboratories
64 篇 control systems
58 篇 application soft...
54 篇 processor schedu...
53 篇 delay
49 篇 computer archite...
47 篇 distributed comp...
42 篇 hardware
40 篇 power systems
38 篇 computer science
36 篇 fault tolerance
36 篇 computational mo...
34 篇 timing
31 篇 neural networks
29 篇 scheduling algor...
29 篇 particle swarm o...
27 篇 protocols
25 篇 resource managem...
24 篇 intelligent netw...

机构

103 篇 real-time comput...
32 篇 department of ph...
32 篇 faculty of scien...
32 篇 departamento de ...
32 篇 department for p...
32 篇 department of ph...
32 篇 dipartimento di ...
32 篇 yerevan physics ...
32 篇 institute of phy...
32 篇 institute of phy...
31 篇 lehrstuhl für ex...
31 篇 west university ...
31 篇 kirchhoff-instit...
31 篇 graduate school ...
31 篇 tomsk state univ...
30 篇 department of mo...
30 篇 department of ph...
30 篇 department of ph...
30 篇 department of ph...
30 篇 research center ...

作者

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

语言

1,474 篇 英文
175 篇 其他
17 篇 中文

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

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Towards energy-aware software-based fault tolerance in real-time systems

Towards energy-aware software-based fault tolerance in real-...

引用

International Symposium on Low Power Electronics and Design (ISLPED)

作者： O.S. Unsal I. Koren C.M. Krishna Architecture and Real-Time Systems Laboratory Department of Electrical and Computer Engineering University of Massachusetts Amherst MA USA

Many real-time systems employed in defense, space, and consumer applications have power constraints and high reliability requirements. In this paper, we focus on the relationship between fault tolerance techniques and energy consumption. In particular, we establish the energy efficiency of Application Level Fault Tolerance (ALFT) over other software-based fault tolerance methods. We then develop sensible energy-aware heuristics for ALFT schemes. The heuristics yield up to 40% energy savings.

关键词： Fault tolerant systems real time systems Fault tolerance Redundancy Application software Power system reliability Permission Scheduling computer architecture Laboratories

来源：评论

学校读者我要写书评

暂无评论

Efficiently tolerating failures in asynchronous real-time distributed systems

Efficiently tolerating failures in asynchronous real-time di...

引用

IEEE International Symposim on High Assurance Systems engineering

作者： Peng Li B. Ravindran The Bradley Department of Electrical and Computer Engineering Real-Time Systems Laboratory Virginia Tech Antenna Group Blacksburg VA USA

We present a proactive resource allocation algorithm, called BEA, for fault-tolerant asynchronous real-time distributed systems. BEA considers an application model where transnode application timeliness requirements are expressed using benefit functions, and anticipated workload during future time intervals are expressed using adaptation functions. Furthermore, BEA considers an adaptation model where subtasks of application tasks are replicated at run-time for tolerating failures as well as for sharing workload increases. Given such models, the objective of the algorithm is to maximize the aggregate real-time benefit and the ability to tolerate host failures during the time window of adaptation functions. Since determining the optimal solution is computationally intractable, BEA heuristically computes near-optimal resource allocations in polynomial-time. We show that BEA can achieve almost the same fault-tolerance ability as full replication, and accrue most of real-time benefit that full replication can accrue. In the meanwhile, BEA requires much fewer replicas than full replication, and hence is cost effective.

关键词： real time systems Resource management Runtime Quality of service Fault tolerance Application software Adaptation model Aggregates Polynomials Costs

来源：评论

学校读者我要写书评

暂无评论

Parallel and distributed computing with coevolutionary algorithms 16

Parallel and distributed computing with coevolutionary algor...

引用

16th International Parallel and Distributed Processing Symposium, IPDPS 2002

作者： Seredynski, F. Zomaya, A.Y. Department of Computer Science Institute of Insurance Wesola 52 Kielce25-353 Poland Parallel Computing Research Laboratory Department of Electrical and Electronic Engineering University of Western Australia Nedlands PerthWA6907 Australia

ISBN: (纸本)0769515738

The problem of parallel and distributed function optimization is considered. Two coevolutionary algorithms with different degrees of parallelism and different levels of a global coordination are used for this purpose and compared with sequential genetic algorithm (GA). The first coevolutionary algorithm called a loosely coupled genetic algorithm (LCGA) represents a competitive coevolutionary approach to problem solving and is compared with another coevolutionary algoritm called cooperative coevolutionary genetic algorithm (CCGA). The algorithms are applied for parallel and distributed optimization of a number of test functions known in the area of evolutionary computation. We show that both coevolutionary algorithms outperform a sequential GA. While both LCGA and CCGA algorithms offer high quality solutions, they may compete to outperform each other in some specific test optimization problems. The LCGA may be recommended to be used in optimization systems when high degree of parallelism is possible and non global coordination is expected while the CCGA algorithm is useful when low degree of parallelism and global coordination is acceptable. © 2002 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Coevolution and evolving parallel cellular automata-based scheduling algorithms 5th

引用

5th International Conference on Evolution Artificielle, EA 2001

作者： Seredyński, Franciszek Zomaya, Albert Y. The University of Podlasie Computer Science Department Sienkiewicza 51 Siedlce08-110 Poland Parallel Computing Research Laboratory Department of Electrical and Electronic Engineering The University of Western Australia Nedlands PerthWA6907 Australia

ISBN: (纸本)3540435441

The paper reports new results on developing parallel algorithms for multiprocessor scheduling with use of cellular automata (CAs). The simpliest case when a multiprocessor system is limited to two processors, but without of any limitations on a size and parameters of parallel programs is considered. An approach called a selected neighborhood is used to design a structure of CAs for a given program graph. Co evolutionary genetic algorithm (GA) to discover rules of parallel CAs, suitable for solving the scheduling problem is proposed. Sequential and parallel scheduling algorithms discovered in the context of CAs - based scheduling system are compared. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Cellular automata

来源：评论

学校读者我要写书评

暂无评论

BPA: a fast packet scheduling algorithm for real-time switched Ethernet networks

BPA: a fast packet scheduling algorithm for real-time switch...

引用

International Conference on Parallel Processing (ICPP)

作者： Jinggang Wang B. Ravindran Real-Time Systems Laboratory The Bradley Department of Electrical and Computer Engineering Virginia Polytechnic Institute and State University Blacksburg VA USA

In this paper, we present a MAC-layer packet scheduling algorithm, called BPA, for real-time switched Ethernet networks. BPA considers a message model where trans-node application-level messages have end-to-end timeliness requirements that are specified using Jensen's benefit functions. The objective of BPA is to maximize the aggregate message-level benefit. The algorithm reasons that this objective can be achieved by maximizing aggregate packet-level benefit, where packets of messages are allowed to inherit benefit functions of their parent messages. BPA thus solves a non-preemptive packet scheduling problem. Since this problem is NP-hard, BPA heuristically computes packet schedules to maximize aggregate benefit, incurring a worst-case computational complexity of O(n/sup 2/). This is better than the O(n/sup 3/) complexity of the previously known best algorithm (called CMA) for the same problem. Further, our experimental studies show that BPA performs as good as CMA for a broad set of benefit functions, and significantly outperforms CMA for some benefit functions. Furthermore, we observe that BPA yields lower missed-deadline ratio than CMA when message arrival density increases.

关键词： Scheduling algorithm Packet switching Ethernet networks Multiaccess communication real time systems Protocols Aggregates Bandwidth Timing Laboratories

来源：评论

学校读者我要写书评

暂无评论

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

An efficient schedulability analysis policing technique for ...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Eui-Nam Huh L.R. Welch B. Pfarr Department of Computer Science Sahmyook University Seoul South Korea School of Electrical Engineering & Computer Science Ohio University Athens OH USA Real-Time Software Engineering Branch NASA/GSFC

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). However, certain realtime 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.

关键词： Dynamic scheduling Processor scheduling Application software computer science Performance analysis Software engineering Page description languages Reactive power Quality of service

来源：评论

学校读者我要写书评

暂无评论

Musical instruments recognition using hidden Markov model

Musical instruments recognition using hidden Markov model

引用

Asilomar Conference on Signals, Systems & computers

作者： Jonghyun Lee Joohwan Chun Scientific Computing Laboratory Department of Electrical Engineering and Computer Science Korea Advanced Institute of Science and Technology Daejeon South Korea

ISBN: (纸本)0780375769

A new musical instrument recognition technique based on a hidden Markov model (HMM) is proposed. The spectral envelope is the key information of instrument characteristic and timbre. We decompose an instrument sound into sinusoidal components (harmonics) and noise components and estimate the amplitudes of the harmonics component. We want to express the spectral envelope effectively using estimated amplitude, therefore, we define three kinds of features and apply a recognition procedure to each feature. The HMM model used is continuous single Gaussian output HMM. To evaluate the performance of the recognition technique, the proposed technique is applied to classify the real instrumental sound of MUMS (MacGill University Master Samples). The recognition success ratio is more than 70%.

关键词： Instruments Frequency estimation Hidden Markov models Amplitude estimation Frequency synthesizers Sampling methods Acoustic noise Noise level Phase noise Stochastic resonance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：