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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,033 篇 会议
685 篇 期刊文献
9 篇 学位论文
5 册 图书

馆藏范围

10,732 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,362 篇 工学
- 1,162 篇 计算机科学与技术...
- 851 篇 电气工程
- 664 篇 信息与通信工程
- 293 篇 软件工程
- 276 篇 电子科学与技术（可...
- 221 篇 控制科学与工程
- 200 篇 仪器科学与技术
- 150 篇 机械工程
- 58 篇 交通运输工程
- 24 篇 材料科学与工程（可...
- 23 篇 网络空间安全
- 21 篇 石油与天然气工程
- 17 篇 光学工程
- 16 篇 动力工程及工程热...
- 15 篇 航空宇航科学与技...
- 7 篇 土木工程
- 6 篇 测绘科学与技术
- 4 篇 化学工程与技术
252 篇 管理学
- 247 篇 管理科学与工程(可...
- 6 篇 工商管理
- 6 篇 图书情报与档案管...
173 篇 理学
- 67 篇 系统科学
- 58 篇 物理学
- 30 篇 数学
- 16 篇 化学
- 9 篇 生物学
48 篇 文学
- 48 篇 新闻传播学
16 篇 医学
- 12 篇 临床医学
9 篇 经济学
- 7 篇 应用经济学
9 篇 军事学
- 9 篇 军队指挥学
5 篇 教育学
1 篇 法学

主题

10,732 篇 scheduling algor...
4,056 篇 processor schedu...
2,043 篇 delay
1,645 篇 throughput
1,565 篇 algorithm design...
1,380 篇 computer science
1,303 篇 resource managem...
1,302 篇 real time system...
1,292 篇 quality of servi...
1,170 篇 bandwidth
1,086 篇 traffic control
969 篇 job shop schedul...
946 篇 dynamic scheduli...
782 篇 costs
736 篇 telecommunicatio...
691 篇 switches
677 篇 optimal scheduli...
588 篇 application soft...
582 篇 heuristic algori...
520 篇 hardware

机构

40 篇 department of el...
32 篇 department of co...
30 篇 department of co...
30 篇 department of el...
30 篇 department of co...
29 篇 department of el...
29 篇 scuola superiore...
29 篇 department of co...
26 篇 department of co...
24 篇 department of co...
24 篇 school of electr...
23 篇 department of co...
22 篇 department of co...
22 篇 department of co...
22 篇 mitre corporatio...
22 篇 beijing universi...
21 篇 institute of com...
19 篇 department of el...
19 篇 bell laboratorie...
18 篇 department of el...

作者

30 篇 m. hamdi
26 篇 tei-wei kuo
25 篇 e. leonardi
21 篇 e.h.-m. sha
19 篇 sanjoy baruah
19 篇 f. neri
19 篇 klaus i. pederse...
18 篇 k.g. shin
18 篇 james h. anderso...
17 篇 p. giaccone
17 篇 maode ma
17 篇 v.o.k. li
16 篇 jian-jia chen
16 篇 n.k. jha
16 篇 kwei-jay lin
16 篇 d. mosse
15 篇 j.a. stankovic
15 篇 i. ahmad
15 篇 j.w.s. liu
15 篇 r. srikant

语言

10,592 篇 英文
82 篇 其他
58 篇 中文

检索条件"主题词=Scheduling algorithm"

共 10732 条记录，以下是4461-4470 订阅

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

详细简洁

排序：

Optimizing Distributed Foundation Fieldbus Process Control with *** Tool

Optimizing Distributed Foundation Fieldbus Process Control w...

引用

IEEE International Conference on Industrial Informatics (INDIN)

作者： Jianping Song Aloysius Mok Deji Chen Mark Nixon

In a foundation fieldbus-based process control system, control strategies are implemented in a distributed environment on devices connected to the fieldbus. Although the fieldbus standard specifies the procedure to implement a given control strategy, it is left to system engineers to figure out the optimal configuration of a strategy. In this paper, we present a practical software tool that searches for the optimal deployment of a control strategy, in terms of overall finish time of the macrocycle and the number of published message on the bus. Despite the theoretically high worst-case time complexity, our tool's running time is acceptable in practice because of the limited size of a fieldbus network in practice. In addition, we propose an effective heuristic to reduce the running time further. Experiments with real world data show that our program outperforms a commercial control system in terms of the quality of schedules generated.

关键词： Field buses Process control Control systems Job shop scheduling Automatic control Optimal control scheduling algorithm Systems engineering and theory Communication system control Software tools

来源：评论

学校读者我要写书评

暂无评论

CBX-1 Switch: An Effective Load Balanced Switch

CBX-1 Switch: An Effective Load Balanced Switch

引用

IEEE International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)

