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

IEEE 8th Joint International Information Technology and Artificial Intelligence Conference (ITAIC)

作者： Huang, Yuqian Wu, Shuomin Li, Yaping Wang, Ying Zhang, Kaifeng Southeast Univ Minist Educ Key Lab Measurement & Control Complex Syst Engn Nanjing 210096 Jiangsu Peoples R China China Elect Power Res Inst Nanjing Nanjing 210003 Jiangsu Peoples R China

ISBN: (纸本)9781538681787

a new method for identifying the operation of electrical appliances is proposed in this paper, which considers the time correlation between different operating states of the same electrical appliance. Firstly, the improved k-means clustering algorithm is used to obtain the active power values of each operating state for electrical appliances;Then several independent state time series are established to comprehensively cover the 10-min sampling interval for the same electrical appliance;Finally, constraints are determined based on the time correlation between operating states in the same state time series, the operation of electrical appliances will be identified by integer programming algorithm. The experiments results show that the algorithm proposed identify the instants of appliances ON/OFF and the times of start and stop for appliances accurately.

关键词： operation status identification of the electrical appliances time correlation state time series set linear integer programming

来源：评论

学校读者我要写书评

暂无评论

Siphon Basis-Based Design of Petri Net Controllers for a Class of Flexible Manufacturing Systems

Siphon Basis-Based Design of Petri Net Controllers for a Cla...

引用

IEEE International Conference of Region 10 (TENCON)

作者： Liu, Huixia Gao, Zhenxin Ludong Univ Sch Informat & Elect Engn Yantai Peoples R China Xian Jiotong Univ Syst Engn Inst Xian Peoples R China

ISBN: (纸本)9781479928255;9781479928279

This paper develops a new deadlock prevention policy for a class of flexible manufacturing systems called as systems of simple sequential processes with resources (S(3)PRs). Siphon basis is introduced to obtain a compact Petri net controller by considering the complementary sets of siphons in S(3)PRs. A siphon basis consists of strict minimal siphons (SMSs) whose complementary sets can cover the complementary set of each SMS in Petri nets. It is proved that a live Petri net controller can be constructed based on a controllable siphon basis. The structural complexity of the obtained controller is largely reduced because the number of SMSs in a controllable siphon basis is no more than that of the operation places in S(3)PRs. Based on a controllable siphon basis, a new deadlock prevention policy is established for S(3)PRs. An example is utilized to demonstrate the proposed method.

关键词： Flexible manufacturing systems Petri nets deadlock control siphons linear integer programming

来源：评论

学校读者我要写书评

暂无评论

Drivers' range anxiety and cost of new EV chargers in Amsterdam: a scenario-based optimization approach

引用

ANNALS OF GIS 2021年第1期27卷 87-98页

作者： Mashhoodi, Bardia van der Blij, Nils Wageningen Univ & Res Dept Environm Sci Landscape Architecture & Spatial Planning Grp NL-6700 AA Wageningen Netherlands Delft Univ Technol Fac Elect Engn Math & Comp Sci Dept Elect Sustainable Energy DC Syst Energy Convers & Storage Res Grp Delft Netherlands

Due to the sharp growth in the adaptation of electric vehicles (EV) in the Netherlands and the objectives of the Dutch Climate Accord is to encourage electric mobility, in the coming decades a substantial number of new EV charging facilities needs to be provided. Efficient planning of EV charging infrastructure is coupled with the notion of range anxiety, which is likely to be severely high in case of soon-to-be EV drivers. This study aims to estimate the cost of developing a new charging infrastructure under five scenarios of range anxiety in Amsterdam East. Employing a linear integer programming optimization model, on the basis of geographic data on car registration, existing EV chargers, and electricity substations, it is obtained that if drivers use 90% of their battery before using a charging facility, the existing charging infrastructure needs to be expanded by only 31% to accommodate almost seven times larger number of EVs - the threshold set by the European Union (EU) legislation on the deployment of alternative fuel infrastructure. If drivers use only 30% of the batteries;however, an increase of 167% in infrastructure is inevitable (accounting for almost five million euro of cost). Second, at any point along the range anxiety spectrum, if the interval between charging session increases for 1 day, the overall cost decreases by more than 30%. These findings are discussed, and two policy approaches are proposed: (1) information technology approach;(2) demand-response approach, on the basis of EU legislation on energy efficiency and deployment of alternative fuel infrastructure.

