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

4th World Conference on Smart Trends in Systems, Security and Sustainability (WorldS4)

作者： Nayak, Niharika Tripathi, Rakesh Gupta, Govind P. Natl Inst Technol Dept Informat Technol Raipur Madhya Pradesh India

ISBN: (纸本)9781728168234

In current environment, many web services map to the distributed data centers, to respond to variable and increasing workloads. It is not cost efficient for one data center to increase number of servers in order to fulfill all requests coming to it. For this reason, federated data center is a key solution for sharing unused resources and gain sonic profit. In this paper, we have used demand multiplexing and exploits the spatio-temporal variation of electricity price of distributed data center across locations and also consider the power consumption cost of servers at data center. We develop an integer linear programming problem (ILPP) for Profit Maximization problem of federated data centers and proposes Greedy algorithm for computing an optimal federation formation of data centers. The performance of the proposed Greedy federation formation algorithm (G-FM) compares with two other algorithms which are Optimal Federation Formation Algorithm (OEM) and Random Federation Formation Algorithm (REM). Experiments are performed on real world traffic demands at data center in which the proposed (G-EM) algorithm gives an optimize solution to the optimization problem.

关键词： Greedy Algorithm integer linear programming problem Demand Multiplexing Spatio-temporal Variation in Electricity Price

来源：评论

学校读者我要写书评

暂无评论

Cognitive Wireless Mesh Networks: A Connectivity Preserving and Interference Minimizing Channel Assignment Scheme

Cognitive Wireless Mesh Networks: A Connectivity Preserving ...

引用

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)

作者： Ahmadi, Maryam Pan, Jianping Univ Victoria Victoria BC V8W 2Y2 Canada

ISBN: (纸本)9781457702518

Recent studies show that most of the licensed bands are under-utilized at certain time and location. The emergence of cognitive radio made it possible for nodes to use licensed channels, as well as unlicensed ones for data transmission provided that there is no licensed user active simultaneously. This leads to a new challenge, where nodes need efficient mechanisms to sense the spectrum bands and identify the spectrum holes. Based on this information, nodes will pick the best channel among all available channels, while maintaining the priority of licensed users and minimizing the network interference at the same time. By formulating the problem as an integer linear programming (ILP) problem, we try to minimize the network interference in different scenarios, assuming nodes are equipped with cognitive radios and they are able to use licensed bands when appropriate.

关键词： Cognitive radio Color Interference Network topology Protocols Topology Wireless mesh networks channel allocation cognitive radio cognitive radio cognitive wireless mesh network connectivity preservation data transmission integer linear programming problem integer programming interference minimizing channel assignment scheme licensed bands licensed channels linear programming spectrum band spectrum hole identification wireless channels wireless mesh networks

来源：评论

学校读者我要写书评

暂无评论

QoS Provisioning in Heterogeneous Cognitive Radio Networks through Dynamic Resource Allocation 12

QoS Provisioning in Heterogeneous Cognitive Radio Networks t...

引用

12th IEEE International Conference on Green Innovation for Africon Renaissance (AFRICON)

作者： Awoyemi, B. S. Maharaj, B. T. Alfa, A. S. Univ Pretoria Dept Elect Elect & Comp Engn ZA-0002 Pretoria South Africa Univ Manitoba Dept Elect & Comp Engn Winnipeg MB R3T 5V6 Canada

ISBN: (纸本)9781479974986

Cognitive radio networks (CRN) has been depicted as one of the most important driving forces in achieving next generation wireless communication capabilities. To this end, several works are being done in describing and designing this new wireless communication paradigm. In this work, a study on how dynamic resource allocation can be used in achieving the desired quality of service (QoS) in a heterogeneous CRN environment is carried out. An underlay CRN model is developed where, in the resource allocation formulation, the demands of secondary users differ but must be met concomitantly. The objective is to maximize the weighted data rate of the different categories of users in the CRN, and by so doing, achieve some required QoS. The developed problem is both non-linear and also non-deterministic polynomial-time (NP) hard. However, the problem is smartly re-formulated as an integer linear programming problem and the branch-and-bound approach is employed in obtaining optimal solutions. The QoS metrics evaluated are average data rate, throughput and outage probability. The results obtained show that optimal solutions with QoS satisfaction are achievable for the heterogeneous CRN.

关键词： cognitive radio computational complexity integer programming linear programming next generation networks quality of service resource allocation telecommunication network reliability NP hard QoS provisioning dynamic resource allocation heterogeneous CRN heterogeneous cognitive radio networks integer linear programming problem next generation wireless communication nondeterministic polynomial-time hard outage probability secondary users Bit error rate Computers Dynamic scheduling Modulation Quality of service Resource management Wireless communication

