Nothing Special   »   [go: up one dir, main page]

You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
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 (681)

Search Parameters:
Keywords = symmetric key

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
20 pages, 3466 KiB  
Article
Symmetric Tridiagonal Eigenvalue Solver Across CPU Graphics Processing Unit (GPU) Nodes
by Erika Hernández-Rubio, Alberto Estrella-Cruz, Amilcar Meneses-Viveros, Jorge Alberto Rivera-Rivera, Liliana Ibeth Barbosa-Santillán and Sergio Víctor Chapa-Vergara
Appl. Sci. 2024, 14(22), 10716; https://doi.org/10.3390/app142210716 - 19 Nov 2024
Viewed by 365
Abstract
In this work, an improved and scalable implementation of Cuppen’s algorithm for diagonalizing symmetric tridiagonal matrices is presented. This approach uses a hybrid-heterogeneous parallelization technique, taking advantage of GPU and CPU in a distributed hardware architecture. Cuppen’s algorithm is a theoretical concept and [...] Read more.
In this work, an improved and scalable implementation of Cuppen’s algorithm for diagonalizing symmetric tridiagonal matrices is presented. This approach uses a hybrid-heterogeneous parallelization technique, taking advantage of GPU and CPU in a distributed hardware architecture. Cuppen’s algorithm is a theoretical concept and a powerful tool in various scientific and engineering applications. It is a key player in matrix diagonalization, finding its use in Functional Density Theory (FDT) and Spectral Clustering. This highly efficient and numerically stable algorithm computes eigenvalues and eigenvectors of symmetric tridiagonal matrices, making it a crucial component in many computational methods. One of the challenges in parallelizing algorithms for GPUs is their limited memory capacity. However, we overcome this limitation by utilizing multiple nodes with both CPUs and GPUs. This enables us to solve subproblems that fit within the memory of each device in parallel and subsequently combine these subproblems to obtain the complete solution. The hybrid-heterogeneous approach proposed in this work outperforms the state-of-the-art libraries and also maintains a high degree of accuracy in terms of orthogonality and quality of eigenvectors. Furthermore, the sequential version of the algorithm with our approach in this work demonstrates superior performance and potential for practical use. In the experiments carried out, it was possible to verify that the performance of the implementation that was carried out scales by 2× using two graphic cards in the same node. Notably, Symmetric Tridiagonal Eigenvalue Solvers are fundamental to solving more general eigenvalue problems. Additionally, the divide-and-conquer approach employed in this implementation can be extended to singular value solvers. Given the wide range of eigenvalue problems encountered in scientific and engineering domains, this work is essential in advancing computational methods for efficient and accurate matrix diagonalization. Full article
Show Figures

Figure 1

Figure 1
<p>Heterogeneous parallel architecture.</p>
Full article ">Figure 2
<p>Process flow.</p>
Full article ">Figure 3
<p>Time-symmetric tridiagonal eigensystem.</p>
Full article ">Figure 4
<p>Eigenpairs error <math display="inline"><semantics> <msub> <mrow> <mo>∥</mo> <mi>A</mi> <mi>Q</mi> <mo>−</mo> <mi>Q</mi> <mo>Λ</mo> <mo>∥</mo> </mrow> <mi>F</mi> </msub> </semantics></math>.</p>
Full article ">Figure 5
<p>Orthogonality error <math display="inline"><semantics> <mrow> <mrow> <mo>∥</mo> <mi>Q</mi> </mrow> <msup> <mi>Q</mi> <mi>T</mi> </msup> <msub> <mrow> <mo>−</mo> <mi>I</mi> <mo>∥</mo> </mrow> <mi>F</mi> </msub> </mrow> </semantics></math>.</p>
Full article ">
22 pages, 517 KiB  
Article
LIRL: Latent Imagination-Based Reinforcement Learning for Efficient Coverage Path Planning
by Zhenglin Wei, Tiejiang Sun and Mengjie Zhou
Symmetry 2024, 16(11), 1537; https://doi.org/10.3390/sym16111537 - 17 Nov 2024
Viewed by 412
Abstract
Coverage Path Planning (CPP) in unknown environments presents unique challenges that often require the system to maintain a symmetry between exploration and exploitation in order to efficiently cover unknown areas. This paper introduces latent imagination-based reinforcement learning (LIRL), a novel framework that addresses [...] Read more.
Coverage Path Planning (CPP) in unknown environments presents unique challenges that often require the system to maintain a symmetry between exploration and exploitation in order to efficiently cover unknown areas. This paper introduces latent imagination-based reinforcement learning (LIRL), a novel framework that addresses these challenges by integrating three key components: memory-augmented experience replay (MAER), a latent imagination module (LIM), and multi-step prediction learning (MSPL) within a soft actor–critic architecture. MAER enhances sample efficiency by prioritizing experience retrieval, LIM facilitates long-term planning via simulated trajectories, and MSPL optimizes the trade-off between immediate rewards and future outcomes through adaptive n-step learning. MAER, LIM, and MSPL work within a soft actor–critic architecture, and LIRL creates a dynamic equilibrium that enables efficient, adaptive decision-making. We evaluate LIRL across diverse simulated environments, demonstrating substantial improvements over state-of-the-art methods. Through this method, the agent optimally balances short-term actions with long-term planning, maintaining symmetrical responses to varying environmental changes. The results highlight LIRL’s potential for advancing autonomous CPP in real-world applications such as search and rescue, agricultural robotics, and warehouse automation. Our work contributes to the broader fields of robotics and reinforcement learning, offering insights into integrating memory, imagination, and adaptive learning for complex sequential decision-making tasks. Full article
(This article belongs to the Section Computer)
Show Figures

Figure 1

Figure 1
<p>Schematic of the proposed LIRL framework for efficient CPP.</p>
Full article ">Figure 2
<p>Illustration of coverage maps at multiple scales.</p>
Full article ">Figure 3
<p>Schematic diagram of (<b>a</b>) Map1, (<b>b</b>) Map2, and (<b>c</b>) Map3.</p>
Full article ">Figure 4
<p>Learning curves of LIRL and baselines in Map2.</p>
Full article ">Figure 5
<p>Adaptability to environmental changes in Map3.</p>
Full article ">
23 pages, 3161 KiB  
Article
Dynamic Characterization and Optimization of Heat Flux and Thermal Efficiency of a Penetrable Moving Hemispherical Fin Embedded in a Shape Optimized Fe3O4-Ni/C6H18OSi2 Hybrid Nanofluid: L-IIIA Solution
by Ammembal Gopalkrishna Pai, Rekha G. Pai, Karthi Pradeep and Likith Raj
Symmetry 2024, 16(11), 1532; https://doi.org/10.3390/sym16111532 - 15 Nov 2024
Viewed by 699
Abstract
The present paper reports the theoretical results on the thermal performance of proposed Integrated Hybrid Nanofluid Hemi-Spherical Fin Model assuming a combination of Fe3O4-Ni/C6H18OSi2 hybrid nanofluid. The model leverages the concept of symmetrical [...] Read more.
The present paper reports the theoretical results on the thermal performance of proposed Integrated Hybrid Nanofluid Hemi-Spherical Fin Model assuming a combination of Fe3O4-Ni/C6H18OSi2 hybrid nanofluid. The model leverages the concept of symmetrical geometries and optimized nanoparticle shapes to enhance the heat flux, with a focus on symmetrical design applications in thermal engineering. The simulations are carried out by assuming a silicone oil as a base fluid, due to its exceptional stability in hot and humid conditions, enriched with superparamagnetic Fe3O4 and Ni nanoparticles to enhance the heat transfer capabilities, with the aim of contributing to the field of nanotechnology, electronics and thermal engineering, The focus of this work is to optimize the heat dissipation in systems that require high thermal efficiency and stability such as automotive cooling systems, aerospace components and power electronics. In addition, the study explores the influence of key parameters such as heat transfer coefficients and thermal conductivity that play an important role in improving the thermal performance of cooling systems. The overall thermal performance of the model is evaluated based on its heat flux and thermal efficiency. The study also examines the impact of the shape optimized nanoparticles in silicone oil by incorporating shape-factor in its modelling equations and proposes optimization of parameters to enhance the overall thermal performance of the system. Darcy’s flow model is used to analyse the key parameters in the system and study the thermal behaviour of the hybrid nanofluid within the fin by incorporating natural convection, temperature-dependent internal heat generation, and radiation effects. By using the similarity approach, the governing equations were reduced to non-linear ordinary differential equations and numerical solutions were obtained by using four-stage Lobatto-IIIA numerical technique due to its robust stability and convergence properties. This enables a systematic investigation of various influential parameters, including thermal conductivity, emissivity and heat transfer coefficients. Additionally, it stimulates interest among researchers in applying mathematical techniques to complex heat transfer systems, thereby contributing towards the development of highly efficient cooling system. Our findings indicate that there is a significant enhancement in the heat flux as well as improvement in the thermal efficiency due to the mixture of silicone oil and shape optimized nanoparticles, that was visualized through comprehensive graphical analysis. Quantitatively, the proposed model displays a maximum thermal efficiency of 57.5% for lamina shaped nanoparticles at Nc = 0.5, Nr = 0.2, Ng = 0.2 and Θa = 0.4. The maximum enhancement in the heat flux occurs when Nc doubles from 5 to 10 for m2 = 0.2 and Nr = 0.1. Optimal thermal performance is found for Nc, Nr and m2 values in the range 5 to 10, 0.2 to 0.4 and 0.4 to 0.8 respectively. Full article
(This article belongs to the Section Physics)
Show Figures

