[go: up one dir, main page]

 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (633)

Search Parameters:
Keywords = biometric systems

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
27 pages, 11864 KiB  
Article
Circular Pear Production Using Compost Fertilization: Influence on Tree Growth and Nitrogen Leaf Concentration
by Ana Cornelia Butcaru, Cosmin Alexandru Mihai, Andrei Moț, Ruxandra Gogoț, Dorel Hoza and Florin Stănică
Horticulturae 2024, 10(11), 1209; https://doi.org/10.3390/horticulturae10111209 (registering DOI) - 16 Nov 2024
Abstract
The circular economy with compost fertilization is included in the sustainable orchard paradigm, creating a holistic production ecosystem. Modern orchards are mostly intensive and super-intensive, requiring different rootstocks. This research presents the response to compost fertilization of two specific pear rootstocks (quince ‘CTS [...] Read more.
The circular economy with compost fertilization is included in the sustainable orchard paradigm, creating a holistic production ecosystem. Modern orchards are mostly intensive and super-intensive, requiring different rootstocks. This research presents the response to compost fertilization of two specific pear rootstocks (quince ‘CTS 212’ and ‘Farold® 40’) and own-rooted trees, analyzing six resistant cultivars in a circular production system. The dynamic of nitrogen and carbon concentration in leaves, soil respiration coefficient, the evolution of the fruit maturity stage in the field, and some biometric parameters such as trunk cross-section area, the annual vegetative growth, and fruiting shoots annual number were analyzed. The results highlighted that compost fertilization led to increased leaf nitrogen concentration over the first two years while carbon concentration remained relatively stable. Rootstock and compost fertilization influenced the fruit maturity dynamic, but a single pattern was not identified. Quince, as pear rootstock, expressed a higher sensitivity to compost application; the biometric parameters, such as trunk cross-section area, and almost all cultivars’ annual vegetative growth were higher than the controls’. Positive output can lead to future model upscaling in farms and households. Full article
(This article belongs to the Special Issue Rethinking Horticulture to Meet Sustainable Development Goals)
Show Figures

Figure 1

Figure 1
<p>Romanian disease-resistant pear cultivars.</p>
Full article ">Figure 2
<p>The experimental design for the compost fertilization study.</p>
Full article ">Figure 3
<p>Total N concentration (%) dynamic for ‘Tudor’ pear cultivar fertilized with compost (a,b—significance letters, Tukey post-hoc test, <span class="html-italic">p</span> &lt; 0.5).</p>
Full article ">Figure 4
<p>Total N concentration (%) dynamic for ‘Corina’ pear cultivar fertilized with compost (a,b—significance letters, Tukey post-hoc test, <span class="html-italic">p</span> &lt; 0.5).</p>
Full article ">Figure 5
<p>Total N concentration (%) dynamic for the ‘Cristal’ pear cultivar fertilized with compost (a,b—significance letters, Tukey post-hoc test, <span class="html-italic">p</span> &lt; 0.5).</p>
Full article ">Figure 6
<p>Total N concentration (%) dynamic for ‘Orizont’ pear cultivar fertilized with compost (a,b—significance letters, Tukey post-hoc test, <span class="html-italic">p</span> &lt; 0.5).</p>
Full article ">Figure 7
<p>Total N concentration (%) dynamic for ‘Romcor’ pear cultivar fertilized with compost (a,b—significance letters, Tukey post-hoc test, <span class="html-italic">p</span> &lt; 0.5).</p>
Full article ">Figure 8
<p>Total N concentration (%) dynamic for ‘Euras’ pear cultivar fertilized with compost (a,b—significance letters, Tukey post-hoc test, <span class="html-italic">p</span> &lt; 0.5).</p>
Full article ">Figure 9
<p>Comparison between pear cultivars on Quince rootstock: total N concentration (%) dynamic (a,b—significance letters, Tukey post-hoc test, <span class="html-italic">p</span> &lt; 0.5).</p>
Full article ">Figure 10
<p>Comparison between pear cultivars on their own roots: total N concentration (%) dynamic (a,b—significance letters, Tukey post-hoc test, <span class="html-italic">p</span> &lt; 0.5).</p>
Full article ">Figure 11
<p>Comparison between pear cultivars on Franc rootstock: total N concentration (%) dynamic (a,b—significance letters, Tukey post-hoc test, <span class="html-italic">p</span> &lt; 0.5).</p>
Full article ">Figure 12
<p>Comparison between pear cultivars on Quince rootstock: total C concentration (%) dynamic (a,b—significance letters, Tukey post-hoc test, <span class="html-italic">p</span> &lt; 0.5).</p>
Full article ">Figure 13
<p>Comparison between pear cultivars on own-rooted: total C concentration (%) dynamic (a,b—significance letters, Tukey post-hoc test, <span class="html-italic">p</span> &lt; 0.5).</p>
Full article ">Figure 14
<p>Comparison between pear cultivars on Franc rootstock: total C concentration (%) dynamic (a,b—significance letters, Tukey post-hoc test, <span class="html-italic">p</span> &lt; 0.5).</p>
Full article ">Figure 15
<p>The influence of the fertilization scheme on the soil respiration coefficient (µmol m<sup>−2</sup> s<sup>−1</sup>).</p>
Full article ">Figure 16
<p>Heatmap of average IAD in pear fruits correlated by Cultivar × Rootstock × Fertilization.</p>
Full article ">Figure 17
<p>Dynamics of IAD for ‘Tudor’ pear cultivar by Rootstock × Fertilization.</p>
Full article ">Figure 18
<p>Dynamics of IAD for ‘Cristal’ pear cultivar by Rootstock × Fertilization.</p>
Full article ">Figure 19
<p>Dynamics of IAD for ‘Corina’ pear cultivar by Rootstock × Fertilization.</p>
Full article ">Figure 20
<p>Dynamics of IAD for ‘Orizont’ pear cultivar by Rootstock × Fertilization.</p>
Full article ">Figure 21
<p>Dynamics of IAD for ‘Romcor’ pear cultivar by Rootstock × Fertilization.</p>
Full article ">Figure 22
<p>Dynamics of IAD for ‘Euras’ pear cultivar by Rootstock × Fertilization.</p>
Full article ">Figure 23
<p>TCSA growth rate (2023–2022) comparison by Cultivar × Rootstock × Fertilization.</p>
Full article ">Figure 24
<p>Total annual vegetative growth rate (2023–2022) comparison by Cultivar × Rootstock × Fertilization.</p>
Full article ">Figure 25
<p>Total rate (2023–2022) comparison by Cultivar × Rootstock × Fertilization for annual fruiting shoots.</p>
Full article ">
14 pages, 1028 KiB  
Article
Person Identification Using Temporal Analysis of Facial Blood Flow
by Maria Raia, Thomas Stogiannopoulos, Nikolaos Mitianoudis and Nikolaos V. Boulgouris
Electronics 2024, 13(22), 4499; https://doi.org/10.3390/electronics13224499 - 15 Nov 2024
Viewed by 249
Abstract
Biometrics play an important role in modern access control and security systems. The need of novel biometrics to complement traditional biometrics has been at the forefront of research. The Facial Blood Flow (FBF) biometric trait, recently proposed by our team, is a spatio-temporal [...] Read more.
Biometrics play an important role in modern access control and security systems. The need of novel biometrics to complement traditional biometrics has been at the forefront of research. The Facial Blood Flow (FBF) biometric trait, recently proposed by our team, is a spatio-temporal representation of facial blood flow, constructed using motion magnification from facial areas where skin is visible. Due to its design and construction, the FBF does not need information from the eyes, nose, or mouth, and, therefore, it yields a versatile biometric of great potential. In this work, we evaluate the effectiveness of novel temporal partitioning and Fast Fourier Transform-based features that capture the temporal evolution of facial blood flow. These new features, along with a “time-distributed” Convolutional Neural Network-based deep learning architecture, are experimentally shown to increase the performance of FBF-based person identification compared to our previous efforts. This study provides further evidence of FBF’s potential for use in biometric identification. Full article
Show Figures

Figure 1

Figure 1
<p>The proposed person identification system based on facial blood flow (FBF).</p>
Full article ">Figure 2
<p>(<b>a</b>) Original face image. (<b>b</b>) Face detection using [<a href="#B32-electronics-13-04499" class="html-bibr">32</a>]. (<b>c</b>) Active Appearance Model (AAM) fit using [<a href="#B34-electronics-13-04499" class="html-bibr">34</a>]. The three control points (two from the AAM and another inferred from the other two) are highlighted. (<b>d</b>) Detection of the forehead region using two control points. (<b>e</b>,<b>f</b>) Detection of the left and right facial regions using the left and right control points, respectively. (The subject in this figure has agreed to have his image included in the paper for demonstration purposes).</p>
Full article ">Figure 3
<p>Snapshots from the three extracted areas for the subject in <a href="#electronics-13-04499-f002" class="html-fig">Figure 2</a>. It is clear that these areas do not contain any traditional facial biometric traits.</p>
Full article ">Figure 4
<p>Division of a video clip into five sub-clips. Temporal averages are calculated for each sub-clip.</p>
Full article ">Figure 5
<p>Temporal features for the FBF biometric extracted from the forehead region. The averaged image template [<a href="#B26-electronics-13-04499" class="html-bibr">26</a>] is shown for for subject A and B. Lighter colors represent greater values while darker colors represent smaller values (best seen in color).</p>
Full article ">Figure 6
<p>Temporal features for the FBF biometric extracted from the forehead region. The proposed temporal averages of (<a href="#FD1-electronics-13-04499" class="html-disp-formula">1</a>) is shown for subject A and B. Lighter colors represent greater values while darker colors represent smaller values (best seen in color).</p>
Full article ">Figure 7
<p>Frequency-domain features for the FBF biometric extracted from the forehead region of subject A. (<b>a</b>) DCT features, (<b>b</b>) FFT features calculated using (<a href="#FD3-electronics-13-04499" class="html-disp-formula">3</a>).</p>
Full article ">Figure 8
<p>The proposed CNN structure with ‘time’-distributed 2D convolutions used in the convolutional layers of the network. Conv2D refers to a “time-distributed” 2D convolutional layer, ReLU and Softmax refer to the corresponding activation functions, Dropout refers to Dropout regularization [<a href="#B40-electronics-13-04499" class="html-bibr">40</a>], BN refers to Batch Normalization. The numbers of filters and the sizes of the filters are indicated at the top of the respective level.</p>
Full article ">Figure 9
<p>Two ensemble methods to combine the features from the three facial regions of interest. Pipeline refers to the architecture of <a href="#electronics-13-04499-f008" class="html-fig">Figure 8</a> without the fully connected (Dense) layers.</p>
Full article ">Figure 10
<p>The evolution of the loss function and accuracy over 30 epochs for the proposed “time-distributed” VGG network with the FFT features and the Ensemble 2 strategy.</p>
Full article ">Figure 11
<p>The confusion matrix for the proposed “time-distributed” VGG network with the FFT features and the Ensemble 2 strategy.</p>
Full article ">
22 pages, 2149 KiB  
Article
Robust Biometric Verification Using Phonocardiogram Fingerprinting and a Multilayer-Perceptron-Based Classifier
by Roberta Avanzato, Francesco Beritelli and Salvatore Serrano
Electronics 2024, 13(22), 4377; https://doi.org/10.3390/electronics13224377 - 8 Nov 2024
Viewed by 386
Abstract
Recently, a new set of biometric traits, called medical biometrics, have been explored for human identity verification. This study introduces a novel framework for recognizing human identity through heart sound signals, commonly referred to as phonocardiograms (PCGs). The framework is built on extracting [...] Read more.
Recently, a new set of biometric traits, called medical biometrics, have been explored for human identity verification. This study introduces a novel framework for recognizing human identity through heart sound signals, commonly referred to as phonocardiograms (PCGs). The framework is built on extracting and suitably processing Mel-Frequency Cepstral Coefficients (MFCCs) from PCGs and on a classifier based on a Multilayer Perceptron (MLP) network. A large dataset containing heart sounds acquired from 206 people has been used to perform the experiments. The classifier was tuned to obtain the same false positive and false negative misclassification rates (equal error rate: EER = FPR = FNR) on chunks of audio lasting 2 s. This target has been reached, splitting the dataset into 70% and 30% training and testing non-overlapped subsets, respectively. A recurrence filter has been applied to also improve the performance of the system in the presence of noisy recordings. After the application of the filter on chunks of audio signal lasting from 2 to 22 s, the performance of the system has been evaluated in terms of recall, specificity, precision, negative predictive value, accuracy, and F1-score. All the performance metrics are higher than 97.86% with the recurrence filter applied on a window lasting 22 s and in different noise conditions. Full article
Show Figures

Figure 1

Figure 1
<p>Block diagram of biometric authentication modes: (<b>a</b>) identification mode; (<b>b</b>) verification mode.</p>
Full article ">Figure 2
<p>Examples of PCG recordings for 2 subjects: (<b>a</b>) 1st PCG recording of a female subject <math display="inline"><semantics> <msub> <mi>F</mi> <mrow> <mi>x</mi> <mo>,</mo> <mn>1</mn> </mrow> </msub> </semantics></math>, (<b>b</b>) 2nd PCG recording of a female subject <math display="inline"><semantics> <msub> <mi>F</mi> <mrow> <mi>x</mi> <mo>,</mo> <mn>2</mn> </mrow> </msub> </semantics></math>, (<b>c</b>) 1st PCG recording of a male subject <math display="inline"><semantics> <msub> <mi>M</mi> <mrow> <mi>y</mi> <mo>,</mo> <mn>1</mn> </mrow> </msub> </semantics></math>, and (<b>d</b>) 2nd PCG recording of a male subject <math display="inline"><semantics> <msub> <mi>M</mi> <mrow> <mi>y</mi> <mo>,</mo> <mn>2</mn> </mrow> </msub> </semantics></math>.</p>
Full article ">Figure 2 Cont.
<p>Examples of PCG recordings for 2 subjects: (<b>a</b>) 1st PCG recording of a female subject <math display="inline"><semantics> <msub> <mi>F</mi> <mrow> <mi>x</mi> <mo>,</mo> <mn>1</mn> </mrow> </msub> </semantics></math>, (<b>b</b>) 2nd PCG recording of a female subject <math display="inline"><semantics> <msub> <mi>F</mi> <mrow> <mi>x</mi> <mo>,</mo> <mn>2</mn> </mrow> </msub> </semantics></math>, (<b>c</b>) 1st PCG recording of a male subject <math display="inline"><semantics> <msub> <mi>M</mi> <mrow> <mi>y</mi> <mo>,</mo> <mn>1</mn> </mrow> </msub> </semantics></math>, and (<b>d</b>) 2nd PCG recording of a male subject <math display="inline"><semantics> <msub> <mi>M</mi> <mrow> <mi>y</mi> <mo>,</mo> <mn>2</mn> </mrow> </msub> </semantics></math>.</p>
Full article ">Figure 3
<p>Details (extracted at t = 20 s and lasting 2 s) of PCG recordings for 2 subjects: (<b>a</b>) 1st PCG recording of a female subject <math display="inline"><semantics> <msub> <mi>F</mi> <mrow> <mi>x</mi> <mo>,</mo> <mn>1</mn> </mrow> </msub> </semantics></math>, (<b>b</b>) 2nd PCG recording of a female subject <math display="inline"><semantics> <msub> <mi>F</mi> <mrow> <mi>x</mi> <mo>,</mo> <mn>2</mn> </mrow> </msub> </semantics></math>, (<b>c</b>) 1st PCG recording of a male subject <math display="inline"><semantics> <msub> <mi>M</mi> <mrow> <mi>y</mi> <mo>,</mo> <mn>1</mn> </mrow> </msub> </semantics></math>, and (<b>d</b>) 2nd PCG recording of a male subject <math display="inline"><semantics> <msub> <mi>M</mi> <mrow> <mi>y</mi> <mo>,</mo> <mn>2</mn> </mrow> </msub> </semantics></math>.</p>
Full article ">Figure 4
<p>Mel-frequency spectrograms and image representation of the related averaged vector <math display="inline"><semantics> <mover accent="true"> <mi>c</mi> <mo>→</mo> </mover> </semantics></math> evaluated for (<b>a</b>) 1st PCG chunk for female subject <math display="inline"><semantics> <msub> <mi>F</mi> <mi>x</mi> </msub> </semantics></math>, (<b>b</b>) 2nd PCG chunk for female subject <math display="inline"><semantics> <msub> <mi>F</mi> <mi>x</mi> </msub> </semantics></math>, (<b>c</b>) 1st PCG chunk for male subject <math display="inline"><semantics> <msub> <mi>M</mi> <mi>y</mi> </msub> </semantics></math>, and (<b>d</b>) 2nd PCG chunk for male subject <math display="inline"><semantics> <msub> <mi>M</mi> <mi>y</mi> </msub> </semantics></math>.</p>
Full article ">Figure 5
<p>Architecture of MLP binary classifier implemented to perform human identity verification by means of PCG features extracted from a segment of audio recording lasting 2 s; the output <math display="inline"><semantics> <mrow> <mi>y</mi> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </semantics></math> is true for identity verified, false for identity not verified.</p>
Full article ">Figure 6
<p>Architecture of the recurrence filter.</p>
Full article ">Figure 7
<p>Example of chunk affected by noises (2nd PCG recording of a female subject <math display="inline"><semantics> <msub> <mi>F</mi> <mrow> <mi>x</mi> <mo>,</mo> <mn>2</mn> </mrow> </msub> </semantics></math>): (<b>a</b>) signal plus office noise, SNR = 15 dB (in red), (<b>b</b>) signal plus babble noise, SNR = 20 dB (in red), (<b>c</b>) signal plus babble noise, SNR = 30 dB (in red), (<b>d</b>) Mel spectrogram and features for chunk in (<b>a</b>), (<b>e</b>) Mel spectrogram and features for chunk in (<b>b</b>), and (<b>f</b>) Mel spectrogram and features for chunk in (<b>c</b>).</p>
Full article ">Figure 8
<p>Output of the loss function during the training phase for each epoch.</p>
Full article ">Figure 9
<p>ROC curve for HSCT-11 database without application of the “recurrence filter”.</p>
Full article ">Figure 10
<p>DET curve for HSCT-11 database without application of the “recurrence filter”. Red dashed line corresponds to the EER.</p>
Full article ">Figure 11
<p>Confusion matrices varying “recurrence filter” length obtained with the testing set portion of the system database: (<b>a</b>) <math display="inline"><semantics> <mrow> <mi>L</mi> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>: no filtering, response time 2 s; (<b>b</b>) <math display="inline"><semantics> <mrow> <mi>L</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>: response time 6 s; (<b>c</b>) <math display="inline"><semantics> <mrow> <mi>L</mi> <mo>=</mo> <mn>4</mn> </mrow> </semantics></math>: response time 10 s; (<b>d</b>) <math display="inline"><semantics> <mrow> <mi>L</mi> <mo>=</mo> <mn>6</mn> </mrow> </semantics></math>: response time 14 s.</p>
Full article ">Figure 12
<p>Performance indexes varying “recurrence filter” length (response time) for the four datasets: (<b>a</b>) recall, (<b>b</b>) specificity, (<b>c</b>) precision, (<b>d</b>) negative predictive value, (<b>e</b>) accuracy, and (<b>f</b>) F1-score.</p>
Full article ">
21 pages, 5596 KiB  
Article
EEG Data Augmentation Method for Identity Recognition Based on Spatial–Temporal Generating Adversarial Network
by Yudie Hu, Lei Sun, Xiuqing Mao and Shuai Zhang
Electronics 2024, 13(21), 4310; https://doi.org/10.3390/electronics13214310 - 2 Nov 2024
Viewed by 506
Abstract
Traditional identity recognition methods are facing significant security challenges due to their vulnerability to leakage and forgery. Brainprint recognition, a novel biometric identification technology leveraging EEG signals, has emerged as a promising alternative owing to its advantages such as resistance to coercion, non-forgeability, [...] Read more.
Traditional identity recognition methods are facing significant security challenges due to their vulnerability to leakage and forgery. Brainprint recognition, a novel biometric identification technology leveraging EEG signals, has emerged as a promising alternative owing to its advantages such as resistance to coercion, non-forgeability, and revocability. Nevertheless, the scarcity of high-quality electroencephalogram (EEG) data limits the performance of brainprint recognition systems, necessitating the use of shallow models that may not perform optimally in real-world scenarios. Data augmentation has been demonstrated as an effective solution to address this issue. However, EEG data encompass diverse features, including temporal, frequency, and spatial components, posing a crucial challenge in preserving these features during augmentation. This paper proposes an end-to-end EEG data augmentation method based on a spatial–temporal generative adversarial network (STGAN) framework. Within the discriminator, a temporal feature encoder and a spatial feature encoder were parallelly devised. These encoders effectively captured global dependencies across channels and time of EEG data, respectively, leveraging a self-attention mechanism. This approach enhances the data generation capabilities of the GAN, thereby improving the quality and diversity of the augmented EEG data. The identity recognition experiments were conducted on the BCI-IV2A dataset, and Fréchet inception distance (FID) was employed to evaluate data quality. The proposed method was validated across three deep learning models: EEGNET, ShallowConvNet, and DeepConvNet. Experimental results indicated that data generated by STGAN outperform DCGAN and RGAN in terms of data quality, and the identity recognition accuracies on the three networks were improved by 2.49%, 2.59% and 1.14%, respectively. Full article
(This article belongs to the Section Artificial Intelligence)
Show Figures

Figure 1

Figure 1
<p>WGAN-GP architecture.</p>
Full article ">Figure 2
<p>(<b>a</b>) Multi-head attention; (<b>b</b>) scaled dot-product attention.</p>
Full article ">Figure 3
<p>STGAN architecture.</p>
Full article ">Figure 4
<p>EEG electrode montage.</p>
Full article ">Figure 5
<p>(<b>a</b>) Original data of individual 3 and data generated by DCGAN; (<b>b</b>) original data of individual 3 and data generated by RGAN; (<b>c</b>) original data of individual 3 and data generated by STGAN.</p>
Full article ">Figure 6
<p>(<b>a</b>) Original data of individual 7 and data generated by DCGAN; (<b>b</b>) original data of individual 7 and data generated by RGAN; (<b>c</b>) original data of individual 7 and data generated by STGAN.</p>
Full article ">Figure 7
<p>Individual recognition accuracy of EEGNET.</p>
Full article ">Figure 8
<p>Individual recognition accuracy of ShallowConvNet.</p>
Full article ">Figure 9
<p>Individual recognition accuracy of DeepConvNet.</p>
Full article ">
25 pages, 1766 KiB  
Article
Automatic Scheduling Method for Customs Inspection Vehicle Relocation Based on Automotive Electronic Identification and Biometric Recognition
by Shengpei Zhou, Nanfeng Zhang, Qin Duan, Jinchao Xiao and Jingfeng Yang
Algorithms 2024, 17(11), 483; https://doi.org/10.3390/a17110483 - 28 Oct 2024
Viewed by 452
Abstract
This study presents an innovative automatic scheduling method for the relocation of customs inspection vehicles, leveraging Vehicle Electronic Identification (EVI) and biometric recognition technologies. With the expansion of global trade, customs authorities face increasing pressure to enhance logistics efficiency. Traditional vehicle scheduling often [...] Read more.
This study presents an innovative automatic scheduling method for the relocation of customs inspection vehicles, leveraging Vehicle Electronic Identification (EVI) and biometric recognition technologies. With the expansion of global trade, customs authorities face increasing pressure to enhance logistics efficiency. Traditional vehicle scheduling often relies on manual processes and simplistic algorithms, resulting in prolonged waiting times and inefficient resource allocation. This research addresses these challenges by integrating EVI and biometric systems into a comprehensive framework aimed at improving vehicle scheduling. The proposed method utilizes genetic algorithms and intelligent optimization techniques to dynamically allocate resources and prioritize vehicle movements based on real-time data. EVI technology facilitates rapid identification of vehicles entering customs facilities, while biometric recognition ensures that only authorized personnel can operate specific vehicles. This dual-layered approach enhances security and streamlines the inspection process, significantly reducing delays. A thorough analysis of the existing literature on customs vehicle scheduling identifies key limitations in current methodologies. The automatic scheduling algorithm is detailed, encompassing vehicle prioritization criteria, dynamic path planning, and real-time driver assignment. The genetic algorithm framework allows for adaptive responses to varying operational conditions. Extensive simulations using real-world data from customs operations validate the effectiveness of the proposed method. Results indicate a significant reduction in vehicle waiting times—up to 30%—and an increase in resource utilization rates by approximately 25%. These findings demonstrate the potential of integrating EVI and biometric technologies to transform customs logistics management. Additionally, a comparison against state-of-the-art scheduling algorithms, such as NSGA-II and MOEA/D, reveals superior efficiency and adaptability. This research not only addresses pressing challenges faced by customs authorities but also contributes to optimizing logistics operations more broadly. In conclusion, the automatic scheduling method presented represents a significant advancement in customs logistics, providing a robust solution for managing complex vehicle scheduling scenarios. Future research directions will focus on refining the algorithm to handle peak traffic periods and exploring predictive analytics for enhanced scheduling optimization. Advancements in the intersection of technology and logistics aim to support more efficient and secure customs operations globally. Full article
(This article belongs to the Section Algorithms for Multidisciplinary Applications)
Show Figures

Figure 1

Figure 1
<p>Global view of the proposed solution.</p>
Full article ">Figure 2
<p>Pareto front solution. (<b>a</b>) Pareto Front Solution between Vehicle Waiting Time and Relocation Path Length; (<b>b</b>) Pareto Front Solution between Balancing Driver Workload and Relocation Path Length; (<b>c</b>) Pareto Front Solution between Resource Utilization Rate and Relocation Path Length; (<b>d</b>) Pareto Front Solution between Resource Utilization Rate, Vehicle Waiting Time, and Relocation Path Length; (<b>e</b>) Pareto Front Solution between Balancing Driver Workload, Vehicle Waiting Time, and Relocation Path Length; (<b>f</b>) Pareto Front Solution between Balancing Driver Workload, Vehicle Waiting Time, and Resource Utilization Rate.</p>
Full article ">Figure 3
<p>Convergence curve of algorithm proposed.</p>
Full article ">Figure 4
<p>(<b>a</b>) Convergence curve of objective Function 1. (<b>b</b>) Convergence curve of objective Function 2. (<b>c</b>) Convergence curve of objective Function 3. (<b>d</b>) Convergence curve of objective Function 4. (<b>e</b>) Convergence curve of objective Function 5. (<b>f</b>) Convergence curve of objective Function 6. (<b>g</b>) Convergence curve of objective Function 7. (<b>h</b>) Convergence curve of objective Function 8.</p>
Full article ">Figure 5
<p>(<b>a</b>) Runtime curve. (<b>b</b>) Memory usage curve.</p>
Full article ">
21 pages, 3768 KiB  
Article
A Lightweight GCT-EEGNet for EEG-Based Individual Recognition Under Diverse Brain Conditions
by Laila Alshehri and Muhammad Hussain
Mathematics 2024, 12(20), 3286; https://doi.org/10.3390/math12203286 - 20 Oct 2024
Viewed by 609
Abstract
A robust biometric system is essential to mitigate various security threats. Electroencephalography (EEG) brain signals present a promising alternative to other biometric traits due to their sensitivity, non-duplicability, resistance to theft, and individual-specific dynamics. However, existing EEG-based biometric systems employ deep neural networks, [...] Read more.
A robust biometric system is essential to mitigate various security threats. Electroencephalography (EEG) brain signals present a promising alternative to other biometric traits due to their sensitivity, non-duplicability, resistance to theft, and individual-specific dynamics. However, existing EEG-based biometric systems employ deep neural networks, such as convolutional neural networks (CNNs) and recurrent neural networks (RNNs), which face challenges such as high parameter complexity, limiting their practical application. Additionally, their ability to generalize across a large number of subjects remains unclear. Moreover, they have been validated on datasets collected in controlled environments, which do not accurately reflect real-world scenarios involving diverse brain conditions. To overcome these challenges, we propose a lightweight neural network model, GCT–EEGNet, which is based on the design ideas of a CNN model and incorporates an attention mechanism to pay attention to the appropriate frequency bands for extracting discriminative features relevant to the identity of a subject despite diverse brain conditions. First, a raw EEG signal is decomposed into frequency bands and then passed to GCT–EEGNet for feature extraction, which utilizes a gated channel transformation (GCT) layer to selectively emphasize informative features from the relevant frequency bands. The extracted features were used for subject recognition through a cosine similarity metric that measured the similarity between feature vectors of different EEG trials to identify individuals. The proposed method was evaluated on a large dataset comprising 263 subjects. The experimental results demonstrated that the method achieved a correct recognition rate (CRR) of 99.23% and an equal error rate (EER) of 0.0014, corroborating its robustness against different brain conditions. The proposed model maintains low parameter complexity while keeping the expressiveness of representations, even with unseen subjects. Full article
Show Figures

Figure 1

Figure 1
<p>The architecture of the attention-based EEGNet model (GCT–EEGNet), where <span class="html-italic">B</span> is the number of frequency bands, <span class="html-italic">T</span> is the time points, <span class="html-italic">C</span> is the number of channels of the EEG signal, α, <span class="html-italic">β, γ, θ,</span> and <span class="html-italic">δ</span> are the alpha, beta, gamma, theta, and delta frequency bands, respectively. The <span class="html-italic">TConv, CConv, BN,</span> and <span class="html-italic">GAP</span> represent temporal and channel convolutions, batch normalization, and global average pooling layers, respectively, and <span class="html-italic">v</span> is the learned feature vector and <span class="html-italic">l</span> is the subject label.</p>
Full article ">Figure 2
<p>Gate channel transformation (GCT) module, where <span class="html-italic">B</span> is the number of frequency bands, <span class="html-italic">T</span> is the time points, <span class="html-italic">C</span> is the number of channels of the EEG signal, α, <span class="html-italic">β, γ, θ,</span> and <span class="html-italic">δ</span> are the alpha, beta, gamma, theta, and delta frequency bands, respectively. <math display="inline"><semantics> <mrow> <mi>η</mi> </mrow> </semantics></math> denotes the trainable embedding weights, <span class="html-italic">W</span> represents the global context information, <math display="inline"><semantics> <mrow> <mi>λ</mi> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>ω</mi> </mrow> </semantics></math> represent the gating weights and biases, and <math display="inline"><semantics> <mrow> <mi>κ</mi> </mrow> </semantics></math> is the output of tanh function. Different colors in the output a<sup>(1)</sup> indicate the varying significance assigned to each band.</p>
Full article ">Figure 3
<p>Channel positions of all 64 electrodes (channels) using a 10–20 system where the highlighted channels were used in experiments [<a href="#B24-mathematics-12-03286" class="html-bibr">24</a>].</p>
Full article ">Figure 4
<p>Performance in identification: CMC curves for the combined dataset.</p>
Full article ">Figure 5
<p>Performance in verification: DET curves for the combined dataset.</p>
Full article ">Figure 6
<p>The effect of frequency bands on the combined dataset. (<b>a</b>) The GCT attention mechanism weights. (<b>b</b>) The respective mean SHAP values.</p>
Full article ">Figure 7
<p>Five different channel configurations, each highlighting different regions of the scalp: (<b>a</b>) frontal (F), (<b>b</b>) central and parietal (CP), (<b>c</b>) temporal (T), (<b>d</b>) occipital and parietal (OP), (<b>e</b>) frontal and parietal (FP).</p>
Full article ">Figure 8
<p>Performance of the proposed method among five different sets of channels. (<b>a</b>) All frequency bands, (<b>b</b>) gamma band, where CRR (5) denotes the performance of the five distinct channel sets, while CRR (5)–CRR (32) indicate the performance differences among the five channel subsets and the 32 channels.</p>
Full article ">Figure 9
<p>The t-SNE visualization for high-dimensional features of the GAP layer.</p>
Full article ">
22 pages, 2551 KiB  
Review
A Performance Benchmark for the PostgreSQL and MySQL Databases
by Sanket Vilas Salunke and Abdelkader Ouda
Future Internet 2024, 16(10), 382; https://doi.org/10.3390/fi16100382 - 19 Oct 2024
Viewed by 590
Abstract
This study highlights the necessity for efficient database management in continuous authentication systems, which rely on large-scale behavioral biometric data such as keystroke patterns. A benchmarking framework was developed to evaluate the PostgreSQL and MySQL databases, minimizing repetitive coding through configurable functions and [...] Read more.
This study highlights the necessity for efficient database management in continuous authentication systems, which rely on large-scale behavioral biometric data such as keystroke patterns. A benchmarking framework was developed to evaluate the PostgreSQL and MySQL databases, minimizing repetitive coding through configurable functions and variables. The methodology involved experiments assessing select and insert queries under primary and complex conditions, simulating real-world scenarios. Our quantified results show PostgreSQL’s superior performance in select operations. In primary tests, PostgreSQL’s execution time for 1 million records ranged from 0.6 ms to 0.8 ms, while MySQL’s ranged from 9 ms to 12 ms, indicating that PostgreSQL is about 13 times faster. For select queries with a where clause, PostgreSQL required 0.09 ms to 0.13 ms compared to MySQL’s 0.9 ms to 1 ms, making it roughly 9 times more efficient. Insert operations were similar, with PostgreSQL at 0.0007 ms to 0.0014 ms and MySQL at 0.0010 ms to 0.0030 ms. In complex experiments with simultaneous operations, PostgreSQL maintained stable performance (0.7 ms to 0.9 ms for select queries during inserts), while MySQL’s performance degraded significantly (7 ms to 13 ms). These findings underscore PostgreSQL’s suitability for environments requiring low data latency and robust concurrent processing capabilities, making it ideal for continuous authentication systems. Full article
(This article belongs to the Special Issue Distributed Storage of Large Knowledge Graphs with Mobility Data)
Show Figures

Figure 1

Figure 1
<p>Continuous authentication architecture.</p>
Full article ">Figure 2
<p>Benchmarking framework block diagram.</p>
Full article ">Figure 3
<p>Configuration file variables.</p>
Full article ">Figure 4
<p>Database benchmarking activity diagram.</p>
Full article ">Figure 5
<p>Select query execution time of MySQL for primary experiment one.</p>
Full article ">Figure 6
<p>Select query execution time of PostgreSQL for primary experiment one.</p>
Full article ">Figure 7
<p>Select query comparison of MySQL and PostgreSQL for primary experiment one.</p>
Full article ">Figure 8
<p>Select operation with where condition query execution time of MySQL for primary experiment two.</p>
Full article ">Figure 9
<p>Select operation with where condition query execution time of PostgreSQL for primary experiment two.</p>
Full article ">Figure 10
<p>Select operation with where condition query comparison of MySQL and PostgreSQL for primary experiment two.</p>
Full article ">Figure 11
<p>Insert query execution time of MySQL for primary experiment three.</p>
Full article ">Figure 12
<p>Insert query execution time of PostgreSQL for primary experiment three.</p>
Full article ">Figure 13
<p>Insert query comparison of MySQL and PostgreSQL for primary experiment three.</p>
Full article ">Figure 14
<p>Select query execution time of MySQL with insert operation in parallel.</p>
Full article ">Figure 15
<p>Select query execution time of PostgreSQL with insert operation in parallel.</p>
Full article ">Figure 16
<p>Select query comparison of MySQL and PostgreSQL with insert operation in parallel.</p>
Full article ">Figure 17
<p>Select operation with where query execution time of MySQL with insert operation in parallel.</p>
Full article ">Figure 18
<p>Select operation with where query execution time of PostgreSQL with insert operation in parallel.</p>
Full article ">Figure 19
<p>Select operation with where query comparison of MySQL and PostgreSQL with insert operation in parallel.</p>
Full article ">Figure 20
<p>Insert query execution time of MySQL with select operation in parallel.</p>
Full article ">Figure 21
<p>Insert query execution time of PostgreSQL with select operation in parallel.</p>
Full article ">Figure 22
<p>Insert query comparison of MySQL and PostgreSQL with select operation in parallel.</p>
Full article ">
16 pages, 567 KiB  
Article
ACGAN for Addressing the Security Challenges in IoT-Based Healthcare System
by Babu Kaji Baniya
Sensors 2024, 24(20), 6601; https://doi.org/10.3390/s24206601 - 13 Oct 2024
Viewed by 1161
Abstract
The continuous evolution of the IoT paradigm has been extensively applied across various application domains, including air traffic control, education, healthcare, agriculture, transportation, smart home appliances, and others. Our primary focus revolves around exploring the applications of IoT, particularly within healthcare, where it [...] Read more.
The continuous evolution of the IoT paradigm has been extensively applied across various application domains, including air traffic control, education, healthcare, agriculture, transportation, smart home appliances, and others. Our primary focus revolves around exploring the applications of IoT, particularly within healthcare, where it assumes a pivotal role in facilitating secure and real-time remote patient-monitoring systems. This innovation aims to enhance the quality of service and ultimately improve people’s lives. A key component in this ecosystem is the Healthcare Monitoring System (HMS), a technology-based framework designed to continuously monitor and manage patient and healthcare provider data in real time. This system integrates various components, such as software, medical devices, and processes, aimed at improvi1g patient care and supporting healthcare providers in making well-informed decisions. This fosters proactive healthcare management and enables timely interventions when needed. However, data transmission in these systems poses significant security threats during the transfer process, as malicious actors may attempt to breach security protocols.This jeopardizes the integrity of the Internet of Medical Things (IoMT) and ultimately endangers patient safety. Two feature sets—biometric and network flow metric—have been incorporated to enhance detection in healthcare systems. Another major challenge lies in the scarcity of publicly available balanced datasets for analyzing diverse IoMT attack patterns. To address this, the Auxiliary Classifier Generative Adversarial Network (ACGAN) was employed to generate synthetic samples that resemble minority class samples. ACGAN operates with two objectives: the discriminator differentiates between real and synthetic samples while also predicting the correct class labels. This dual functionality ensures that the discriminator learns detailed features for both tasks. Meanwhile, the generator produces high-quality samples that are classified as real by the discriminator and correctly labeled by the auxiliary classifier. The performance of this approach, evaluated using the IoMT dataset, consistently outperforms the existing baseline model across key metrics, including accuracy, precision, recall, F1-score, area under curve (AUC), and confusion matrix results. Full article
(This article belongs to the Section Internet of Things)
Show Figures

Figure 1

Figure 1
<p>ACGAN architecture: label (<span class="html-italic">C</span>), noise (<span class="html-italic">Z</span>), real samples (<math display="inline"><semantics> <msub> <mi>X</mi> <mrow> <mi>r</mi> <mi>e</mi> <mi>a</mi> <mi>l</mi> </mrow> </msub> </semantics></math>), generator (<span class="html-italic">G</span>) synthetic samples (<math display="inline"><semantics> <msub> <mi>X</mi> <mrow> <mi>s</mi> <mi>y</mi> <mi>n</mi> <mi>t</mi> <mi>h</mi> <mi>e</mi> <mi>t</mi> <mi>i</mi> <mi>c</mi> </mrow> </msub> </semantics></math>), discriminator (<span class="html-italic">D</span>), and predicated classes: ‘Normal’ and ‘Attack’.</p>
Full article ">Figure 2
<p>The challenges of healthcare monitoring systems.</p>
Full article ">Figure 3
<p>Overview of EHMS: medical sensors, gateway, network (router, switch, attacker, intrusion detection system), and server [<a href="#B1-sensors-24-06601" class="html-bibr">1</a>].</p>
Full article ">Figure 4
<p>ROC curve of ‘Attack’ and ‘Normal’ category of WUSTL-EHMS-2020 dataset).</p>
Full article ">Figure 5
<p>t-SNE visualization of the original attack samples (depicted in light blue) and synthetic samples (depicted in orange) of the EHMS dataset (attack samples).</p>
Full article ">Figure 6
<p>Stack ensemble structure: support vector machine, adaboost, and random forest are base classifiers, and logistic regression is a meta-classifier.</p>
Full article ">Figure 7
<p>Comparison of the classification accuracies of network flow, biometric, and combined features using different classifiers.</p>
Full article ">
18 pages, 4451 KiB  
Article
A Biometric Identification for Multi-Modal Biomedical Signals in Geriatric Care
by Yue Che, Lingyan Du, Guozhi Tang and Shihai Ling
Sensors 2024, 24(20), 6558; https://doi.org/10.3390/s24206558 - 11 Oct 2024
Viewed by 590
Abstract
With the acceleration of global population aging, the elderly have an increasing demand for home care and nursing institutions, and the significance of health prevention and management of the elderly has become increasingly prominent. In this context, we propose a biometric recognition method [...] Read more.
With the acceleration of global population aging, the elderly have an increasing demand for home care and nursing institutions, and the significance of health prevention and management of the elderly has become increasingly prominent. In this context, we propose a biometric recognition method for multi-modal biomedical signals. This article focuses on three key signals that can be picked up by wearable devices: ECG, PPG, and breath (RESP). The RESP signal is introduced into the existing two-mode signal identification for multi-mode identification. Firstly, the features of the signal in the time–frequency domain are extracted. To represent deep features in a low-dimensional feature space and expedite authentication tasks, PCA and LDA are employed for dimensionality reduction. MCCA is used for feature fusion, and SVM is used for identification. The accuracy and performance of the system were evaluated using both public data sets and self-collected data sets, with an accuracy of more than 99.5%. The experimental data fully show that this method significantly improves the accuracy of identity recognition. In the future, combined with the signal monitoring function of wearable devices, it can quickly identify individual elderly people with abnormal conditions, provide safer and more efficient medical services for the elderly, and relieve the pressure on medical resources. Full article
(This article belongs to the Section Biomedical Sensors)
Show Figures

