Computation Time Research Articles

RPC-EAU: Radar Plot Classification Algorithm Based on Evidence Adaptive Updating

Accurately classifying targets and clutter plots is crucial in radar data processing. It is beneficial for filtering out a large amount of clutters and improving the track initiation speed and tracking accuracy of real targets. However, in practical applications, this problem becomes difficult due to complex electromagnetic environments such as cloud and rain clutter, sea clutter, and strong ground clutter. This has led to poor performance of some commonly used radar plot classification algorithms. In order to solve this problem and further improve classification accuracy, the radar plot classification algorithm based on evidence adaptive updating (RPC-EAU) is proposed in this paper. Firstly, the multi-dimensional recognition features of radar plots used for classification are established. Secondly, the construction and combination of mass functions based on feature sample distribution are designed. Then, a confidence network classifier containing an uncertain class was designed, and an iterative update strategy for it was provided. Finally, several experiments based on synthetic and real radar plots were presented. The results show that RPC-EAU can effectively improve the radar plot classification performance, achieving a classification accuracy of about 0.96 and a clutter removal rate of 0.95. Compared with some traditional radar pattern recognition algorithms, it can improve by 1 to 10 percentage points. The target loss rate of RPC-EAU is also the lowest, only about 0.02, which is about one third to one half of the comparison algorithms. In addition, RPC-EAU avoids clustering all radar points in each update, greatly saving the computational time. The proposed algorithm has the characteristics of high classification accuracy, low target loss rate, and less computational time. Therefore, it is suitable for radar data processing with high timeliness requirements and multiple radar plots.

Performance Evaluation of Some Selected Classification Algorithms in a Facial Recognition System

Facial Recognition (FR) has been an active area of research and has diverse applicable environment, it continues to be a challenging research topic. With the development of image processing and pattern recognition technology, there are many challenges in machine learning to select the appropriate classification algorithms, most especially in the area of classification of extracted features to have low classification time, high sensitivity and accuracy of the classification algorithms, so it is very important to explore the performance of different algorithms in image classification. The three selected supervised learning classification algorithms: Learning Vector Quantization (LVQ), Relevance Vector Machine (RVM), and Support Vector Machine (SVM) performance were evaluated so as to know the most effective out of the selected algorithms for facial images classification. The development of the system has four stages, the first stage is image acquisition and 180 images were taken by digital camera under same illumination and light colour background. The second stage is pre-processing to improve the images data by suppressing unwilling distortion; grayscale and normalization were used for image pre-processing. The third stage is feature extraction; Discrete Cosine Transform (DCT) is adopted for this purpose. While the fourth stage is face recognition classification, Receiver Operating Characteristics (ROC) was used to test the performance of each the three algorithms. However the Learning Vector Quantization algorithm, Relevance Vector Machine and Support Vector Machine performance have not been compared together to the most effective out of the three algorithms in term of False Positive Rate, Sensitivity, Specificity, Precision, Accuracy and Computation Time. Hence, this work evaluated the performance of the Learning Vector Quantization; Relevance Vector Machine and Support Vector Machine classification algorithms in facial recognition system and Support Vector Machine outwit the other two algorithms in facial recognition in term of specificity, recognition time and recognition accuracy at different threshold.

Expert knowledge data-driven based actor–critic reinforcement learning framework to solve computationally expensive unit commitment problems with uncertain wind energy

With the expansion of power grid, unaffordable computational cost and time will pose serious challenges of time-efficient scheduling in unit commitment problem (UCP). However, existing optimization methods, i.e., mathematical programming methods and meta-heuristic algorithms, are powerless and time-consuming to handle computationally expensive UCP (CEUCP). Thus, reinforcement learning methods with strong inference and time-saving performances are motivated to solve the computationally expensive challenges in tackling CEUCPs. In this paper, a novel expert knowledge data-driven based actor–critic (AC) reinforcement learning methodology is proposed for solving CEUCPs. Specifically, in the proposed AC reinforcement learning methodology, expert knowledge, data-driven surrogate model, and improved meta-heuristic algorithm are integrated for further performance enhancement. Firstly, a novel action selection mechanism (based on the expert knowledge of thermal units characteristic) is integrated into AC to improve the efficiency of network training. Secondly, an improved extreme learning machine (ELM) data-driven surrogate model is proposed to build reward function in AC. In detail, original cost function in reward is replaced by a lightweight ELM model. Shape distance is integrated into ELM for enhancing accuracy. Finally, original marine predators algorithm (MPA) is improved for obtaining optimal dispatching decisions and rewards of AC method quickly and correctly. Original search pattern is replaced by quantum based representation for boosting convergence. The excellent performances of the proposed AC framework are verified by simulations of 10-units, 100-units, and 100-units with wind energy test systems.