关键词： Electric vehicle charging infrastructure linear integer programming range anxiety spatial optimization Netherlands

来源：评论

学校读者我要写书评

暂无评论

Joint Optimization of Gateway Placement and Multi-hop Routing for the Internet of Things 6

Joint Optimization of Gateway Placement and Multi-hop Routin...

引用

6th National-Foundation-for Science-and-Technology-Development (NAFOSTED) Conference on Information and Computer Science (NICS)

作者： Hoai-Nam Chu Tuan-Minh Pham Univ Transport & Commun Dept Telecommun Engn Hanoi Vietnam Phenikaa Univ Fac Comp Sci Hanoi Vietnam

ISBN: (数字)9781728151632

ISBN: (纸本)9781728151632

The Internet of Things (IoT) has materialized smart homes, smart manufacturing, and smart cities for a better quality of life and new industrial opportunities. In an IoT network, a massive number of devices might lead to a serious problem of scalable performance. A possible approach for the scalability problem is to use the support of multi-hop routing for data communication and to group IoT devices into clusters. In this paper, we consider the joint optimization problem of gateway placement in a cluster and routing for an IoT network supporting multihop communication. We first formulate the problem as a Mixed integer linear programming (MILP) model for obtaining the optimal solution. We then develop an approximation algorithm for addressing the problem in a large-scale IoT network. The evaluation results under a set of scenarios with various topologies and parameters show that the proposed algorithm achieves the results close to the optimal solution with a huge decrease in computation time. Our solution allows an IoT service provider to determine the optimal solution for the deployment of gateways and the optimal routing with a performance constraint in an IoT network.

关键词： IoT optimization multi-hop routing linear integer programming

来源：评论

学校读者我要写书评

暂无评论

Lagrangean relaxation algorithm for disjoint paths with different path-costs

Lagrangean relaxation algorithm for disjoint paths with diff...

引用

Asia-Pacific Optical and Wireless Communications Conference (APOC 2003)

作者： Wang, ZY Li, L Wang, B PLA Univ Sci & Technol Inst Sci Nanjing Peoples R China

ISBN: (纸本)0819451770

To improve the reliability of the increasing network two disjoint paths should be found between a given source and a given destination. The problem of finding two minimum cost node-disjoint/edge -disjoint paths with different costs in a directed network can be formulated as a linear integer programming problem minimizing the sum of the costs on the edges in two paths, which is strongly NP-complete problem. linear relaxation programming which relaxes the integer variables in the original programming is often applied to solve this NP problem. Comparing with linear relaxation programming, Lagrangean relaxation affords a lower bound of the objective value of original programming. Based on this a Lagrangean relaxation method for solving two disjoint paths is presented after a mathematical programming model of the problem is established. By using a modified subgradient optimization technology a new algorithm to solve the Lagrangean relaxation is put forward. The complexity of the proposed algorithm is as same as the Dijkstra's algorithm (O(n(2))). The efficiency of this algorithm is demonstrated by test examples.

关键词： reliability disjoint paths NP-complete linear integer programming Lagrangean relaxation subgradient optimization shortest path variable target function

来源：评论

学校读者我要写书评

暂无评论

Improving Profit through Cloud Federation 12

Improving Profit through Cloud Federation

引用

2015 12th Annual IEEE Consumer Communications and Networking Conference (CCNC)

作者： Rebai, Salma Hadji, Makhlouf Zeghlache, Djamal Telecom SudParis Inst Mines Telecom Evry France UMR CNRS 5157 Evry France Technol Res Inst IRT SystemX IT Dept Palaiseau France