Figure 1

Figure 1
<p>Block diagram of multi-modal identification.</p>
Full article ">Figure 2
<p>Biomedical signal acquisition experiment diagram.</p>
Full article ">Figure 3
<p>Block diagram of signal preprocessing.</p>
Full article ">Figure 4
<p>Comparison of biomedical signals before and after filtering.</p>
Full article ">Figure 5
<p>Energy spectrum diagram of (<b>a</b>) ECG, (<b>b</b>) PPG, and (<b>c</b>) RESP signals.</p>
Full article ">Figure 6
<p>Localized waves of (<b>a</b>) ECG, (<b>b</b>) PPG, and (<b>c</b>) RESP signals. The waveform in the red box in (<b>a</b>) is a complete single-period beat.</p>
Full article ">Figure 7
<p>Complex vectors of (<b>a</b>) ECG, (<b>b</b>) PPG, and (<b>c</b>) RESP signals.</p>
Full article ">Figure 8
<p>Block diagram of feature dimension reduction fusion.</p>
Full article ">Figure 9
<p>Principal component contribution rate and cumulative contribution rate of ECG. (<b>a</b>) shows the contribution rates of the first ten feature principal components for PCA reduction of ECG, and (<b>b</b>) shows the cumulative contribution rates of the first ten feature principal components.</p>
Full article ">Figure 10
<p>Principal component contribution rate and cumulative contribution rate of PPG. (<b>a</b>) shows the contribution rates of the first ten feature principal components for PCA reduction of PPG, and (<b>b</b>) shows the cumulative contribution rates of the first ten feature principal components.</p>
Full article ">Figure 11
<p>Principal component contribution rate and cumulative contribution rate of RESP. (<b>a</b>) shows the contribution rates of the first ten feature principal components for PCA reduction of RESP, and (<b>b</b>) shows the cumulative contribution rates of the first ten feature principal components.</p>
Full article ">Figure 12
<p>LDA performs secondary dimensionality reduction results.</p>
Full article ">Figure 13
<p>Individual identification results.</p>
Full article ">
14 pages, 3352 KiB  
Article
Beyond Empathy: Unveiling the Co-Creation Process of Emotions through a Wearable Device
by Bach Q. Ho, Kei Shibuya and Makiko Yoshida
J. Theor. Appl. Electron. Commer. Res. 2024, 19(4), 2714-2727; https://doi.org/10.3390/jtaer19040130 - 8 Oct 2024
Viewed by 1025
Abstract
Emotions fluctuate during the process of social interaction. Although the co-creation of emotions through organizational behavior has been discussed theoretically in existing research, there is no method to demonstrate how emotions are co-created. Instead, previous studies have paid much attention to empathy, in [...] Read more.
Emotions fluctuate during the process of social interaction. Although the co-creation of emotions through organizational behavior has been discussed theoretically in existing research, there is no method to demonstrate how emotions are co-created. Instead, previous studies have paid much attention to empathy, in which a person’s emotions are contagious. In contrast to self-report, which is a traditional method that can only assess emotions at a single point in time and adapts to empathy, biometric technology has made it possible to analyze emotional fluctuations over time. However, previous studies have focused only on understanding the emotional fluctuations of individuals separately. In the present study, we developed a system to measure the co-creation of emotions using a wearable device. The pulse rate was converted into valence as a positive–negative emotion, and the fluctuations in valence were analyzed by cross-correlation. We demonstrated the feasibility of the proposed system through triangulation by integrating biometrics with observation and self-report. The proposed system was verified to measure the co-creation of pair and group emotions using real-world data beyond laboratory settings. The present study contributes to business administration by proposing a critical concept for measuring the co-creation of emotions based on a constructionist approach. Full article
Show Figures

