Complex 3D Vortex Lattice Formation by Phase-Engineered Multiple Beam Interference by Jolly Xavier, Sunil Vyas, Paramasivam Senthilkumaran, Joby Joseph

“…We present the computational results on the formation of diverse complex 3D vortex lattices by a designed superposition of multiple plane waves. …”
Get full text

Algorithms for Processing Coronavirus Genomes for the Goals and Objectives of Modern Immunoinformatics, Vaccinomics, and Virology by M. V. Sprindzuk, A. S. Vladyko, L. P. Titov, Lu Zhuozhuang, V. I. Bernik

“…The algorithms for processing genomic information developed by the authors based on the analysis of the available literature and many years of experience in computational and laboratory experiments can be used not only for the design and analysis of epitope vaccine components, but also for the other tasks of computational virology and microbiology. …”
Get full text

On Fault-Tolerant Resolving Sets of Some Families of Ladder Networks by Hua Wang, Muhammad Azeem, Muhammad Faisal Nadeem, Ata Ur-Rehman, Adnan Aslam

“…In computer networks, vertices represent hosts or servers, and edges represent as the connecting medium between them. …”
Get full text

An Efficient Higher-Order Quasilinearization Method for Solving Nonlinear BVPs by Eman S. Alaidarous, Malik Zaka Ullah, Fayyaz Ahmad, A.S. Al-Fhaid

“…The reported method is very general and can be extended to desired order of convergence for highly nonlinear differential equations and also computationally superior to proposed iterative method based on Adomain decomposition because our proposed iterative scheme avoids the calculations of Adomain polynomials and achieves the same computational order of convergence as authors have claimed in Motsa and Sibanda, 2013. …”
Get full text

ID-based server-aided verification signature scheme with strong unforgeability by Xiao-dong YANG, Miao-miao YANG, Guo-juan GAO, Ya-nan LI, Xiao-yong LU, Cai-fen WANG

“…Most identity-based signature schemes in the standard model are existentially unforgeable,which cannot prevent adversaries from forging valid signatures on messages that have previously been signed.However,signature verification algorithms of ID-based signature schemes in the standard model require expensive bilinear pairing operations.In order to overcome the shortcomings of the existing ID-based signature schemes such as strong security assumption and high computation cost，a strongly unforgeable ID-based server-aided verification signature scheme was presented.This scheme was proven to be secure under collusion attacks,adaptive chosen identity and message attacks in the standard model.Analysis results show that the proposed scheme effectively reduces computation cost of pairing operation,and it greatly reduces computational complexity of signature verification algorithm.The proposed scheme is more efficient than the existing ID-based signature schemes.…”
Get full text

Simulation of Supersonic Flow in an Ejector Diffuser Using the JPVM by Carlos Couder-Castañeda

“…The first step is the construction of a proper transformation of the solution space to generate a computational regular space to apply an explicit scheme. …”
Get full text

Pengembangan aplikasi media pembelajaran perangkat komputer berbasis augmented reality (AR) by Menrisal Menrisal, Indra Wijaya

“…This research aims to design Learning Media Introduction to Computer Devices Using Augmented Reality to facilitate understanding of the material on Computer Devices material. …”
Get full text

Efficient pairing-free CP-ABE based on ordered binary decision diagram by Sheng DING, Jin CAO, Hui LI

“…To improve the computational efficiency of ABE,its access structure was optimized and a pairing-free CP-ABE scheme based on ordered binary decision diagram (OBDD) was proposed.Based on the elliptic curve cryptography,the complex bilinear pairing operation in traditional CP-ABE was replaced with the relatively lightweight scalar multiplication,thus the overall computation overhead was reduced.And OBDD was used as the access structure of CP-ABE,which can not only represent any Boolean expression about attributes,but also support both positive and negative attributes.The length of the key was independent of the number of attributes and the length of the ciphertext was only related to the number of valid paths in the access policy.The security and performance analysis show that the scheme can resist chosen plaintext attack under the decisional Diffie-Hellman (DDH) assumption,and the computation efficiency can meet the practical application requirements of Internet of things.…”
Get full text

Global Multi-Phase Path Planning Through High-Level Reinforcement Learning by Babak Salamat, Sebastian-Sven Olzem, Gerhard Elsbacher, Andrea M. Tonello