Calibration of Decision-Based Crowd-Behaviour Model

Various methods of calibration are used depending on the model type, application, and individual preferences. While there is no universally applicable method, statistical techniques became popular in recent decades. Introduced calibration concept consists of separate calibration episodes to avoid choosing only a few metrics to describe the whole system and a high computational time increasing exponentially with the number of parameters. These episodes are designed to be separated from each other and to cover one type of pedestrian behaviour captured by some model parameters. The design of the calibration quantities; estimate of the needed simulation time to get stationary results; and the number of iterations by Chebyshev's inequality influencing the quality of the results are discussed. Furthermore, hypothesis testing (James' test) is used to compare the model and experimental data. This calibration process can be applied for any pedestrian model; this paper deals with its application on the crowd-behaviour phase in the author's decision based model.

Implementation and optimization of Burg’s method for real-time packet loss concealment in networked music performance applications

AbstractIn networked music performance (NMP) applications, which entail real-time audio streaming over the Internet, strict latency requirements are needed to ensure a realistic interaction between geographically dispersed musicians. Thus, NMP applications typically leverage uncompressed audio and unreliable transport protocols to avoid unnecessary processing and re-transmission delays. Given that no guarantee on packet delivery is offered, NMP applications must deal with late/lost audio packets to mitigate the impact of the resulting audio artifacts on the quality of the playback audio stream. This paper explores an audio packet loss concealment (PLC) technique based on autoregressive (AR) models. In particular, it investigates the algorithmic implementation of Burg’s method and the parameters configuration that offers the best trade-off between prediction error and computational time requirements. The purpose is to find the most suitable solution capable of running on a Raspberry Pi 4B within the real-time audio boundaries imposed by NMP applications. Additionally, we analyze the computational time required to fit the model and predict future samples by considering six implementations and various compilation flags. Results confirm that AR models can predict future audio samples more accurately than traditional PLC approaches, which consist of filling audio gaps with silence or repeating the last received audio segment. Furthermore, results demonstrate the effectiveness of the proposed solution in meeting the strict latency requirements when deployed on a Raspberry Pi 4B.

Volt-VAR Control in Active Distribution Networks Using Multi-Agent Reinforcement Learning

With the advancement of power systems, the integration of a substantial portion of renewable energy often leads to frequent voltage surges and increased fluctuations in distribution networks (DNs), significantly affecting the safety of DNs. Active distribution networks (ADNs) can address voltage issues arising from a high proportion of renewable energy by regulating distributed controllable resources. However, the conventional mathematical optimization-based approach to voltage reactive power control has certain limitations. It heavily depends on precise DN parameters, and its online implementation requires iterative solutions, resulting in prolonged computation time. In this study, we propose a Volt-VAR control (VVC) framework in ADNs based on multi-agent reinforcement learning (MARL). To simplify the control of photovoltaic (PV) inverters, the ADNs are initially divided into several distributed autonomous sub-networks based on the electrical distance of reactive voltage sensitivity. Subsequently, the Multi-Agent Soft Actor-Critic (MASAC) algorithm is employed to address the partitioned cooperative voltage control problem. During online deployment, the agents execute distributed cooperative control based on local observations. Comparative tests involving various methods are conducted on IEEE 33-bus and IEEE 141-bus medium-voltage DNs. The results demonstrate the effectiveness and versatility of this method in managing voltage fluctuations and mitigating reactive power loss.