Figure 1

Figure 1
<p>Core idea of the present study regarding biometrics analysis.</p>
Full article ">Figure 2
<p>Sum of cross-correlation coefficients of the valence of all participants at the first meeting.</p>
Full article ">Figure 3
<p>Sum of cross-correlation coefficients of the valence of all participants at the second meeting.</p>
Full article ">Figure 4
<p>Sum of cross-correlation coefficients of the valence of all participants at the fourth meeting.</p>
Full article ">Figure 5
<p>Individual fluctuations in the valence of Participants 1 and 9 at the third meeting.</p>
Full article ">Figure 6
<p>Cross-correlation coefficients of the pair of Participants 1 and 9 at the third meeting.</p>
Full article ">Figure 7
<p>Sum of cross-correlation coefficients of the valence of all participants at the third meeting.</p>
Full article ">Figure 8
<p>Individual fluctuations in the valence of Participants 2 and 5 at the fourth meeting.</p>
Full article ">Figure 9
<p>Cross-correlation coefficients of the pair of Participants 2 and 5 at the fourth meeting.</p>
Full article ">
25 pages, 649 KiB  
Article
Provably Quantum Secure Three-Party Mutual Authentication and Key Exchange Protocol Based on Modular Learning with Error
by Hyewon Park, Seunghwan Son, Youngho Park and Yohan Park
Electronics 2024, 13(19), 3930; https://doi.org/10.3390/electronics13193930 - 4 Oct 2024
Viewed by 588
Abstract
With the rapid development of quantum computers, post-quantum cryptography (PQC) has become critical technology in the security field. PQC includes cryptographic techniques that are secure against quantum-computer-based attacks, utilizing methods such as code-based, isogeny-based, and lattice-based approaches. Among these, lattice-based cryptography is the [...] Read more.
With the rapid development of quantum computers, post-quantum cryptography (PQC) has become critical technology in the security field. PQC includes cryptographic techniques that are secure against quantum-computer-based attacks, utilizing methods such as code-based, isogeny-based, and lattice-based approaches. Among these, lattice-based cryptography is the most extensively studied due to its ease of implementation and efficiency. As quantum computing advances, the need for secure communication protocols that can withstand quantum computer-based threats becomes increasingly important. Traditional two-party AKE protocols have a significant limitation: the security of the entire system can be compromised if either of the communicating parties behaves maliciously. To overcome this limitation, researchers have proposed three-party AKE protocols, where a third party acts as an arbiter or verifier. However, we found that a recently proposed three-party AKE protocol is vulnerable to quantum-computer-based attacks. To address this issue, we propose a provably quantum secure three-party AKE protocol based on MLWE. The proposed scheme leverages the user’s biometric information and the server’s master key to prevent the exposure of critical parameters. We analyzed the security of the protocol using simulation tools such as the Burrows–Abadi–Needham (BAN) logic, Real-or-Random (RoR) model, and Automated Validation of Internet Security Protocols and Applications (AVISPA). Furthermore, comparative analysis with similar protocols demonstrates that our protocol is efficient and suitable. Full article
Show Figures