Figure 1

Figure 1
<p>Schematic of the flow configuration of the proposed model.</p>
Full article ">Figure 2
<p>Variation of <math display="inline"><semantics> <mrow> <mi>Θ</mi> <mo>(</mo> <mi>X</mi> <mo>)</mo> </mrow> </semantics></math> along its axial distance.</p>
Full article ">Figure 3
<p>(<b>a</b>) Repercussion of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>c</mi> </mrow> </msub> </mrow> </semantics></math> on thermal profile. (<b>b</b>) Repercussion of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>c</mi> </mrow> </msub> </mrow> </semantics></math> on thermal gradient.</p>
Full article ">Figure 4
<p>(<b>a</b>) Repercussion of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>r</mi> </mrow> </msub> </mrow> </semantics></math> on thermal profile. (<b>b</b>) Repercussion of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>r</mi> </mrow> </msub> </mrow> </semantics></math> on thermal gradient.</p>
Full article ">Figure 4 Cont.
<p>(<b>a</b>) Repercussion of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>r</mi> </mrow> </msub> </mrow> </semantics></math> on thermal profile. (<b>b</b>) Repercussion of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>r</mi> </mrow> </msub> </mrow> </semantics></math> on thermal gradient.</p>
Full article ">Figure 5
<p>(<b>a</b>) Repercussion of <span class="html-italic">n</span> on thermal profile. (<b>b</b>) Repercussion of <span class="html-italic">n</span> on thermal gradient.</p>
Full article ">Figure 6
<p>(<b>a</b>) Repercussion of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>m</mi> </mrow> <mrow> <mn>2</mn> </mrow> </msub> </mrow> </semantics></math> on thermal profile. (<b>b</b>) Repercussion of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>m</mi> </mrow> <mrow> <mn>2</mn> </mrow> </msub> </mrow> </semantics></math> on thermal gradient.</p>
Full article ">Figure 7
<p>(<b>a</b>) Repercussion of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>Θ</mi> </mrow> <mrow> <mi>a</mi> </mrow> </msub> </mrow> </semantics></math> on thermal profile. (<b>b</b>) Repercussion of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>Θ</mi> </mrow> <mrow> <mi>a</mi> </mrow> </msub> </mrow> </semantics></math> on thermal gradient.</p>
Full article ">Figure 8
<p>(<b>a</b>) Repercussion of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>g</mi> </mrow> </msub> </mrow> </semantics></math> on thermal profile. (<b>b</b>) Repercussion of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>g</mi> </mrow> </msub> </mrow> </semantics></math> on thermal gradient.</p>
Full article ">Figure 8 Cont.
<p>(<b>a</b>) Repercussion of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>g</mi> </mrow> </msub> </mrow> </semantics></math> on thermal profile. (<b>b</b>) Repercussion of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>g</mi> </mrow> </msub> </mrow> </semantics></math> on thermal gradient.</p>
Full article ">Figure 9
<p>Repercussion of Shape-factor on thermal profile.</p>
Full article ">Figure 10
<p>Temperature profile for spherical shape nanoparticles and various values of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>c</mi> </mrow> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 11
<p>Temperature profile for blade shape nanoparticles and various values of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>c</mi> </mrow> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 12
<p>Temperature profile for lamina shape nanoparticles and various values of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>c</mi> </mrow> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 13
<p>Repercussion of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>r</mi> </mrow> </msub> <mo>,</mo> <mo> </mo> <msub> <mrow> <mi>m</mi> </mrow> <mrow> <mn>2</mn> </mrow> </msub> </mrow> </semantics></math> on <math display="inline"><semantics> <mrow> <msup> <mrow> <mo>−</mo> <mi>Θ</mi> </mrow> <mrow> <mo>′</mo> </mrow> </msup> <mfenced separators="|"> <mrow> <mn>0</mn> </mrow> </mfenced> </mrow> </semantics></math> for various values of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>c</mi> </mrow> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 14
<p>Repercussion of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>Θ</mi> </mrow> <mrow> <mi>a</mi> </mrow> </msub> </mrow> </semantics></math>, <span class="html-italic">n</span> on <math display="inline"><semantics> <mrow> <msup> <mrow> <mo>−</mo> <mi>Θ</mi> </mrow> <mrow> <mo>′</mo> </mrow> </msup> <mfenced separators="|"> <mrow> <mn>0</mn> </mrow> </mfenced> </mrow> </semantics></math> for various values of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>g</mi> </mrow> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 15
<p>Repercussion of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>r</mi> </mrow> </msub> </mrow> </semantics></math> and shape factor on <span class="html-italic">η</span> for various values of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>c</mi> </mrow> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 16
<p>Repercussion of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>Θ</mi> </mrow> <mrow> <mi>a</mi> </mrow> </msub> </mrow> </semantics></math> and shape factor on <span class="html-italic">η</span> for various values of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>g</mi> </mrow> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 17
<p>% Enhancement in heat flux with two-fold rise in <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>c</mi> </mrow> </msub> </mrow> </semantics></math> for various values of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>m</mi> </mrow> <mrow> <mn>2</mn> </mrow> </msub> </mrow> </semantics></math>,<math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>r</mi> </mrow> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 18
<p>% Enhancement in heat flux with two-fold rise in <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>m</mi> </mrow> <mrow> <mn>2</mn> </mrow> </msub> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>r</mi> </mrow> </msub> </mrow> </semantics></math> for various values of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>N</mi> </mrow> <mrow> <mi>c</mi> </mrow> </msub> </mrow> </semantics></math>.</p>
Full article ">
14 pages, 455 KiB  
Article
Skew-Symmetric Generalized Normal and Generalized t Distributions
by Najmeh Nakhaei Rad, Mahdi Salehi, Yaser Mehrali and Ding-Geng Chen
Axioms 2024, 13(11), 782; https://doi.org/10.3390/axioms13110782 - 13 Nov 2024
Viewed by 276
Abstract
In this paper, we introduce the skew-symmetric generalized normal and the skew-symmetric generalized t distributions, which are skewed extensions of symmetric special cases of generalized skew-normal and generalized skew-t distributions, respectively. We derive key distributional properties for these new distributions, including a [...] Read more.
In this paper, we introduce the skew-symmetric generalized normal and the skew-symmetric generalized t distributions, which are skewed extensions of symmetric special cases of generalized skew-normal and generalized skew-t distributions, respectively. We derive key distributional properties for these new distributions, including a recurrence relation and an explicit form for the cumulative distribution function (cdf) of the skew-symmetric generalized t distribution. Numerical examples including a simulation study and a real data analysis are presented to illustrate the practical applicability of these distributions. Full article
Show Figures

