Optimized Bayesian regularization-back propagation neural network using data-driven intrusion detection system in Internet of Things by Ashok Kumar K (21441108)

“…Hence, Binary Black Widow Optimization Algorithm (BBWOA) is proposed in this manuscript to improve the BRBPNN classifier that detects intrusion precisely. …”

Bayesian Spatial Binary Regression for Label Fusion in Structural Neuroimaging by D. Andrew Brown (6584837)

Application of ABC SMC to the fitting of the binary flip with cusp model. by Elena Camacho-Aguilar (10906327)

Fitness score statistics for BADASS optimization of alpha-amylase (AMY_BACSU). by Carlos A. Gomez-Uribe (21492788)

Bayesian sequential design for sensitivity experiments with hybrid responses by Yuxia Liu (1779592)

“…To deal with the problem of complex computation involved in searching for optimal designs, fast algorithms are presented using two strategies to approximate the optimal criterion, denoted as SI-optimal design and Bayesian D-optimal design, respectively. …”

Effective region sampling strategy. by Yu Gu (162342)

“…<div><p>Aiming at the problems of blind sampling points and slow planning speed of path planning Rapidly-exploring Random Trees algorithm, an effective region sampling Levy Rapidly-exploring Random Trees algorithm (LRRT*) is proposed based on the improved Levy flight strategy. …”

Probability graphical model of scMSI. by Yuqian Liu (1413763)

Flow diagram of the reachable workspace. by Zesheng Wang (15244172)

“…A sensitivity analysis is performed using the finite difference method to screen for and eliminate error sources with a negligible impact on the moving platform’s pose. Measurement points are then selected uniformly throughout the workspace using the farthest point sampling algorithm. …”

Size parameters of the 5PUS-RPUR parallel robot. by Zesheng Wang (15244172)

“…A sensitivity analysis is performed using the finite difference method to screen for and eliminate error sources with a negligible impact on the moving platform’s pose. Measurement points are then selected uniformly throughout the workspace using the farthest point sampling algorithm. …”

Structure diagram of branched PUS with errors. by Zesheng Wang (15244172)

“…A sensitivity analysis is performed using the finite difference method to screen for and eliminate error sources with a negligible impact on the moving platform’s pose. Measurement points are then selected uniformly throughout the workspace using the farthest point sampling algorithm. …”

PK subproblem 3. by Zesheng Wang (15244172)

“…A sensitivity analysis is performed using the finite difference method to screen for and eliminate error sources with a negligible impact on the moving platform’s pose. Measurement points are then selected uniformly throughout the workspace using the farthest point sampling algorithm. …”

The two recognized basic PK sub-problems. by Zesheng Wang (15244172)

“…A sensitivity analysis is performed using the finite difference method to screen for and eliminate error sources with a negligible impact on the moving platform’s pose. Measurement points are then selected uniformly throughout the workspace using the farthest point sampling algorithm. …”

Structure diagram of branched RPUR with errors. by Zesheng Wang (15244172)

“…A sensitivity analysis is performed using the finite difference method to screen for and eliminate error sources with a negligible impact on the moving platform’s pose. Measurement points are then selected uniformly throughout the workspace using the farthest point sampling algorithm. …”

5PUS-RPUR parallel robot system. by Zesheng Wang (15244172)

“…A sensitivity analysis is performed using the finite difference method to screen for and eliminate error sources with a negligible impact on the moving platform’s pose. Measurement points are then selected uniformly throughout the workspace using the farthest point sampling algorithm. …”

Overview of our approach. by Carlos A. Gomez-Uribe (21492788)

UR5 robotic arm. by Yu Gu (162342)

“…<div><p>Aiming at the problems of blind sampling points and slow planning speed of path planning Rapidly-exploring Random Trees algorithm, an effective region sampling Levy Rapidly-exploring Random Trees algorithm (LRRT*) is proposed based on the improved Levy flight strategy. …”

Reselect parent node. by Yu Gu (162342)

“…<div><p>Aiming at the problems of blind sampling points and slow planning speed of path planning Rapidly-exploring Random Trees algorithm, an effective region sampling Levy Rapidly-exploring Random Trees algorithm (LRRT*) is proposed based on the improved Levy flight strategy. …”

Ablation experiment. by Yu Gu (162342)

“…<div><p>Aiming at the problems of blind sampling points and slow planning speed of path planning Rapidly-exploring Random Trees algorithm, an effective region sampling Levy Rapidly-exploring Random Trees algorithm (LRRT*) is proposed based on the improved Levy flight strategy. …”

Simulation data of complex obstacle environment. by Yu Gu (162342)

“…<div><p>Aiming at the problems of blind sampling points and slow planning speed of path planning Rapidly-exploring Random Trees algorithm, an effective region sampling Levy Rapidly-exploring Random Trees algorithm (LRRT*) is proposed based on the improved Levy flight strategy. …”

Greedy back path. by Yu Gu (162342)

“…<div><p>Aiming at the problems of blind sampling points and slow planning speed of path planning Rapidly-exploring Random Trees algorithm, an effective region sampling Levy Rapidly-exploring Random Trees algorithm (LRRT*) is proposed based on the improved Levy flight strategy. …”