Figure 1

Figure 1
<p>AKE phase of Guo et al.’s scheme.</p>
Full article ">Figure 2
<p>Flowchart of the proposed scheme.</p>
Full article ">Figure 3
<p>Registration process of proposed scheme.</p>
Full article ">Figure 4
<p>AKE phase of proposed scheme.</p>
Full article ">Figure 5
<p>Analysis of AVISPA simulation using OFMC and CL-AtSe.</p>
Full article ">Figure 6
<p>Computation costs comparison on the user’s side [<a href="#B14-electronics-13-03930" class="html-bibr">14</a>,<a href="#B20-electronics-13-03930" class="html-bibr">20</a>,<a href="#B21-electronics-13-03930" class="html-bibr">21</a>,<a href="#B22-electronics-13-03930" class="html-bibr">22</a>,<a href="#B32-electronics-13-03930" class="html-bibr">32</a>].</p>
Full article ">
58 pages, 52497 KiB  
Article
Hybrid-Blockchain-Based Electronic Voting Machine System Embedded with Deepface, Sharding, and Post-Quantum Techniques
by Sohel Ahmed Joni, Rabiul Rahat, Nishat Tasnin, Partho Ghose, Md. Ashraf Uddin and John Ayoade
Blockchains 2024, 2(4), 366-423; https://doi.org/10.3390/blockchains2040017 - 30 Sep 2024
Viewed by 867
Abstract
The integrity of democratic processes relies on secure and reliable election systems, yet achieving this reliability is challenging. This paper introduces the Post-Quantum Secured Multiparty Computed Hierarchical Authoritative Consensus Blockchain (PQMPCHAC-Bchain), a novel e-voting system designed to overcome the limitations of current Biometric [...] Read more.
The integrity of democratic processes relies on secure and reliable election systems, yet achieving this reliability is challenging. This paper introduces the Post-Quantum Secured Multiparty Computed Hierarchical Authoritative Consensus Blockchain (PQMPCHAC-Bchain), a novel e-voting system designed to overcome the limitations of current Biometric Electronic Voting Machine (EVM) systems, which suffer from trust issues due to closed-source designs, cyber vulnerabilities, and regulatory concerns. Our primary objective is to develop a robust, scalable, and secure e-voting framework that enhances transparency and trust in electoral outcomes. Key contributions include integrating hierarchical authorization and access control with a novel consensus mechanism for proper electoral governance. We implement blockchain sharding techniques to improve scalability and propose a multiparty computed token generation system to prevent fraudulent voting and secure voter privacy. Post-quantum cryptography is incorporated to safeguard against potential quantum computing threats, future-proofing the system. Additionally, we enhance authentication through a deep learning-based face verification model for biometric validation. Our performance analysis indicates that the PQMPCHAC-Bchain e-voting system offers a promising solution for secure elections. By addressing critical aspects of security, scalability, and trust, our proposed system aims to advance the field of electronic voting. This research contributes to ongoing efforts to strengthen the integrity of democratic processes through technological innovation. Full article
(This article belongs to the Special Issue Feature Papers in Blockchains)
Show Figures