Figure 1

Figure 1
<p>The density function of <math display="inline"><semantics> <mrow> <mi>G</mi> <mi>S</mi> <mi>N</mi> <mo>(</mo> <msub> <mi>λ</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>λ</mi> <mn>2</mn> </msub> <mo>,</mo> <mi>ρ</mi> <mo>)</mo> </mrow> </semantics></math> for <math display="inline"><semantics> <mrow> <mi>ρ</mi> <mo>=</mo> <mn>0.8</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 2
<p>The density function of <math display="inline"><semantics> <mrow> <mi>S</mi> <mi>S</mi> <mi>G</mi> <mi>N</mi> <mo>(</mo> <mi>λ</mi> <mo>,</mo> <mi>ρ</mi> <mo>,</mo> <mi>α</mi> <mo>)</mo> </mrow> </semantics></math> for some choices of the parameters.</p>
Full article ">Figure 3
<p>The skewness of <math display="inline"><semantics> <mrow> <mi>S</mi> <mi>S</mi> <mi>G</mi> <mi>N</mi> <mo>(</mo> <mi>λ</mi> <mo>,</mo> <mi>ρ</mi> <mo>,</mo> <mi>α</mi> <mo>)</mo> </mrow> </semantics></math> for the selected parameter values.</p>
Full article ">Figure 4
<p>The kurtosis of <math display="inline"><semantics> <mrow> <mi>S</mi> <mi>S</mi> <mi>G</mi> <mi>N</mi> <mo>(</mo> <mi>λ</mi> <mo>,</mo> <mi>ρ</mi> <mo>,</mo> <mi>α</mi> <mo>)</mo> </mrow> </semantics></math> for the selected parameter values.</p>
Full article ">Figure 5
<p>The density function of <math display="inline"><semantics> <mrow> <mi>G</mi> <mi>S</mi> <mi>t</mi> <mo>(</mo> <mi>ν</mi> <mo>,</mo> <msub> <mi>λ</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>λ</mi> <mn>2</mn> </msub> <mo>,</mo> <mi>ρ</mi> <mo>)</mo> </mrow> </semantics></math> for <math display="inline"><semantics> <mrow> <mi>ν</mi> <mo>=</mo> <mn>2</mn> <mo>,</mo> <mi>ρ</mi> <mo>=</mo> <mn>0.8</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 6
<p>The density function of <math display="inline"><semantics> <mrow> <mi>S</mi> <mi>S</mi> <mi>G</mi> <mi>t</mi> <mo>(</mo> <mi>ν</mi> <mo>,</mo> <mi>λ</mi> <mo>,</mo> <mi>ρ</mi> <mo>,</mo> <mi>α</mi> <mo>)</mo> </mrow> </semantics></math> for various parameter choices.</p>
Full article ">Figure 7
<p>The skewness of <math display="inline"><semantics> <mrow> <mi>S</mi> <mi>S</mi> <mi>G</mi> <mi>t</mi> <mo>(</mo> <mi>ν</mi> <mo>,</mo> <mi>λ</mi> <mo>,</mo> <mi>ρ</mi> <mo>,</mo> <mi>α</mi> <mo>)</mo> </mrow> </semantics></math> for various parameter choices.</p>
Full article ">Figure 8
<p>The kurtosis of <math display="inline"><semantics> <mrow> <mi>S</mi> <mi>S</mi> <mi>G</mi> <mi>t</mi> <mo>(</mo> <mi>ν</mi> <mo>,</mo> <mi>λ</mi> <mo>,</mo> <mi>ρ</mi> <mo>,</mo> <mi>α</mi> <mo>)</mo> </mrow> </semantics></math> for various parameter choices.</p>
Full article ">Figure 9
<p>The MSE and absolute bias of the MLEs of the SSGN’s parameters for <math display="inline"><semantics> <mrow> <mi>μ</mi> <mo>=</mo> <mn>0</mn> <mo>,</mo> <mi>σ</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mi>λ</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> </mrow> </semantics></math><math display="inline"><semantics> <mrow> <mi>α</mi> <mo>=</mo> <mn>0.4</mn> <mo>,</mo> <mi>ρ</mi> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math>, and different values of <span class="html-italic">n</span>.</p>
Full article ">Figure 10
<p>The histogram of the data and the fitted curves (<b>left</b>) and the Q-Q plot of <math display="inline"><semantics> <mrow> <mi>S</mi> <mi>S</mi> <mi>G</mi> <mi>N</mi> </mrow> </semantics></math> (<b>right</b>).</p>
Full article ">
14 pages, 311 KiB  
Article
Generating Bent Functions and Dynamic Filters: A Novel Equivalence-Based Approach
by Joseph Nelson, Chungath Srinivasan, Anand R. Nair and Lakshmy Koduvayur Viswanathan
Symmetry 2024, 16(11), 1501; https://doi.org/10.3390/sym16111501 - 8 Nov 2024
Viewed by 776
Abstract
Boolean functions are fundamental building blocks in both discrete mathematics and computer science, with applications spanning from cryptography to coding theory. Bent functions, a subset of Boolean functions with maximal nonlinearity, are particularly valuable in cryptographic applications. This study introduces a novel equivalence [...] Read more.
Boolean functions are fundamental building blocks in both discrete mathematics and computer science, with applications spanning from cryptography to coding theory. Bent functions, a subset of Boolean functions with maximal nonlinearity, are particularly valuable in cryptographic applications. This study introduces a novel equivalence relation among all Boolean functions and presents an algorithm to generate bent functions based on this relation. We systematically generated a collection of 10,000 bent functions over eight variables, all originating from the same equivalence class, and analyzed their structural complexity through rank determination. Our findings revealed the presence of at least five distinct affine classes of bent functions within this collection. By employing this construction, we devised an algorithm to generate a filter function capable of combining Boolean functions. This filter function can be dynamically adjusted based on a key, offering potential applications in symmetric cipher design, such as enhancing security or improving efficiency. Full article
(This article belongs to the Section Mathematics)
Show Figures

Figure 1

Figure 1
<p>Distribution of bent functions with respect to rank.</p>
Full article ">
14 pages, 4946 KiB  
Article
The Asymmetries in Straight Jumps on the Trampoline Under Different Sensory Conditions
by Matjaž Pezdirc, Igor Pušnik, Maja Pajek, Ivan Čuk and Karmen Šibanc
Symmetry 2024, 16(11), 1472; https://doi.org/10.3390/sym16111472 - 5 Nov 2024
Viewed by 508
Abstract
The trampoline is a popular piece of sports equipment both for recreational use and for Olympic trampolining as a competitive sport. Maintaining body position during jumps is influenced by sensory inputs (visual, auditory, and somatosensory) and symmetrical muscle activity that help athletes to [...] Read more.
The trampoline is a popular piece of sports equipment both for recreational use and for Olympic trampolining as a competitive sport. Maintaining body position during jumps is influenced by sensory inputs (visual, auditory, and somatosensory) and symmetrical muscle activity that help athletes to perform consecutive jumps as vertically as possible. To evaluate the effects of these inputs, 15 male and 15 female students (with an average age of 24.4 years, height of 174.3 cm, and average weight of 69.7 kg) performed 10 consecutive straight jumps under four sensory conditions: (1) looking at the edge of the trampoline, (2) without sight, (3) without hearing, and (4) without hearing or sight. Using insoles with integrated pressure sensors (Pedar®, novel GmbH, Munich, Germany), the contact forces on the trampoline during the jump were measured separately for the left and right feet. The results showed that the lack of visual input significantly shortened flight times and increased the asymmetry of ground reaction forces between the left and right legs. For example, in the second series without vision, the average normalized force difference between the legs increased by 0.33 G compared to the control condition. An ANOVA revealed significant differences in the ground reaction forces between sensory conditions, with vision playing a key role in maintaining body control. These results provide practical insights for coaches looking to improve jumping performance and address asymmetries during training by focusing on sensory feedback strategies. Full article
(This article belongs to the Section Life Sciences)
Show Figures