A Cooperative Scheduling Based on Deep Reinforcement Learning for Multi-Agricultural Machines in Emergencies

Effective scheduling of multiple agricultural machines in emergencies can reduce crop losses to a great extent. In this paper, cooperative scheduling based on deep reinforcement learning for multi-agricultural machines with deadlines is designed to minimize makespan. With the asymmetric transfer paths among farmlands, the problem of agricultural machinery scheduling under emergencies is modeled as an asymmetric multiple traveling salesman problem with time windows (AMTSPTW). With the popular encoder-decoder structure, heterogeneous feature fusion attention is designed in the encoder to integrate time windows and asymmetric transfer paths for more comprehensive and better feature extraction. Meanwhile, a path segmentation mask mechanism in the decoder is proposed to divide solutions efficiently by adding virtual depots to assign work to each agricultural machinery. Experimental results show that our proposal outperforms existing modified baselines for the studied problem. Especially, the measurements of computation ratio and makespan are improved by 26.7% and 21.9% on average, respectively. The computation time of our proposed strategy has a significant improvement over these comparisons. Meanwhile, our strategy has a better generalization for larger problems.

Exploration of Natural Element Form Optimization Algorithm using Spatial-Temporal Multi-Scale Alignment Graph Neural Network in Architectural Design Based on Morphological Theory

The construction industry has experienced important changes in recent years due to advancements in digital, artificial intelligence, and construction technologies, as well as the sector's on-going development and the advancement of science and technology. The creative growth of building industry, creative creation of architectural forms are partially supported technically by sophisticated parametric design apparatuses, the potent computing benefits of computer technology. In this manuscript, Exploration of Natural Element Form Optimization Algorithm using Spatial-Temporal Multi-Scale Alignment Graph Neural Network in Architectural Design Based on Morphological Theory (ENEF-OA-ADMT) is proposed. The STMSA-GNN and the Chaotic Coyote Algorithm (CCA) are two tools used by the proposed ENEF-OA-ADMT approach to improve architectural design based on morphological theory. The ST-MSA GNN's ability to capture intricate interactions and dependencies between several components in both space and time allows it to perform a comprehensive study of the morphological aspects of architectural designs. This graph neural network's integration of spatial and temporal dimensions enables a deeper understanding of how the architectural structural form design changes over time. The CCA optimized the ST-MSA-GNN to enhance the architectural structural form design. The proposed ENEF-OA-ADMT methodology skill fully combines these methodologies, creating a strong framework that allows architects and designers to work together to explore, refine, and create architectural structural design forms. The framework provided serves as a spur for further research, encouraging a more complete integration of technology and environment in the architectural domain. The effectiveness of proposed method is executed in python, evaluated through performance metrics encompassing accuracy, precision, specificity, Recall, computational time, F1 score, population diversification, randomness. Proposed ENEF-OA-ADMT method 34.56%, 28.63% and 21.89% higher accuracy, 34.97%, 32.13% and 21.89% higher precision and 34.68%, 20.84% and 29.76% higher randomness when compared with the existing methods such as Study of Morphological Design of Architecture from Geometric Logic Perspective (SOT-MDA-GLP), learning deep morphological networks by neural architecture search (LD-MN-NAS) and identifying degrees of deprivation from space utilizing deep learning with morphological spatial analysis of deprived urban areas (IDDS-DLMSA-DUA) respectively.

MERA: Meta-Learning Based Runtime Adaptation for Industrial Wireless Sensor-Actuator Networks

IEEE 802.15.4-based industrial wireless sensor-actuator networks (WSANs) have been widely deployed to connect sensors, actuators, and controllers in industrial facilities. Configuring an industrial WSAN to meet the application-specified quality of service (QoS) requirements is a complex process, which involves theoretical computation, simulation, and field testing, among other tasks. Since industrial wireless networks become increasingly hierarchical, heterogeneous, and complex, many research efforts have been made to apply wireless simulations and advanced machine learning techniques for network configuration. Unfortunately, our study shows that the network configuration model generated by the state-of-the-art method decays quickly over time. To address this issue, we develop a ME ta-learning based R untime A daptation (MERA) method that efficiently adapts network configuration models for industrial WSANs at runtime. Under MERA, the parameters of the network configuration model are explicitly trained such that a small number of optimization steps with only a few new measurements will produce good generalization performance after the network condition changes. We also develop a data sampling method to reduce the measurements required by MERA at runtime without sacrificing its performance. Experimental results show that MERA achieves higher prediction accuracy with less physical measurements, less computation time, and longer adaptation intervals compared to a state-of-the-art baseline.

