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

Optimization on annual energy efficiency of heat pumps based on maximum solving of definition functions with multi constraints

引用

APPLIED ENERGY 2022年 321卷

作者： Wang, Fei Li, Wanwan Ding, Chao Qu, Zhiguo Luo, Rongbang Chen, Xi Xi An Jiao Tong Univ Dept Heat Flow Sci & Engn Xian 710049 Peoples R China Qingdao Haier Air Conditioner Co LTD Qingdao 266101 Peoples R China Henan Univ Technol Dept Bldg Environm & Energy Engn Zhengzhou 450001 Peoples R China Lawrence Berkeley Natl Lab Energy Technol Area One Cyclotron Rd Berkeley CA 94720 USA

Air conditioners is expected to be the second largest source of growth in global electricity demand. To promote electrification, heat pump air conditioner is encouraged to replace natural gas furnace. Improving heat pump's energy efficiency can help reduce global energy consumption and greenhouse gas emissions. Annual performance factor is one of the key metrics to evaluate heat pump systems' energy performance. Seeking annual performance factor maximum belongs to an optimization problem with multi constraints. However, due to the nested variables, continuous non-differentiable and piecewise form of annual performance factor definition functions, the optimized objective function is usually based on the simplification with large errors. Meanwhile, the multi constraint boundaries are either ignored or considered but through complicated and high-cost tests. In this research, the variable iteration logic of the annual performance factor definition functions is sorted firstly. Then the above exact mathematical definitions are programmed as the objective functions without any simplification. Enumeration method is used to establish the annual performance factor maximum solution algorithm. More importantly, taking a 3.5 kW cooling capacity mini-split heat pump prototype as an example, energy performance tests are conducted to fit the multi constraints, namely using less global parameters to cover more local parameters, which greatly simplifies the test procedures and cost. Then, using our proposed method, the maximum annual performance factor is predicted and validated by experiments. The prediction accuracy is 99.6%, with a 38.4% improvement compared to the best reported value from literature. Based on the recommended variable values, the prototype's annual performance factor achieves the maximum with a 7.71% improvement from the baseline. The proposed method can save time and experimental resources in the product development stage compared with the traditional trial and e

关键词： Heat pump Annual performance factor Maximum solution Enumeration method multi constraints

来源：评论

学校读者我要写书评

暂无评论

Workflow-Based Service Selection Under multi-constraints

Workflow-Based Service Selection Under Multi-Constraints

引用

12th IEEE International Conference on Services Computing (SCC)

作者： Xia, Chao Chi, Chi-Hung Wong, Raymond Wombacher, Andreas Pires, Luis F. van Sindern, Marten Ding, Chen Tsinghua Univ Sch Software Beijing Peoples R China CSIRO Digital Prod Flagship Canberra ACT Australia Univ New S Wales Dept Comp Sci Sydney NSW Australia Univ Twente POB 217 NL-7500 AE Enschede Netherlands Ryerson Univ Dept Comp Sci Toronto ON Canada

ISBN: (纸本)9781467372817

Despite the as ailability of services with similar functionality but from different providers in the cloud, using them in a workflow might subject to constraints such as service QoS and service bundling. Service ice bundling refers to the situation where here the subscription of two services have to be done together;such requirement might he imposed by service providers and/or by the alliance group that the providers join in. In this paper, we focus on the set's ice selection problem under the QoS constraints from the user and the bundling constraints associated with the chosen services. We first formulate the service selection problem as a multi-constrained selection problem. Then we propose a recursive heuristic search algorithm that takes the required QoS and bundling constraints into consideration for service selection. This algorithm has two unique functions: (i) utility function to measure the quality of the selection strategy under consideration, and (ii) acceptance function to limit the selection strategy only to those potential service candidates that have higher chance to satisfy the bundling constraints. Experiments show that our proposed solution can find better solutions than the existing ones without too much extra performance overhead.

关键词： service computing workflow scheduling multi constraints

来源：评论

学校读者我要写书评

暂无评论

Survey on Integrated Guidance and Control of Unmanned Aerial Vehicle

Survey on Integrated Guidance and Control of Unmanned Aerial...

引用

2024 International Conference on Guidance, Navigation and Control

作者： Luo, Yuxie Song, Jia Zhao, Mingfei Beihang Univ Sch Astronaut Beijing 100191 Peoples R China

ISBN: (纸本)9789819622665;9789819622641;9789819622634

The integrated guidance and control (IGC) is a method to improve the traditional separation guidance and control design for unmanned aerial vehicles (UAV). The advantage is that this design fully considers the coupling relationship between guidance and control loops, and the full-state control of the UAV can be taken into account, thereby improving the accuracy of guidance. This paper provides a review and discussion of current work on the design of IGC systems. The difficulty in designing an IGC system is that the order of the IGC system is high, and the coupling between states is strong, making the controller design difficult. Its research focuses on IGC methods that satisfy complex multi-constraint conditions, IGC methods with rapid convergence and strong robust IGC methods under uncertainty and unknown disturbances, etc. This paper also discusses possible future work on IGC methods of UAVs, including fault-tolerant and anti-noise IGC methods under harsh working conditions, cooperative IGC design of UAVs and intelligent IGC methods.

关键词： Integrated guidance and control Unmanned aerial vehicle multi constraints Uncertain system

来源：评论

学校读者我要写书评

暂无评论