Figure 1

Figure 1
<p>Pressure sensors used in a study (<b>left</b>) and socks with rubber bottoms (<b>right</b>).</p>
Full article ">Figure 2
<p>Straight jumps in the series. Note: 1–looking down at the edge of the trampoline, 2–without seeing, 3–looking at the edge of the trampoline without hearing, and 4–without hearing or seeing.</p>
Full article ">Figure 3
<p>Variables during one take-off in a straight jump. Note: <span class="html-italic">F</span><sub>T</sub> = total ground reaction force; <span class="html-italic">F</span><sub>L</sub> = ground reaction force for the left leg; <span class="html-italic">F</span><sub>R</sub> = ground reaction force for the right leg; <span class="html-italic">F</span><sub>D</sub> = difference in ground reaction forces between left and right; <span class="html-italic">t</span><sub>D</sub> = time difference in maximum ground reaction force for left and right leg; <span class="html-italic">t</span><sub>f</sub> = time of flight.</p>
Full article ">Figure 4
<p>Raw ground reaction forces during the straight jump (1st series of jumps) for one person. Note: <span class="html-italic">F</span><sub>L</sub> + <span class="html-italic">F</span><sub>R</sub> = <span class="html-italic">F</span><sub>T</sub> = total ground reaction force (green); <span class="html-italic">F</span><sub>L</sub> = ground reaction force for the left leg (blue); <span class="html-italic">F</span><sub>R</sub> = ground reaction force for the right leg (orange); <span class="html-italic">t</span><sub>f3</sub> and <span class="html-italic">t</span><sub>f4</sub> = flight time after 3rd and 4th jump in one series.</p>
Full article ">Figure 5
<p>Raw ground reaction forces without seeing (2nd series of jumps) for one person. Note: <span class="html-italic">F</span><sub>L</sub> + <span class="html-italic">F</span><sub>R</sub> = <span class="html-italic">F</span><sub>T</sub> = total ground reaction force (green); <span class="html-italic">F</span><sub>L</sub> = ground reaction force for the left leg (blue); <span class="html-italic">F</span><sub>R</sub> = ground reaction force for the right leg (orange).</p>
Full article ">Figure 6
<p>Raw ground reaction forces without hearing (3rd series of jumps) for one person. Note: <span class="html-italic">F</span><sub>L</sub> + <span class="html-italic">F</span><sub>R</sub> = <span class="html-italic">F</span><sub>T</sub> = total ground reaction force (green); <span class="html-italic">F</span><sub>L</sub> = ground reaction force for the left leg (blue); <span class="html-italic">F</span><sub>R</sub> = ground reaction force for the right leg (orange).</p>
Full article ">Figure 7
<p>Raw ground reaction forces without seeing or hearing (4th series of jumps) for one person. Note: <span class="html-italic">F</span><sub>L</sub> + <span class="html-italic">F</span><sub>R</sub> = <span class="html-italic">F</span><sub>T</sub> = total ground reaction force (green); F<sub>L</sub> = ground reaction force for the left leg (blue); <span class="html-italic">F</span><sub>R</sub> = ground reaction force for the right leg (orange).</p>
Full article ">Figure 8
<p>The sum of differences in ground reaction forces between the left and right leg for all four jump series. Note: <span class="html-italic">F</span><sub>Dsum</sub>/<span class="html-italic">F</span><sub>g</sub> = the sum of the difference in ground reaction forces between the left and right leg; 1–4 = number of series; 1 = 1st series of jumps; 2 = 2nd series of jumps without vision; 3 = 3rd series of jumps without hearing; 4 = 4th series of jumps without vision or hearing.</p>
Full article ">
15 pages, 4038 KiB  
Article
A Practical Pole-to-Ground Fault Current Calculation Method for Symmetrical Monopole DC Grids
by Ying Xu, Wei Kuang, Baohong Li, Xiaopeng Li, Tierui Zou, Qin Jiang and Yiping Luo
Electronics 2024, 13(21), 4245; https://doi.org/10.3390/electronics13214245 - 29 Oct 2024
Viewed by 615
Abstract
At present, DC grid fault current analyses are usually based on numerical analyses and/or simulations. To make fault current analyses more practical and convenient, this study proposes a fast fault current level assessment methodology that is applicable when a symmetrical monopole DC (SMDC) [...] Read more.
At present, DC grid fault current analyses are usually based on numerical analyses and/or simulations. To make fault current analyses more practical and convenient, this study proposes a fast fault current level assessment methodology that is applicable when a symmetrical monopole DC (SMDC) system encounters a pole-to-ground (PTG) fault. To further clarify how PTG faults develop in SMDC systems, fault current analysis is implemented in the frequency domain rather than the time domain. Specifically, we find the key factors that impact the high-frequency domain, as these factors have a high correlation with fault currents in the initial milliseconds. Based on simplified SMDC fault circuits and a high-frequency characteristic analysis, a practical index to assess PTG faults is ultimately proposed. It is proved that the index can be used for various SMDC systems with different topologies. With the proposed method, the topology of a DC grid can be optimized to decrease the fault current level, which can help with the design and construction of practical DC grid projects. Full article
(This article belongs to the Section Industrial Electronics)
Show Figures

Figure 1

