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

作者： Salma Rebai Universite Pierre et Marie Curie

学位级别：博士

Cloud computing is a steadily maturing large-scale model for providing on-demand IT resources on a pay-as-you-go basis. This emerging paradigm has rapidly revolutionized the IT industry and enabled new service delivery trends, including infrastructure exter- nalization to large third-party providers. The Cloud multi-tenancy architecture raises several management challenges for all stakeholders. Despite the increasing attention on this topic, most efforts have been focused on user-centric solutions, and unfortunately much less on the difficulties encountered by Cloud providers in improving their business. In this context, Cloud Federation has been recently suggested as a key solution to the in- creasing and variable workloads. Providers having complementary resource requirements over time can collaborate and share their respective infrastructures, to dynamically ad- just their hosting capacities in response to users' demands. However, joining a federation makes the resource allocation more complex, since providers have to also deal with co- operation decisions and workload distribution within the federation. This is of crucial importance for cloud providers from a profit standpoint and especially challenging in a federation involving multiple providers and distributed resources and applications. This thesis addresses profit optimization through federating and allocating resources amongst multiple infrastructure providers. The work investigates the key challenges and opportunities related to revenue maximization in Cloud federation, and defines efficient strategies to govern providers' cooperation decisions. The goal is to provide algorithms to automate the selection of cost-effective distributed allocation plans that simultaneously satisfy user demand and networking requirements. We seek generic and robust models able to meet the new trends in Cloud services and handle both simple and complex requests, ranging from standalone VMs to composite services requiring the p

关键词： Cloud federation profit optimization distributed allocation request splitting linear integer programming Graph decomposition Gomory-Hu tree Best-Fit matching

来源：评论

学校读者我要写书评

暂无评论

A New PMU Placement Algorithm to Meet a Specified Synchrophasor Availability

A New PMU Placement Algorithm to Meet a Specified Synchropha...

引用

IEEE Power-and-Energy-Society Innovative Smart Grid Technologies Conference (ISGT)

作者： Sarailoo, Morteza Wu, N. Eva SUNY Binghamton Dept Elect & Comp Engn Binghamton NY USA

ISBN: (纸本)9781509051670

As real-time monitoring and control are entering to smarten power grids, imposing data availability criterion on PMU placement into an existing (or a new) measurement network becomes ever more important. This criterion decreases the probability of a wrong action. Synchrophasor availability (SA) at a bus measures the fraction of time in the long run when its PMU output data are correct and accessible. The SA-based placement goal is to meet a prescribed SA profile across the power system with a minimum number of PMUs. This paper reports two new developments in the SA-based PMU placement. (1) Consideration of equipment faults, in addition to data communication interruptions. (2) An efficient iterative linear program is developed to solve the problem, and the solutions always meets the full static observability. The solution is demonstrated through PMU placement in several IEEE test systems under a variety of SA specifications and random event rates.

关键词： PMU placement Synchrophasor availability Sensor network architecture linear integer programming Markov/semi-Markov chains

来源：评论

学校读者我要写书评

暂无评论

The Model with Left Bottom Corner Coordinates for 2D Rectangular Strip Packing Problem 2017

The Model with Left Bottom Corner Coordinates for 2D Rectang...

引用

International Conference on Wireless Communications, Networking and Applications (WCNA)

作者： Qi, Xiao-Ying Zheng, Qiao-Xian Li, Ming Guo, Tian-Jiao Wuhan Univ Sci & Technol Coll Sci Wuhan 430065 Hubei Peoples R China Hubei Univ Coll Comp & Informat Engn Wuhan 430062 Hubei Peoples R China

ISBN: (纸本)9781450353441

