检索结果-南通市图书馆

Using the Taguchi Method and Grey Relational Analysis to Optimize the Performance of a Solar Air Heater

Energy Engineering 2021年第5期118卷 1425-1438页

作者： Manar B.al-Hajji Nabeel Abu Shaban shahnaz al khalil Ayat al-Jarrah Department of Mechanical Engineering School of EngineeringThe University of JordanAmmanJordan Department of Mechanical Engineering Faculty of Engineering and Technology Al-Zaytonah University of JordanAmmanJordan Department of Mechatronics Engineering Faculty of EngineeringThe Hashemite UniversityZarqa’Jordan

Solar energy is regarded as one of the promising renewable energy sources in the *** main aim of this study is to use the Taguchi-Grey relational grade analysis to optimize the performance of two Solar Air Heaters(SAHs).A typical Grey–Taguchi method was *** Orthogonal Array,Signal-to-Noise ratio,Grey Relational Grade,and Analysis of Variance were employed to investigate the performance characteristics of *** observations were made in agreement with Jordanian climate 32°00′N latitude and 36°00′E longitude with a solar intensity of 500 W\m^(2).The operating factors selected for optimization are the tilt angle(T)with three levels(0°,22°,45°),inlet velocity(V)with two levels(1.2,1.8 m/s),and absorber plate material(M)with two levels(aluminum,wood).In this study,the Grey–Taguchi approach is validated by performing 12 individual *** results show that the process factors sequence required for a maximum SAH efficiency(SAHµ)is V>T>*** this approach,we combined the Orthogonal Array design with Grey Relational *** a result of that,the level of each operating conditions which optimizes both process responses(Temperature difference,ΔT and Solar air heater efficiency,SAHµ)can be specified with a minimum number of tests compared with classic Grey Relational *** optimal operating conditions of a SAH for multiple performance characteristics are determined as T2,M2,and V2,respectively,which are in congruence with the experimental results.

关键词： Solar air heater collector efficiency thermal efficiency grey-taguchi method robust design

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A Service Level Agreement Aware Online algorithm for Virtual Machine Migration

引用

Computers, Materials & Continua 2023年第1期74卷 279-291页

作者： Iftikhar Ahmad Ambreen shahnaz Muhammad Asfand-e-Yar Wajeeha khalil Yasmin Bano Department of Computer Science and Information Technology University of Engineering and TechnologyPeshawar25120Pakistan Department of Computer Science Shaheed Benazir Bhutto Women UniversityPeshawar25000Pakistan Center of Excellence in Artificial Intelligence Department of Computer ScienceBahria UniversityIslamabadPakistan

The demand for cloud computing has increased manifold in the recent *** specifically,on-demand computing has seen a rapid rise as organizations rely mostly on cloud service providers for their day-to-day computing *** cloud service provider fulfills different user requirements using virtualization-where a single physical machine can host multiple *** virtualmachine potentially represents a different user environment such as operating system,programming environment,and ***,these cloud services use a large amount of electrical energy and produce greenhouse *** reduce the electricity cost and greenhouse gases,energy efficient algorithms must be *** specific area where energy efficient algorithms are required is virtual machine *** virtualmachine consolidation,the objective is to utilize the minimumpossible number of hosts to accommodate the required virtual machines,keeping in mind the service level agreement *** research work formulates the virtual machine migration as an online problem and develops optimal offline and online algorithms for the single host virtual machine migration problem under a service level agreement constraint for an over-utilized *** online algorithm is analyzed using a competitive analysis *** addition,an experimental analysis of the proposed algorithm on real-world data is conducted to showcase the improved performance of the proposed algorithm against the benchmark *** proposed online algorithm consumed 25%less energy and performed 43%fewer migrations than the benchmark algorithms.

关键词： Cloud computing green computing online algorithms virtual machine migration

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Fault Tolerant Suffix Trees

引用

Computers, Materials & Continua 2021年第1期66卷 157-164页

作者： Iftikhar Ahmad Syed Zulfiqar ali Shah Ambreen shahnaz Sadeeq Jan Salma Noor Wajeeha khalil Fazal Qudus Khan Muhammad Iftikhar Khan Department of Computer Science and Information Technology University of Engineering and TechnologyPeshawar25120Pakistan Department of Computer Science Shaheed Benazir Bhutto Women UniversityPeshawar25000Pakistan Department of Information Technology FCITKing Abdulaziz UniversityJeddahSaudi Arabia Department of Electrical Engineering University of Engineering and TechnologyPeshawar25120Pakistan

Classical algorithms and data structures assume that the underlying memory is reliable,and the data remain safe during or after ***,the assumption is perilous as several studies have shown that large and inexpensive memories are vulnerable to bit ***,the correctness of output of a classical algorithm can be threatened by a few memory *** tolerant data structures and resilient algorithms are developed to tolerate a limited number of faults and provide a correct output based on the uncorrupted part of the *** tree is one of the important data structures that has widespread applications including substring search,super string problem and data *** fault tolerant version of the suffix tree presented in the literature uses complex techniques of encodable and decodable error-correcting codes,blocked data structures and fault-resistant *** this work,we use the natural approach of data replication to develop a fault tolerant suffix tree based on the faulty memory random access machine *** proposed data structure stores copies of the indices to sustain memory faults injected by an *** develop a resilient version of the Ukkonen’s algorithm for constructing the fault tolerant suffix tree and derive an upper bound on the number of corrupt suffixes.

关键词： Resilient data structures fault tolerant data structures suffix tree

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：