Improved Variable Structure Interacting Multimodels for Target Trajectory Tracking and Extrapolation

To improve the lengthy computation time of conventional variable structure interacting multiple model (VSIMM) algorithm and increase the precision of target prediction and extrapolation, the target state and flight intent information captured by the Automatic Dependent Surveillance-Broadcast (ADS-B) are used as the model’s prior information; combining this information with VSIMM theoretical framework, we purpose an intent variable structure interacting multiple model (INT-VSIMM) algorithm. Firstly, the motion pattern of the target in the flight phase of the flight path is decomposed, and complete sets of motion models are established. Secondly, according to the principle of directed graph switching, a model set switching method is designed, which is mainly based on “hard” switching and supplemented by “soft” switching. Finally, the INT-VSIMM algorithm is used to track the trajectory of the target aircraft, and short-term trajectory extrapolation is performed based on the target state estimation. The simulation results show that the target tracking performance computational time based on the INT-VSIMM algorithm is superior to the comparative existing methods, and the extrapolated trajectory has less error in the short term, which can satisfy the needs of conflict detection.

Design and Performance Evaluation of Network Intrusion Detection System Based on Deep Learning

Today’s internets are made up of nearly half million various networks. In any network connection, detecting attacks by their kinds is challenging task as various attacks may have several connections, their number vary from few to hundreds of network connections. In this paper, Design and Performance Evaluation of Network Intrusion Detection System Based on Deep Learning (NID-SPGAN-STO) is proposed. Initially, input data are collected by NSL-KDD dataset. Afterward, data are fed to preprocessing. In preprocessing, Distributed Set-Membership Fusion Filtering is used to remove redundant and biased records from input data. The pre-processed output is given to feature selection for selecting optimal features utilizing Piranha foraging Optimization Algorithm. Finally the selected features are transferred into the Semantic-Preserved Generative Adversarial Network (SPGAN) for detecting Network Intrusion, like DoS, Probe, R2L, U2R and Normal. Generally SPGAN doesn’t reveal some adoption of optimization techniques for computing optimal parameters for promising precise network intrusion detection. Hence Siberian Tiger Optimisation (STO) is used to enhance weight parameters of SPGAN. The proposed NID-SPGAN-STO method is implemented using Python. To detect network intrusion detection, performance metrics likes precision, sensitivity, FI-score, specificity, accuracy, RoC, computational time are considered. The NID-SPGAN-STO method attains 30.58%, 28.73% and 25.62%, higher precision, 20.48%, 24.73%, 29.32% higher specificity and 30.98%, 26.66% and 21.32% higher F-score, 26.78%, 34.47%, and 22.86% higher recall analysed, with existing techniques likes improved binary gray wolf optimizer with SVM for intrusion detection system in WSNs (NID-SVM-IDS), network intrusion detection system utilizing deep learning (NID-DNN), design with improvement of efficient network intrusion detection system utilizing ML methods (NID-IDS-ANN) respectively.

Sampling-Based Global Path Planning Using Convex Polytope Approximation for Narrow Collision-Free Space of Humanoid