(1)Based on the relationship between the left bottom corner coordinate of the rectangles and the unit of the stripe box, a more efficient linear integer programming model for the 2D rectangular strip packing problem (2DR-SPP) with non-rotating rectangles is established, in which the behavior of forbidding two rectangles placed with overlap is guaranteed. In the rotatable 2DR-SPP, every rectangle is placed to the stripe box only with the way of rotated 900 or not, and the feature is utilized to build the mathematical model of the rotatable 2DR-SPP based on the not rotated problem. The effectiveness and accuracy of two models are demonstrated by the results of computational experiments.

关键词： 2D rectangular strip packing problem Mathematic model with left bottom corner coordinates linear integer programming

来源：评论

学校读者我要写书评

暂无评论

Three-Dimensional Optimization of Touch Panel Design with Combinatorial Group Theory

Three-Dimensional Optimization of Touch Panel Design with Co...

引用

作者： Kong, Christie University of Waterloo

学位级别：master

This thesis documents the optimized design of a touch screen using infrared technology as a three dimensional problem. The framework is fundamentally built on laser diode technology and introduces mirrors for signal reflection. The rising popularity of touch screens are credited to the naturally intuitive control of display interfaces, extensive data presentation, and the improved manufacturing process of various touch screen implementations. Considering the demands on touch screen technology, the design for a large scaled touch panel is inevitable, and signal reduction techniques become a necessity to facilitate signal processing and accurate touch detection. The developed research model seeks to capture realistic touch screen design limitations to create a deploy-able configuration. The motivation of the problem stems from the significant reduction of representation achieved by combinatorial group theory. The research model is of difficulty NP-complete. Additional exclusive-or functions for uniqueness, strengthening model search space, symmetry eliminating constraints, and implementation constraints are incorporated for enhanced performance. The computational results and analysis of objectives, valuing the emphasis on diodes and layers are evaluated. The evaluation of trade-off between diodes and layers is also investigated

关键词： touch panel three dimensional optimization infrared technology linear integer programming combinatorial group theory laser diode

来源：评论

学校读者我要写书评

暂无评论

Operations Research Frameworks for Improving Make-Ahead Drug Policies at Outpatient Chemotherapy Infusion Centers

Operations Research Frameworks for Improving Make-Ahead Drug...

引用

作者： Richardson, Donald University of Michigan

Outpatient chemotherapy infusion is one of the most common forms of treatment used to cure, control, and ease symptoms of cancer. Patients who require outpatient chemotherapy infusion undergo lengthy and physically demanding infusion sessions over the course of their treatment. While the frequency and duration of visits vary by patient, drug, and cancer type, most patients will require several treatments over the course of months or years to complete their regimen/treat their disease. Receiving infusion is just one part of the complex treatment process. Patients may have their blood work done, wait for the results to process, visit their oncologist, wait on their order to be placed by their oncologist and prepared by the pharmacy, and then have the infusion administered by infusion clinic staff. Each step introduces randomness which can lead to propagated delays. These delays negatively affect patients as well as clinical operation cost and staff workload. We focus on optimizing drug preparation at the pharmacy to reduce patient delays. Drugs can be prepared the morning before patients arrive to prevent the patient from waiting the additional time needed to prepare their prescribed drugs in addition to any other wait time incurred during peak pharmacy hours. However, patients scheduled for outpatient chemotherapy infusion sometimes may need to cancel at the last minute even after arriving for their appointment (i.e. patient may be deemed too ill to receive treatment). This results in the health system incurring waste cost if the drug was made ahead since the drugs are patient specific and have a short shelf life. Infusion centers must implement policies to balance this potential waste cost with the time savings for their patients and staff. In support of this effort, this dissertation focuses on methods and strategies to improve the process flow of chemotherapy infusion outpatients by optimizing pharmacy make-ahead policies. We propose using three different methods

关键词： linear integer programming Simulation Predictive Modeling Cancer Center Pharmacy Thesis

来源：评论

学校读者我要写书评

暂无评论

A novel energy routing technique with hybrid energy storage for residential electricity cost minimization in a smart distribution network

引用