作者： Xiaoliang Wang Xiaohong Jiang Susumu Horiguchi Graduate School of Information Sciences University of Tohoku Sendai Japan

Load balance (LB) switch architecture is attractive for building high speed switches since it does not require a centralized scheduler and still can guarantee 100% throughput under any admissible traffic. It is notable, however, that due to the multi-path property of LB switches, the packet out-of-sequence problem may happen in such switches. Several schemes have been proposed to tackle the above problem, but these schemes either require infinite central buffer or introduce a high average packet delay. In this paper, we propose a new LB switch architecture - central buffer one-packet-crosspoint (CBX-1). The key idea ofCBX-1 is to introduce a VIOQ (virtual input output queue) with capacity one (i.e., it can store only one packet) after the first stage of a LB switch to emulate a CIXB-1 switch (combined input-one-packet-crosspoint buffered switch). We show through both analysis and simulation that although our architecture requires only finite central buffer to tackle the packet out-of-sequence problem, it still guarantees 100% throughput and achieves a good delay performance.

关键词： Switches Packet switching Delay Throughput Traffic control Computer architecture Processor scheduling scheduling algorithm Chromium Distributed computing

来源：评论

学校读者我要写书评

暂无评论

An adaptive packet-by-packet scheduler for multi-user MIMO cellular systems

An adaptive packet-by-packet scheduler for multi-user MIMO c...

引用

IEEE/IFIP International Conference in Central Asia on Internet (ICI)

作者： Masoomeh Torabzadeh Yusheng Ji National Institute of Informatics Graduate University of Advanced Studies (SOKENDAI) Tokyo Japan

Multiple-input multiple-output (MIMO) wireless antenna systems are known as the effective means to achieve high capacity over wireless links. In this paper, we propose an adaptive packet-by-packet scheduling scheme, which considers channel state information, user's average throughput, and queueing state information when making scheduling decision. Our proposed scheduler, adaptive proportional fairness with queue length consideration (APF-Q), is work conserving and can provide low delay of users in a fair way. Numerical results taking into consideration traffic characteristics and the mobility of users demonstrate the superior performance of the proposed APF-Q scheduler.

关键词： Adaptive scheduling MIMO Base stations Transmitting antennas Delay scheduling algorithm Throughput Traffic control Round robin Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

VLSI Architectures for Layered Decoding for Irregular LDPC Codes of WiMax

VLSI Architectures for Layered Decoding for Irregular LDPC C...

引用

IEEE International Conference on Communications (ICC)

作者： K. K. Gunnam G. S. Choi M. B. Yeary M. Atiquzzaman Department of ECE Texas A and M University College Station TX USA School of Electrical and Computer Engineering University of Oklahama Norman OK USA School of Computer Science University of Oklahama Norman OK USA

We present a new multi-rate architecture for decoding irregular LDPC codes in IEEE 802.16e WiMax standard. The proposed architecture utilizes the value-reuse property of offset min-sum, block-serial scheduling of computations and turbo decoding message passing algorithm. The decoder has the following advantages: 55% savings in memory, reduction of routers by 50%, and increase of throughput by 2times when compared to the recent state-of-the-art decoder architectures.

关键词： Very large scale integration Decoding Parity check codes WiMAX Computer architecture Code standards Processor scheduling Message passing scheduling algorithm Throughput

来源：评论

学校读者我要写书评

暂无评论

Hierarchically Clustered P2P Streaming System

Hierarchically Clustered P2P Streaming System

引用

IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference

作者： Chao Liang Yang Guo Yong Liu ECE Department Polytechnic University Brooklyn NY USA Corporate Research Thomson Inc. Princeton NJ USA

Peer-to-peer video streaming has been gaining popularity. However, it is still challenging to manage a P2P system efficiently to support high video playback rate. In this paper, we propose HCPS - Hierarchically Clustered P2P Streaming system that can support a streaming rate approaching the optimum upper bound with short delay, yet is simple enough to be implemented in practice. In HCPS, the peers are grouped into clusters and a hierarchy is formed among clusters to retrieve video data from the source server. By actively balancing the uploading capacities among clusters, and executing the perfect scheduling algorithm [1] within each cluster, the system resource can be fully utilized. The simulation experiments driven by the traces collected from a real P2P streaming system demonstrate the effectiveness of HCPS.

关键词： Streaming media scheduling algorithm Bandwidth Delay Internet Peer to peer computing Topology Bit rate Chaos Upper bound

来源：评论

学校读者我要写书评

暂无评论

Weighted fairness for flows in wireless mesh networks

Weighted fairness for flows in wireless mesh networks

引用

Asia-Pacific Conference on Communications

作者： Steven Gordon Binh Ngo Aruna Jayasuriya Sirindhorn International Institute of Technology Thammasat University Pathum Thani Thailand Institute for Telecommunications Res University of South Australia Mawson Lakes Australia

ISBN: (纸本)9781424413737;1424413737

Fairly allocating bandwidth to application sessions (flows) is difficult in Wireless Mesh Networks due to dynamics of wireless channel capacity and contention between flows on different nodes. Different scheduling algorithms have been applied to improve fairness in various scenarios. In this paper we propose a flow-based fairness scheme where a node determines its probability to send based on its flow requirements, and requirements of neighbor nodes. We propose novel methods for calculating this probability and distributing requirements to neighbors. Analysis shows our scheme can improve fairness, maintain high throughput, but at the expense of increased delay.

关键词： Wireless mesh networks Bandwidth Telecommunication traffic Probability Australia Spread spectrum communication Channel capacity scheduling algorithm Throughput Delay

来源：评论

学校读者我要写书评

暂无评论

Zero Latency Queuing System Based on Deficit Round Robin

Zero Latency Queuing System Based on Deficit Round Robin

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Byoung Chul Kim In Suk Chun Samsung Electronics Company Limited Suwon Gyeonggi South Korea

As the Internet grows in size and bandwidth, a variety of real time applications such as voice over IP (VoIP) and video conferences require low latency, bandwidth guarantee and delay bounded service constraints. Because current Internet provides only offer best effort services, packet scheduling algorithms supporting quality of service (QoS) requirements play an important part in switches and routers. This paper discusses a new packet scheduling discipline called zero latency queuing scheduler (ZLQS), which has one special zero latency queue (ZLQ) for real time traffic flows. When a packet comes to the ZLQ, it is serviced at a time from en-queue to de-queue without queuing latencies. The ZLQS offers zero latency queuing for real time traffic flows, and in addition it supports not only committed rate (CR)1 but also peak rate (PR)2 or burst rate (BR) for the bandwidth reservation. The ZLQS is a frame-based scheduler like deficit round robin (DRR), and therefore has the good properties of simple implementation at high speeds routers or switches, per packet work complexity of O(l) and almost perfect fairness.

关键词： Delay Round robin Bandwidth scheduling algorithm Web and internet services Quality of service Packet switching Switches Traffic control Internet telephony

来源：评论

学校读者我要写书评

暂无评论

VLSI Oriented Fast Multiple Reference Frame Motion Estimation algorithm for H.264/AVC

VLSI Oriented Fast Multiple Reference Frame Motion Estimatio...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Zhenyu Liu Lingfeng Li Yang Song Takeshi Ikenaga Satoshi Goto The Graduate School of IPS Waseda University Kitakyushu Japan

