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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是4661-4670 订阅

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

详细简洁

排序：

Admission Control Framework for Delay Bounded Traffic in Cellular Networks

Admission Control Framework for Delay Bounded Traffic in Cel...

引用

IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference

作者： Yaser Khamayseh Ehab S. Elmallah Department of Computing Science University of Alberta Edmonton Canada

In this paper we present an admission control framework for serving streaming connections to mobile users in wireless cellular networks. The network is assumed to allocate a fixed number of channels to streaming services, and serve each connection at a fixed data rate. In addition, it is assumed that each connection has specified bounds on the maximum tolerable start of service delay, and the total service interruption delay. The admission control problem is formalized as a discrete scheduling problem which the framework handles by utilizing a heuristic algorithm guided by a mechanism that dynamically adapts a scheduling planning interval according to the offered connection request pattern. The devised framework does not assume a priori knowledge of the distribution of the arriving requests from either the target cell, or as a consequence of handoff. Performance is compared against a scheme that assumes a priori knowledge of such traffic distribution and admits a stream only if the estimated cell overload probability, after a prescribed prediction interval, does not exceed a specified threshold value. The obtained results show improvements with regard to the achieved throughput of the connections served to completion, and forced terminations.

关键词： Admission control Communication system traffic control Land mobile radio cellular systems Delay Streaming media scheduling algorithm Dynamic scheduling Processor scheduling Throughput Quality of service

来源：评论

学校读者我要写书评

暂无评论

Joint Node and Link Assignment in an STDMA Network

Joint Node and Link Assignment in an STDMA Network

引用

IEEE 65th Vehicular Technology Conference (VTC-Spring 2007), vol.3

作者： Ashay Dhamdhere Jimmi Gronkvist

Spatial Re-use TDMA (STDMA) is a Medium Access Control (MAC) protocol which allows multiple transmitter-receiver pairs to communicate simultaneously, as long as they do not interfere too much with each other. Node and link assignment strategies for Spatial re-use TDMA networks have previously been studied independently. The metric chosen in these studies is the uniform capacity, the minimum rate at which any node can communicate with any other node in the network. It has been shown that for large frame lengths, node assignment leads to lower spatial re-use than link assignment, resulting in lower uniform capacity than link assignment. In this paper, we first explore the behaviour of node and link assignment at small frame lengths. We show that node assignment achieves non-zero throughput values at lower frame lengths than link assignment, and that it outperforms link assignment at small frame lengths. This motivates the need for an assignment strategy that performs well for all values of the frame length. We propose a joint node-link assignment strategy and show that it performs as well as node assignment at small frame lengths and as well as link assignment at large frame lengths, while exceeding the performance of both node and link assignment at intermediate frame lengths.

关键词： Telecommunication traffic Time division multiple access Distributed algorithms Media Access Protocol Costs scheduling algorithm algorithm design and analysis Traffic control Measurement Access protocols

来源：评论

学校读者我要写书评

暂无评论

Clock Period Minimization with Minimum Delay Insertion 07

Clock Period Minimization with Minimum Delay Insertion

引用

Design Automation Conference

作者： Shih-Hsu Huang Chun-Hua Cheng Chia-Ming Chang Yow-Tyng Nieh Department of Electronic Engineering Chung Yuan Christian University Chungli Taiwan

ISBN: (纸本)9781595936271

The combination of clock skew scheduling and delay insertion may lead to further clock period reduction. Although some previous works can minimize the clock period, they only heuristically reduce the required inserted delay. However, since the delay insertion is an ECO (engineering change order) process, minimizing the required inserted delay is very important for the design closure, hi this paper, we present a linear program to formally formulate the simultaneous application of clock skew scheduling and delay insertion. Our objective is not only to achieve the lower bound of the clock period, but also to achieve the lower bound of required inserted delay. Compared with previous works, our paper has the following two significant contributions: (1) our approach is the first work that guarantees solving this problem optimally; and (2) our paper is the first proof of showing that the time complexity of this problem is polynomial.