ENERGY SOURCES PART A-RECOVERY UTILIZATION AND ENVIRONMENTAL EFFECTS 2024年第1期46卷 9881-9898页

作者： Gundu, Venkateswarlu Simon, Sishaj P. Natl Inst Technol Elect & Elect Engn Dept Tiruchirappalli India

In a dynamic pricing scheme at a secondary distribution network, the residential electricity cost minimization and effective distributed energy resources management with energy storage (ES) is challenging using either compressed air or pumped hydro. Since, each one has its inherent limitations along with merits like ES with compressed air requires a very deep air storage cavern which results in increased constructional cost. Whereas ES with pumped hydro suffers from gravitational issues and also it requires suitable construction to maintain height difference. In particular, with the benefits of energy storage and solar integration, all residential houses lumped in the distributed network are willing to draw much of their load demand at minimum pricing intervals. This situation may lead to crowding phenomena among the residential houses. In order to overcome the crowding phenomena, in this paper a novel energy routing technique with hybrid energy storage has been proposed. The hybrid energy storage is a combination of compressed air energy storage and pumped hydro storage. The proposed energy routing technique assigns the role of each house as a seller or buyer by identifying the surplus or paucity power along with the status of their energy storage. A priority factor is calculated, in this past contribution made by each residential house and load demand are considered to be key parameters. Further, the linear integer program is employed to schedule the buyers to buy the electrical energy at minimum price without any crowding phenomena. The performance of the proposed novel technique has been validated on12 bus distribution system with 100 MVA, 11 kV ratings and IEEE 33 bus test system with 100 MVA, 12.66 kV ratings. The result analysis shows that the proposed novel technique is robust and applicable for real-time smart grid environment.

关键词： linear integer programming solar energy distribution network priority factor

来源：评论

学校读者我要写书评

暂无评论

Managing aquatic invasions: Optimal locations and operating times for watercraft inspection stations

引用

JOURNAL OF ENVIRONMENTAL MANAGEMENT 2021年 283卷 111923-111923页

作者： Fischer, Samuel M. Beck, Martina Herborg, Leif-Matthias Lewis, Mark A. Univ Alberta Dept Math & Stat Sci 632 Cent Acad Bldg Edmonton AB T6G 2G1 Canada BC Minist Environm & Climate Change Strategy Conservat Sci Sect Victoria BC Canada Fisheries & Oceans Canada Inst Ocean Sci Sidney BC Canada Univ Alberta Dept Biol Sci Edmonton AB Canada

Aquatic invasive species (AIS) cause significant ecological and economic damages around the world. A major spread mechanism for AIS is traffic of boaters transporting their watercraft from invaded to uninvaded water bodies. To inhibit the spread of AIS, Canadian provinces and American states often set up watercraft inspection stations at roadsides, where potentially infested boats are screened for AIS and, if necessary, decontaminated. However, since budgets for AIS control are limited, watercraft inspection stations can only be operated at specific locations and daytimes. Though theoretical studies provide managers with general guidelines for AIS management, more specific results are needed to determine when and where watercraft inspections would be most effective. This is the subject of this paper. We show how linear integer programming techniques can be used to optimize watercraft inspection policies under budget constraints. We introduce our approach as a general framework and apply it to the prevention of the spread of zebra and quagga mussels (Dreissena spp.) to the Canadian province of British Columbia. We consider multiple scenarios and show how variations in budget constraints, propagule sources, and model uncertainty affect the optimal policy. Based on these results, we identify simple, generally applicable principles for optimal AIS management.

关键词： Aquatic invasive species linear integer programming Optimal management Spatially explicit Zebra mussel

来源：评论

学校读者我要写书评

暂无评论

Automatic Constraint Detection for 2D Layout Regularization

引用

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 2016年第8期22卷 1933-1944页