In this paper, we propose a computationally fast method of sampling-based global path planning for humanoids under Manifold Constraints such as closed kinematic chains and Volume-Reducing Constraints such as collision avoidance. In multi-contact and whole-body manipulation of humanoids, narrow collision-free space causes path planning to take a long computation time (narrow corridor problem). In previous research of constrained planning, Manifold Constraints are locally approximated by tangent plane, and steering motions along Manifold Constraints are found efficiently by projection or continuation methods. In this paper, we applied constrained planning algorithms to collision avoidance. Since tangent plane cannot approximate Volume-Reducing Constraints, we adopted convex polytope instead of tangent plane. Both Manifold Constraints and Volume-Reducing Constraints are locally approximated by convex polytope with linear equality and inequality constraints, and steering motions inside the convex polytope are found efficiently by the SQP-based prioritized inverse kinematics. We developed CP-KPIECE (Convex Polytope approximation-based KPIECE) with this approach. Benchmarks using the humanoid JAXON proved the effectiveness of our approach for fast path planning in narrow collision-free space of humanoids.

Quasinormal modes by improved matrix method and weighted residual method

This work discusses the Improved Matrix Method and Weighted Residual Method for studying the quasinormal modes (QNMs) of black holes. In the first method, by utilizing Jordan decomposition, the improved matrix method avoids the calculation of inverse matrices in the original matrix method. This significantly saves computational resources and time needed to compute the coefficient square matrices of the derivatives. In the second method, we illustrate the effectiveness of the weighted residual method in QNMs calculations by using the collocation method and Galerkin method as examples. We compared the results of both methods with the Generalized Horowitz-Hubeny Method and the WKB approximation. The methods proposed in this paper demonstrates superior precision. Additionally, we provide five criteria to exclude extraneous roots from the methods.

Dual therapy of cancer using optimal control supported by swarm intelligence.

The scientific revolution in the treatment of many illnesses has been significantly aided by stem cells. This paper presents an optimal control on a mathematical model of chemotherapy and stem cell therapy for cancer treatment. To develop effective hybrid techniques that combine the optimal control theory (OCT) with the evolutionary algorithm and multi-objective swarm algorithm. The developed technique is aimed to reduce the number of cancerous cells while utilizing the minimum necessary chemotherapy medications and minimizing toxicity to protect patients' health. Two hybrid techniques are proposed in this paper. Both techniques combined OCT with the evolutionary algorithm and multi-objective swarm algorithm which included MOEA/D, MOPSO, SPEA II and PESA II. This study evaluates the performance of two hybrid techniques in terms of reducing cancer cells and drug concentrations, as well as computational time consumption. In both techniques, MOEA/D emerges as the most effective algorithm due to its superior capability in minimizing tumour size and cancer drug concentration. This study highlights the importance of integrating OCT and evolutionary algorithms as a robust approach for optimizing cancer chemotherapy treatment.

An end-to-end deep convolutional neural network-based dose engine for parotid gland cancer seed implant brachytherapy.

Seed implant brachytherapy (SIBT) is a promising treatment modality for parotid gland cancers (PGCs). However, the current clinical standard dose calculation method based on the American Association of Physicists in Medicine (AAPM) Task Group 43 (TG-43) Report oversimplifies patient anatomy as a homogeneous water phantom medium, leading to significant dose calculation errors due to heterogeneity surrounding the parotid gland. Monte Carlo Simulation (MCS) can yield accurate dose distributions but the long computation time hinders its wide application in clinical practice. This paper aims to develop an end-to-end deep convolutional neural network-based dose engine (DCNN-DE) to achieve fast and accurate dose calculation for PGC SIBT. A DCNN model was trained using the patient's CT images and TG-43-based dose maps as inputs, with the corresponding MCS-based dose maps as the ground truth. The DCNN model was enhanced based on our previously proposed model by incorporating attention gates (AGs) and large kernel convolutions. Training and evaluation of the model were performed using a dataset comprising 188 PGC I-125 SIBT patient cases, and its transferability was tested on an additional 16 non-PGC head and neck cancers (HNCs) I-125 SIBT patient cases. Comparison studies were conducted to validate the superiority of the enhanced model over the original one and compare their overall performance. On the PGC testing dataset, the DCNN-DE demonstrated the ability to generate accurate dose maps, with percentage absolute errors (PAEs) of 0.67%±0.47% for clinical target volume (CTV) D90 and 1.04%±1.33% for skin D0.1cc. The comparison studies revealed that incorporating AGs and large kernel convolutions resulted in 8.2% (p<0.001) and 3.1% (p<0.001) accuracy improvement, respectively, as measured by dose mean absolute error. On the non-PGC HNC dataset, the DCNN-DE exhibited good transferability, achieving a CTV D90 PAE of 1.88%±1.73%. The DCNN-DE can generate a dose map in less than 10 ms. We have developed and validated an end-to-end DCNN-DE for PGC SIBT. The proposed DCNN-DE enables fast and accurate dose calculation, making it suitable for application in the plan optimization and evaluation process of PGC SIBT.

