期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Investigation into the Computational Costs of Using Genetic Algorithm and Simulated Annealing for the Optimization of Explicit Friction Factor Models
1
作者 Sunday Boladale Alabi Abasiyake Uku Ekpenyong 《Journal of Materials Science and Chemical Engineering》 CAS 2022年第12期1-9,共9页
Research reports show that the accuracies of many explicit friction factor models, having different levels of accuracies and complexities, have been improved using genetic algorithm (GA), a global optimization approac... Research reports show that the accuracies of many explicit friction factor models, having different levels of accuracies and complexities, have been improved using genetic algorithm (GA), a global optimization approach. However, the computational cost associated with the use of GA has yet to be discussed. In this study, the parameters of sixteen explicit models for the estimation of friction factor in the turbulent flow regime were optimized using two popular global search methods namely genetic algorithm (GA) and simulated annealing (SA). Based on 1000 interval values of Reynolds number (Re) in the range of and 100 interval values of relative roughness () in the range of , corresponding friction factor (f) data were obtained by solving Colebrook-White equation using Microsoft Excel spreadsheet. These data were then used to modify the parameters of the selected explicit models. Although both GA and SA led to either moderate or significant improvements in the accuracies of the existing friction factor models, SA outperforms the GA. Moreover, the SA requires far less computational time than the GA to complete the corresponding optimization process. It can therefore be concluded that SA is a better global optimizer than GA in the process of finding an improved explicit friction factor model as an alternative to the implicit Colebrook-White equation in the turbulent flow regime. 展开更多
关键词 Genetic Algorithm Simulated Annealing Global Optimization Explicit Friction Factor computational cost
下载PDF
Secure Localization Based Authentication (SLA) Strategy for Data Integrity in WNS
2
作者 V.Manikandan M.Sivaram +2 位作者 Amin Salih Mohammed V.Porkodi K.Shankar 《Computers, Materials & Continua》 SCIE EI 2021年第6期4005-4018,共14页
Wireless Sensor Networks(WSN)has been extensively utilized as a communication model in Internet of Things(IoT).As well,to offer service,numerous IoT based applications need effective transmission over unstable locatio... Wireless Sensor Networks(WSN)has been extensively utilized as a communication model in Internet of Things(IoT).As well,to offer service,numerous IoT based applications need effective transmission over unstable locations.To ensure reliability,prevailing investigations exploit multiple candidate forwarders over geographic opportunistic routing in WSNs.Moreover,these models are affected by crucial denial of service(DoS)attacks,where huge amount of invalid data are delivered intentionally to the receivers to disturb the functionality of WSNs.Here,secure localization based authentication(SLA)is presented to fight against DoS attack,and to fulfil the need of reliability and authentication.By examining state information,SLA projects a trust model to enhance efficacy of data delivery.Indeed,of the prevailing opportunistic protocols,SLA guarantees data integrity by modelling a trust based authentication,providing protection against DoS attackers and diminishing computational costs.Specifically,this model acts as a verification strategy to accelerate?attackers and to handle isolation.This strategy helps SLA in eliminating duplicate transmission and by continuous verification that results from conventional opportunistic routing.Simulation is performed in a MATLAB environment that offers authentic and reliable delivery by consuming approximately 50%of the cost in contrast to other approaches.The anticipated model shows better trade off in comparison to the prevailing ones. 展开更多
关键词 Wireless sensor networks opportunistic routing secure localization based authentication denial of service computational cost
下载PDF
Block Iterative STMV Algorithm and Its Application in Multi-Targets Detection
3
作者 Daizhu Zhu Haoquan Guo +1 位作者 Yuanao Wei Kaiju Wang 《Journal of Applied Mathematics and Physics》 2020年第7期1346-1361,共16页
<div style="text-align:justify;"> STMV beamforming algorithm needs inversion operation of matrix, and its engineering application is limited due to its huge computational cost. This paper proposed bloc... <div style="text-align:justify;"> STMV beamforming algorithm needs inversion operation of matrix, and its engineering application is limited due to its huge computational cost. This paper proposed block iterative STMV algorithm based on one-phase regressive filter, matrix inversion lemma and inversion of block matrix. The computational cost is reduced approximately as 1/4 M times as original algorithm when array number is M. The simulation results show that this algorithm maintains high azimuth resolution and good performance of detecting multi-targets. Within 1 - 2 dB directional index and higher azimuth discrimination of block iterative STMV algorithm are achieved than STMV algorithm for sea trial data processing. And its good robustness lays the foundation of its engineering application. </div> 展开更多
关键词 BEAMFORMING Steered Minimum Variance (STMV) Block Iterative computational cost Multi-Targets Detection
下载PDF
An Efficient Mapped WENO Scheme Using Approximate Constant Mapping
4
作者 Ruo Li Wei Zhong 《Numerical Mathematics(Theory,Methods and Applications)》 SCIE CSCD 2022年第1期1-41,共41页
We present a novel mapping approach for WENO schemes through the use of an approximate constant mapping function which is constructed by employing an approximation of the classic signum function.The new approximate co... We present a novel mapping approach for WENO schemes through the use of an approximate constant mapping function which is constructed by employing an approximation of the classic signum function.The new approximate constant mapping function is designed to meet the overall criteria for a proper mapping function required in the design of the WENO-PM6 scheme.The WENO-PM6 scheme was proposed to overcome the potential loss of accuracy of the WENO-M scheme which was developed to recover the optimal convergence order of the WENO-JS scheme at critical points.Our new mapped WENO scheme,denoted as WENOACM,maintains almost all advantages of the WENO-PM6 scheme,including low dissipation and high resolution,while decreases the number of mathematical operations remarkably in every mapping process leading to a significant improvement of efficiency.The convergence rates of the WENO-ACM scheme have been shown through one-dimensional linear advection equation with various initial conditions.Numerical results of one-dimensional Euler equations for the Riemann problems,the Mach 3 shock-density wave interaction and the Woodward-Colella interacting blastwaves are improved in comparison with the results obtained by the WENO-JS,WENO-M and WENO-PM6 schemes.Numerical experiments with two-dimensional problems as the 2D Riemann problem,the shock-vortex interaction,the 2D explosion problem,the double Mach reflection and the forward-facing step problem modeled via the two dimensional Euler equations have been conducted to demonstrate the high resolution and the effectiveness of the WENO-ACM scheme.The WENOACM scheme provides significantly better resolution than the WENO-M scheme and slightly better resolution than the WENO-PM6 scheme,and compared to the WENOM and WENO-PM6 schemes,the extra computational cost is reduced by more than 83%and 93%,respectively. 展开更多
关键词 WENO approximate constant mapping hyperbolic problems high resolution low computational cost
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部