来源：评论

学校读者我要写书评

暂无评论

A Two-phase Heuristic Method for Agri-fresh Inventory Optimisation

A Two-phase Heuristic Method for Agri-fresh Inventory Optimi...

引用

IEEE Symposium Series on Computational Intelligence (IEEE SSCI)

作者： Abedi, Mehdi Paam, Parichehr Berretta, Regina Univ Newcastle Sch Elect Engn & Comp Newcastle NSW Australia

ISBN: (纸本)9781728125473

This paper proposes a heuristic method for inventory optimisation of agri-fresh food products. The problem consists of multiple varieties of agri-fresh products collected in the harvest season that must be stored in a limited number of warehouses to supply demand throughout the whole planning horizon. The warehouses can be set on two modes with different energy consumption rates and different impacts on preventing product losses. The aim is to minimise the costs of energy consumption and product loss. Based on a mixed integer linear programming model for the problem, which is effective only for small instances due to the complexity of the problem, we propose an efficient two-phase heuristic method. In the first phase, a problem-specific heuristic determines and fixes the values of the binary variables, and then, in the second phase, the mixed integer linear programming problem is solved to determine the remaining variables. We evaluated the performance of the proposed approach by solving instances with different sizes. The results illustrate that the two-phase approach can efficiently find solutions of good quality.

关键词： Inventory optimisation fresh food supply chain heuristic integer linear programming problem

来源：评论

学校读者我要写书评

暂无评论

Rate-maximization Channel Assignment Scheme for Cognitive Radio Networks

Rate-maximization Channel Assignment Scheme for Cognitive Ra...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Salameh, Haythem Bany Yarmouk Univ Hijjawi Fac Engn Technol Irbid 21163 Jordan

ISBN: (纸本)9781424456383

In this paper, we consider the coordinated spectrum access problem in a multiuser single-transceiver cognitive radio network (CRN). Our objective is to maximize the sum-rate achieved by all contending cognitive radio users with respect to both spectrum assignment and transmission rate. The problem is posed as a rate-maximization problem subject to hardware and interference constraints. Specifically, we show that this problem can be formulated as an integer linear programming problem (ILP) with unimodular constraint matrix, which can be optimally solved in polynomial time using linear programming. Unlike previous research, our formulation is not restricted to the information-theoretic capacity, and can be applied to any arbitrarily given rate-SINR function. We also develop a distributed CSMA/CA-based MAC protocol for CRNs to realize the optimal assignment in a distributed manner. Simulation results indicate that compared to a reference CSMA/CA CRN MAC protocol, the proposed protocol significantly improves network throughput and preserves fairness.

关键词： access protocols carrier sense multiple access channel allocation cognitive radio coordinated spectrum access problem distributed CSMA-CA-based MAC protocol information theoretic capacity integer linear programming problem integer programming linear progr

来源：评论

学校读者我要写书评

暂无评论

Network Design Models with Partial Protection Schemes against Multiple Failures under Optical-Channel Data Unit Constraints

Network Design Models with Partial Protection Schemes agains...

引用

Optoelectronics Global Conference (OGC)

作者： Tan, Yiliu Wu, Qian Nakano, Yoshiki Wang, Jiading Shigeno, Maiko Univ Tsukuba Syst & Informat Engn Tsukuba Ibaraki 3058577 Japan

ISBN: (纸本)9781665431941

In recent years, dependency on computer networks has been increasing due to the increasing speed and capacity of data transmission. To guarantee the quality of service in networks, new technologies are being developed. The use of optical-channel data unit (ODU) technology in optical networks can segment and combine the required traffic demands and make effective use of network resources so that more traffic demands can be satisfied. An algorithm for addressing multiple ODU switch failures is described in this paper. This paper proposes three models to prevent multiple failures and formulates them as integer linear programming problems. The computer experiments compare their efficiencies. As a result, each traffic demand on the network is divided into plural paths, and less calculation time is required when the capacity allocated to each path is fixed. When the same method is used but the capacity allocated to each path is unfixed, the resource cost is relatively small.

关键词： survivable network design partial protection scheme optical-channel data unit integer linear programming problem

来源：评论

学校读者我要写书评

暂无评论

Lagrangean relaxation for service location in large-scale networks with QoS constraints

引用

WIRELESS COMMUNICATIONS & MOBILE COMPUTING 2009年第12期9卷 1668-1682页

作者： Kamal, Zille Huma Al-Fuqaha, Ala Gupta, Ajay Western Michigan Univ Dept Comp Sci Kalamazoo MI 49008 USA