关键词： Clocks Delay scheduling algorithm Polynomials Timing Libraries Design engineering Upper bound Logic design Design optimization

来源：评论

学校读者我要写书评

暂无评论

A low complexity distributed multibase transmission scheme for improving the sum capacity of wireless networks

A low complexity distributed multibase transmission scheme f...

引用

IEEE Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Hilde Skjevling David Gesbert Are Hjorungnes Department of Informatics University of Oslo Oslo Norway Mobile Communications Department Eurécom Institute Sophia-Antipolis France UniK-University Graduate Center University of Oslo Kjeller Norway

This paper addresses the problem of base station coordination in multicell wireless networks. We present a distributed approach to downlink multibase beamforming, as well as a low complexity, near-optimal, scheduling algorithm, allowing the multiplexing of M user terminals randomly located in a network with N base stations. The algorithms rely on the maximization of the sum rate of the network, based on locally available information at each base station. Results show that our approach yields significant gains in the system capacity when compared to schemes not allowing cooperation between cells, without requiring the extensive signaling overhead involved in optimal multicell MIMO processing.

关键词： Wireless networks Base stations MIMO Array signal processing Interference Downlink scheduling algorithm Signal processing Resource management Femtocell networks

来源：评论

学校读者我要写书评

暂无评论

New Code Generation algorithm for QueueCore An Embedded Processor with High ILP

New Code Generation Algorithm for QueueCore An Embedded Proc...

引用

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

作者： Arquimedes Canedo Ben A. Abderazek Masahiro Sowa University of Electro-Communications Tokyo Japan

Modern architectures rely on exploiting parallelism found at the instruction level to achieve high performance. Aggressive ILP compilers expose high amounts of instruction level parallelism where, in some cases, the number of architected registers is not enough to hold the results of potential parallel instructions. This paper presents a new code generation scheme for the QueueCore, a 32-bit queue-based architecture capable of executing high amounts of ILP. QueueCore's instructions implicitly read their operands and write results. Compiling for the QueueCore requires that all instructions have at most one explicit operand represented as an offset calculated at compile-time. Additionally, the instructions must be scheduled in level-order manner. The proposed algorithm successfully restricts all instructions to have at most one offset reference, it computes the offset values, and makes a level-order scheduling of the program. To evaluate the effectiveness of the new code generation scheme we developed a queue compiler and compiled a set of benchmark programs. Our results show that the code has more parallelism than optimized RISC code by factors ranging from 1.12 to 2.30. QueueCore's instruction set allows us to generate code about 40%-18% denser than optimized RISC code.

关键词： Registers Parallel processing Hardware Processor scheduling scheduling algorithm Program processors Reduced instruction set computing Encoding Computational modeling Distributed computing

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluations and Estimations ofWorkload of On-Demand Updates in Soft Real-Time Systems

Performance Evaluations and Estimations ofWorkload of On-Dem...

引用

IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

作者： Thomas Gustafsson Jorgen Hansson Department of Information and Computer Science Linköping University Sweden School of Engineering Jönköping University Sweden Software Engineering Institute Carnegie Mellon University USA

Data being used in real-time systems must be up-to-date to produce correct results. The use of outdated data can have catastrophic consequences since calculated control signals are based on stale data. Two distinct methods to update data exist: (i) dedicated tasks (DT) update data items, and (ii) on-demand (OD) updating being a conditioned part of the execution flow of tasks. On-demand updating has not been studied in terms of CPU utilization analysis for real-time systems. This paper studies on-demand updating in terms of (i) imposed workload and compares the workload to deferrable scheduling (DS), and (ii) analytical formula for estimating workload to be used in CPU utilization based schedulability tests. It is found that on-demand updating uses less workload for updates compared to DS, which suggests on-demand updating should be used for resource constrained systems. However, using on-demand updating makes the execution times of updates unpredictable, which currently gives two possibilities (i) be pessimistic and assume all updates always execute or (ii) be less pessimistic but estimate the times between executions of updates. This paper devises a formula for such estimates and compares their result to approach (i). Evaluations show the formula can be useful for soft real-time systems.

