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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

6,753 篇 会议
1,802 篇 期刊文献
5 篇 学位论文
1 册 图书

馆藏范围

8,561 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

5,405 篇 工学
- 3,895 篇 计算机科学与技术...
- 1,640 篇 信息与通信工程
- 1,591 篇 软件工程
- 1,516 篇 电气工程
- 588 篇 控制科学与工程
- 342 篇 电子科学与技术（可...
- 308 篇 机械工程
- 194 篇 动力工程及工程热...
- 187 篇 交通运输工程
- 115 篇 仪器科学与技术
- 81 篇 航空宇航科学与技...
- 69 篇 生物工程
- 62 篇 冶金工程
- 49 篇 土木工程
- 46 篇 安全科学与工程
- 43 篇 建筑学
- 39 篇 网络空间安全
- 38 篇 力学（可授工学、理...
- 38 篇 光学工程
1,883 篇 管理学
- 1,764 篇 管理科学与工程(可...
- 1,433 篇 工商管理
- 222 篇 图书情报与档案管...
1,759 篇 理学
- 1,440 篇 数学
- 224 篇 系统科学
- 199 篇 统计学（可授理学、...
- 148 篇 物理学
- 90 篇 生物学
- 41 篇 化学
101 篇 经济学
- 99 篇 应用经济学
67 篇 法学
- 62 篇 社会学
49 篇 医学
37 篇 农学
27 篇 教育学
25 篇 文学
5 篇 艺术学
2 篇 军事学

主题

8,561 篇 scheduling algor...
1,047 篇 scheduling
567 篇 schedules
520 篇 resource managem...
511 篇 real-time system...
473 篇 cloud computing
439 篇 throughput
420 篇 heuristic algori...
392 篇 quality of servi...
377 篇 delays
307 篇 task analysis
304 篇 dynamic scheduli...
295 篇 optimization
261 篇 computational mo...
228 篇 simulation
217 篇 energy consumpti...
208 篇 bandwidth
205 篇 job shop schedul...
198 篇 servers
194 篇 algorithm design...

机构

26 篇 beijing universi...
24 篇 state key labora...
21 篇 university of ch...
18 篇 national mobile ...
14 篇 institute of com...
13 篇 hong kong polyte...
13 篇 purple mountain ...
12 篇 northeastern uni...
12 篇 college of compu...
10 篇 college of compu...
10 篇 sun yat sen univ...
10 篇 georgia state un...
10 篇 school of softwa...
10 篇 university of el...
10 篇 scuola super san...
10 篇 school of automa...
9 篇 shanghai jiao to...
9 篇 school of electr...
9 篇 college of compu...
9 篇 department of el...

作者

21 篇 ghaderi javad
16 篇 baruah sanjoy
15 篇 guan nan
13 篇 yi wang
13 篇 gao hong
11 篇 anderson james h...
11 篇 xie zhiqiang
11 篇 buyya rajkumar
11 篇 wang yi
10 篇 wei hu
10 篇 wang wei
10 篇 zhang jie
10 篇 jing liu
9 篇 zhang lei
9 篇 deng qingxu
9 篇 ying lei
9 篇 guo song
9 篇 hsu yu-pin
9 篇 li bo
9 篇 shakkottai sanja...

语言

8,305 篇 英文
167 篇 其他
81 篇 中文
7 篇 西班牙文
4 篇 朝鲜文
2 篇 日文
1 篇 斯洛文尼亚文
1 篇 土耳其文

检索条件"主题词=scheduling algorithms"

共 8561 条记录，以下是4671-4680 订阅

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

详细简洁

排序：

A wised routing protocols for LEO satellite networks

A wised routing protocols for LEO satellite networks

引用

Asian Control Conference

作者： Saeid Aghaei Nezhad Firouzja Muhammad Yousefnezhad Mohd Fauzi Othman Masoud Samadi College of Electronic Engineering Shanghai Jiang Tong University China College of Computer Science & Technology Nanjing University of Aeronautics and Astronautics China Center for Artificial Intelligence and Robotics Universiti Teknologi Malaysia Kuala Lumpur Malaysia

This Study proposes a routing strategy of combining a packet scheduling with congestion control policy that applied for LEO satellite network with high speed and multiple traffic. It not only ensures the QoS of different traffic, but also can avoid low priority traffic to be “starve” due to their weak resource competitiveness, thus it guarantees the throughput and performance of the network. In the end, we set up a LEO satellite network simulation platform in OPNET to verify the effectiveness of the proposed algorithm.

关键词： Satellites Routing Delays Quality of service Packet loss scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Production control in semiconductor manufacturing with time constraints

Production control in semiconductor manufacturing with time ...

引用

IEEE/SEMI Conference and Workshop on Advanced Semiconductor Manufacturing

作者： Rezvan Sadeghi Stéphane Dauzère-Pérès Claude Yugma Guillaume Lepelletier Department of Manufacturing Sciences and Logistics UMR CNRS 6158 Gardanne France STMicroelectronics Crolles Cedex France

In this paper, production of lots under time constraints in a semiconductor wafer fabrication is investigated. A time constraint covers a sequence of process steps and has a maximum time that lots must spend in these steps. Lots which violate a recommended time constraint have to be scrapped or reprocessed. Accordingly, controlling the entrance of lots in a time constraint is critical in semiconductor fabrication. An approach is developed to estimate whether a given lot may satisfy time constraints or not. Some numerical experiments are presented with industrial data.

关键词： Time factors scheduling algorithms Probabilistic logic Job shop scheduling Manufacturing

来源：评论

学校读者我要写书评

暂无评论

Improving the Quality of Experience with Size-Based and Opportunistic scheduling 11

Improving the Quality of Experience with Size-Based and Oppo...

引用

11th IEEE International Symposium on Wireless Communications Systems (ISWCS)

作者： Proebster, Magnus Univ Stuttgart Inst Commun Networks & Comp Engn D-70174 Stuttgart Germany

ISBN: (纸本)9781479958634

In cellular networks, the Shortest Remaining Processing Time first (SRPT) principle, which is known to be optimal for sharing jobs on a single-server system, can deliver significant advantages over conventional scheduling algorithms. Transmissions are finished earlier, which improves user experience and enables operators to allow more users in their networks. However, this comes at the cost of reduced cell throughput and a penalty for large objects in peak traffic situations. We therefore propose an extension to SRPT that combines it with opportunistic scheduling and allows to trade off the advantages of both sides. We evaluate and compare the performance of SRPT and conventional schedulers by simulation with a realistic traffic scenario. An important metric is the transmission duration of application layer objects as it is central for the users' Quality of Experience (QoE). The results show that the proposed scheduler provides the superior QoE of SRPT for short, interactive transmissions while keeping the rate reduction for larger traffic objects at an acceptable level.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Outage Analysis of MIMO Multiuser Broadcast scheduling with MMSE Receiver

Outage Analysis of MIMO Multiuser Broadcast Scheduling with ...

引用

2014 IEEE/CIC International Conference on Communications in China - Workshops (CIC/ICCC)

作者： Li, Rongsheng Gao, Hui Lv, Tiejun Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Minist Educ Key Lab Trustworthy Distributed Comp & Serv Beijing 100876 Peoples R China

ISBN: (纸本)9781479941469

In future wireless communication systems, multiple-input multiple-output (MIMO) technique and multi-user scheduling may play a key role in enhancing link reliability and spectral efficiency. In addition, linear signal processing is near-optimal when the number of the antennas becomes very large in the next generation wireless network. In this paper, we aim to investigate overall outage performance of multi-user MIMO broadcast system using minimum mean squared error receivers. Several scheduling algorithms are considered over Rayleigh fading channel. Tight and closed-form upper bounds of the overall outage probabilities are derived for two round-robin scheduling algorithms and two feedback-based opportunistic scheduling algorithms. Our analysis indicates that there exists an performance gap between opportunistic scheduling algorithm and stream-specific opportunistic scheduling algorithm. This gap is related to the number of transmit data streams N-t and the number of users K, and the gap becomes larger as N-t and K increase.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Downlink scheduling in Visible Light Communications 6

Downlink Scheduling in Visible Light Communications

引用

6th International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Babatundi, Ojemba Qian, Lijun Cheng, Julian Prairie View A&M Univ Texas A&M Univ Syst Dept Elect & Comp Engn Prairie View TX 77446 USA Univ British Columbia Sch Engn Kelowna BC V1V 1V7 Canada

ISBN: (纸本)9781479973392

Visible Light Communication (VLC) using Light Emitting Diodes (LEDs) within the existing lighting infrastructure would reduce the implementation cost and may operate at higher throughput than RF or Infrared (IR) based wireless systems. One of the major concerns in VLC implementation is developing resource allocation schemes that maintain or increase channel throughput, ensure fairness and fast link recovery while reducing delay. To address this challenge, the characteristics of VLC channel is modeled in detail mathematically and the resource allocation problem is formulated for a centrally controlled indoor VLC system in this paper. We focus on a VLC system providing location based services and it is shown that the resource allocation problem can be solved by optimal scheduling, and the solution has to consider different transmission scenarios based on different transmitters and receivers' locations. Specifically, a scheduling algorithm using proportional fair principle is proposed and the simulation results demonstrate that the proposed algorithm outperform the maximum rate scheduling and round robin by balancing the user throughput and fairness among users. A prototype of the VLC system is currently under development to demonstrate the effectiveness of the proposed system.

关键词： Interference Light emitting diodes Optical receivers Optical transmitters Resource management scheduling algorithms Light emitting diodes Optical transmitters management of resources Optical receivers scheduling algorithms variable length codes Resource utilization Visible light communication Throughput interference Round robin

来源：评论

学校读者我要写书评

暂无评论

Time-Frequency Coupled Proportional Fair Scheduler with Multicarrier Awareness for LTE Downlink

Time-Frequency Coupled Proportional Fair Scheduler with Mult...

引用

IEEE Vehicular Technology Conference

作者： D. Martin-Sacristan J. F. Monserrat D. Calabuig N. Cardona Universitat Politecnica de Valencia - iTEAM Research Institute

ISBN: (纸本)9781479980895

Proportional fair schedulers have been thoroughly used in Long Term Evolution (LTE) due to their ability to provide a good trade-off between cell spectral efficiency and user fairness. Current algorithms provide suboptimum solutions at a low computational cost, but present several drawbacks. This paper proposes a Coupled and Multicarrier Aware PFS (CMA-PFS) for LTE downlink that increases efficiency as compared with current algorithms with independent time and frequency domain scheduling, referred to as Decoupled PFS (D-PFS). The proposed algorithm includes new features such as tight coupling between time and frequency domain scheduling and multicarrier transmission awareness. Simulations have been conducted using an International Mobile Telecommunications Advanced (IMT-Advanced) compliant semi-static simulator. Results show that the CMA-PFS improves proportional fairness as compared with D-PFS that is reflected both in an increase of cell spectral efficiency (around +2%) and a higher cell-edge user spectral efficiency (around +10%) in a Single User MIMO (SU-MIMO) system.

关键词： Long Term Evolution Throughput Couplings Algorithm design and analysis scheduling algorithms Mathematical model Downlink

来源：评论

学校读者我要写书评

暂无评论

Uniprocessor Feasibility of Sporadic Tasks Remains coNP-Complete under Bounded Utilization

Uniprocessor Feasibility of Sporadic Tasks Remains coNP-Comp...

引用

Real-Time Systems Symposium (RTSS)

作者： Pontus Ekberg Wang Yi Uppsala University Sweden

A central problem in real-time scheduling theory is to decide whether a sporadic task system with constrained deadlines is feasible on a preemptive uniprocessor. It is known that this problem is strongly coNP-complete in the general case, but also that there exists a pseudo-polynomial time solution for instances with utilization bounded from above by any constant c, where 0

关键词： Complexity theory Real-time systems Boosting Electronic mail Resumes scheduling algorithms Schedules

来源：评论

学校读者我要写书评

暂无评论

Opportunistic fair resource sharing with secrecy considerations in uplink wiretap channels

Opportunistic fair resource sharing with secrecy considerati...

引用

IEEE Conference on Wireless Communications and Networking

作者： Xin Ge Hu Jin Xiuhua Li Victor C. M. Leung Dept. Electrical and Computer Engineering The University of British Columbia Vancouver Canada Dept. Electronics and Communication Engineering Hanyang University Ansan Republic of Korea

ISBN: (纸本)9781479984077

In this paper, we propose two opportunistic scheduling algorithms for uplink wiretap networks with multiple legitimate users (LUs) and eavesdroppers. Different from the existing works on scheduling algorithms with secrecy considerations, we focus on the practical scenario where LUs experience diverse path-loss to the base station (BS). Hence, both secrecy throughput and fairness among LUs are crucial design considerations. In the proposed scheduling algorithms, the feedback information generated by each LU is designed to reduce the probability that the LU is selected by the BS when the eavesdroppers overhear much information. It is proved that fairness among LUs can be achieved in arbitrary fading channels. In order to investigate the efficiency of our proposed scheduling algorithms, the normalized secrecy throughput, i.e., the secrecy throughput for a given LU normalized by the probability of it being selected, is analyzed and proved to achieve double-logarithmic growth when the number of LUs in the network increases to infinity.

关键词： Throughput scheduling algorithms Resource management Signal to noise ratio Uplink Wireless networks Diversity methods

来源：评论

学校读者我要写书评

暂无评论

Modified SINR based user selection for MU-MIMO systems

Modified SINR based user selection for MU-MIMO systems

引用

International Conference on Information and Communication Technologies (ICICT)

作者： Muddasar Naeem Sajid Bashir Muhammad Usman Khan Aqeel A Syed Dept of Computer Science Iqra University Islamabad Pakistan Dept of Electronics Quaid-i-Azam University Islamabad Pakistan

ISBN: (纸本)9781467389082

In multi-antenna systems, the spatial degree of freedom can be efficiently exploited to enhance the system capacity by effectively scheduling the multiple users. This article analyzes the interference based scheduling for multiuser MIMO (MU-MIMO) communication in terms of performance gains, fairness, and computational complexity. We also consider the significance of specifiec selection criteria for the first user adopted in well known scheduling algorithms and investigate its impact on performance and computational complexity. Through experimental validations, it is shown that with random selection not only the performance loss in negligible but a significant gain in computational complexity is also achieved. Simulations results are presented to confirm the viewpoint for the suggested modification quantifying the scheduling performance in terms of sum rate (bps/Hz) and fairness.

关键词： Interference scheduling algorithms Signal to noise ratio Precoding MIMO Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Passivity of linear parameter varying systems with intermittent non-passive behavior

Passivity of linear parameter varying systems with intermitt...

引用

IEEE Annual Conference on Decision and Control

作者： Sivaranjani S Vijay Gupta Peter Seiler Department of Electrical Engineering University of Notre Dame Notre Dame IN USA Department of Electrical Engineering University of Notre Dame IN 46556 Department of Aerospace Engineering and Mechanics University of Minnesota Minneapolis MN

ISBN: (纸本)9781479978878

We analyze passivity of Linear Parameter Varying (LPV) systems in which certain regions of the parameter trajectory may be non-passive. It is shown that system passivity can be maintained if the system remains in passive parameter regions "sufficiently often". Analytical conditions that ensure system passivity are derived in terms of the fractions of times spent in passive and non-passive regions of the parameter trajectory. An online algorithm to schedule controllers to maintain a desired level of passivity based on parameter measurements is also proposed.

关键词： Trajectory Switched systems Stability analysis Schedules Aerospace engineering Vehicles scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：