Figure 1
<p>Equivalent circuit of SMDC system.</p>
Full article ">Figure 2
<p>The discharge paths for the PTG fault.</p>
Full article ">Figure 3
<p>PTG current assessment using the superposition theorem.</p>
Full article ">Figure 4
<p>The converter’s related inductance, resistance, and capacitor impedance in the frequency domain.</p>
Full article ">Figure 5
<p>The equivalent fault circuit.</p>
Full article ">Figure 6
<p>The equivalent fault circuit without the arm equivalent impedance.</p>
Full article ">Figure 7
<p>Equivalent circuit transformation.</p>
Full article ">Figure 8
<p>Decoupling of the loop network: (<b>a</b>) a triangular loop network and (<b>b</b>) the division of the loop network into two radial networks.</p>
Full article ">Figure 9
<p>Simplified model of complex DC grid for fault current analysis.</p>
Full article ">Figure 10
<p>The magnitude plots of the equivalent components.</p>
Full article ">Figure 11
<p>The six-terminal ring SMDC grid used for verification.</p>
Full article ">Figure 12
<p>Fault current comparison results after 6 ms.</p>
Full article ">Figure 13
<p>Different SMDC grid structures.</p>
Full article ">Figure 14
<p>Fault current assessment index verification results.</p>
Full article ">Figure 15
<p>Fault current level assessment using the proposed index.</p>
Full article ">Figure 16
<p>Distance matrix <span class="html-italic">D</span>.</p>
Full article ">Figure 17
<p>The binary identification code.</p>
Full article ">Figure 18
<p>Comparison of maximum fault current levels for different topologies when the active power is zero.</p>
Full article ">Figure 19
<p>Comparison of fault current levels following consideration of practical constraints.</p>
Full article ">
33 pages, 355 KiB  
Article
A Comprehensive Review of MI-HFE and IPHFE Cryptosystems: Advances in Internal Perturbations for Post-Quantum Security
by Yong Wang, Lingyue Li, Ying Zhou and Huili Zhang
Axioms 2024, 13(11), 741; https://doi.org/10.3390/axioms13110741 - 29 Oct 2024
Viewed by 539
Abstract
The RSA cryptosystem has been a cornerstone of modern public key infrastructure; however, recent advancements in quantum computing and theoretical mathematics pose significant risks to its security. The advent of fully operational quantum computers could enable the execution of Shor’s algorithm, which efficiently [...] Read more.
The RSA cryptosystem has been a cornerstone of modern public key infrastructure; however, recent advancements in quantum computing and theoretical mathematics pose significant risks to its security. The advent of fully operational quantum computers could enable the execution of Shor’s algorithm, which efficiently factors large integers and undermines the security of RSA and other cryptographic systems reliant on discrete logarithms. While Grover’s algorithm presents a comparatively lesser threat to symmetric encryption, it still accelerates key search processes, creating potential vulnerabilities. In light of these challenges, there has been an intensified focus on developing quantum-resistant cryptography. Current research is exploring cryptographic techniques based on error-correcting codes, lattice structures, and multivariate public key systems, all of which leverage the complexity of NP-hard problems, such as solving multivariate quadratic equations, to ensure security in a post-quantum landscape. This paper reviews the latest advancements in quantum-resistant encryption methods, with particular attention to the development of robust trapdoor functions. It also provides a detailed analysis of prominent multivariate cryptosystems, including the Matsumoto–Imai, Oil and Vinegar, and Polly Cracker schemes, alongside recent progress in lattice-based systems such as Kyber and Crystals-DILITHIUM, which are currently under evaluation by NIST for potential standardization. As the capabilities of quantum computing continue to expand, the need for innovative cryptographic solutions to secure digital communications becomes increasingly critical. Full article
18 pages, 3123 KiB  
Article
Design and Performance Evaluation of an Authentic End-to-End Communication Model on Large-Scale Hybrid IPv4-IPv6 Virtual Networks to Detect MITM Attacks
by Zeeshan Ashraf, Adnan Sohail and Muddesar Iqbal
Cryptography 2024, 8(4), 49; https://doi.org/10.3390/cryptography8040049 - 28 Oct 2024
Viewed by 779
Abstract
After the end of IPv4 addresses, the Internet is moving towards IPv6 address architecture quickly with the support of virtualization techniques worldwide. IPv4 and IPv6 protocols will co-exist long during the changeover process. Some attacks, such as MITM attacks, do not discriminate by [...] Read more.
After the end of IPv4 addresses, the Internet is moving towards IPv6 address architecture quickly with the support of virtualization techniques worldwide. IPv4 and IPv6 protocols will co-exist long during the changeover process. Some attacks, such as MITM attacks, do not discriminate by appearance and affect IPv4 and IPv6 address architectures. In an MITM attack, the attacker secretly captures the data, masquerades as the original sender, and sends it toward the receiver. The receiver replies to the attacker because the receiver does not authenticate the source. Therefore, the authentication between two parties is compromised due to an MITM attack. The existing authentication schemes adopt complicated mathematical procedures. Therefore, the existing schemes increase computation and communication costs. This paper proposes a lightweight and authentic end-to-end communication model to detect MITM attacks using a pre-shared symmetric key. In addition, we implement and analyze the performance of our proposed security model on Linux-based virtual machines connected to large-scale hybrid IPv4-IPv6 virtual networks. Moreover, security analyses prove the effectiveness of our proposed model. Finally, we compare the performance of our proposed security model with existing models in terms of computation cost and communication overhead. Full article
Show Figures

Figure 1

Figure 1
<p>IPv6 adoption.</p>
Full article ">Figure 2
<p>MITM attack.</p>
Full article ">Figure 3
<p>Authentic client–server communication model.</p>
Full article ">Figure 4
<p>Key exchange and authentication process.</p>
Full article ">Figure 5
<p>MITM attack detection.</p>
Full article ">Figure 6
<p>Results through AVISPA.</p>
Full article ">Figure 7
<p>Hybrid IPv4-IPv6 Experimental Setup.</p>
Full article ">Figure 8
<p>Output on server.</p>
Full article ">Figure 9
<p>Output on client.</p>
Full article ">Figure 10
<p>Convergence time over hybrid IPv4-IPv6 networks.</p>
Full article ">Figure 11
<p>RTT for IPv4-IPv6 networks.</p>
Full article ">Figure 12
<p>Throughput for IPv4-IPv6 networks.</p>
Full article ">Figure 13
<p>Jitter for IPv4-IPv6 Networks.</p>
Full article ">Figure 14
<p>Packet loss ratio for IPv4-IPv6 networks.</p>
Full article ">
13 pages, 3027 KiB  
Article
Optical and Amplified Spontaneous Emission Properties of 4H-Pyran-4-Ylidene-2-Cyanoacetate Fragment Containing 2-Cyanoacetic Acid Derivative in PVK, PSU, or PS Matrix
by Patricija Paulsone, Julija Pervenecka, Elmars Zarins, Valdis Kokars and Aivars Vembris
Solids 2024, 5(4), 520-532; https://doi.org/10.3390/solids5040035 - 19 Oct 2024
Viewed by 523
Abstract
Organic solid-state lasers are highly promising devices known for their low-cost fabrication processes and compact sizes and the tunability of their emission spectrum. These lasers are in high demand across various industries including biomedicine, sensors, communications, spectroscopy, and military applications. A key requirement [...] Read more.
Organic solid-state lasers are highly promising devices known for their low-cost fabrication processes and compact sizes and the tunability of their emission spectrum. These lasers are in high demand across various industries including biomedicine, sensors, communications, spectroscopy, and military applications. A key requirement for light-emitting materials used in a light-amplifying medium is a low threshold value of the excitation energy of the amplified spontaneous emission (ASE). A newly synthesized non-symmetric red-light-emitting laser dye, Ethyl 2-(2-(4-(bis(2-(trityloxy)ethyl)amino)styryl)-6-tert butyl-4H-pyran-4-ylidene)-2-cyanoacetate (KTB), has shown great promise in meeting this requirement. KTB, with its attached bulky trityloxyethyl groups, has the ability to form amorphous thin films from a solution using a wet-casting method. Recent experiments have demonstrated that KTB exhibits a low ASE threshold value. This study focused on investigating the optical and amplified spontaneous emission properties of KTB in poly(N-vinylcarbazole) (PVK), polysulfone (PSU), and polystyrene (PS) matrices at various concentrations. The results showed that as the concentration of the dye increased, a redshift of the photoluminescence and ASE spectra occurred due to the solid-state solvation effect. The lowest ASE threshold value of 9 µJ/cm2 was achieved with a 20 wt% concentration of KTB in a PVK matrix, making it one of the lowest excitation threshold energies reported to date. Full article
Show Figures

Figure 1