关键词： Real time systems Job shop scheduling Testing Processor scheduling Industrial control Probability density function Data engineering Computer science Software engineering scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Community Learning by Graph Approximation

Community Learning by Graph Approximation

引用

IEEE International Conference on Data Mining (ICDM)

作者： Bo Long Xiaoyun Wu Zhongfei Zhang Philip S. Yu SUNY Binghamton USA Google Inc. USA IBM Watson Research Center USA

Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we propose a general model based on graph approximation to learn link-pattern based community structures from a graph. The model generalizes the traditional graph partitioning approaches and is applicable to learning various community structures. Under this model, we derive a family of algorithms which are flexible to learn various community structures and easy to incorporate the prior knowledge of the community structures. Experimental evaluation and theoretical analysis show the effectiveness and great potential of the proposed model and algorithms.

关键词： Web pages algorithm design and analysis Web mining Vehicles Data mining USA Councils Communities Partitioning algorithms scheduling algorithm Social network services

来源：评论

学校读者我要写书评

暂无评论

Task Merging for Dynamic Power Management of Cyclic Applications in Real-Time Multiprocessor Systems

Task Merging for Dynamic Power Management of Cyclic Applicat...

引用

IEEE International Conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： Qinru Qiu Shaobo Liu Qing Wu Binghamton University Binghamton NY USA

In this paper we propose the method of task merging and idle period clustering for dynamic power management (DPM) in a real-time system with multiple processing elements. We show that with good task scheduling, the energy and delay overheads due to power mode switching can be reduced significantly, while the opportunity for the system to switch to low power modes can be further improved. New on-line and off-line task scheduling algorithms are proposed that minimize the number of idle time intervals under the deadline and precedence constraints. A simple DPM policy is then used to save the energy dissipation during the idle time intervals. Experimental results show that, comparing to the DPM schemes without proper task scheduling, the proposed method reduces the number of power mode switching by 56% in average.

关键词： Merging Energy management Power system management Real time systems Multiprocessing systems Processor scheduling Digital signal processing Switches scheduling algorithm Field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Disjunctive Temporal Problems with Classes

Fuzzy Disjunctive Temporal Problems with Classes

引用

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

作者： M. Falda Department of Pure and Applied Mathematics Padova Italy

This paper describes a framework for temporal reasoning that allows managing a restricted form of disjunctive temporal constraints without making the modelled problems intractable as in the case of general DTPs. This is obtained by assigning classes to the constraints and by allowing only one constraint per class, in order to build a collection of independent STPs that can share sub-problems and therefore allows increasing algorithm efficiency. The model proposed is directly applied to fuzzy constraint satisfaction problems and can be solved using an extended fuzzy path-consistency algorithm, also presented in the paper. A simple application to medical diagnosis shows its expressive power over previous tractable temporal reasoning models.

关键词： Fuzzy reasoning Desktop publishing Fuzzy sets Polynomials Medical diagnosis Constraint theory Fuzzy set theory scheduling algorithm Path planning Mathematics

来源：评论

学校读者我要写书评

暂无评论

The Simulation Comparison of Transportation Mode in Distribution Network

The Simulation Comparison of Transportation Mode in Distribu...

引用

International Conference on Services Systems and Services Management, ICSSSM

作者： Jun Zhang Jiafu Tang Ying Dong Gang Dong Key Laboratory of Integrated Automation of Process Industry of MOE Shenyang Liaoning China

It studies the features of three transportation modes and gives the model of them. All the researches are under single supplier, multiple retailers, multiple products, multiple times and direct shipping strategies. Firstly it analyses the influence on the total costs corresponding to the optimization solution when parameters vary. Then it lays the emphasis on the vehicle-rent transportation mode. It studies which parameters vary has the larger influence on the total costs. It also analyses the range of the rent under given condition. At last it shows the function of the prototype system.

关键词： Logistics Road transportation Vehicles Job shop scheduling scheduling algorithm Cost function Prototypes Production Laboratories Automation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 463 464 465 466 467 468 469 470 471 472 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：