Category: 7. Maths

Data level and pre-experimental preparation

The dataset used in this paper is the open-source RDD 202,022 dataset, which includes road images from Japan, India, and the Czech Republic. The dataset contains four main types of road damage:…

Fast fourier transform (FFT)

A signal can be transformed from the time domain to the frequency domain using the Fast Fourier Transform (FFT) technique. Its operational principle is rooted in Fourier analysis, which breaks down the Discrete Fourier…

Directional cone and goal-biased sampling mechanism

To optimize the random sampling process in path planning, the Directional Cone and Goal-Biased Sampling Mechanism is employed to effectively control the sampling direction and probability,…

Partial reparameterization convolution block (PRepConvBlock)

The quality, reliability, and fidelity of the dataset were verified through a multi-stage workflow. This process combined hardware and signal-integrity checks, descriptive statistics, low-level feature exploration, and feature-space…

In this section, some numerical examples are given to show the efficiency of the I-GWO algorithm. Three shape optimization models are solved to obtain the optimal shape control parameters which generate the developable surfaces with a higher…

This section provides a detailed description of the datasets utilized to evaluate the proposed method’s performance, specifying the metrics employed to assess its effectiveness and showcasing the results obtained from the implemented approach.

To validate the presented approach, all stages were developed and simulated in MATLAB. This simulation displays the results of an emotion recognition algorithm applied to the speaker’s speech. It also enables the comparison of these results to…

3D jumper models

To conduct aerodynamic simulations, a three-dimensional geometric model of the athlete–ski system during the straight-line descent of the in-run phase was established. The model was constructed using anthropometric data obtained…

In this section, we revisit the work of Herrmann et al.⁷, which focuses on maximizing small root bounds for RSA with a small secret exponent. In their approach, they introduced a novel technique known as the method of unravelled linearization….