Figure 1

Figure 1
<p>This diagram visually explains the Hierarchical Authoritative Consensus algorithm, which combines both public and permitted features of blockchain. It shows the multiple layers of permission and access for each entity in the network, making HAC a hybrid consensus algorithm.</p>
Full article ">Figure 2
<p>Node architecture of the proposed system, featuring three key layers: Application Layer for user interaction and services, Consensus Layer for maintaining node agreement, and Network Layer for managing internode communication.</p>
Full article ">Figure 3
<p>This diagram visually illustrates the proposed election process, highlighting interactions among various participants, system components, and external entities. (<b>a</b>) Participants include voters, polling officers, and returning officers. (<b>b</b>) System components encompass the server, local database, scripting system, and peers on the network. (<b>c</b>) External entities involve the decentralized key management server (KMS), token generation system, and NID server.</p>
Full article ">Figure 4
<p>The overview of the biometric face verification system. From the figure, we can see how the system scans the voter’s face in front of the EVM unit. DeepFace, a facial recognition and facial attribute analysis deep learning model, has been employed to compare the image of the voter with the database image to ensure voter integrity.</p>
Full article ">Figure 5
<p>The diagram visually explains the proposed scripting mechanism. It shows how a scripting panel pushes commands in the script stack and publishes them on blockchain networks. Other nodes retrieve the script from the network to their local machines, verify its authenticity, execute the command, and update the system accordingly.</p>
Full article ">Figure 6
<p>This diagram presents a lucid explanation of the authorization process. It shows how every entity is hashed, signed, and generates a proof of record.</p>
Full article ">Figure 7
<p>A visual representation of the EVM system that displays voter information, which includes names, addresses, and voter ID numbers.</p>
Full article ">Figure 8
<p>Voters present smart NID cards and undergo biometric facial verification for identification, as illustrated in <a href="#blockchains-02-00017-f004" class="html-fig">Figure 4</a>. A unique token is generated as mentioned in <a href="#sec4dot6-blockchains-02-00017" class="html-sec">Section 4.6</a>, which prevents multiple voting. Verified voters cast encrypted votes stored securely on the blockchain, ensuring integrity. Post-voting verification is also available.</p>
Full article ">Figure 9
<p>The diagram illustrates category-based sharding, dividing a blockchain into categories with dedicated shards for data storage. A coordinator manages shards, and a lookup table directs category queries. Intra-shard and cross-shard communication occurs via a peer-to-peer network.</p>
Full article ">Figure 10
<p>The diagram illustrates shard assignment for a specific category and node. The shard reconfigurator and coordinator manage the process, optimizing shard assignments based on network traffic and copy count.</p>
Full article ">Figure 11
<p>The high-level representation of the structure of token-based verification in the system shows how voter information is split and computed into a token, which is then used to verify double voting without revealing the voter’s identity.</p>
Full article ">Figure 12
<p>Data generation process for voter distribution. The bar graph illustrates the hierarchical breakdown of voter counts across different administrative divisions: (<b>A</b>) number of voters per division, (<b>B</b>) number of voters per district, (<b>C</b>) number of voters per union, and (<b>D</b>) number of voters per upazila.</p>
Full article ">Figure 13
<p>Comparison of Block Generation Time (<b>a</b>) and Throughput (<b>b</b>) with and without Block Modularity. (<b>a</b>) The blue line represents block modularity, while the orange line depicts the scenario without it. The horizontal axis shows voter count, and the vertical axis displays time in seconds. Block modularity demonstrates lower block generation times as voter count increases due to efficient data segmentation. (<b>b</b>) The vertical axis represents voter count, and the horizontal axis denotes time in seconds. Block modularity (blue line) shows significantly better throughput compared to the scenario without it (orange line), highlighting enhanced performance.</p>
Full article ">Figure 14
<p>This graph compares Dilithium-2 and Dilithium-3 performances. Here, Figure (<b>a</b>) shows Dilithium-2 without (sky blue) and with (dark red) block modularity, and Figure (<b>b</b>) represents Dilithium-3 without (dark red) and with (purple) block modularity. Also, (<b>c</b>,<b>d</b>) compare both with block modularity—Dilithium-2 (sky blue) and Dilithium-3 (green)—and Dilithium-2 (purple) and Dilithium-3 (green) without block modularity. The horizontal axis depicts voters, while the vertical axis shows time. Dilithium-3 with block modularity generates blocks faster, enhancing performance and security, especially with more voters.</p>
Full article ">Figure 15
<p>This graph compares Dilithium-2 and Dilithium-3 throughput. Here, Figure (<b>a</b>) shows Dilithium-2 without (orange) and with (dark blue) block modularity, and Figure (<b>b</b>) represents Dilithium-3 without (orange) and with (dark blue) block modularity. Also, (<b>c</b>,<b>d</b>) compare both with block modularity— Dilithium-2 (orange) and Dilithium-3 (dark blue)—and Dilithium-2 (orange) and Dilithium-3 (dark blue) without block modularity. The horizontal axis depicts voters, while the vertical axis shows time. Dilithium-3 with block modularity generates blocks faster, enhancing performance and security, especially with more voters.</p>
Full article ">Figure 16
<p>The graph shows the block generation time (<b>a</b>) and throughput (<b>b</b>) for sharding with two, three, and five shards. Sharding with five shards provides the best performance, both in terms of block generation time and throughput. This is because sharding with five shards distributes the workload more evenly across the shards, resulting in less work for each shard and faster block generation.</p>
Full article ">Figure 17
<p>This figure presents a comparative analysis of block generation time and throughput for systems with and without sharding. The line graph (<b>A</b>) illustrates the block generation time, where the blue line represents the system without sharding, and the green line represents the system with sharding, demonstrating a significant reduction in block generation time when sharding is implemented. The bar graph (<b>B</b>) shows the throughput, with the dark green bar representing the system without sharding and the green bar representing the system with sharding. The results indicate that sharding not only reduces block generation time, but also significantly enhances throughput.</p>
Full article ">Figure 18
<p>The bar graph shows the storage consumption with and without sharding for different numbers of blocks. The x-axis represents the number of blocks, and the y-axis represents the total storage consumption in bytes. Sharding significantly reduces storage consumption in blockchain networks, especially for large numbers of blocks.</p>
Full article ">Figure A1
<p>Performance of Dilithium-2 with block modularity (dark red line) vs. without block modularity (sky-blue line). The horizontal axis represents the number of voters, and the vertical axis represents the time. Block modularity improves the performance of Dilithium-2, especially as the number of voters increases.</p>
Full article ">Figure A2
<p>Throughput of Dilithium-2 with block modularity vs. without block modularity. The horizontal axis represents the number of voters, and the vertical axis represents the throughput in transaction per second (tps). Block modularity improves throughput, especially with the high number of voters.</p>
Full article ">Figure A3
<p>Performance of Dilithium-3 with block modularity (violet line) vs. without block modularity (maroon line). The horizontal axis represents the number of voters, and the vertical axis represents the time. Block modularity improves performance, especially with the high number of voters, because it can perform computations in parallel and is more efficient in terms of memory usage.</p>
Full article ">Figure A4
<p>The bar graph shows the throughput of Dilithium-3 with and without block modularity in a blockchain network. The vertical axis represents the number of voters, and the horizontal axis represents time. The bar graph shows that Dilithium-3 with block modularity (sky-blue line) has a higher throughput than Dilithium-3 without block modularity (green line), especially when the number of voters is high. Throughput is measured in blocks per second (bps). This is because block modularity allows Dilithium-3 to process more transactions per second.</p>
Full article ">Figure A5
<p>Comparison block generation time of block modularity and Dilithium-2 with block modularity. The blue line represents block modularity with Dilithium-2, and the green line represents block modularity alone. The number of voters is on the horizontal axis, and the time in seconds to generate a block is on the vertical axis. In conclusion, block modularity shows better performance than Dilithium-2 with block modularity.</p>
Full article ">Figure A6
<p>Block Modularity vs. Dilithium-2 with Block Modularity Throughput. This bar graph compares the throughput of block modularity and Dilithium-2 with block modularity. The x-axis shows the number of voters, and the y-axis shows the time. The blue bars represent block modularity with Dilithium-2, and the green bars represent block modularity alone. Block modularity initially has better throughput than Dilithium-2 with block modularity. However, at their peak, they both have the same throughput.</p>
Full article ">Figure A7
<p>Comparison block generation time of Dilithium-2 without block modularity and without block modularity. The green line represents Dilithium-2 without block modularity, and the blue line represents without block modularity. The number of voters is on the horizontal axis, and the time in seconds to generate a block is on the vertical axis. The block generation time is almost the same for both configurations.</p>
Full article ">Figure A8
<p>Comparison of the throughput of Dilithium-2 without block modularity and without block modularity. The sky-blue line represents Dilithium-2 without block modularity, and the green line represents without block modularity. The number of voters is on the horizontal axis and the number of blocks generated per second is on the vertical axis. Dilithium-2 without block modularity initially has better throughput than without block modularity. However, at their peak, they both have the same throughput.</p>
Full article ">Figure A9
<p>Comparison of the block generation time of block modularity and Dilithium-3 with block modularity. The blue line represents block modularity with Dilithium-3, and the green line represents block modularity alone. The number of voters is on the horizontal axis, and the time in seconds to generate a block is on the vertical axis. Dilithium-3 with block modularity offers faster block generation times than block modularity alone.</p>
Full article ">Figure A10
<p>Comparison of the throughput of block modularity and Dilithium-3 with block modularity. The blue bars represent block modularity with Dilithium-3, and the green bars represent block modularity alone. The number of voters is on the horizontal axis and time is on the vertical axis. Block modularity initially has better throughput than Dilithium-3 with block modularity. However, at their peak, they both have the same throughput.</p>
Full article ">Figure A11
<p>Block Generation Time Comparison of Dilithium-3 without Block Modularity and Without Block Modularity. The green line represents Dilithium-3 without block modularity, and the blue line represents without block modularity. The number of voters is on the horizontal axis and the time in seconds is on the vertical axis. Dilithium-3 without block modularity took less time to generate a block.</p>
Full article ">Figure A12
<p>Throughput Comparison of Dilithium-3 without Block Modularity and Without Block Modularity. The blue-sky bars represent without block modularity with Dilithium-3, and the green bars represent without block modularity alone. The number of voters is on the horizontal axis and the time is on the vertical axis. The bar graph shows that without block modularity initially has better throughput than Dilithium-3 without block modularity. However, at their peak, they both have the same throughput.</p>
Full article ">Figure A13
<p>Performance Comparison of Dilithium-3 without block modularity and Dilithium-2 without block modularity. The olive-colored line represents Dilithium-3 without block modularity, and the violet line represents Dilithium-2 without block modularity. The horizontal axis represents the number of blocks generated, and the vertical axis represents the time in seconds. In conclusion, Dilithium-3 without block modularity gave better performance than Dilithium-2 without block modularity.</p>
Full article ">Figure A14
<p>Comparing the performance of Dilithium-3 and Dilithium-2 without block modularity in terms of throughput. In the bar graph, the horizontal axis represents the time, and the vertical axis represents the voter. Additionally, the sky-blue line represents Dilithium-3 without block modularity and the green line represents Dilithium-2 without block modularity. In conclusion, Dilithium-3 without block modularity performs slightly better than Dilithium-2 without block modularity.</p>
Full article ">Figure A15
<p>Performance comparison of Dilithium-3 with block modularity and Dilithium-2 with block modularity. The green line represents Dilithium-3 with block modularity, and the sky-blue line represents Dilithium-2 with block modularity. The horizontal axis represents the number of blocks generated, and the vertical axis represents the time in seconds. Here, Dilithium-3 with block modularity is faster than Dilithium-2 with block modularity.</p>
Full article ">Figure A16
<p>Comparing the throughput of Dilithium-3 with block modularity and Dilithium-2 with block modularity over time. The graph shows the voter on the vertical axis and time on the horizontal axis. The green line represents Dilithium-3 with block modularity, and the sky-blue line represents Dilithium-2 with block modularity. Dilithium-3 with block modularity performs better than Dilithium-2 with block modularity in terms of throughput.</p>
Full article ">Figure A17
<p>Time to generate a block for different numbers of voters using Dilithium-2 with block modularity (orange line) and sharding with two shards (sky-blue line). The horizontal axis represents the number of voters, and the vertical axis represents the time in milliseconds. Sharding with two shards consistently outperforms Dilithium-2 with block modularity, especially for large numbers of voters.</p>
Full article ">Figure A18
<p>Throughput comparison of sharding with two shards and Dilithium-2 with block modularity for different numbers of voters. The vertical axis represents the number of voters, and the horizontal axis represents the time in seconds. Sharding consistently outperforms Dilithium-2 with block modularity, especially for large numbers of voters. This suggests that sharding is a better choice for blockchain networks that need to scale to large numbers of users and transactions.</p>
Full article ">Figure A19
<p>Time to generate a block for different numbers of voters, comparing Dilithium-2 without block modularity and sharding with two shards. The x-axis represents the number of voters, and the y-axis represents the time in seconds. The red line represents Dilithium-2 without block modularity, and the green line represents sharding with two shards. Sharding with two shards consistently outperforms Dilithium-2 without block modularity.</p>
Full article ">Figure A20
<p>Throughput of Dilithium-2 without block modularity and sharding with two shards. The bar graph shows the throughput of Dilithium-2 without block modularity and sharding with two shards. The horizontal axis represents time, and the vertical axis represents time. These results demonstrate the significant throughput improvements achieved through sharding.</p>
Full article ">Figure A21
<p>Block generation time for Dilithium-3 with block modularity and sharding with two shards. The horizontal axis represents the number of voters, and the vertical axis represents the time in seconds. Here, sharding with two shards gave better performance than Dilithium-3 with block modularity.</p>
Full article ">Figure A22
<p>Throughput of Dilithium-3 with block modularity and sharding with two shards. The horizontal axis represents the time, the vertical axis represents voters, and the green line represents sharding, and the sky-blue line represents Dilithium-3 with block modularity. Here, sharding with two shards gave better performance than Dilithium-3 with block modularity.</p>
Full article ">Figure A23
<p>Block generation time for Dilithium-3 without block modularity and sharding. The horizontal axis represents the time, and the vertical axis represents the number of voters. As the number of voters increases, sharding with two shards (green line) is able to maintain a consistent block generation time. In contrast, Dilithium-3 without block modularity (blue line) experiences significant performance degradation. This comparison highlights the efficiency of sharding in maintaining consistent performance under increasing voter loads.</p>
Full article ">Figure A24
<p>Throughput of Dilithium-3 without block modularity and sharding with two shards. The bar graph shows the throughput of the two approaches for different numbers of voters. The horizontal axis represents the number of voters, and the vertical axis represents the throughput in transactions per second. Here, sharding with two shards gave better performance than Dilithium-3 without block modularity.</p>
Full article ">Figure A25
<p>This is a visual representation of a block and its units. The block header stores the metadata of the block, and the block body stores the data of the block. The block is divided into different units, each of which has a hash. The block hash is made by combining the hashes of all the units of the block.</p>
Full article ">Figure A26
<p>The visual representation of the Merkle tree shows how it is constructed from the bottom up. The leaves of the tree are hashes of the data blocks, and the non-leaf nodes are hashes of their child nodes. The root of the tree is called the Merkle root. The block record is made up of the Merkle root and other metadata, and the Merkle root is stored in the block header.</p>
Full article ">Figure A27
<p>This diagram presents a lucid explanation of the authorization process. It shows how every entity is hashed, signed, and generates proof of record.</p>
Full article ">Figure A28
<p>The representation of a user capturing an image in front of a system for verification prior to accessing their respective systems is a common security measure employed to prevent unauthorized access. The user is typically required to maintain a steady pose while the system captures a high-resolution image. The captured image is then compared to a stored image of the user’s face to validate their identity.</p>
Full article ">Figure A29
<p>This diagram provides a clear explanation of the verification process. The intended record is hashed, signed, and generates into a proof. This newly generated proof is then compared to the existing proof to ensure validity.</p>
Full article ">Figure A30
<p>The MPC token generation process is a secure and efficient way to generate tokens that can be used to verify that a voter is eligible to vote and to prevent voter fraud. The process works by taking the voter’s unique identifier as input, splitting it into multiple parts, encrypting each part, and then having each encrypted part computed by a different party. The computed parts are then merged to form a token.</p>
Full article ">
37 pages, 8629 KiB  
Review
A Comprehensive Survey of Masked Faces: Recognition, Detection, and Unmasking
by Mohamed Mahmoud, Mahmoud SalahEldin Kasem and Hyun-Soo Kang
Appl. Sci. 2024, 14(19), 8781; https://doi.org/10.3390/app14198781 - 28 Sep 2024
Cited by 1 | Viewed by 1081
Abstract
Masked face recognition (MFR) has emerged as a critical domain in biometric identification, especially with the global COVID-19 pandemic, which introduced widespread face masks. This survey paper presents a comprehensive analysis of the challenges and advancements in recognizing and detecting individuals with masked [...] Read more.
Masked face recognition (MFR) has emerged as a critical domain in biometric identification, especially with the global COVID-19 pandemic, which introduced widespread face masks. This survey paper presents a comprehensive analysis of the challenges and advancements in recognizing and detecting individuals with masked faces, which has seen innovative shifts due to the necessity of adapting to new societal norms. Advanced through deep learning techniques, MFR, along with face mask recognition (FMR) and face unmasking (FU), represents significant areas of focus. These methods address unique challenges posed by obscured facial features, from fully to partially covered faces. Our comprehensive review explores the various deep learning-based methodologies developed for MFR, FMR, and FU, highlighting their distinctive challenges and the solutions proposed to overcome them. Additionally, we explore benchmark datasets and evaluation metrics specifically tailored for assessing performance in MFR research. The survey also discusses the substantial obstacles still facing researchers in this field and proposes future directions for the ongoing development of more robust and effective masked face recognition systems. This paper serves as an invaluable resource for researchers and practitioners, offering insights into the evolving landscape of face recognition technologies in the face of global health crises and beyond. Full article
Show Figures