Figure 1
<p>Chemical structure of KTB.</p>
Full article ">Figure 2
<p>Light confinement in the planar waveguide for (<b>a</b>) PVK, (<b>b</b>) PSU, and (<b>c</b>) PS. Calculations were conducted in the OMS program.</p>
Full article ">Figure 3
<p>High-resolution optical images of the samples’ surface morphologies. The sample composition and organic compound concentration in polymer is shown in each subfigure. Optical images were obtained at ×200 magnification.</p>
Full article ">Figure 4
<p>Absorption spectra of thin films of 20 wt% of investigated compound in different matrices. Absorption spectrum for neat KTB thin film is given for comparison.</p>
Full article ">Figure 5
<p>(<b>a</b>) Photoluminescence spectra of 20 wt% KTB compound in different polymers. (<b>b</b>) Wavelength of photoluminescence maximum at different KTB concentrations.</p>
Full article ">Figure 6
<p>Dependence of photoluminescence quantum yield on the laser dye concentration in PVK, PS, and PSU matrices.</p>
Full article ">Figure 7
<p>Amplified spontaneous emission spectra at different dye concentrations in the (<b>a</b>) PVK, (<b>b</b>) PSU, and (<b>c</b>) PS matrices. (<b>d</b>) Dependence of ASE maximum wavelength on dye concentration.</p>
Full article ">Figure 8
<p>Amplified spontaneous emission excitation threshold energy at different KTB dye concentrations. Insert: determination of ASE threshold energy for 20 wt% of KTB in PVK matrix.</p>
Full article ">
12 pages, 3136 KiB  
Article
Stiffness Hardening Effect of Wire Rope Isolators under Small Cyclic Loads for Vibration Isolation
by Mingyang Fu and Zhenyu Yang
Materials 2024, 17(20), 4983; https://doi.org/10.3390/ma17204983 - 11 Oct 2024
Viewed by 600
Abstract
Wire rope isolator (WRI) devices are widely used in vibration reduction industrial equipment, and stiffness is the key parameter that determines isolation effectiveness. WRI devices show slight nonlinearity under small loads, and the manufacturers generally only provide the initial parameters. To investigate the [...] Read more.
Wire rope isolator (WRI) devices are widely used in vibration reduction industrial equipment, and stiffness is the key parameter that determines isolation effectiveness. WRI devices show slight nonlinearity under small loads, and the manufacturers generally only provide the initial parameters. To investigate the mechanical behavior changes in the WRI devices under repeated loads, five types of WRI specimens were tested under various amplitudes, loading speeds, and preloads. The test results of large symmetrical compression and tension loads showed that the WRI devices demonstrated stable hysteresis curves under repeated loads, while the hysteresis curves were independent of the loading speed. The test results of small cyclic loads with large preloads show that the stiffness of the WRI specimen follows the logarithmic law, with the cycle number under various loading conditions. Particularly, the stiffness of the specimen increases by about 10–30% after 50 cycles. The initial stiffness Ka decreases linearly with the preloads, while the decrease is quadratic in relation to the cyclic load. The hardening coefficient Ca shows a positive correlation with the loading capacity of the WRI devices, while it shows a negative correlation with the preload and cyclic load amplitudes. It is recommended to consider the stiffness increase in the WRI devices during the evaluation of isolation effectiveness. Full article
Show Figures

Figure 1

Figure 1
<p>The test specimen of the WRI specimen.</p>
Full article ">Figure 2
<p>Photo and components of the test machine.</p>
Full article ">Figure 3
<p>The force–deformation curve of the WRI specimen under repeated loads.</p>
Full article ">Figure 4
<p>The force–deformation curve of the WRI specimen at the first and last cycles.</p>
Full article ">Figure 5
<p>The force–deformation curve of WRI specimen under various loading speeds.</p>
Full article ">Figure 6
<p>The force–deformation curve of WRI specimens under small loads.</p>
Full article ">Figure 7
<p>The axial stiffness of the WRI specimen.</p>
Full article ">Figure 8
<p>WRI device stiffness changes in various scenarios.</p>
Full article ">Figure 9
<p>WRI device stiffness changes under various preloads and load amplitudes.</p>
Full article ">Figure 10
<p>WRI device stiffness changes for various WRI devices.</p>
Full article ">Figure 11
<p>The fitted coefficient of stiffness change curves.</p>
Full article ">
33 pages, 15174 KiB  
Article
Liquid Rocket Engine Performance Characterization Using Computational Modeling: Preliminary Analysis and Validation
by Md. Amzad Hossain, Austin Morse, Iram Hernandez, Joel Quintana and Ahsan Choudhuri
Aerospace 2024, 11(10), 824; https://doi.org/10.3390/aerospace11100824 - 8 Oct 2024
Viewed by 866
Abstract
The need to refuel future missions to Mars and the Moon via in situ resource utilization (ISRU) requires the development of LOX/LCH4 engines, which are complex and expensive to develop and improve. This paper discusses how the use of digital engineering—specifically physics-based modeling [...] Read more.
The need to refuel future missions to Mars and the Moon via in situ resource utilization (ISRU) requires the development of LOX/LCH4 engines, which are complex and expensive to develop and improve. This paper discusses how the use of digital engineering—specifically physics-based modeling (PBM)—can aid in developing, testing, and validating a LOX/LCH4 engine. The model, which focuses on propulsion performance and heat transfer through the engine walls, was created using Siemens’ STAR-CCM+ CFD tool. Key features of the model include Eulerian multiphase physics (EMP), complex chemistry (CC) using the eddy dissipation concept (EDC), and segregated solid energy (SSE) for heat transfer. A comparison between the complete GRI 3.0 and Lu’s reduced combustion mechanisms was performed, with Lu’s mechanism being chosen for its cost-effectiveness and similar output to the GRI mechanism. The model’s geometry represents 1/8th of the engine’s volume, with a symmetric rotational boundary. The performance of this engine was investigated using NASA’s chemical equilibrium analysis (CEA) and STAR-CCM+ simulations, focusing on thrust levels of 125 lbf and 500 lbf. Discrepancies between theoretical predictions and simulations ranged from 1.4% to 28.5%, largely due to differences in modeling assumptions. While NASA CEA has a zero-dimensional, steady-state approach based on idealized conditions, STAR-CCM+ accounts for real-world factors such as multiphase flow, turbulence, and heat loss. For the 125 lbf case, a 9.2% deviation in combustion chamber temperature and a 15.0% difference in thrust were noted, with simulations yielding 113.48 lbf compared to the CEA’s 133.52 lbf. In the 500 lbf case, thrust reached 488 lbf, showing a 2.4% deviation from the design target and an 8.6% increase over CEA predictions. Temperature and pressure deviations were also observed, with the highest engine wall temperature at the nozzle throat. Monte Carlo simulations revealed that substituting LNG for LCH4 affects combustion dynamics. The findings emphasize the need for advanced modeling approaches to enhance the prediction accuracy of rocket engine performance, aiding in the development of digital twins for the CROME. Full article
Show Figures

Figure 1