multi-path SDN route selection subject to multi-constraints

Multi-path SDN route selection subject to multi-constraints

引用

Third International Conference on Cyberspace Technology (CCT 2015)

作者： Qingfeng Pan Xianghan Zheng Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou 350108 China College of Mathematics and Computer Science Fuzhou University 350108 China

ISBN: (纸本)9781510821873

multi-constrained optimal routing problem and disjoint path selection are NP-hard problem. The conventional single-path and single constraint routing can not meet people's needs. The reliability of network data transmission and packet loss rate can be decreased when the route or the transmission fails. To solve the problems, we need to study the routing path selection strategies. This paper optimizes the routing path that meets the QoS constraints under the SDN pre planning routing, and proposes a routing mechanism that can solve problems in polynomial time. Firstly, the paper combined with Clustering and Gauss algorithm to simulate the network simulation, obtain the initial experimental data. It can reflect the network status more accurately. Secondly, simplify the multi-objectives based on the AHP, It reduces the complexity of the problem and meets QoS requirements. Finally, select the disjoint communication paths and backup paths with the heuristic algorithms in order to balance the load of network and improve the transmission reliability. The selection mechanism can improve the efficiency of data transmission, and the survival of network communication.

关键词： Analytic Hierarchy Process Disjoint Path multi constraints Optimal Path QoS Routing

来源：评论

学校读者我要写书评

暂无评论

Optimal Deployment of Radar Network based on Chaos Genetic Algorithm 31

Optimal Deployment of Radar Network based on Chaos Genetic A...

引用

31st Chinese Control And Decision Conference (CCDC)

作者： Pan, Wei Zheng, Lifeng Huang, Feng Xie, Huixiang Army Artillery & Air Def Forces Acad Noncominissioned Officer Acad Shenyang 110867 Peoples R China

ISBN: (纸本)9781728101057

In this paper, an optimal disposition method based on chaos genetic algorithm (AGA) is presented for radar netting. A mathematical model for radar optimal disposition is established according to the analysis of regional radar netting at the beginning. And then, the solving process of AGA for this optimization problem is discussed. The adaptive crossover probability and adaptive mutation probability are proposed, which consider the influence of every generation to algorithm and the effect individual fitness in every generation. Finally, through analyzing an example, it comes to a conclusion that several optimal deployment of radar networks can be obtained much more quickly by this method with better operability.

关键词： chaos genetic algorithm radar network optimal deployment multi constraints crossover probability mutation probability

来源：评论

学校读者我要写书评

暂无评论

A New Filter Design for Low-Cost GNSS Attitude Determination Applications 3

A New Filter Design for Low-Cost GNSS Attitude Determination...

引用

2017 3rd IEEE International Conference on Control Science and Systems Engineering (ICCSSE)

作者： Jianlun He Tao Li Xiaoping Hu Meiping Wu Jingyu Zhang College of Mechatronics and Automation National University of Defense Technology

ISBN: (纸本)9781538604854

This paper proposes a new filter design optimized for GNSS attitude determination applications using low cost devices. The filter contains all relevant constraints and observations, including double differenced carrier phase and code observations along with MEMS-IMU observations. Benefited from the unified treatment, the priori information is well used during the resolution of double differenced GNSS observables. Hence, the success rate of integer ambiguity resolution as well as attitude determination is improved. A set of experiments were conducted to evaluate the performance of the method, compared with the traditional method. This paper uses RTKLIB[1], an open source platform to provide the results of traditional method. The new filter is proved to be capable of improving the attitude determination accuracy and reliability. Apart from the validation, a proposal for future work is also attached in this paper.

关键词： GNSS integer ambiguity resolution Kalman filter multi constraints unified treatment

来源：评论

学校读者我要写书评

暂无评论

Construction of an optimal multicast tree for group communication in a cellular network using genetic algorithm

引用

COMPUTER COMMUNICATIONS 2006年第16期29卷 3306-3312页

作者： Mala, C. Selvakumar, S. Natl Inst Technol Dept Comp Sci & Engn Tiruchirappalli 620015 Tamil Nadu India

The recent advances in wireless technology has enabled users of Mobile cellular networks in different parts of the world not only to communicate with each other but also to participate in real time applications, viz., video conferencing, multiparty games, online auctions, access to distributed databases, etc., on the fly. All these applications require a multicast Tree (MT) to be constructed among the group users with the source being the root of the MT. Traditional methods used in a wired network to construct a MT take into account only the distance or delay between the nodes. These methods when extended to mobile networks fail because of the inherent dynamism in a mobile network. To overcome this problem and to give an optimized solution to this problem, a novel Genetic Algorithm (GA) based approach to construct an Optimal multicast Tree (OMT) with four constraints viz., probability of delay over a path, queuing delay at a node, residual bandwidth of a link, and the speed of the user is proposed in this paper. Further, for a network of N nodes and E edges, with k independent constraints, it has been derived that the time complexity and space complexity for GA based algorithm are O(N-2) and O(N), respectively, whereas the time complexity and space complexity for the non-GA based multi constrained algorithm are O (N-2k) and O(N-2). These results show that the GA based algorithm is insensitive to the number of constraints and it constructs OMT faster than the traditional algorithms. (c) 2006 Elsevier B.V. All rights reserved.

关键词： mobile network genetic algorithm Optimal multicast Tree multi constraints time and space complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：