Figure 1

Figure 1
<p>Illustration showcasing the tasks of masked face recognition (MFR), face mask recognition (FMR), and face unmasking (FU) with varied outputs for the same input.</p>
Full article ">Figure 2
<p>Illustrates the evolving landscape of MFR and FMR studies from 2019 to 2024. The data were sourced from Scopus using keywords “Masked face recognition” for MFR and “Face mask detection”, “Face masks”, and “Mask detection” for FMR.</p>
Full article ">Figure 3
<p>Samples of masked and unmasked faces from the real-mask masked face datasets used in masked face recognition.</p>
Full article ">Figure 4
<p>Samples from real masked face datasets used in face mask recognition.</p>
Full article ">Figure 5
<p>Samples of synthetic masked faces from benchmark datasets.</p>
Full article ">Figure 6
<p>Illustration of the FMR-Net architecture for face mask recognition, depicting two-subtask scenarios: 2-class (with and without mask) and 3-class (with, incorrect, and without mask).</p>
Full article ">Figure 7
<p>Overview of the GAN network as an example of FU-Net for face mask removal.</p>
Full article ">Figure 8
<p>Face unmasking outputs from three state-of-the-art models: GANMasker, GUMF, and FFII-GatedCon. The first column shows the input masked face, while the second column displays the original unmasked face for reference.</p>
Full article ">Figure 9
<p>Three directions in masked face recognition (MFR): face restoration, masked region discarding, and deep learning-based approaches.</p>
Full article ">
21 pages, 11115 KiB  
Review
Mobile Devices in Forest Mensuration: A Review of Technologies and Methods in Single Tree Measurements
by Robert Magnuson, Yousef Erfanifard, Maksymilian Kulicki, Torana Arya Gasica, Elvis Tangwa, Miłosz Mielcarek and Krzysztof Stereńczak
Remote Sens. 2024, 16(19), 3570; https://doi.org/10.3390/rs16193570 - 25 Sep 2024
Viewed by 1152
Abstract
Mobile devices such as smartphones, tablets or similar devices are becoming increasingly important as measurement devices in forestry due to their advanced sensors, including RGB cameras and LiDAR systems. This review examines the current state of applications of mobile devices for measuring biometric [...] Read more.
Mobile devices such as smartphones, tablets or similar devices are becoming increasingly important as measurement devices in forestry due to their advanced sensors, including RGB cameras and LiDAR systems. This review examines the current state of applications of mobile devices for measuring biometric characteristics of individual trees and presents technologies, applications, measurement accuracy and implementation barriers. Passive sensors, such as RGB cameras have proven their potential for 3D reconstruction and analysing point clouds that improve single tree-level information collection. Active sensors with LiDAR-equipped smartphones provide precise quantitative measurements but are limited by specific hardware requirements. The combination of passive and active sensing techniques has shown significant potential for comprehensive data collection. The methods of data collection, both physical and digital, significantly affect the accuracy and reproducibility of measurements. Applications such as ForestScanner and TRESTIMATM have automated the measurement of tree characteristics and simplified data collection. However, environmental conditions and sensor limitations pose a challenge. There are also computational obstacles, as many methods require significant post-processing. The review highlights the advances in mobile device-based forestry applications and emphasizes the need for standardized protocols and cross-device benchmarking. Future research should focus on developing robust algorithms and cost-effective solutions to improve measurement accuracy and accessibility. While mobile devices offer significant potential for forest surveying, overcoming the above-mentioned challenges is critical to optimizing their application in forest management and protection. Full article
Show Figures