In Search of the Best Low-Cost Methods for Efficient Screening of Conformers.

Locating the lowest energy conformer is crucial for the accurate computation of equilibrium properties of molecular systems. This paper examines the performance of efficient low-cost methods in terms of the alignment and relative energies of their energy minima against the benchmark revDSD-PBEP86-D4/def2-TZVPP//MP2/cc-pVTZ potential energy surface. The low-cost methods considered include GFN-FF, GFN2-xTB, DFTB3, HF-3c, B97-3c, PBEh-3c, and r2SCAN-3c composite methods against a diverse test set of 20 compounds including alkanes, perfluoroalkyl molecules, peptides, open-shell radicals, and Zn(II) complexes of varying sizes. The "3c" composite methods are generally more accurate, but are at least 2-3 orders of magnitude more expensive than tight-binding methods which have energy minima that align well with the benchmark potential energy surface. The findings of this paper were further exploited to introduce a simple strategy involving Grimme's CENSO energy-sorting algorithm that resulted in up to an order of magnitude reduction in computational time for locating the lowest energy conformer on the revDSD-PBEP86-D4/def2-TZVPP//MP2/cc-pVTZ surface.

Extended finite element method with cell-based smoothing for modeling frictional contact crack-induced acoustic nonlinearity involving distorted mesh

Abstract This study proposes a 2D cell-based smoothed extended finite element method (CS-XFEM) for accurate and efficient simulation of nonlinear ultrasonic wave propagation in solid structures, specifically addressing the effects of frictional contact in cracks. Traditional mesh discretization methods for cracks often suffer from mesh distortion and computational instability owing to their high aspect ratios. To overcome this, CS-XFEM integrates a cell-based smoothing technique into XFEM to model the frictional contact of a crack. A comprehensive numerical example demonstrates the advantages of CS-XFEM. The results show that CS-XFEM exhibits a higher convergence rate and enables a larger critical time increment than XFEM. Specifically, the critical time increment of CS-XFEM was found to be twice that of XFEM, leading to a 50% reduction in the total computational time. These findings confirm that CS-XFEM is an efficient, accurate, and robust numerical method for studying the acoustic nonlinearity induced by crack-induced frictional contact.

A novel skin cancer detection model using modified finch deep CNN classifier model

Skin cancer is one of the most life-threatening diseases caused by the abnormal growth of the skin cells, when exposed to ultraviolet radiation. Early detection seems to be more crucial for reducing aberrant cell proliferation because the mortality rate is rapidly rising. Although multiple researches are available based on the skin cancer detection, there still exists challenges in improving the accuracy, reducing the computational time and so on. In this research, a novel skin cancer detection is performed using a modified falcon finch deep Convolutional neural network classifier (Modified Falcon finch deep CNN) that efficiently detects the disease with higher efficiency. The usage of modified falcon finch deep CNN classifier effectively analyzed the information relevant to the skin cancer and the errors are also minimized. The inclusion of the falcon finch optimization in the deep CNN classifier is necessary for efficient parameter tuning. This tuning enhanced the robustness and boosted the convergence of the classifier that detects the skin cancer in less stipulated time. The modified falcon finch deep CNN classifier achieved accuracy, sensitivity, and specificity values of 93.59%, 92.14%, and 95.22% regarding k-fold and 96.52%, 96.69%, and 96.54% regarding training percentage, proving more effective than literary works.

Gershgorin circle theorem-based feature extraction for biomedical signal analysis