“…We highlight existing path planning challenges, particularly in integrating dynamic adaptability and computational efficiency. The results validate our method's convergence guarantees using Lyapunov’s stability theorem and underscore its computational advantages.…”
Get full text

Non-linear Vibrations of Deep Cylindrical Shells by the p-Version Finite Element Method by Pedro Ribeiro, Bruno Cochelin, Sergio Bellizzi

“…External forces are applied and the displacements in the geometrically non-linear regime computed with the p-model are found to be close to the ones computed using a commercial FE package. …”
Get full text

Modeling Transmission Lines With Open Boundaries via Infinite Mapping Layer by Gines Garcia-Contreras, Juan Corcoles, Jorge A. Ruiz-Cruz, Matteo Oldoni, Lorenzo Codecasa, Gian Guido Gentili

“…In this paper we introduce the use of several different Infinite Mapping Layers to model open boundaries in the 2-D Finite Element Method for the computation of transmission line parameters. The transformation maps a semi-infinite interval to a finite interval, thereby providing a simple and accurate description of open boundaries while keeping the size of the computational domain very compact. …”
Get full text

Higher-form symmetries, Bethe vacua, and the 3d-3d correspondence by Julius Eckhard, Heeyeon Kim, Sakura Schäfer-Nameki, Brian Willett

“…An observable that is sensitive to the higher-form symmetries is the Witten index, which can be computed by counting solutions to a set of Bethe equations that are determined by M3. …”
Get full text

Gender and learning attitudes in using Web-based science lessons by Siew Chee Leong, Suliman Al-Hawamdeh

“…The study shows differences in gender attitudes toward computers. Generally, boys spent more time with computers at home playing games and had more experience using the World Wide Web compared to girls. …”
Get full text

Research of STR multicast key management protocol based on bilinear pairing in ad hoc network by ZHOU Fu-cai1, XU Jian2, XU Hai-fang1, LIU Ze-chao1

“…STR multicast key management protocol has an optimal cost in computation,communication and storage.But on security property,STR cannot resist active attacks without providing key authentication.By introducing the bilinear pairing cryptosystem and the 3-ary key tree,the improved STR protocol which is called PSTR（bilinear pairing-based STR） was proposed.The key generation process and six basic sub-protocols were included in the protocol.Through proving the bilinear form of PSTR key tree,the security of the PSTR in computation was proved.Finally PSTR were compared with STR through performance analysis,the results of which show that: PSTR is more efficient than STR in the communication cost and the computation cost as well as the storage requirement.Therefore,PSTR is a novel,reliable group key management protocol,and is well-suited for Ad hoc networks.…”
Get full text

Study on the Convective Term Discretized by Strong Conservation and Weak Conservation Schemes for Incompressible Fluid Flow and Heat Transfer by Peng Wang, Bo Yu, Jianyu Xie, Yu Zhao, Jingfa Li, Qianqian Shao

“…Especially in the computation regions with sharp gradients, the advantages of strong conservation scheme become more apparent.…”
Get full text

Quantifying the Robustness of Countries’ Competitiveness by Network-Based Methods by Ming-Yang Zhou, Xiao-Yu Li, Wen-Man Xiong, Hao Liao

Get full text

An Energy Efficient Anchor-Free Localization Algorithm for No-Identity Wireless Sensor Networks by Zhe Qu, Minglei Shu, Ming Yang, Chongqing Zhang, Nuo Wei, Qingbei Guo, Tao Du

Get full text

Deep Learning in Nuclear Industry: A Survey by Chenwei Tang, Caiyang Yu, Yi Gao, Jianming Chen, Jiaming Yang, Jiuling Lang, Chuan Liu, Ling Zhong, Zhenan He, Jiancheng Lv

Get full text

Analysis of the Symmetries and Conservation Laws of the Nonlinear Jaulent-Miodek Equation by Mehdi Nadjafikhah, Mostafa Hesamiarshad

“…And conservation laws of the J-M equation are presented with two steps: firstly, finding multipliers for computation of conservation laws and, secondly, symbolic computation of conservation laws will be applied.…”
Get full text

A Generalized Gradient Projection Filter Algorithm for Inequality Constrained Optimization by Wei Wang, Shaoli Hua, Junjie Tang

“…The first is that the amount of computation is lower, since the gradient matrix only needs to be computed one time at each iterate. …”
Get full text