ISBN: (纸本)9781479963904

This paper addresses profit optimization through insourcing and outsourcing virtual resources (seen as VMs) for cloud infrastructure providers. A linear program is proposed to assist IaaS providers, involved in a cloud federation, in adjusting their hosting and cooperation decisions in response to their workloads and available resources. The proposed exact formulation takes into account the prices and quotas proposed by the federation members and the costs of resources and their networking to maximize providers revenues. The algorithm performance evaluation and the identified benefits show the conditions for profitable cloud federations and the efficiency of the proposed model in improving profit.

关键词： Cloud federation profit optimization distributed allocation request splitting linear integer programming

来源：评论

学校读者我要写书评

暂无评论

An Efficient Heuristic for Restorable Energy Aware Routing in Networks with Bundled Links

An Efficient Heuristic for Restorable Energy Aware Routing i...

引用

Asia-Pacific-Signal-and-Information-Processing-Association Annual Summit and Conference (APSIPA ASC)

作者： Wang, Rui Gao, Suixiang Yang, Wenguo Jiang, Zhipeng Univ Chinese Acad Sci Sch Math Sci Beijing Peoples R China

ISBN: (纸本)9789881476807

Energy aware routing via rerouting traffic or traffic aggregating has received wide attention in the last decade. It is important and challenging to take network reliability into consideration to enhance the resilience to failures at the same time. In this paper, we aim to minimize energy expenditure while ensuring network reliability by restoration. As each request has an active path and disjoint backup path for restoration, the backup path can be used if the active path fails. To this end, we first propose the problem called Restorable Energy Aware Routing Problem in networks with bundled links (REAR-BL) when backup sharing is not allowed. We form a linear integer model to minimize the number of powered-on cables of links while putting idle cables to sleep under constraints of restoration and maximum link utilization. Since REAR-BL is Np-hard, we design a fast heuristic to solve it based on Suurballe algorithm and the analysis of a lower bound and an upper bound of the optimal solution. We evaluate our heuristic through extensive simulations on real and synthetic topologies and obtain considerable energy savings with less time when compared to CPLEX solutions and upper and lower bounds.

关键词： energy aware routing restoration link disjoint linear integer programming backup path upper and lower bounds

来源：评论

学校读者我要写书评

暂无评论

Group Decision Making with Transitive Preferences Under Ordinal and Cardinal Consistencies: An Optimization Approach

引用

GROUP DECISION AND NEGOTIATION 2021年第1期30卷 221-250页

作者： Wu, Zhibin Yuan, Rong Tu, Jiancheng Sichuan Univ Sch Business 24South Sect 1Yihuan Rd Chengdu 610064 Sichuan Peoples R China

With the ubiquity of preference relations used in group decision making (GDM), controlling the transitivity of preferences characterized by individual consistency has attracted much attention. However, few previous studies consider ordinal and cardinal consistencies simultaneously and the ordinal consistency is often ignored in consensus reaching process in existing studies. In this study, the conditions of individual ordinal consistency are proved to be equivalent to a series of inequalities, based on which, an optimization model is developed to deal with the ordinal inconsistency problem. In addition, a second optimization model is proposed to address the coexistence of both ordinal and cardinal inconsistencies. A framework is designed to provide a complete strategy for controlling consistency. Such a framework is also generalized to accommodate the consensus problem in GDM. Comparing to the existing consistency improvement approaches, the proposed approach explicitly solves the ordinal consistency problem by an optimization approach. Furthermore, the proposed group consensus model guarantees both ordinal consistency and acceptable cardinal consistency when consensus is achieved. Finally, classical examples with extensive comparisons are conducted to show the effectiveness of the proposed approaches.

关键词： Ordinal consistency Additive consistency Consensus Transitivity linear integer programming

来源：评论

学校读者我要写书评

暂无评论

Resource allocation in Cloud federation

Resource allocation in Cloud federation

引用

作者： 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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：