Current trends in computing indicate that there is a great potential for service-oriented computing and similar technologies, such as application-oriented networks (AONs), where services can relocate to adapt to the conditions of the underlying network. In Such environments, providing and consuming services and establishing a relationship between consumers (users of services) and producers (providers of services) are still challenging and vastly researched aspects. Bearing this in mind, we define a service location and planning (SLP) problem that uniquely matches producers to consumers and accounts for realistic parameters Such as, quality of service (QoS) constraints of throughput and delay, and network constraints of underlying link layer bandwidth capacities, and cost of meeting consumer requests. Our contribution lies in the mathematical formulation of the SLP problem as an integer linear programming (ILP) problem that can be solved optimally for small-scale networks and extending this work using Lagrangean relaxation (LR) approximation techniques to solve the SLP problem for large-scale networks. Copyright (C) 2009 John Wiley & Sons, Ltd.

关键词： managing network resources and services Lagrangean relaxation service location and planning problem application-oriented networks opportunistic networks optimization problem integer linear programming problem

来源：评论

学校读者我要写书评

暂无评论

Further reduction of minimal first-met bad markings for the computationally efficient synthesis of a maximally permissive controller

引用

INTERNATIONAL JOURNAL OF CONTROL 2015年第8期88卷 1423-1428页

作者： Liu, GaiYun Chao, Daniel Yuh Xidian Univ Sch Electromech Engn Xian 710071 Peoples R China Natl Chengchi Univ Dept Management & Informat Syst Taipei 116 Taiwan

To date, research on the supervisor design for flexible manufacturing systems focuses on speeding up the computation of optimal (maximally permissive) liveness-enforcing controllers. Recent deadlock prevention policies for systems of simple sequential processes with resources ((SPR)-P-3) reduce the computation burden by considering only the minimal portion of all first-met bad markings (FBMs). Maximal permissiveness is ensured by not forbidding any live state. This paper proposes a method to further reduce the size of minimal set of FBMs to efficiently solve integer linear programming problems while maintaining maximal permissiveness using a vector-covering approach. This paper improves the previous work and achieves the simplest structure with the minimal number of monitors.

关键词： flexible manufacturing system Petri net deadlock siphon integer linear programming problem

来源：评论

学校读者我要写书评

暂无评论

Heuristic algorithm for the problem of vessel routing optimisation for offshore wind farms

引用

The Journal of Engineering 2017年第13期2017卷 1159-1163页

作者： Rafael Dawid David McMillan Matthew Revie University of Strathclyde Electronic & Electrical Engineering Department Glasgow UK

A new heuristic method is proposed for the problem of vessel routing optimisation for offshore wind farms. Turbines requiring a maintenance action are arranged into clusters, each associated with a vessel and a value for repairing the turbines. The clusters with the highest value are used to produce offspring, which is selected from the remaining high-value clusters, provided the constraints are met. The process is repeated until vessels available or turbines requiring maintenance are exhausted. To test the performance of the proposed approach, the same problem was formulated as integer linear programming problem and benchmarked against the IBM CPLEX commercial solver. The proposed method was shown to consistently produce close-to-optimal policies within seconds, even in problems with 15–20 turbines requiring a maintenance action. Although the proposed method only outperformed the commercial solver in one instance, its benefits include short and consistent computational times and the fact that the users can easily understand, implement and adapt the algorithm to suit their needs.

关键词： wind power plants vehicle routing wind turbines maintenance engineering offshore installations integer programming linear programming IBM CPLEX commercial solver integer linear programming problem repairing maintenance turbine offshore wind farm vessel routing optimisation problem heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal Planning of Nurses' Redeployment at Patient Overflow

Optimal Planning of Nurses' Redeployment at Patient Overflow

引用

2015 International Conference on Circuits and Systems(CAS 2015)

作者： Djamel Bellala Lazhar Ourlis Hacene Smadi Control Engineering and Manufacturing Laboratory University of Batna

In order to provide to his patients a quality medical service at lower cost, the General Administration Department of a University Hospital wants to maintain the number of the allocated nurses as low as possible while guaranteeing a satisfying level of health care. The nurses' redeployment is an optimization problem that falls under the category of integer linear programming problems whose graphical model is a digraph. The mathematical model is composed of an objective function of several interdependent variables to be obtained and some equality and side constraints that the General Administration Department should not violate in order to achieve satisfaction. The solution of this kind of problems rests on the use of an iterative method known as the simplex algorithm.

关键词： medical care nurses' redeployment optimal planning digraph integer linear programming problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：