Figure 1
<p>Distribution of combustion temperatures and relative errors compared to 100% methane combustion for 5000 random LNG mixtures.</p>
Full article ">Figure 2
<p>Distribution of ratio of specific heats and its relative errors compared to 100% methane combustion for 5000 random LNG mixtures.</p>
Full article ">Figure 3
<p>Distribution of combustion temperatures vs. methane mass fraction.</p>
Full article ">Figure 4
<p>Temperature fields for GRI-3.0 (<b>Top</b>) and Lu (<b>Bottom</b>) at 0 PSI gage pressure.</p>
Full article ">Figure 5
<p>Temperature fields for GRI-3.0 (<b>Top</b>) and Lu (<b>Bottom</b>) at 125 PSI gage pressure.</p>
Full article ">Figure 6
<p>Temperature fields for GRI-3.0 (<b>Top</b>) and Lu (<b>Bottom</b>) at 250 PSI gage pressure.</p>
Full article ">Figure 7
<p>Ratio of specific heat fields for GRI-3.0 (<b>Top</b>) and Lu (<b>Bottom</b>) at 0 PSI gage pressure.</p>
Full article ">Figure 8
<p>Ratio of specific heat fields for GRI-3.0 (<b>Top</b>) and Lu (<b>Bottom</b>) at 125 PSI gage pressure.</p>
Full article ">Figure 9
<p>Ratio of specific heat fields for GRI-3.0 (<b>Top</b>) and Lu (<b>Bottom</b>) at 250 PSI gage pressure.</p>
Full article ">Figure 10
<p>Lagrangian multiphase spray and impingement pattern.</p>
Full article ">Figure 11
<p>Grid for solid and fluid geometries.</p>
Full article ">Figure 12
<p>Thrust and chamber pressure plot for every iteration.</p>
Full article ">Figure 13
<p>Temperature gradient for inner volume in the X-Y plane.</p>
Full article ">Figure 14
<p>Surface temperature gradient for the engine wall (<b>left</b>) and the engine nozzle section (<b>right</b>).</p>
Full article ">Figure 15
<p>Pressure gradient for entire inner volume.</p>
Full article ">Figure 16
<p>Mach number gradient for entire inner volume (<b>left</b>) and for the nozzle outlet (<b>right</b>).</p>
Full article ">Figure 17
<p>Y+ values and TKE along the inner volume of the outer wall.</p>
Full article ">Figure 18
<p>Engine performance parameters observed in both CEA and CFD analyses at F = 125 lbf.</p>
Full article ">Figure 19
<p>One-eight thrust and chamber pressure plot for every iteration.</p>
Full article ">Figure 20
<p>Surface temperature contours at steady state.</p>
Full article ">Figure 21
<p>Gas temperature contours at steady state.</p>
Full article ">Figure 22
<p>Mach distribution contours at steady state.</p>
Full article ">Figure 23
<p>Steady-state pressure distribution within chamber.</p>
Full article ">Figure 24
<p>Engine performance parameters observed in both CEA and CFD analyses at F = 500 lbf.</p>
Full article ">
37 pages, 1076 KiB  
Article
Distributed Ledger-Based Authentication and Authorization of IoT Devices in Federated Environments
by Michał Jarosz, Konrad Wrona and Zbigniew Zieliński
Electronics 2024, 13(19), 3932; https://doi.org/10.3390/electronics13193932 - 4 Oct 2024
Viewed by 764
Abstract
One of the main security challenges when federating separate Internet of Things (IoT) administrative domains is effective Identity and Access Management, which is required to establish trust and secure communication between federated IoT devices. The primary goal of the work is to develop [...] Read more.
One of the main security challenges when federating separate Internet of Things (IoT) administrative domains is effective Identity and Access Management, which is required to establish trust and secure communication between federated IoT devices. The primary goal of the work is to develop a “lightweight” protocol to enable authentication and authorization of IoT devices in federated environments and ensure the secure communication of IoT devices. We propose a novel Lightweight Authentication and Authorization Framework for Federated IoT (LAAFFI) which takes advantage of the unique fingerprint of IoT devices based on their configuration and additional hardware modules, such as Physical Unclonable Function, to provide flexible authentication and authorization based on Distributed Ledger technology. Moreover, LAAFFI supports IoT devices with limited computing resources and devices not equipped with secure storage space. We implemented a prototype of LAAFFI and evaluated its performance in the Hyperledger Fabric-based IoT framework. Three main metrics were evaluated: latency, throughput (number of operations or transactions per second), and network resource utilization rate (transmission overhead introduced by the LAAFFI protocol). The performance tests conducted confirmed the high efficiency and suitability of the protocol for federated IoT environments. Also, all LAAFFI components are scalable as confirmed by tests. We formally evaluated LAAFFI security using Verifpal as a formal verification tool. Based on the models developed for Verifpal, we validated their security properties, such as message secrecy, authenticity, and freshness. Our results show that the proposed solution can improve the security of federated IoT environments while providing zero-day interoperability and high scalability. Compared to existing solutions, LAAFFI is more efficient due to the use of symmetric cryptography and algorithms adapted for operations involving IoT devices. LAAFFI supports multiple authorization mechanisms, and since it also offers authentication and accountability, it meets the requirements of Authentication, Authorization and Accounting (AAA). It uses Distributed Ledger (DL) and smart contracts to ensure that the request complies with the policies agreed between the organizations. LAAFFI offers authentication of devices belonging to a single organization and different organizations, with the assurance that the encryption key will be shared with another device only if the appropriate security policy is met. The proposed protocol is particularly useful for ensuring the security of federated IoT environments created ad hoc for special missions, e.g., operations conducted by NATO countries and disaster relief operations Humanitarian Assistance and Disaster Relief (HADR) involving military forces and civilian services, where immediate interoperability is required. Full article
(This article belongs to the Special Issue Security and Trust in Internet of Things and Edge Computing)
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>Communication between the IoT device and a ledger node during the registration phase.</p>
Full article ">Figure 2
<p>Communication between an IoT device and the distributed ledger.</p>
Full article ">Figure 3
<p>The procedure of communication between IoT devices.</p>
Full article ">Figure 4
<p>The method of generating pseudorandom numbers in the Linux operating system since version 5.6. Source: Own design based on [<a href="#B12-electronics-13-03932" class="html-bibr">12</a>].</p>
Full article ">Figure 5
<p>A federated IoT network with two organizations with two DL nodes each.</p>
Full article ">Figure 6
<p>Overhead data transferred during our tests.</p>
Full article ">
16 pages, 6662 KiB  
Article
Fully Automated Detection of the Appendix Using U-Net Deep Learning Architecture in CT Scans
by Betül Tiryaki Baştuğ, Gürkan Güneri, Mehmet Süleyman Yıldırım, Kadir Çorbacı and Emre Dandıl
J. Clin. Med. 2024, 13(19), 5893; https://doi.org/10.3390/jcm13195893 - 2 Oct 2024
Cited by 1 | Viewed by 1014
Abstract
Background: The accurate segmentation of the appendix with well-defined boundaries is critical for diagnosing conditions such as acute appendicitis. The manual identification of the appendix is time-consuming and highly dependent on the expertise of the radiologist. Method: In this study, we propose a [...] Read more.
Background: The accurate segmentation of the appendix with well-defined boundaries is critical for diagnosing conditions such as acute appendicitis. The manual identification of the appendix is time-consuming and highly dependent on the expertise of the radiologist. Method: In this study, we propose a fully automated approach to the detection of the appendix using deep learning architecture based on the U-Net with specific training parameters in CT scans. The proposed U-Net architecture is trained on an annotated original dataset of abdominal CT scans to segment the appendix efficiently and with high performance. In addition, to extend the training set, data augmentation techniques are applied for the created dataset. Results: In experimental studies, the proposed U-Net model is implemented using hyperparameter optimization and the performance of the model is evaluated using key metrics to measure diagnostic reliability. The trained U-Net model achieved the segmentation performance for the detection of the appendix in CT slices with a Dice Similarity Coefficient (DSC), Volumetric Overlap Error (VOE), Average Symmetric Surface Distance (ASSD), Hausdorff Distance 95 (HD95), Precision (PRE) and Recall (REC) of 85.94%, 23.29%, 1.24 mm, 5.43 mm, 86.83% and 86.62%, respectively. Moreover, our model outperforms other methods by leveraging the U-Net’s ability to capture spatial context through encoder–decoder structures and skip connections, providing a correct segmentation output. Conclusions: The proposed U-Net model showed reliable performance in segmenting the appendix region, with some limitations in cases where the appendix was close to other structures. These improvements highlight the potential of deep learning to significantly improve clinical outcomes in appendix detection. Full article
(This article belongs to the Topic AI in Medical Imaging and Image Processing)
Show Figures

Figure 1