Figure 1

Figure 1
<p>The word cloud consists of a total of 40 keywords that represent the main topics and concepts of the reviewed articles. The selected keywords were repeated at least twice.</p>
Full article ">Figure 2
<p>Overview of the initial search and screening process for this study in three databases: Google Scholar, Scopus, and Web of Science. The search terms (bolded in each section) and inclusion criteria are detailed for each database, with the number of entries excluded after the initial screening also noted.</p>
Full article ">Figure 3
<p>The devices, auxiliary equipment, and applications discussed in 34 reviewed articles are shown with labels indicating their reference numbers.</p>
Full article ">Figure 4
<p>Exploring data collection methods for mobile device application in tree attribute assessment: indirect vs. direct.</p>
Full article ">Figure 5
<p>The RGB images of a beaver-damaged oak (<span class="html-italic">Quercus robur</span>) tree taken by iPhone 15 Pro Max in Leśnictwo Zielony Dwór Forest in Gajewo, Poland (1 April 2024) (<b>a</b>) and the results of commonly used applications, i.e., Polycam (<b>b</b>); ForestScanner (<b>c</b>); 3D Scanner App (<b>d</b>); PIX4Dcatch (<b>e</b>) installed on the iPhone 15 Pro Max to scan the tree and process its point clouds. Blue boxes in (<b>e</b>) show the locations of photos automatically taken by the phone.</p>
Full article ">
12 pages, 860 KiB  
Article
Oxidative Stress Markers and Na,K-ATPase Enzyme Kinetics Are Altered in the Cerebellum of Zucker Diabetic Fatty fa/fa Rats: A Comparison with Lean fa/+ and Wistar Rats
by Dominika Radosinska, Alexandra Gaal Kovalcikova, Roman Gardlik, Maria Chomova, Denisa Snurikova, Jana Radosinska and Norbert Vrbjar
Biology 2024, 13(10), 759; https://doi.org/10.3390/biology13100759 - 25 Sep 2024
Viewed by 668
Abstract
Type 2 diabetes mellitus has been referred to as being closely related to oxidative stress, which may affect brain functions and brain glucose metabolism due to its high metabolic activity and lipid-rich content. Na,K-ATPase is an essential enzyme maintaining intracellular homeostasis, with properties [...] Read more.
Type 2 diabetes mellitus has been referred to as being closely related to oxidative stress, which may affect brain functions and brain glucose metabolism due to its high metabolic activity and lipid-rich content. Na,K-ATPase is an essential enzyme maintaining intracellular homeostasis, with properties that can sensitively mirror various pathophysiological conditions such as diabetes. The goal of this study was to determine oxidative stress markers as well as Na,K-ATPase activities in the cerebellum of Zucker diabetic fatty (ZDF) rats depending on diabetes severity. The following groups of male rats were used: Wistar, ZDF Lean (fa/+), and ZDF (fa/fa) rats, arbitrarily divided according to glycemia into ZDF obese (ZO, less severe diabetes) and ZDF diabetic (ZOD, advanced diabetes) groups. In addition to basic biometry and biochemistry, oxidative stress markers were assessed in plasma and cerebellar tissues. The Na, K-ATPase enzyme activity was measured at varying ATP substrate concentrations. The results indicate significant differences in basic biometric and biochemical parameters within all the studied groups. Furthermore, oxidative damage was greater in the cerebellum of both ZDF (fa/fa) groups compared with the controls. Interestingly, Na,K-ATPase enzyme activity was highest to lowest in the following order: ZOD > ZO > Wistar > ZDF lean rats. In conclusion, an increase in systemic oxidative stress resulting from diabetic conditions has a significant impact on the cerebellar tissue independently of diabetes severity. The increased cerebellar Na,K-ATPase activity may reflect compensatory mechanisms in aged ZDF (fa/fa) animals, rather than indicating cerebellar neurodegeneration: a phenomenon that warrants further investigation. Full article
(This article belongs to the Section Biochemistry and Molecular Biology)
Show Figures

