Shahina Anwarul¹, Sunil Kumar², Ashok Bhansali³, Hammam Alshazly^4,*, Hany S. Hussein^5,6

Computer Systems Science and Engineering, Vol.47, No.3, pp. 3145-3163, 2023, DOI:10.32604/csse.2023.041061

Abstract Security systems are the need of the hour to protect data from unauthorized access. The dissemination of confidential information over the public network requires a high level of security. The security approach such as steganography ensures confidentiality, authentication, integrity, and non-repudiation. Steganography helps in hiding the secret data inside the cover media so that the attacker can be confused during the transmission process of secret data between sender and receiver. Therefore, we present an efficient hybrid security model that provides multifold security assurance. To this end, a rectified Advanced Encryption Standard (AES) algorithm is proposed to overcome the problems existing… More >

Zhaolin Chen^1,*, Xiaohui Wei¹, Tianhang Xiao¹, Ning Qin²

The International Conference on Computational & Experimental Engineering and Sciences, Vol.25, No.2, pp. 1-1, 2023, DOI:10.32604/icces.2023.09976

Abstract A computational study has been conducted on various airfoils to simulate flows at low Reynolds numbers 17,000 and 21,000 with Mach number changes from 0.25 to 0.85 to provide understanding and guidance for Mars rotory wing designs. The computational fluid dynamics tool used in this study is a Reynolds-averaged Navier–Stokes solver with a transition model (k-ω SST γ-Reθ). The airfoils investigated in this study include NACA airfoils (4, 5, and 6% camber), UltraThin airfoils, and thin cambered plates (3% camber, but various maximum camber locations). Airfoils were examined for lift and drag performance as well as surface pressure and flow… More >

Mohamed A. Meselhi^*, Saber M. Elsayed, Daryl L. Essam, Ruhul A. Sarker

CMC-Computers, Materials & Continua, Vol.74, No.1, pp. 1-17, 2023, DOI:10.32604/cmc.2023.027448

Abstract Dynamic constrained optimization is a challenging research topic in which the objective function and/or constraints change over time. In such problems, it is commonly assumed that all problem instances are feasible. In reality some instances can be infeasible due to various practical issues, such as a sudden change in resource requirements or a big change in the availability of resources. Decision-makers have to determine whether a particular instance is feasible or not, as infeasible instances cannot be solved as there are no solutions to implement. In this case, locating the nearest feasible solution would be valuable information for the decision-makers.… More >