Figure 1
<p>Block diagram of the proposed detection system for the fully automated detection of appendix region in CT scans.</p>
Full article ">Figure 2
<p>Sample slices from the dataset indicating the annotated appendix regions with GT masks.</p>
Full article ">Figure 3
<p>Proposed U-Net deep learning architecture for automated detection of appendix.</p>
Full article ">Figure 4
<p>The effect of the data augmentation procedures on some CT scans and GT masks in the dataset.</p>
Full article ">Figure 5
<p>(<b>a</b>) Training loss and (<b>b</b>) DSC development during test phase for U-Net, DenseNet, and Res U-Net methods.</p>
Full article ">Figure 6
<p>The appendix regions successfully detected and segmented on CT slices using the proposed U-Net deep learning architecture during the experimental studies. Red: ground truth mask for appendix, yellow: U-Net segmentation for appendix.</p>
Full article ">Figure 7
<p>Some examples of unsuccessful appendix detection and segmentation by the proposed U-Net model. Red: ground truth mask for appendix, yellow: U-Net segmentation for appendix.</p>
Full article ">Figure 8
<p>Boxplot showing the performance metrics for appendix segmentation obtained using the proposed U-Net deep learning architecture and other models in the study.</p>
Full article ">Figure 9
<p>The comparison of the appendix segmentation performances of the proposed U-Net deep learning model and other state-of-the-art DenseNet and Res U-Net architectures on the same CT slices.</p>
Full article ">
37 pages, 762 KiB  
Article
Authenticated Multicast in Tiny Networks via an Extremely Low-Bandwidth Medium
by Mirosław Kutyłowski, Adrian Cinal, Przemysław Kubiak and Denys Korniienko
Appl. Sci. 2024, 14(17), 7962; https://doi.org/10.3390/app14177962 - 6 Sep 2024
Viewed by 469
Abstract
We consider authenticating multicast messages in the case of extremely narrow communication channels, such as underwater acoustic communication, with devices such as mobile sensors creating a self-organizing autonomous network. Channel characteristics in this scenario prevent the application of digital signatures (and asymmetric cryptography [...] Read more.
We consider authenticating multicast messages in the case of extremely narrow communication channels, such as underwater acoustic communication, with devices such as mobile sensors creating a self-organizing autonomous network. Channel characteristics in this scenario prevent the application of digital signatures (and asymmetric cryptography in general), as it would consume too much of the available bandwidth. As communication is relatively sparse, standard symmetric methods such as TESLA have limited application in this scenario as well. Driven by real-world requirements, we focus on tiny networks of only a few nodes. This paper discusses two issues: (a) strategies of key predistribution enabling flexible creation of multicast groups; (b) authenticating multicast messages in a way that prevents an attacker impersonating the sender by subverting one or more receiver nodes and learning the symmetric keys stored by these nodes. For tiny networks, we show that scalable and asymptotically efficient solutions might be useless, and that specially tailored combinatorial approaches may confer some advantage. Full article
(This article belongs to the Section Electrical, Electronics and Communications Engineering)
Show Figures

Figure 1

Figure 1
<p>An example of underwater network of UUVs with one-to-one communication to the central unit.</p>
Full article ">Figure 2
<p>An example of multicast groups; the sender is the central unit.</p>
Full article ">Figure 3
<p>Internal and external attacks on multicast communication.</p>
Full article ">Figure 4
<p>Wormwhole attack.</p>
Full article ">Figure 5
<p>A separating family <math display="inline"><semantics> <mrow> <msub> <mi>F</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>F</mi> <mn>5</mn> </msub> </mrow> </semantics></math> obtained by connecting the nodes <math display="inline"><semantics> <mrow> <msub> <mi>F</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>F</mi> <mn>5</mn> </msub> </mrow> </semantics></math> by edges labeled 1 through 10. The obtained solution is <math display="inline"><semantics> <mrow> <msub> <mi>F</mi> <mn>1</mn> </msub> <mo>=</mo> <mrow> <mo>{</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>4</mn> <mo>,</mo> <mn>6</mn> <mo>}</mo> </mrow> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>F</mi> <mn>2</mn> </msub> <mo>=</mo> <mrow> <mo>{</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> <mo>,</mo> <mn>7</mn> <mo>,</mo> <mn>10</mn> <mo>}</mo> </mrow> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>F</mi> <mn>3</mn> </msub> <mo>=</mo> <mrow> <mo>{</mo> <mn>5</mn> <mo>,</mo> <mn>6</mn> <mo>,</mo> <mn>7</mn> <mo>,</mo> <mn>8</mn> <mo>}</mo> </mrow> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>F</mi> <mn>4</mn> </msub> <mo>=</mo> <mrow> <mo>{</mo> <mn>4</mn> <mo>,</mo> <mn>8</mn> <mo>,</mo> <mn>9</mn> <mo>,</mo> <mn>10</mn> <mo>}</mo> </mrow> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>F</mi> <mn>5</mn> </msub> <mo>=</mo> <mrow> <mo>{</mo> <mn>1</mn> <mo>,</mo> <mn>3</mn> <mo>,</mo> <mn>5</mn> <mo>,</mo> <mn>9</mn> <mo>}</mo> </mrow> </mrow> </semantics></math>.</p>
Full article ">Figure 6
<p>An optimal separating family for five nodes consisting of four sets <math display="inline"><semantics> <mrow> <msub> <mi>F</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>F</mi> <mn>4</mn> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 7
<p>An optimal separating family for six nodes consisting of four sets <math display="inline"><semantics> <mrow> <msub> <mi>F</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>F</mi> <mn>4</mn> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 8
<p>An optimal separating family for ten nodes consisting of five sets <math display="inline"><semantics> <mrow> <msub> <mi>F</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>F</mi> <mn>5</mn> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 9
<p>Set <math display="inline"><semantics> <mrow> <msub> <mi>F</mi> <mn>1</mn> </msub> <mo>∈</mo> <mi mathvariant="script">SF</mi> </mrow> </semantics></math> separates 1 from <math display="inline"><semantics> <mrow> <mn>2</mn> <mo>,</mo> <mn>3</mn> </mrow> </semantics></math>, while <math display="inline"><semantics> <msub> <mi>F</mi> <mn>2</mn> </msub> </semantics></math> does not separate 2 from 1 and 3.</p>
Full article ">Figure 10
<p>Traces in case A: Each trace is represented by an arch where the endpoints are the elements of a trace; <math display="inline"><semantics> <msub> <mi>F</mi> <mn>1</mn> </msub> </semantics></math>, …<math display="inline"><semantics> <msub> <mi>F</mi> <mn>6</mn> </msub> </semantics></math> are labels of the corresponding sets in <math display="inline"><semantics> <mi mathvariant="script">SF</mi> </semantics></math>.</p>
Full article ">Figure 11
<p>Traces in case B: Each trace is represented by an arch where the endpoints are the elements of a trace; <math display="inline"><semantics> <msub> <mi>W</mi> <mn>1</mn> </msub> </semantics></math>, …<math display="inline"><semantics> <msub> <mi>W</mi> <mn>7</mn> </msub> </semantics></math> are labels of the corresponding sets in <math display="inline"><semantics> <mi mathvariant="script">SF</mi> </semantics></math>.</p>
Full article ">Figure 12
<p>Three possible pairs of sets <math display="inline"><semantics> <msub> <mi>F</mi> <mi>a</mi> </msub> </semantics></math> with disjoint traces; each pair is shown in a different color.</p>
Full article ">Figure 13
<p>Example profiles of element 1; each element from <math display="inline"><semantics> <msup> <mi mathvariant="script">SF</mi> <mo>′</mo> </msup> </semantics></math> containing 1 is represented by an arch.</p>
Full article ">Figure 14
<p>Traces of sets in <math display="inline"><semantics> <msup> <mi mathvariant="script">SF</mi> <mo>′</mo> </msup> </semantics></math> when <math display="inline"><semantics> <mrow> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> </mrow> </semantics></math> have <math display="inline"><semantics> <mrow> <mi mathvariant="sans-serif">m</mi> <mspace width="-0.166667em"/> <mspace width="-0.166667em"/> <mo>−</mo> <mspace width="-0.166667em"/> <mspace width="-0.166667em"/> <mi mathvariant="sans-serif">profile</mi> </mrow> </semantics></math>.</p>
Full article ">Figure 15
<p>Traces of sets in <math display="inline"><semantics> <msup> <mi mathvariant="script">SF</mi> <mo>′</mo> </msup> </semantics></math> when <math display="inline"><semantics> <mrow> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> </mrow> </semantics></math> have <math display="inline"><semantics> <mrow> <mi mathvariant="sans-serif">I</mi> <mspace width="-0.166667em"/> <mspace width="-0.166667em"/> <mo>−</mo> <mspace width="-0.166667em"/> <mspace width="-0.166667em"/> <mi mathvariant="sans-serif">profile</mi> </mrow> </semantics></math>.</p>
Full article ">
Back to TopTop