In H.264/AVC standard, motion estimation can be processed on multiple reference frames (MRF) to improve the video coding performance. For the VLSI real-time encoder, the heavy computation of fractional motion estimation (FME) makes the integer motion estimation (IME) and FME must be scheduled in two macro block (MB) pipeline stages, which makes many fast MRF algorithms inefficient for the computation reduction. In this paper, two algorithms are provided to reduce the computation of FME and IME. First, through analyzing the block's Hadamard transform coefficients, all-zero case after quantization can be accurately detected. The FME processing in the remaining frames for the block, detected as all-zero one, can be eliminated. Second, because the fast motion object blurs its edges in image, the effect of MRF to aliasing is weakened. The first reference frame is enough for fast motion MBs and MRF is just processed on those slow motion MBs with a small search range. The computation of IME is also highly reduced with this algorithm. Experimental results show that 61.4%-76.7% computation can be saved with the similar coding quality as the reference software. Moreover, the provided fast algorithms can be combined with fast block matching algorithms to further improve the performance.

关键词： Very large scale integration Motion estimation Automatic voltage control Video coding Processor scheduling Pipelines scheduling algorithm Quantization Image edge detection Software quality

来源：评论

学校读者我要写书评

暂无评论

A Near Optimal Antenna Assignment for MIMO Systems with Low Complexity

A Near Optimal Antenna Assignment for MIMO Systems with Low ...

引用

IEEE International Conference on Networks

作者： Masoomeh Torabzadeh Yusheng Ji National Institute of Informatics Graduate University of Advanced Studies (SOKENDAI) Tokyo Japan

ISBN: (纸本)9781424412297;1424412293

High performance, low complexity schedulers are challenging to develop for the downlink of multiple-input multiple-output (MIMO) cellular systems. Selection among available channels between users and the base station in a centralized way makes the problem complex. An approach to solve this problem is combinatorial optimization algorithms. In this case, the scheduling can be done in two different phases. The first phase is the user selection in which the scheduler selects a group of users based on its own criterion. The assignment scheme assigns the selected users to the transmit antennas, taking into consideration the capacity maximization in the second phase of the scheduling. Considerations related to user satisfaction, fairness, physical layer parameters, and/or traffic arrival processes in this kind of scheduler can be implemented with low complexity. For the second phase, we propose a near-optimal, low-complexity, assignment scheme, called the max difference of top two (MDTT). An intensive simulation study taking into account the mobility of users shows the superior performance of our assignment scheme.

关键词： MIMO Transmitting antennas Downlink Round robin Base stations Physical layer Traffic control Fading Throughput scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Path-Constrained Relaxed Schedulability Analysis

Path-Constrained Relaxed Schedulability Analysis

引用

International Symposium on Symbolic and Numeric algorithms for Scientific Computing (SYNASC)

作者： Stefan Andrei Samarjit Chakraborty Department of Computer Science Lamar University Beaumont TX USA School of Computing National University of Singapore Singapore

The schedulability analysis problem for many realistic task models is known to be hard (NP or coNP). As this severely restricts the application of these task models, recently there has been a considerable amount of interest in relaxed or approximate notions of schedulability, with the hope that they can be checked more efficiently. In this paper we introduce yet another natural notion of relaxed schedulability, which is parameterized in terms of the number of paths in a task set. In the model we consider, each task is represented by a directed acyclic graph where the nodes of such a graph are annotated with execution times and deadlines. Our proposed notion of schedulability allows a certain number of paths from each task graph to be non-schedulable. For describing the relaxed schedulability analysis, we formally define a measure called pseudo-K-schedulability, which corresponds to the situation when the task set has exactly K schedulable paths. At one extreme is the classical notion of schedulability analysis, where the problem is NP hard in our and many other task models. At the other extreme of this spectrum we have the trivial notion of schedulability analysis, where no path needs to be schedulable. Problems in between allow for a flexible notion of schedulability. This paper studies the relaxed schedulability because not all paths in a code are executed. This paper shows a fundamental result, namely the membership of the pseudoschedulability problem to the class of NP-hard problems.

关键词： scheduling algorithm Processor scheduling Real time systems algorithm design and analysis Polynomials Approximation algorithms System testing Context modeling Scientific computing Computer science

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 443 444 445 446 447 448 449 450 451 452 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：