Figure 1

Figure 1
<p>Na,K-ATPase enzyme kinetics. (<b>a</b>) Activity of Na,K-ATPase enzyme in presence of ATP substrate at low concentrations (range: 0.16–0.8 mmol·L⁻<sup>1</sup>). Inset: activity of the enzyme in the whole examined range of ATP. (<b>b</b>) Values of V<sub>max</sub> in all experimental groups. (<b>c</b>) Values of K<sub>m</sub> in all experimental groups. Abbreviation: W—Wistar, ZL—lean fa/+, Zucker diabetic fatty (ZDF) fa/fa rats divided into ZO rats with lower glycemia (&lt;10 mmol·L<sup>−1</sup>) and ZOD rats with higher glycemia (&gt;10 mmol·L<sup>−1</sup>). Data are presented as means ± standard errors of mean (SEM). * <span class="html-italic">p</span> &lt; 0.05, **** <span class="html-italic">p</span> &lt; 0.0001 vs. W; <sup>+</sup> <span class="html-italic">p</span> &lt; 0.05, <sup>++</sup> <span class="html-italic">p</span> &lt; 0.01 vs. ZL; <sup>#</sup> <span class="html-italic">p</span> &lt; 0.05 vs. ZO.</p>
Full article ">Figure 2
<p>The schematic presentation of the key points of this study. Abbreviation: ZL—lean fa/+, Zucker diabetic fatty (ZDF) fa/fa rats divided into ZO rats with lower glycemia (&lt;10 mmol·L<sup>−1</sup>) and ZOD rats with higher glycemia (&gt;10 mmol·L<sup>−1</sup>), ↑—increase, ↑↑—greater increase, ↔—no change. The experimental animals were 38/39 weeks old.</p>
Full article ">
Back to TopTop