作者： Jiang, Haiyong Nan, Liangliang Yan, Dong-Ming Dong, Weiming Zhang, Xiaopeng Wonka, Peter Chinese Acad Sci Inst Automat Natl Lab Pattern Recognit NLPR Beijing 100190 Peoples R China KAUST Thuwal 239556900 Saudi Arabia Arizona State Univ Tempe AZ 85287 USA

In this paper, we address the problem of constraint detection for layout regularization. The layout we consider is a set of two-dimensional elements where each element is represented by its bounding box. Layout regularization is important in digitizing plans or images, such as floor plans and facade images, and in the improvement of user-created contents, such as architectural drawings and slide layouts. To regularize a layout, we aim to improve the input by detecting and subsequently enforcing alignment, size, and distance constraints between layout elements. Similar to previous work, we formulate layout regularization as a quadratic programming problem. In addition, we propose a novel optimization algorithm that automatically detects constraints. We evaluate the proposed framework using a variety of input layouts from different applications. Our results demonstrate that our method has superior performance to the state of the art.

关键词： Layout regularization constraint detection constraint analysis linear integer programming

来源：评论

学校读者我要写书评

暂无评论

Minimizing the number of robots required for a Robotic Process Automation (RPA) problem

引用

Procedia Computer Science 2021年 192卷 709-716页

作者： Sara Séguin Hugo Tremblay Iméne Benkalaï David-Emmanuel Perron-Chouinard Xavier Lebeuf Université du Québec à Chicoutimi 555 boul. de l’Université Saguenay G7H2B1 Canada Group for Research in Decision Analysis (GERAD) 3000 ch. de la Côte-Sainte-Catherine Montréal H3T2A7 Canada

Robotic Process Automation (RPA) is used in various fields of human activity in order to implement faster and more secure processes through a reduction in the risks or errors but also an increase in the productivity rates. The increase of its use and importance calls for evermore efficient solution methods for this problem. In this paper, the RPA is addressed in the context of a financial institution. The problem consists in assigning transactions to software robots, where each transaction type has a different clearance date and a different processing time. First, four heuristics are used to compute an upper bound on the number of required software robots. Then, this bound is given as a parameter to an integer linear program, which is used to assign the transactions to the different robots. The quality of the solutions is assessed by an extensive experimental study on a set of 39,000 instances. The results show that two heuristics outperform the others and allow for a faster resolution by the integer linear program which in turn finds the optimal solution for most of the instances within a timeout of 60 seconds.

关键词： Robotic process automation linear integer programming bin packing heuristics upper bound

来源：评论

学校读者我要写书评

暂无评论

Designing a connected nature reserve using a network flow theory approach

引用

Acta Ecologica Sinica 2013年第5期33卷 253-259页

作者： Yicheng Wang Hayri Önal College of Resources and Environment Qingdao Agricultural University Qingdao China Department of Agricultural and Consumer Economics University of Illinois at Urbana-Champaign IL USA

Establishing nature conservation reserves is an effective and widely accepted practice to protect biodiversity. In order to promote the effectiveness and efficiency of the reserve, spatial attributes of the reserve should be considered. Connectedness (contiguity) is one of these important spatial attributes. Currently in the biological literature there are only a few formal/exact optimization approaches to endogenously designing a connected nature reserve. This article adds a new approach by adapting a spatial unit allocation model to the reserve design problem. Using concepts from network flow theory, the model defines a sink site from which no flow directs out and ensures contiguity by specifying the outflow and inflow relationship of the potential sites. Computational performance of the model is tested using hypothetical problems with various sizes including up to 400 potential sites. Results show that the time needed to solve the problem to optimality increases exponentially both as number of potential sites increases and as species distribution gets more sparse. An empirical application involving 80 potential sites and 15 bird species in part of Fox River watershed, Illinois USA is presented. Factors influencing an IP model’s computational performance and potential extensions of the model were discussed.

关键词： Conservation reserve design Connectedness/contiguity linear integer programming Network flow theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：