Recently, graph theory has become a promising tool for biomedical signal analysis, wherein the signals are transformed into a graph network and represented as either adjacency or Laplacian matrices. However, as the size of the time series increases, the dimensions of transformed matrices also expand, leading to a significant rise in computational demand for analysis. Therefore, there is a critical need for efficient feature extraction methods demanding low computational time. This paper introduces a new feature extraction technique based on the Gershgorin Circle theorem applied to biomedical signals, termed Gershgorin Circle Feature Extraction (GCFE). The study makes use of two publicly available datasets: one including synthetic neural recordings, and the other consisting of EEG seizure data. In addition, the efficacy of GCFE is compared with two distinct visibility graphs and tested against seven other feature extraction methods. In the GCFE method, the features are extracted from a special modified weighted Laplacian matrix from the visibility graphs. This method was applied to classify three different types of neural spikes from one dataset, and to distinguish between seizure and non-seizure events in another. The application of GCFE resulted in superior performance when compared to seven other algorithms, achieving a positive average accuracy difference of 2.67% across all experimental datasets. This indicates that GCFE consistently outperformed the other methods in terms of accuracy. Furthermore, the GCFE method was more computationally-efficient than the other feature extraction techniques. The GCFE method can also be employed in real-time biomedical signal classification where the visibility graphs are utilized such as EKG signal classification.

A comparison of computational algorithms for the Bayesian analysis of clinical trials.

Clinical trials are increasingly using Bayesian methods for their design and analysis. Inference in Bayesian trials typically uses simulation-based approaches such as Markov Chain Monte Carlo methods. Markov Chain Monte Carlo has high computational cost and can be complex to implement. The Integrated Nested Laplace Approximations algorithm provides approximate Bayesian inference without the need for computationally complex simulations, making it more efficient than Markov Chain Monte Carlo. The practical properties of Integrated Nested Laplace Approximations compared to Markov Chain Monte Carlo have not been considered for clinical trials. Using data from a published clinical trial, we aim to investigate whether Integrated Nested Laplace Approximations is a feasible and accurate alternative to Markov Chain Monte Carlo and provide practical guidance for trialists interested in Bayesian trial design. Data from an international Bayesian multi-platform adaptive trial that compared therapeutic-dose anticoagulation with heparin to usual care in non-critically ill patients hospitalized for COVID-19 were used to fit Bayesian hierarchical generalized mixed models. Integrated Nested Laplace Approximations was compared to two Markov Chain Monte Carlo algorithms, implemented in the software JAGS and stan, using packages available in the statistical software R. Seven outcomes were analysed: organ-support free days (an ordinal outcome), five binary outcomes related to survival and length of hospital stay, and a time-to-event outcome. The posterior distributions for the treatment and sex effects and the variances for the hierarchical effects of age, site and time period were obtained. We summarized these posteriors by calculating the mean, standard deviations and the 95% equitailed credible intervals and presenting the results graphically. The computation time for each algorithm was recorded. The average overlap of the 95% credible interval for the treatment and sex effects estimated using Integrated Nested Laplace Approximations was 96% and 97.6% compared with stan, respectively. The graphical posterior densities for these effects overlapped for all three algorithms. The posterior mean for the variance of the hierarchical effects of age, site and time estimated using Integrated Nested Laplace Approximations are within the 95% credible interval estimated using Markov Chain Monte Carlo but the average overlap of the credible interval is lower, 77%, 85.6% and 91.3%, respectively, for Integrated Nested Laplace Approximations compared to stan. Integrated Nested Laplace Approximations and stan were easily implemented in clear, well-established packages in R, while JAGS required the direct specification of the model. Integrated Nested Laplace Approximations was between 85 and 269 times faster than stan and 26 and 1852 times faster than JAGS. Integrated Nested Laplace Approximations could reduce the computational complexity of Bayesian analysis in clinical trials as it is easy to implement in R, substantially faster than Markov Chain Monte Carlo methods implemented in JAGS and stan, and provides near identical approximations to the posterior distributions for the treatment effect. Integrated Nested Laplace Approximations was less accurate when estimating the posterior distribution for the variance of hierarchical effects, particularly for the proportional odds model, and future work should determine if the Integrated Nested Laplace Approximations algorithm can be adjusted to improve this estimation.