[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
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

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (625)

Search Parameters:
Keywords = topological constraint

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
25 pages, 778 KiB  
Article
DRL-Based Dynamic SFC Orchestration Algorithm for LEO Satellite Networks
by Ziyi Zhang, Hefei Hu and You Wu
Electronics 2025, 14(1), 56; https://doi.org/10.3390/electronics14010056 - 26 Dec 2024
Viewed by 217
Abstract
Low-Earth-Orbit (LEO) satellite networks face unique challenges in service function chain (SFC) orchestration due to their dynamic topology and resource constraints, making traditional terrestrial network solutions inadequate. This study addresses the challenge of maximizing service provider benefits through efficient SFC deployment and readjustment [...] Read more.
Low-Earth-Orbit (LEO) satellite networks face unique challenges in service function chain (SFC) orchestration due to their dynamic topology and resource constraints, making traditional terrestrial network solutions inadequate. This study addresses the challenge of maximizing service provider benefits through efficient SFC deployment and readjustment in LEO satellite networks. We propose PPOSFC, a novel dynamic SFC orchestration algorithm based on Proximal Policy Optimization (PPO), which incorporates future topology information into the decision-making process. The algorithm models the orchestration problem as a Markov decision process and employs a dual-objective optimization approach considering both deployment success rate and readjustment costs. Simulation results demonstrate that PPOSFC achieves a 13.07% increase in cumulative profit and improves deployment success rates by 6.78% compared to existing algorithms. The algorithm exhibits superior performance in both high and low user service request intensity, effectively balancing service quality and operational efficiency. Furthermore, our analysis reveals that incorporating predicted topology information significantly enhances orchestration performance. Full article
(This article belongs to the Section Networks)
Show Figures

Figure 1

Figure 1
<p>Flowchart of DRL-based dynamic SFC orchestration algorithm for LEO satellite networks.</p>
Full article ">Figure 2
<p>Algorithm performance on optimization objectives across different user request arrival rates: (<b>a</b>) total profits; (<b>b</b>) cost from SFC readjustments; (<b>c</b>) service provision revenue.</p>
Full article ">Figure 3
<p>Algorithm performance on SFC orchestration success rates across different user request arrival rates: (<b>a</b>) deployment success rates; (<b>b</b>) readjustment success rates.</p>
Full article ">Figure 4
<p>SFC orchestration performance across different immediate reward parameters: (<b>a</b>) deployment success rates across different <math display="inline"><semantics> <mi>ζ</mi> </semantics></math>; (<b>b</b>) readjustment success rates across different <math display="inline"><semantics> <mi>ζ</mi> </semantics></math>; (<b>c</b>) deployment success rates across different <math display="inline"><semantics> <mi>θ</mi> </semantics></math>; (<b>d</b>) readjustment success rates across different <math display="inline"><semantics> <mi>θ</mi> </semantics></math>.</p>
Full article ">Figure 5
<p>Algorithm performance across different satellite configurations.</p>
Full article ">Figure 6
<p>Cumulative training rewards with different hyperparameters: (<b>a</b>) cumulative training rewards with different learning rates; (<b>b</b>) cumulative training rewards with different batch sizes.</p>
Full article ">
18 pages, 563 KiB  
Article
Energy-Efficient Connectivity Algorithm for Directional Sensor Networks in Edge Intelligence Systems
by Dingcheng Wu, Xueyong Xu, Chang Lu and Dapeng Mu
Symmetry 2025, 17(1), 20; https://doi.org/10.3390/sym17010020 - 26 Dec 2024
Viewed by 245
Abstract
The proliferation of edge intelligence systems necessitates efficient and reliable connectivity for sensor networks deployed at the edge. This paper proposes a novel energy-efficient connectivity algorithm called Constrained Angle-aware Connectivity Optimization (CA-Opt), designed for directional sensor networks to address the challenges of limited [...] Read more.
The proliferation of edge intelligence systems necessitates efficient and reliable connectivity for sensor networks deployed at the edge. This paper proposes a novel energy-efficient connectivity algorithm called Constrained Angle-aware Connectivity Optimization (CA-Opt), designed for directional sensor networks to address the challenges of limited resources and asymmetric network constraints in edge environments. CA-Opt constructs a hop-constrained, degree-bounded network topology while considering the directional coverage of sensor nodes. The algorithm incorporates an angle-aware child selection strategy to optimize the energy consumption by minimizing the number of active links and the total communication distance. Extensive simulations demonstrated that CA-Opt achieved comparable connectivity to the traditional Breadth-First Search (BFS) algorithms while significantly reducing the energy consumption. Furthermore, the impact of key parameters, such as the communication range, node density, maximum degree, and directional coverage angle, on CA-Opt’s performance was analyzed. The results underscore the potential of CA-Opt to balance asymmetry-driven connectivity control with energy-efficient operation, making it particularly suitable for resource-constrained edge applications, such as smart manufacturing, environmental monitoring, and intelligent transportation systems. Full article
(This article belongs to the Special Issue Symmetry and Asymmetry in Embedded Systems)
Show Figures

Figure 1

Figure 1
<p>Flowchart of the CA-Opt algorithm. The algorithm iterates over all nodes, constructing connectivity graphs using a modified BFS under hop and distance constraints (highlighted in light green). The AACS process (highlighted in light red) is invoked to select child nodes while satisfying degree-bounded constraints. The algorithm evaluates each graph and outputs the optimal connectivity graph with minimal total hops and distance.</p>
Full article ">Figure 2
<p>Illustration of an AACS with and without a parent node in Cartesian coordinates. Illustration of the AACS process. (<b>a</b>) Child selection without a parent node: node <span class="html-italic">i</span> evaluates neighbors <math display="inline"><semantics> <msub> <mi>j</mi> <mn>1</mn> </msub> </semantics></math> to <math display="inline"><semantics> <msub> <mi>j</mi> <mn>5</mn> </msub> </semantics></math>, identifying the optimal sector within angular coverage <math display="inline"><semantics> <mo>Φ</mo> </semantics></math>. (<b>b</b>) Child selection with a parent node: the algorithm considers the parent node to ensure the connectivity of the network.</p>
Full article ">Figure 3
<p>Illustration of the connectivity algorithm on a sample sensor network. Nodes are represented by circles, and connections are indicated by dashed arrows. Hop counts are represented by arrow colors: teal for 1-hop connections and orange for 2-hop connections. The shaded sectors illustrate the directional coverage angle (Φ = 120°) for the selected nodes, demonstrating the angle-aware child selection strategy. Note that the sector radius in this figure is scaled down for visual clarity and does not represent the actual communication range <math display="inline"><semantics> <mrow> <mi>R</mi> <mo> </mo> <mo>=</mo> <mo> </mo> <mn>80</mn> </mrow> </semantics></math>. The maximum number of children per node (<span class="html-italic">K</span>) is set to 3. (<b>a</b>) Source node 1; (<b>b</b>) optimal solution, where the source node is node 5.</p>
Full article ">Figure 4
<p>Impacts of key parameters on the connectivity rate (<math display="inline"><semantics> <msub> <mi>κ</mi> <mi>r</mi> </msub> </semantics></math>) of CA-Opt: (<b>a</b>) degree limit (<span class="html-italic">K</span>), (<b>b</b>) hop count limit (<span class="html-italic">H</span>), (<b>c</b>) communication range (<span class="html-italic">R</span>), and (<b>d</b>) coverage angle (<math display="inline"><semantics> <mo>Φ</mo> </semantics></math>). The results were averaged over 30 simulations.</p>
Full article ">Figure 5
<p>Performance comparison between CA-Opt and BFS with <math display="inline"><semantics> <mrow> <mi>N</mi> <mo> </mo> <mo>=</mo> <mo> </mo> <mn>30</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>H</mi> <mo> </mo> <mo>=</mo> <mo> </mo> <mn>10</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>K</mi> <mo> </mo> <mo>=</mo> <mo> </mo> <mn>5</mn> </mrow> </semantics></math>, and Φ = 180°. (<b>a</b>) Average hops, (<b>b</b>) total distance, and (<b>c</b>) average computation time as a function of the communication range (<span class="html-italic">R</span>). The communication range for BFS is dynamically adjusted to match the connectivity rates achieved by CA-Opt. The results were averaged over 30 simulations.</p>
Full article ">Figure 6
<p>Computation time of CA-Opt with increasing node numbers <span class="html-italic">N</span>. The solid line represents the experimental results, and the dashed curve is the quadratic fit with a coefficient of determination <math display="inline"><semantics> <mrow> <msup> <mi>R</mi> <mn>2</mn> </msup> <mo>=</mo> <mn>0.991</mn> </mrow> </semantics></math>.</p>
Full article ">
17 pages, 491 KiB  
Article
Kinetic Theory with Casimir Invariants—Toward Understanding of Self-Organization by Topological Constraints
by Zensho Yoshida
Entropy 2025, 27(1), 5; https://doi.org/10.3390/e27010005 - 25 Dec 2024
Viewed by 33
Abstract
A topological constraint, characterized by the Casimir invariant, imparts non-trivial structures in a complex system. We construct a kinetic theory in a constrained phase space (infinite-dimensional function space of macroscopic fields), and characterize a self-organized structure as a thermal equilibrium on a leaf [...] Read more.
A topological constraint, characterized by the Casimir invariant, imparts non-trivial structures in a complex system. We construct a kinetic theory in a constrained phase space (infinite-dimensional function space of macroscopic fields), and characterize a self-organized structure as a thermal equilibrium on a leaf of foliated phase space. By introducing a model of a grand canonical ensemble, the Casimir invariant is interpreted as the number of topological particles. Full article
Show Figures

Figure 1

Figure 1
<p>(<b>A</b>) The equilibrium on the leaf defined by <math display="inline"><semantics> <mi>μ</mi> </semantics></math>. (<b>B</b>) The equilibrium on the leaf defined by <math display="inline"><semantics> <mi>μ</mi> </semantics></math> and <math display="inline"><semantics> <msub> <mi>J</mi> <mo>‖</mo> </msub> </semantics></math>. Contours: Density distribution of magnetized plasma in the neighborhood of a point dipole. Curves: Magnetic field lines (level sets of <math display="inline"><semantics> <mi>ψ</mi> </semantics></math>). See [<a href="#B14-entropy-27-00005" class="html-bibr">14</a>].</p>
Full article ">
20 pages, 5693 KiB  
Article
Physics-Informed Neural Networks for Heat Pump Load Prediction
by Viorica Rozina Chifu, Tudor Cioara, Cristina Bianca Pop, Ionut Anghel and Andrei Pelle
Energies 2025, 18(1), 8; https://doi.org/10.3390/en18010008 - 24 Dec 2024
Viewed by 102
Abstract
Heat pumps are promising solutions for managing the increasing heating demand of residential houses, reducing the environmental impact when used with renewable energy. Accurate heat load predictions allow the heat pump to operate at the most efficient settings, maintaining comfortable temperatures while reducing [...] Read more.
Heat pumps are promising solutions for managing the increasing heating demand of residential houses, reducing the environmental impact when used with renewable energy. Accurate heat load predictions allow the heat pump to operate at the most efficient settings, maintaining comfortable temperatures while reducing excess energy use and lowering operating costs. Data-driven prediction solutions may have difficulty capturing the dynamics and nonlinearities of the thermodynamics involved. The physics-informed models combine the monitored observed data with theoretical knowledge of heat pumps and directly integrate physical constraints, allowing for better generalization and reducing the dependence on large volumes of data. However, they require detailed knowledge of the system topology and refrigerant parameters, which increases the model complexity. Therefore, in this paper, we propose a physics-informed neural network for predicting the heat load of heat pumps that integrates thermodynamics directly into the loss function of the neural network. We model the heat load as a function of the input variables, including the inlet temperature, outlet temperature, and water flow rate. We integrate the function during model training to reduce the model complexity. Our approach increases the accuracy of the predictions compared with data-driven models and generates prediction results that are consistent with the actual physical behavior of the heat pump. The results show superior prediction accuracy, with a 7.49% reduction in the RMSE and a 6.49% decrease in the MAPE, while the R2 value shows an increase of 0.02%. Full article
(This article belongs to the Section J: Thermal Management)
Show Figures

Figure 1

Figure 1
<p>The architecture of the PINN for heat pump load prediction.</p>
Full article ">Figure 2
<p>Correlation matrix showing the degree of correlation between the heat pump variables monitored.</p>
Full article ">Figure 3
<p>Heatmap illustrating the parameters’ range for the training dataset.</p>
Full article ">Figure 4
<p>Heatmap illustrating the parameters’ range for the validation dataset.</p>
Full article ">Figure 5
<p>Training and validation loss evolution across multiple epochs for the PINN.</p>
Full article ">Figure 6
<p>Histogram of the residuals for the PINN model.</p>
Full article ">Figure 7
<p>Box plot of the prediction errors for the PINN model.</p>
Full article ">Figure 8
<p>Heat load’s actual and predicted values with the PINN and NN.</p>
Full article ">Figure 9
<p>Genetic algorithm’s fitness evolution over generations.</p>
Full article ">Figure 10
<p>PINN’s hyperparameter distribution.</p>
Full article ">Figure 11
<p>Dynamic adjustment of the loss function’s α coefficient over the training epochs.</p>
Full article ">Figure 12
<p>Temperature cooling schedule over the training epochs for simulated annealing.</p>
Full article ">
12 pages, 3740 KiB  
Article
GPU-Accelerated CNN Inference for Onboard DQN-Based Routing in Dynamic LEO Satellite Networks
by Changgeun Yu, Daeyeon Kim, Heoncheol Lee and Myonghun Han
Aerospace 2024, 11(12), 1028; https://doi.org/10.3390/aerospace11121028 - 16 Dec 2024
Viewed by 382
Abstract
This paper addresses the issue of onboard inference for AI-based routing algorithms in dynamic LEO (Low Earth Orbit) satellite networks. In dynamic LEO networks, it is essential to maintain communication performance across varying topologies while considering link disconnections and overcoming computational constraints for [...] Read more.
This paper addresses the issue of onboard inference for AI-based routing algorithms in dynamic LEO (Low Earth Orbit) satellite networks. In dynamic LEO networks, it is essential to maintain communication performance across varying topologies while considering link disconnections and overcoming computational constraints for real-time inference on embedded boards. This paper proposes a GPU-based inference acceleration method to reduce the computation time required for real-time onboard inference of a Dueling DQN (Deep Q-Network)-based routing algorithm in dynamic LEO satellite networks. The approach is composed of memory management, low-level operations, and efficient indexing methods, which collectively enhance computational efficiency. As a result, the proposed method achieves approximately 2.4 times faster inference compared to conventional CPU-based approaches. Additionally, the kernel performance analysis reveals that the proposed method reaches 10% of the peak computational performance and 20% of the peak memory performance. This demonstrates the compatibility of the proposed method for integration with additional applications in the multitasking systems of LEO satellites. Full article
Show Figures

Figure 1

Figure 1
<p>Flowchart of onboard routing inference systems.</p>
Full article ">Figure 2
<p>The comparison of the routing inference architectures in the conventional and proposed methods. (<b>a</b>) In the conventional approach, all blocks of the inference are conducted only sequentially on a CPU. (<b>b</b>) In the proposed approach, several blocks of the inference are conducted in parallel on a GPU, which can reduce the overall computation time.</p>
Full article ">Figure 3
<p>Optimize processing by splitting the weights into distinct blocks and overriding only the parts of the input that correspond to those weights.</p>
Full article ">Figure 4
<p>Inference results of the Dueling Deep Q-Network-based routing simulation. (Blue is the starting position, red is the target position, black is the obstacles (link breaks), the green dot is the current position of the satellite, and the small square you follow is the path.)</p>
Full article ">Figure 4 Cont.
<p>Inference results of the Dueling Deep Q-Network-based routing simulation. (Blue is the starting position, red is the target position, black is the obstacles (link breaks), the green dot is the current position of the satellite, and the small square you follow is the path.)</p>
Full article ">Figure 5
<p>Comparative analysis of the inference operation times between the baseline and the proposed system.</p>
Full article ">Figure 6
<p>The peak performance profiling results of the proposed kernels.</p>
Full article ">
25 pages, 10692 KiB  
Article
An Analytical Framework for Global Dynamic Modeling of Flexible Variable Topology Mechanisms
by Ruihai Geng, Yushu Bian, Zhihui Gao, Yize Zhao and Peng Liu
Actuators 2024, 13(12), 519; https://doi.org/10.3390/act13120519 - 15 Dec 2024
Viewed by 419
Abstract
The coupling of topology transition with flexible deformation and rigid motion presents significant challenges in the dynamic modeling of flexible variable topology mechanisms. Existing dynamics models are mostly special-purpose models for their particular cases and thus struggle to completely depict the general topology [...] Read more.
The coupling of topology transition with flexible deformation and rigid motion presents significant challenges in the dynamic modeling of flexible variable topology mechanisms. Existing dynamics models are mostly special-purpose models for their particular cases and thus struggle to completely depict the general topology transition characteristics. To address this gap, this paper proposes an analytical framework for the global dynamic modeling of flexible variable topology mechanisms, focusing on general cases. Initially, the flexible variable topology mechanisms are rigorously defined by the ordered triples and the general topology transition approaches are presented. A novel concept, the “basic flexible kinematic chain set”, is suggested, which can easily transform into the topology of each submechanism by slightly extending. Based on this concept, basic and conditional constraints are established. The continuous dynamic modeling method for each topology is developed using Jourdain’s principle and the Lagrange multiplier method. Additionally, three classes of constraints related to topology transition are identified, and their equations are formulated, elucidating the topology transition nature. Compatibility equations are proposed to define the new coordinate system for describing the deformation of flexible components after the topology transition. An impact dynamic equation is established to describe abrupt velocity change. Integrating compatibility and impact equations, a discontinuous dynamic modeling method for topology transition is developed. Finally, a flexible variable topology mechanism example is studied, and simulations and experiments are conducted to validate the proposed framework. This analytical framework is general-purpose and efficient, guiding the global dynamic modeling of various flexible variable topology mechanisms and the development of sophisticated control techniques. Full article
(This article belongs to the Section Actuators for Robotics)
Show Figures

Figure 1

Figure 1
<p>Global dynamic modeling of an FVTM.</p>
Full article ">Figure 2
<p>Continuous dynamic modeling process of each submechanism.</p>
Full article ">Figure 3
<p>A kinematic analysis of the unconstrained component.</p>
Full article ">Figure 4
<p>Classification of constraints.</p>
Full article ">Figure 5
<p>A kinematic analysis of the unconstrained component.</p>
Full article ">Figure 6
<p>An FVTM possessing two topologies.</p>
Full article ">Figure 7
<p>The midpoint response of the flexible arm in a working cycle.</p>
Full article ">Figure 8
<p>The midpoint response of the flexible arm within the first and second working-phases: (<b>a</b>) the first working-phase; (<b>b</b>) the second working-phase.</p>
Full article ">Figure 9
<p>The frequency spectra of the first and second working-phases: (<b>a</b>) the first working-phase; (<b>b</b>) the second working-phase.</p>
Full article ">Figure 10
<p>An experimental setup possessing two topologies.</p>
Full article ">Figure 11
<p>Variable topology joint <math display="inline"><semantics> <mrow> <msub> <mi>J</mi> <mn>3</mn> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 12
<p>The midpoint response of the flexible arm in a working cycle.</p>
Full article ">Figure 13
<p>The midpoint response of the flexible arm within the first and second working-phases: (<b>a</b>) the first working-phase; (<b>b</b>) the second working-phase.</p>
Full article ">Figure 14
<p>The frequency spectra of the first and second working-phases: (<b>a</b>) the first working-phase; (<b>b</b>) the second working-phase.</p>
Full article ">
14 pages, 3132 KiB  
Article
A Family of Hybrid Topologies for Efficient Constant-Current and Constant-Voltage Output of Magnetically Coupled Wireless Power Transfer Systems
by Yingyao Zheng, Ronghuan Xie, Tao Lin, Xiaoying Chen, Xingkui Mao and Yiming Zhang
World Electr. Veh. J. 2024, 15(12), 578; https://doi.org/10.3390/wevj15120578 - 15 Dec 2024
Viewed by 390
Abstract
In the field of wireless charging technology for electric vehicles, the charging process of lithium-ion batteries is typically divided into two stages: constant-current (CC) charging and constant-voltage (CV) charging. This two-stage charging method helps protect the battery and extend its service life. This [...] Read more.
In the field of wireless charging technology for electric vehicles, the charging process of lithium-ion batteries is typically divided into two stages: constant-current (CC) charging and constant-voltage (CV) charging. This two-stage charging method helps protect the battery and extend its service life. This paper proposes a family of circuit topology design schemes that achieve a smooth transition from CC to CV charging stages by using two relays. Additionally, the paper derives the corresponding system efficiency formulas and provides constraints on device parameters to ensure that the charging efficiency remains high during different charging stages. The proposed family of circuit topologies adopt unified device parameters and relay control logic, simplifying the design and operation process, and making these topologies more suitable for large-scale applications. To verify the practical performance of these topologies, the paper constructs experimental prototypes and conducts tests. The experimental results show that the proposed family of topologies can stably achieve CC and CV output, with smooth transitions between the two charging modes, and the efficiency can be maintained above 89% before and after mode switching over a wide load range. Furthermore, the mode switching points of the proposed family of topologies are multiples of two. Full article
(This article belongs to the Special Issue Wireless Power Transfer Technology for Electric Vehicles)
Show Figures

Figure 1

Figure 1
<p>Schematic diagram of wireless charging for EVs.</p>
Full article ">Figure 2
<p>Schematic diagram of the lithium battery charging process.</p>
Full article ">Figure 3
<p>Proposed reconfigurable topologies. (<b>a</b>) Half–Half bridge topology. (<b>b</b>) Full–Full bridge topology. (<b>c</b>) Full–Half bridge topology.</p>
Full article ">Figure 4
<p>Equivalent circuit. (<b>a</b>) CC mode. (<b>b</b>) CV mode.</p>
Full article ">Figure 5
<p>Half–Half bridge topology operating modes. (<b>a</b>) Switches Q<sub>1</sub> and Q<sub>2</sub> are open. (<b>b</b>) Switches Q<sub>1</sub> and Q<sub>2</sub> are closed.</p>
Full article ">Figure 6
<p>Full–Full bridge topology operating modes. (<b>a</b>) Switches Q<sub>1</sub> and Q<sub>2</sub> are open. (<b>b</b>) Switches Q<sub>1</sub> and Q<sub>2</sub> are closed.</p>
Full article ">Figure 7
<p>Full–Half bridge topology operating modes. (<b>a</b>) Switches Q<sub>1</sub> and Q<sub>2</sub> are open. (<b>b</b>) Switches Q<sub>1</sub> and Q<sub>2</sub> are closed.</p>
Full article ">Figure 8
<p>Photo of the experimental prototype.</p>
Full article ">Figure 9
<p>Calculated and experimental results for the Full–Full bridge topology. (<b>a</b>) DC charging current and voltage. (<b>b</b>) DC efficiency and output power.</p>
Full article ">Figure 10
<p>Calculated and experimental results for the Full–Half bridge topology. (<b>a</b>) DC charging current and voltage. (<b>b</b>) DC efficiency and output power.</p>
Full article ">Figure 11
<p>Calculated and experimental results for the Half–Half bridge topology. (<b>a</b>) DC charging current and voltage. (<b>b</b>) DC efficiency and output power.</p>
Full article ">
18 pages, 2723 KiB  
Article
An Efficient Multi-Topology Construction Method for Scheduling Mobile Data Flows in Software-Defined Networking
by Chi Zhang, Haojiang Deng and Rui Han
Appl. Sci. 2024, 14(24), 11568; https://doi.org/10.3390/app142411568 - 11 Dec 2024
Viewed by 395
Abstract
In mobile networks, a content server can provide multiple services simultaneously to a mobile device, generating multiple data flows. As the device moves, the transmission path in the wired network may need to be switched to maintain service continuity. However, a single switching [...] Read more.
In mobile networks, a content server can provide multiple services simultaneously to a mobile device, generating multiple data flows. As the device moves, the transmission path in the wired network may need to be switched to maintain service continuity. However, a single switching path may not be able to accommodate all the flows, potentially leading to congestion and a degraded user experience. To address this challenge, we propose a multi-topology routing-based mobile data scheduling method that dynamically switches flows across multiple paths to enhance flexibility and load balancing. The performance of this method is significantly influenced by the construction of logical topologies. Well-designed topologies provide high-bandwidth, low-latency paths to all possible destination nodes, while poorly designed topologies waste switch capacity and fail to achieve these goals. In this paper, we introduce an efficient multi-topology construction method for scheduling mobile data flows in software-defined networking (SDN). Our approach optimizes and balances transmission capacity for each destination node while adhering to the flow entry constraints of switches. Simulations demonstrate that our method consistently outperforms the single-path switching method and the other two multi-topology construction methods in terms of packet delay, packet loss rate, and network throughput, regardless of the device’s new location. Full article
Show Figures

Figure 1

Figure 1
<p>Multi-topology routing in software-defined networking (SDN) and the corresponding processing logic in Switch B. Switches are labeled A, B, C, and D, while ports 1, 2, and 3 represent the three ports of Switch B.</p>
Full article ">Figure 2
<p>The physical topology used in the experiment, consisting of 14 switches and their associated link delays.</p>
Full article ">Figure 3
<p>Comparison of average packet delay among different methods with the increasing number of flows when the device moves to S1.</p>
Full article ">Figure 4
<p>Comparison of average packet delay among different methods with the increasing number of flows: (<b>a</b>) when the device moves to S10; (<b>b</b>) when the device moves to S12.</p>
Full article ">Figure 5
<p>Comparison of average packet loss rate among different methods with the increasing number of flows when the device moves to S1.</p>
Full article ">Figure 6
<p>Comparison of average packet loss rate among different methods with the increasing number of flows: (<b>a</b>) when the device moves to S10; (<b>b</b>) when the device moves to S12.</p>
Full article ">Figure 7
<p>Comparison of throughput among different methods when the device moves to S1, S10, and S12.</p>
Full article ">
24 pages, 9424 KiB  
Article
A Novel IoT-Based Controlled Islanding Strategy for Enhanced Power System Stability and Resilience
by Aliaa A. Okasha, Diaa-Eldin A. Mansour, Ahmed B. Zaky, Junya Suehiro and Tamer F. Megahed
Smart Cities 2024, 7(6), 3871-3894; https://doi.org/10.3390/smartcities7060149 - 10 Dec 2024
Viewed by 744
Abstract
Intentional controlled islanding (ICI) is a crucial strategy to avert power system collapse and blackouts caused by severe disturbances. This paper introduces an innovative IoT-based ICI strategy that identifies the optimal location for system segmentation during emergencies. Initially, the algorithm transmits essential data [...] Read more.
Intentional controlled islanding (ICI) is a crucial strategy to avert power system collapse and blackouts caused by severe disturbances. This paper introduces an innovative IoT-based ICI strategy that identifies the optimal location for system segmentation during emergencies. Initially, the algorithm transmits essential data from phasor measurement units (PMUs) to the IoT cloud. Subsequently, it calculates the coherency index among all pairs of generators. Leveraging IoT technology increases system accessibility, enabling the real-time detection of changes in network topology post-disturbance and allowing the coherency index to adapt accordingly. A novel algorithm is then employed to group coherent generators based on relative coherency index values, eliminating the need to transfer data points elsewhere. The “where to island” subproblem is formulated as a mixed integer linear programming (MILP) model that aims to boost system transient stability by minimizing power flow interruptions in disconnected lines. The model incorporates constraints on generators’ coherency, island connectivity, and node exclusivity. The subsequent layer determines the optimal generation/load actions for each island to prevent system collapse post-separation. Signals from the IoT cloud are relayed to the circuit breakers at the terminals of the optimal cut-set to establish stable isolated islands. Additionally, controllable loads and generation controllers receive signals from the cloud to execute load and/or generation adjustments. The proposed system’s performance is assessed on the IEEE 39-bus system through time-domain simulations on DIgSILENT PowerFactory connected to the ThingSpeak cloud platform. The simulation results demonstrate the effectiveness of the proposed ICI strategy in boosting power system stability. Full article
(This article belongs to the Special Issue Next Generation of Smart Grid Technologies)
Show Figures

Figure 1

Figure 1
<p>The proposed IoT-based controlled islanding strategy.</p>
Full article ">Figure 2
<p>Flow chart of the clustering algorithm.</p>
Full article ">Figure 3
<p>Rotor angles of generators under disturbances in the first case study.</p>
Full article ">Figure 4
<p>Electrical frequency of generators in the first case study.</p>
Full article ">Figure 5
<p>Rotor speed of generators in the first case study.</p>
Full article ">Figure 6
<p>Voltage magnitude of the PV buses in the first case study.</p>
Full article ">Figure 7
<p>Test system after applying ICI in the first scenario.</p>
Full article ">Figure 8
<p>Generators’ rotor angle following ICI in the first case study.</p>
Full article ">Figure 9
<p>Generators’ rotor speed following ICI in the first case study.</p>
Full article ">Figure 10
<p>Voltage magnitude of the PV buses following ICI in the first case study.</p>
Full article ">Figure 11
<p>Frequency of generating units after ICI in the first case study.</p>
Full article ">Figure 12
<p>Rotor angles of generators under the second scenario.</p>
Full article ">Figure 13
<p>Rotor speed of generators under the second case study.</p>
Full article ">Figure 14
<p>Frequency of generators under the second case study.</p>
Full article ">Figure 15
<p>Terminal voltages of generators under the second case study.</p>
Full article ">Figure 16
<p>Intentional controlled islanding in the second scenario.</p>
Full article ">Figure 17
<p>Rotor angle post-controlled islanding in the second scenario.</p>
Full article ">Figure 18
<p>Rotor speed post-controlled islanding in the second scenario.</p>
Full article ">Figure 19
<p>Frequency of generators post-controlled islanding in the second scenario.</p>
Full article ">Figure 20
<p>Voltage magnitude of PV buses post-controlled islanding in the second scenario.</p>
Full article ">
24 pages, 1804 KiB  
Article
The Golden Ratio Family of Extremal Kerr-Newman Black Holes and Its Implications for the Cosmological Constant
by Giorgio Sonnino and Pasquale Nardone
Axioms 2024, 13(12), 862; https://doi.org/10.3390/axioms13120862 - 10 Dec 2024
Viewed by 452
Abstract
This work explores the geometry of extremal Kerr-Newman black holes by analyzing their mass/energy relationships and the conditions ensuring black hole existence. Using differential geometry in E3, we examine the topology of the event horizon surface and identify two distinct families [...] Read more.
This work explores the geometry of extremal Kerr-Newman black holes by analyzing their mass/energy relationships and the conditions ensuring black hole existence. Using differential geometry in E3, we examine the topology of the event horizon surface and identify two distinct families of extremal black holes, each defined by unique proportionalities between their core parameters: mass (m), charge (Q), angular momentum (L), and the irreducible mass (mir). In the first family, these parameters are proportionally related to the irreducible mass by irrational numbers, with a characteristic flat Gaussian curvature at the poles. In the second family, we uncover a more intriguing structure where m, Q, and L are connected to mir through coefficients involving the golden ratio ϕ. Within this family lies a unique black hole whose physical parameters converge on the golden ratio, including the irreducible mass and polar Gauss curvature. This black hole represents the highest symmetry achievable within the constraints of the Kerr-Newman metric. This remarkable symmetry invites further speculation about its implications, such as the potential determination of the dark energy density parameter ΩΛ for Kerr-Newman-de Sitter black holes. Additionally, we compute the maximum energy that can be extracted through reversible transformations. We have determined that the second, golden-ratio-linked family allows for a greater energy yield than the first. Full article
(This article belongs to the Special Issue Advances in Differential Geometry and Mathematical Physics)
Show Figures

Figure 1

Figure 1
<p>Mass/energy formula for the Kerr–Newman black holes (the orange surface). These black holes exist only in the range of <math display="inline"><semantics> <mrow> <msup> <mi>x</mi> <mn>4</mn> </msup> <mo>+</mo> <msup> <mi>y</mi> <mn>2</mn> </msup> <mo>≤</mo> <mn>1</mn> </mrow> </semantics></math> (the gray zone).</p>
Full article ">Figure 2
<p>Scaled Christodoulou’s diagram. Contours of constant <math display="inline"><semantics> <mrow> <mi>z</mi> <mo>=</mo> <mi>m</mi> <mo>/</mo> <msub> <mi>m</mi> <mrow> <mi>i</mi> <mi>r</mi> </mrow> </msub> </mrow> </semantics></math> are depicted in the x-y plane. Black holes can exist only in the interior of the region <math display="inline"><semantics> <mrow> <msup> <mi>x</mi> <mn>4</mn> </msup> <mo>+</mo> <msup> <mi>y</mi> <mn>2</mn> </msup> <mo>≤</mo> <mn>1</mn> </mrow> </semantics></math>. Black holes in the blue contour are the extreme black holes. The green stars correspond to the extreme black holes (<a href="#FD15-axioms-13-00862" class="html-disp-formula">15</a>).</p>
Full article ">Figure 3
<p>Scaled Christodoulou’s diagram. Contours of constant <math display="inline"><semantics> <mrow> <mi>z</mi> <mo>=</mo> <mi>m</mi> <mo>/</mo> <msub> <mi>m</mi> <mrow> <mi>i</mi> <mi>r</mi> </mrow> </msub> </mrow> </semantics></math> are depicted in the x-y plane. The extreme black holes are located in the blue curve <math display="inline"><semantics> <mrow> <msup> <mi>x</mi> <mn>4</mn> </msup> <mo>+</mo> <msup> <mi>y</mi> <mn>2</mn> </msup> <mo>≤</mo> <mn>1</mn> </mrow> </semantics></math>. The red stars refer to the extreme black holes (<a href="#FD17-axioms-13-00862" class="html-disp-formula">17</a>). Note that black holes marked by red stars are the only extreme Kerr–Newman black holes that satisfy the symmetry <math display="inline"><semantics> <mrow> <mo>|</mo> <mi>y</mi> <mo>|</mo> <mo>↔</mo> <mo>|</mo> <mi>x</mi> <mo>|</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 4
<p>The horizon surface of a black hole, when embedded in Euclidean 3-space, forms a surface of revolution.</p>
Full article ">Figure 5
<p>Umbilic points. For metric (<a href="#FD32-axioms-13-00862" class="html-disp-formula">32</a>), the umbilic points are located at the poles.</p>
Full article ">Figure 6
<p>The red stars inside a circle shown in the Christodoulou diagram indicate the locations of the families of extremal black holes to which the Kerr-Newman black holes with golden symmetry (EKNBHGRS) belong. The value of the contour level is given by <math display="inline"><semantics> <mrow> <mi>m</mi> <mo>/</mo> <msub> <mi>m</mi> <mrow> <mi>i</mi> <mi>r</mi> </mrow> </msub> <mo>=</mo> <msqrt> <mn>2</mn> </msqrt> <mrow> <mo>(</mo> <mo>−</mo> <msub> <mi>ϕ</mi> <mo>−</mo> </msub> <mo>)</mo> </mrow> </mrow> </semantics></math>. Extremal Kerr-Newman black holes with golden symmetry are situated at the intersections of these contour lines with the extremal curve. The mass and irreducible mass of the extremal Kerr-Newman black hole with golden ratio symmetry (EKNBHGRS) are <math display="inline"><semantics> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>,</mo> <msub> <mi>m</mi> <mrow> <mi>i</mi> <mi>r</mi> </mrow> </msub> <mo>)</mo> </mrow> <mo>=</mo> <mrow> <mo>(</mo> <mn>0.55589</mn> <mo>,</mo> <mn>0.30901</mn> <mo>)</mo> </mrow> </mrow> </semantics></math>.</p>
Full article ">Figure 7
<p>The surface is the loci of extremal Kerr-Newman black holes that satisfy the mass/energy formula. The red points on this surface, with coordinates <math display="inline"><semantics> <mrow> <mrow> <mo>(</mo> <msub> <mi>m</mi> <mrow> <mi>i</mi> <mi>r</mi> </mrow> </msub> <mo>,</mo> <mi>Q</mi> <mo>,</mo> <mi>m</mi> <mo>)</mo> </mrow> <mo>=</mo> <mrow> <mo>(</mo> <mo>−</mo> <mn>1</mn> <mo>/</mo> <mn>2</mn> <msub> <mi>ϕ</mi> <mo>−</mo> </msub> <mo>,</mo> <msup> <mrow> <mo>(</mo> <mo>−</mo> <msub> <mi>ϕ</mi> <mo>−</mo> </msub> <mo>)</mo> </mrow> <mrow> <mo>−</mo> <mn>3</mn> <mo>/</mo> <mn>2</mn> </mrow> </msup> <mo>,</mo> <mn>1</mn> <mo>/</mo> <msqrt> <mn>2</mn> </msqrt> <msup> <mrow> <mo>(</mo> <mo>−</mo> <msub> <mi>ϕ</mi> <mo>−</mo> </msub> <mo>)</mo> </mrow> <mrow> <mn>1</mn> <mo>/</mo> <mn>2</mn> </mrow> </msup> <mo>)</mo> </mrow> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mrow> <mo>(</mo> <msub> <mi>m</mi> <mrow> <mi>i</mi> <mi>r</mi> </mrow> </msub> <mo>,</mo> <mi>Q</mi> <mo>,</mo> <mi>m</mi> <mo>)</mo> </mrow> <mo>=</mo> <mrow> <mo>(</mo> <mo>−</mo> <mn>1</mn> <mo>/</mo> <mn>2</mn> <msub> <mi>ϕ</mi> <mo>−</mo> </msub> <mo>,</mo> <mo>−</mo> <msup> <mrow> <mo>(</mo> <mo>−</mo> <msub> <mi>ϕ</mi> <mo>−</mo> </msub> <mo>)</mo> </mrow> <mrow> <mo>−</mo> <mn>3</mn> <mo>/</mo> <mn>2</mn> </mrow> </msup> <mo>,</mo> <mn>1</mn> <mo>/</mo> <msqrt> <mn>2</mn> </msqrt> <msup> <mrow> <mo>(</mo> <mo>−</mo> <msub> <mi>ϕ</mi> <mo>−</mo> </msub> <mo>)</mo> </mrow> <mrow> <mn>1</mn> <mo>/</mo> <mn>2</mn> </mrow> </msup> <mo>)</mo> </mrow> </mrow> </semantics></math>, locate the EKNBHGRS in the first and the second quadrants of the Christodoulou diagram, respectively (see the red stars <math display="inline"><semantics> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> </semantics></math> in <a href="#axioms-13-00862-f006" class="html-fig">Figure 6</a>). The black lines on the surface are the loci of extreme Kerr-Newman black holes, where the mass, charge, and angular momentum are proportional to the irreducible mass, with proportionality coefficients corresponding to the golden ratio. Notice that for these extreme black holes, the angular momentum <span class="html-italic">L</span> is not an independent variable as <math display="inline"><semantics> <mrow> <mrow> <mo>|</mo> <mi>L</mi> <mo>|</mo> </mrow> <mo>=</mo> <msub> <mi>m</mi> <mrow> <mi>i</mi> <mi>r</mi> </mrow> </msub> <mrow> <mo>|</mo> <mi>Q</mi> <mo>|</mo> </mrow> </mrow> </semantics></math>. So, the EKNBHGRS <math display="inline"><semantics> <mrow> <mo>(</mo> <mn>3</mn> <mo>)</mo> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </semantics></math> in <a href="#axioms-13-00862-f006" class="html-fig">Figure 6</a> have, respectively, the same coordinate of <math display="inline"><semantics> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> </semantics></math>, but with opposite values of angular momentum.</p>
Full article ">Figure A1
<p>Geometrical version of the extreme Kerr–Newman black holes equations. The right triangle ABC and the right triangle ADB are the first and the second equations of System (<a href="#FD9-axioms-13-00862" class="html-disp-formula">9</a>), respectively. Triangles ACE and ACF correspond to Equation (<a href="#FD10-axioms-13-00862" class="html-disp-formula">10</a>) and Equation (<a href="#FD11-axioms-13-00862" class="html-disp-formula">11</a>), respectively. Note that extreme Kerr–Newman black holes satisfy the relation <math display="inline"><semantics> <mrow> <msqrt> <mn>2</mn> </msqrt> <msub> <mi>m</mi> <mrow> <mi>i</mi> <mi>r</mi> </mrow> </msub> <mo form="prefix">sin</mo> <mi>α</mi> <mo>=</mo> <mi>m</mi> <mo form="prefix">sin</mo> <mi>θ</mi> </mrow> </semantics></math>.</p>
Full article ">Figure A2
<p>Special configuration (<b>i</b>): triangle ABC is exactly the same as triangle AEC.</p>
Full article ">Figure A3
<p>Special configuration (<b>ii</b>): the catheter BD of the right triangle ADB coincides exactly with the height of the triangle ABC relative to the base AC.</p>
Full article ">
19 pages, 13118 KiB  
Article
A Multi-Attribute Decision-Making Approach for Critical Node Identification in Complex Networks
by Xinyun Zhao, Yongheng Zhang, Qingying Zhai, Jinrui Zhang and Lanlan Qi
Entropy 2024, 26(12), 1075; https://doi.org/10.3390/e26121075 - 9 Dec 2024
Viewed by 505
Abstract
Correctly identifying influential nodes in a complex network and implementing targeted protection measures can significantly enhance the overall security of the network. Currently, indicators such as degree centrality, closeness centrality, betweenness centrality, H-index, and K-shell are commonly used to measure node influence. Although [...] Read more.
Correctly identifying influential nodes in a complex network and implementing targeted protection measures can significantly enhance the overall security of the network. Currently, indicators such as degree centrality, closeness centrality, betweenness centrality, H-index, and K-shell are commonly used to measure node influence. Although these indicators can identify critical nodes to some extent, they often consider node attributes from a narrow perspective and have certain limitations. Therefore, evaluating the importance of nodes using most existing indicators remains incomplete. In this paper, we propose the multi-attribute CRITIC-TOPSIS network decision indicator, or MCTNDI, which integrates closeness centrality, betweenness centrality, H-index, and network constraint coefficients to identify critical nodes in a network. This indicator combines information from multiple perspectives, including local neighborhood importance, network topological location, path centrality, and node mutual information, thereby solving the issue of the one-sided perspective of single indicators and providing a more comprehensive measure of node importance. Additionally, MCTNDI is validated through the analysis of several real-world networks, including the Contiguous USA network, Dolphins network, USAir97 network, and Tech-routers-rf network. The validation is conducted from four aspects: the results of simulated network attacks, the distribution of node importance, the monotonicity of rankings, and the similarity of indicators, illustrating MCTNDI’s effectiveness in real networks. Full article
Show Figures

Figure 1

Figure 1
<p>An example of a kite network.</p>
Full article ">Figure 2
<p>The framework of MCTNDI.</p>
Full article ">Figure 3
<p>Network topology of four experimental networks.</p>
Full article ">Figure 4
<p>Changes in network efficiency caused by deliberate attacks in four networks using MCTNDI and different single indicators.</p>
Full article ">Figure 5
<p>Changes in network efficiency caused by deliberate attacks in four networks using different multi-attribute methods.</p>
Full article ">Figure 6
<p>Distribution of node importance scores for four networks under different indicators.</p>
Full article ">Figure 7
<p>Monotonicity results of different indicators in four experimental networks.</p>
Full article ">Figure 8
<p>Correlation of MCTNDI and each indicator.</p>
Full article ">Figure A1
<p>Nodes with the top 20% score in the experimental network under MCTNDI.</p>
Full article ">Figure A1 Cont.
<p>Nodes with the top 20% score in the experimental network under MCTNDI.</p>
Full article ">
24 pages, 555 KiB  
Article
Addressing the Return Visit Challenge in Autonomous Flying Ad Hoc Networks Linked to a Central Station
by Ercan Erkalkan, Vedat Topuz and Ali Buldu
Sensors 2024, 24(23), 7859; https://doi.org/10.3390/s24237859 - 9 Dec 2024
Viewed by 383
Abstract
Unmanned Aerial Vehicles (UAVs) have become essential tools across various sectors due to their versatility and advanced capabilities in autonomy, perception, and networking. Despite over a decade of experimental efforts in multi-UAV systems, substantial theoretical challenges concerning coordination mechanisms still need to be [...] Read more.
Unmanned Aerial Vehicles (UAVs) have become essential tools across various sectors due to their versatility and advanced capabilities in autonomy, perception, and networking. Despite over a decade of experimental efforts in multi-UAV systems, substantial theoretical challenges concerning coordination mechanisms still need to be solved, particularly in maintaining network connectivity and optimizing routing. Current research has revealed the absence of an efficient algorithm tailored for the routing problem of multiple UAVs connected to a central station, especially under the constraints of maintaining constant network connectivity and minimizing the average goal revisit time. This paper proposes a heuristic routing algorithm for multiple UAV systems to address the return visit challenge in flying ad hoc networks (FANETs) linked to a central station. Our approach introduces a composite valuation function for target prioritization and a mathematical model for task assignment with relay allocation, allowing any UAV to visit various objectives and gain an advantage or incur a cost for each. We exclusively utilized a simulation environment to mimic UAV operations, assessing communication range, connectivity, and routing performance. Extensive simulations demonstrate that our routing algorithm remains efficient in the face of frequent topological alterations in the network, showing robustness against dynamic environments and superior performance compared to existing methods. This paper presents different approaches to efficiently directing UAVs and explains how heuristic algorithms can enhance our understanding and improve current methods for task assignments. Full article
(This article belongs to the Section Sensor Networks)
Show Figures

Figure 1

Figure 1
<p>Time-based valuation function <math display="inline"><semantics> <mrow> <msub> <mi>U</mi> <mn>1</mn> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math>: The function shows how the valuation increases over time, starting from zero, increasing linearly after <math display="inline"><semantics> <msub> <mi>t</mi> <mrow> <mi mathvariant="normal">t</mi> <mi mathvariant="normal">h</mi> <mi mathvariant="normal">r</mi> <mi mathvariant="normal">e</mi> <mi mathvariant="normal">s</mi> <mi mathvariant="normal">h</mi> <mi mathvariant="normal">o</mi> <mi mathvariant="normal">l</mi> <mi mathvariant="normal">d</mi> <mn>1</mn> </mrow> </msub> </semantics></math>, and then quadratically after <math display="inline"><semantics> <msub> <mi>t</mi> <mrow> <mi mathvariant="normal">t</mi> <mi mathvariant="normal">h</mi> <mi mathvariant="normal">r</mi> <mi mathvariant="normal">e</mi> <mi mathvariant="normal">s</mi> <mi mathvariant="normal">h</mi> <mi mathvariant="normal">o</mi> <mi mathvariant="normal">l</mi> <mi mathvariant="normal">d</mi> <mn>2</mn> </mrow> </msub> </semantics></math>.</p>
Full article ">Figure 2
<p>Distance-based valuation function <math display="inline"><semantics> <mrow> <msub> <mi>U</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mi>u</mi> <mo>,</mo> <mi>g</mi> <mo>)</mo> </mrow> </mrow> </semantics></math>: The function inversely correlates with distance, giving higher valuation to targets closer to the UAV.</p>
Full article ">Figure 3
<p>Composite valuation function <math display="inline"><semantics> <mrow> <mi>U</mi> <mo>(</mo> <mi>u</mi> <mo>,</mo> <mi>g</mi> <mo>,</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math>: Combines both time and distance valuations to prioritize targets that are both overdue for revisitation and nearby.</p>
Full article ">Figure 4
<p>Network connectivity percentage across varying hybrid UAV fleet sizes.</p>
Full article ">Figure 5
<p>Task completion efficiency across varying hybrid UAV fleet sizes.</p>
Full article ">Figure 6
<p>Energy efficiency across varying hybrid UAV fleet sizes.</p>
Full article ">Figure 7
<p>Dynamic adaptation performance across varying hybrid UAV fleet sizes.</p>
Full article ">Figure 8
<p>Hybrid fleet utilization efficiency across varying hybrid UAV fleet sizes.</p>
Full article ">
15 pages, 4590 KiB  
Article
An Integrated Modeling Framework for Automated Product Design, Topology Optimization, and Mechanical Simulation
by Paschalis Charalampous, Athanasios Pelekoudas, Ioannis Kostavelis, Dimosthenis Ioannidis and Dimitrios Tzovaras
J. Manuf. Mater. Process. 2024, 8(6), 285; https://doi.org/10.3390/jmmp8060285 - 7 Dec 2024
Viewed by 586
Abstract
The present study introduces an integrated software approach that provides an automated product design toolkit for customized products like knives, incorporating topology optimization (TO) and numerical simulations in order to streamline engineering workflows during the product development procedure. The modeling framework combines state-of-the-art [...] Read more.
The present study introduces an integrated software approach that provides an automated product design toolkit for customized products like knives, incorporating topology optimization (TO) and numerical simulations in order to streamline engineering workflows during the product development procedure. The modeling framework combines state-of-the-art technologies into a single platform, enabling the design and the optimization of mechanical structures with minimal human intervention. In particular, the proposed solution leverages artificial intelligence (AI), shape optimization methods, and computational tools in order to iteratively optimize material utilization as well as the design of products based on certain criteria. By embedding simulation within the design optimization loop, the developed software module ensures that performance constraints are respected throughout the design process. The case studies are concentrated in designing knives, demonstrating the platform’s ability to reduce design time, enhance product performance and provide rapid iterations of structurally optimized geometries. Finally, it should be noted that this research showcases the potential of integrated modeling technologies towards the transformation of traditional design paradigms, in this way contributing to faster, more reliable and efficient product development in various engineering industries through the training and deployment of AI models in these scientific fields. Full article
Show Figures

Figure 1

Figure 1
<p>System conceptual architecture.</p>
Full article ">Figure 2
<p>The contour shape detection pipeline, exhibiting the integration of Mask R-CNN for object segmentation, Sobel for contour extraction, and Gaussian smoothing for refining contours.</p>
Full article ">Figure 3
<p>Flowchart of the FEM and topology optimization approach.</p>
Full article ">Figure 4
<p>Integrated platform workflow.</p>
Full article ">Figure 5
<p>CAD-model generation module of the introduced software platform.</p>
Full article ">Figure 6
<p>GUI for defining critical parameters regarding the formulation of the numerical model.</p>
Full article ">Figure 7
<p>Post-process module for evaluating the simulation outcomes.</p>
Full article ">Figure 8
<p>Topological optimized results of the investigated knives.</p>
Full article ">Figure 9
<p>FEM-based validation of the optimized design models.</p>
Full article ">
24 pages, 5523 KiB  
Review
Topology Optimization: A Review for Structural Designs Under Statics Problems
by Tianshu Tang, Leijia Wang, Mingqiao Zhu, Huzhi Zhang, Jiarui Dong, Wenhui Yue and Hui Xia
Materials 2024, 17(23), 5970; https://doi.org/10.3390/ma17235970 - 6 Dec 2024
Viewed by 776
Abstract
Topology optimization is a powerful structural design method that determines the optimal configuration by distributing materials efficiently within a given design domain while satisfying specified load, performance, and volume constraints. Unlike size and shape optimization, topology optimization is independent of the initial design, [...] Read more.
Topology optimization is a powerful structural design method that determines the optimal configuration by distributing materials efficiently within a given design domain while satisfying specified load, performance, and volume constraints. Unlike size and shape optimization, topology optimization is independent of the initial design, offering a broader design space. This paper provides a systematic review of topology optimization methods, covering two theoretical frameworks: linear elasticity and nonlinear theory. Specifically, the review focuses on sensitivity analysis, optimization criteria, and topology solution smoothing within the context of linear elasticity. In the context of nonlinear theory, the review primarily addresses nonlinear phenomena arising from stress constraints, geometric, material, and contact nonlinearities. The paper concludes by summarizing the current state of the field, identifying limitations in existing methods, and suggesting directions for future research. Full article
Show Figures

Figure 1

Figure 1
<p>Representative engineering applications utilizing topology optimization design methods: (<b>a</b>) satellite support system [<a href="#B2-materials-17-05970" class="html-bibr">2</a>]; (<b>b</b>) multi-component layout design for a helicopter pylon [<a href="#B2-materials-17-05970" class="html-bibr">2</a>]; (<b>c</b>) topology optimization design of aircraft pylon [<a href="#B2-materials-17-05970" class="html-bibr">2</a>]; (<b>d</b>) a typical assembly jig for an aircraft wing [<a href="#B2-materials-17-05970" class="html-bibr">2</a>]; (<b>e</b>) aircraft wing design [<a href="#B2-materials-17-05970" class="html-bibr">2</a>]; (<b>f</b>) design of subway air conditioning suspension [<a href="#B3-materials-17-05970" class="html-bibr">3</a>]; (<b>g</b>) topology optimization of a mandibular reconstruction plate [<a href="#B4-materials-17-05970" class="html-bibr">4</a>]; (<b>h</b>) topological optimization of hip spacer reinforcement [<a href="#B5-materials-17-05970" class="html-bibr">5</a>]; (<b>i</b>) design of dental framework using topology optimization [<a href="#B6-materials-17-05970" class="html-bibr">6</a>].</p>
Full article ">Figure 2
<p>Research framework of this paper.</p>
Full article ">Figure 3
<p>The steps of the structural topology optimization design.</p>
Full article ">Figure 4
<p>Topology optimization design model obtained by different sensitivity calculation methods: (<b>a</b>) ESO [<a href="#B41-materials-17-05970" class="html-bibr">41</a>]; (<b>b</b>) WESO [<a href="#B41-materials-17-05970" class="html-bibr">41</a>]; (<b>c</b>) BESO [<a href="#B41-materials-17-05970" class="html-bibr">41</a>]; (<b>d</b>) X−FEM analysis of a 2D filet 1/4 model in tension [<a href="#B42-materials-17-05970" class="html-bibr">42</a>]; (<b>e</b>) smooth model of the 3D arm using DSC [<a href="#B50-materials-17-05970" class="html-bibr">50</a>].</p>
Full article ">Figure 5
<p>Smooth topology solutions of topology optimization design models obtained by different methods: (<b>a</b>) model obtained by the FG BESO method [<a href="#B66-materials-17-05970" class="html-bibr">66</a>]; (<b>b</b>) the ITD algorithm obtains the topology of the MBB beam [<a href="#B67-materials-17-05970" class="html-bibr">67</a>]; (<b>c</b>) smooth structure boundary using the SVM boundary extraction method [<a href="#B72-materials-17-05970" class="html-bibr">72</a>]; (<b>d</b>) cantilever topology optimization using the X−FEM and ITD methods [<a href="#B68-materials-17-05970" class="html-bibr">68</a>]; (<b>e</b>) the cantilever topology is based on the two−way evolutionary structure optimization method based on finite element, LSM, and NURB [<a href="#B69-materials-17-05970" class="html-bibr">69</a>]; (<b>f</b>) ETO design of a 3D cantilever beam with a concentrated force [<a href="#B70-materials-17-05970" class="html-bibr">70</a>]; (<b>g</b>) optimal topology design of Charpy using the RTO method [<a href="#B71-materials-17-05970" class="html-bibr">71</a>].</p>
Full article ">Figure 6
<p>Comparison of topology optimization solutions considering linear and nonlinear conditions: (<b>a</b>) material nonlinear constraint [<a href="#B81-materials-17-05970" class="html-bibr">81</a>]; (<b>b</b>) stress constraint [<a href="#B82-materials-17-05970" class="html-bibr">82</a>]; (<b>c</b>) geometric nonlinear constraint [<a href="#B83-materials-17-05970" class="html-bibr">83</a>,<a href="#B84-materials-17-05970" class="html-bibr">84</a>].</p>
Full article ">Figure 7
<p>Topology optimization model for different structures under stress constraints: (<b>a</b>) topology optimization of a L-shaped structure [<a href="#B99-materials-17-05970" class="html-bibr">99</a>]; (<b>b</b>) structural design of T-beams under two load cases [<a href="#B110-materials-17-05970" class="html-bibr">110</a>]; (<b>c</b>) optimal design of the short cantilever beam problem [<a href="#B104-materials-17-05970" class="html-bibr">104</a>]; (<b>d</b>) topological optimization of stress-constrained continuum L-shape beam structures based on the active constraint technique [<a href="#B110-materials-17-05970" class="html-bibr">110</a>]; (<b>e</b>) design of minimum strain energy for a stress-constrained L-beam [<a href="#B106-materials-17-05970" class="html-bibr">106</a>]; (<b>f</b>) the design result of a double L-bracket with two stress constraints [<a href="#B111-materials-17-05970" class="html-bibr">111</a>].</p>
Full article ">Figure 8
<p>Topology optimization model of different structures under material nonlinearity: (<b>a</b>) optimal design of a cantilever subjected to plastic deformation [<a href="#B112-materials-17-05970" class="html-bibr">112</a>]; (<b>b</b>) plastic designs of the cantilever [<a href="#B120-materials-17-05970" class="html-bibr">120</a>]; (<b>c</b>) optimization result for elastoplastic material and von Mises stresses [<a href="#B114-materials-17-05970" class="html-bibr">114</a>]; (<b>d</b>) optimized layout for the multilinear elastic material modeled by ECP [<a href="#B115-materials-17-05970" class="html-bibr">115</a>]; (<b>e</b>) material distribution of the optimized U-bracket [<a href="#B117-materials-17-05970" class="html-bibr">117</a>]; (<b>f</b>) topology optimization of a U-bracket [<a href="#B124-materials-17-05970" class="html-bibr">124</a>].</p>
Full article ">Figure 9
<p>Topology optimization design under geometric nonlinearity: (<b>a</b>) optimized topology for large displacement modeling [<a href="#B127-materials-17-05970" class="html-bibr">127</a>]; (<b>b</b>) optimal topology resulting from geometrically nonlinear finite element analysis [<a href="#B128-materials-17-05970" class="html-bibr">128</a>]; (<b>c</b>) topological optimization under the geometric nonlinearity of the slender beams [<a href="#B129-materials-17-05970" class="html-bibr">129</a>]; (<b>d</b>) optimization of the geometric nonlinearity of a cantilever beam [<a href="#B133-materials-17-05970" class="html-bibr">133</a>]; (<b>e</b>) optimization of the geometric nonlinearity of a simply supported beam [<a href="#B138-materials-17-05970" class="html-bibr">138</a>].</p>
Full article ">Figure 10
<p>Topology optimization model of different structures under contact nonlinearity: (<b>a</b>) the sub-gradient method was used to design the sheet structure [<a href="#B148-materials-17-05970" class="html-bibr">148</a>]; (<b>b</b>) design of contact-assisted flexible mechanisms through the use of regularized contact modeling [<a href="#B150-materials-17-05970" class="html-bibr">150</a>]; (<b>c</b>) truss optimization by introducing one-way contact conditions [<a href="#B151-materials-17-05970" class="html-bibr">151</a>]; (<b>d</b>) global stiffness optimization of frictionless unidirectional contact structures [<a href="#B154-materials-17-05970" class="html-bibr">154</a>]; (<b>e</b>) topology optimization to meet manufacturing constraints and one-way contact constraints [<a href="#B155-materials-17-05970" class="html-bibr">155</a>]; (<b>f</b>) topological optimization to consider slippage and separation at the contact interface [<a href="#B156-materials-17-05970" class="html-bibr">156</a>]; (<b>g</b>) optimization of contact problems under large deformation conditions [<a href="#B159-materials-17-05970" class="html-bibr">159</a>]; (<b>h</b>) design of uniformity of the contact pressure [<a href="#B160-materials-17-05970" class="html-bibr">160</a>]; (<b>i</b>) stiffness design of frictional contact elastic structures [<a href="#B162-materials-17-05970" class="html-bibr">162</a>]; (<b>j</b>) stress-based tribal contact optimization of elastic continuous structures [<a href="#B163-materials-17-05970" class="html-bibr">163</a>]; (<b>k</b>) optimization of hyper-elastic structures with large deformation and frictionless contact [<a href="#B164-materials-17-05970" class="html-bibr">164</a>].</p>
Full article ">
27 pages, 539 KiB  
Article
Modification of Premises for the Black Hole Information Paradox Caused by Topological Constraints in the Event Horizon Vicinity
by Janusz Edward Jacak
Entropy 2024, 26(12), 1035; https://doi.org/10.3390/e26121035 - 29 Nov 2024
Viewed by 434
Abstract
We demonstrate that at the rim of the photon sphere of a black hole, the quantum statistics transition takes place in any multi-particle system of indistinguishable particles, which passes through this rim to the inside. The related local departure from Pauli exclusion principle [...] Read more.
We demonstrate that at the rim of the photon sphere of a black hole, the quantum statistics transition takes place in any multi-particle system of indistinguishable particles, which passes through this rim to the inside. The related local departure from Pauli exclusion principle restriction causes a decay of the internal structure of collective fermionic systems, including the collapse of Fermi spheres in compressed matter. The Fermi sphere decay is associated with the emission of electromagnetic radiation, taking away the energy and entropy of the falling matter without unitarity violation. The spectrum and timing of the related e-m radiation agree with some observed short giant gamma-ray bursts and X-ray components of the luminosity of quasars and of short transients powered by black holes. The release of energy and entropy when passing the photon sphere rim of a black hole significantly modifies the premises of the information paradox at the falling of matter into a black hole. Full article
(This article belongs to the Special Issue The Black Hole Information Problem)
Show Figures

Figure 1

Figure 1
<p>The squared effective potential (<a href="#FD5-entropy-26-01035" class="html-disp-formula">5</a>) for some exemplary values of reduced angular momentum <math display="inline"><semantics> <mrow> <mi>l</mi> <mo>=</mo> <mstyle scriptlevel="0" displaystyle="true"> <mfrac> <mi mathvariant="script">L</mi> <mrow> <mi>m</mi> <mi>c</mi> <msub> <mi>r</mi> <mi>s</mi> </msub> </mrow> </mfrac> </mstyle> </mrow> </semantics></math> (dimensionless). With the increase in <math display="inline"><semantics> <mi mathvariant="script">L</mi> </semantics></math>, the squared potential is steeper in the region <math display="inline"><semantics> <mrow> <mi>r</mi> <mo>∈</mo> <mo>(</mo> <mn>0</mn> <mo>,</mo> <mn>1.5</mn> <msub> <mi>r</mi> <mi>s</mi> </msub> <mo>)</mo> </mrow> </semantics></math> (singular at <math display="inline"><semantics> <mrow> <mi>r</mi> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>). The event horizon at <math display="inline"><semantics> <mrow> <mi>r</mi> <mo>=</mo> <msub> <mi>r</mi> <mi>s</mi> </msub> </mrow> </semantics></math> and the innermost unstable circular orbit with <math display="inline"><semantics> <mrow> <mi>r</mi> <mo>=</mo> <mn>1.5</mn> <msub> <mi>r</mi> <mi>s</mi> </msub> </mrow> </semantics></math> are marked.</p>
Full article ">Figure 2
<p>Radii of stable (blue line) and unstable (red line) circular orbits versus an angular momentum of a particle near the general relativistic gravitational singularity in the Schwarzschild metric (<a href="#FD1-entropy-26-01035" class="html-disp-formula">1</a>) obtained by the solution of the second equation in the pair (<a href="#FD6-entropy-26-01035" class="html-disp-formula">6</a>). The innermost stable circular orbit occurs at <math display="inline"><semantics> <mrow> <mi>r</mi> <mo>=</mo> <mn>3</mn> <msub> <mi>r</mi> <mi>s</mi> </msub> </mrow> </semantics></math> (yellow dashed horizontal). The coordinates of the point A are <math display="inline"><semantics> <mrow> <mi mathvariant="script">L</mi> <mo>=</mo> <msqrt> <mn>3</mn> </msqrt> <mi>m</mi> <mi>c</mi> <msub> <mi>r</mi> <mi>s</mi> </msub> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mi mathvariant="script">E</mi> <mn>0</mn> </msub> <mo>=</mo> <msqrt> <mstyle scriptlevel="0" displaystyle="true"> <mfrac> <mn>8</mn> <mn>9</mn> </mfrac> </mstyle> </msqrt> <mi>m</mi> <msup> <mi>c</mi> <mn>2</mn> </msup> </mrow> </semantics></math>. The innermost unstable circular orbit occurs at <math display="inline"><semantics> <mrow> <mi>r</mi> <mo>=</mo> <mn>1.5</mn> <msub> <mi>r</mi> <mi>s</mi> </msub> </mrow> </semantics></math> for infinite values of <math display="inline"><semantics> <mi mathvariant="script">L</mi> </semantics></math> and <math display="inline"><semantics> <msub> <mi mathvariant="script">E</mi> <mn>0</mn> </msub> </semantics></math>—marked in the figure by a brown dashed horizontal asymptote. Beneath the innermost stable circular orbit, neither a circular nor any local closed orbit exists. The event horizon and the photon sphere rim (the innermost unstable circular orbit) are shown for illustration.</p>
Full article ">Figure 3
<p>Trajectories of particles which have crossed the photon sphere rim inward, have the form of short spirals directed onto the event horizon—this follows from the solution of Equation (<a href="#FD3-entropy-26-01035" class="html-disp-formula">3</a>) in the radius sector <math display="inline"><semantics> <mrow> <mi>r</mi> <mo>∈</mo> <mo>(</mo> <msub> <mi>r</mi> <mi>s</mi> </msub> <mo>,</mo> <mn>1.5</mn> <msub> <mi>r</mi> <mi>s</mi> </msub> <mo>)</mo> </mrow> </semantics></math>. In the figure, there are shown these spirals for several initial conditions and motion integrals <math display="inline"><semantics> <mi mathvariant="script">L</mi> </semantics></math> and <math display="inline"><semantics> <msub> <mi mathvariant="script">E</mi> <mn>0</mn> </msub> </semantics></math> as specified in the Inset (in which spirals are shown in the coordinates—azimuthal angle versus radius). Though unidirectional spirals can mutually intersect (for opposite signs of angular momenta), it is impossible to close any loop built from their pieces. It means that particles in the photon sphere cannot mutually exchange positions if they belong to the multi-particle system which has passed the photon sphere rim inward. The timing of traversing these spirals is defined by Equation (<a href="#FD2-entropy-26-01035" class="html-disp-formula">2</a>) written in the ordinary time of a remote observer. Changing to the proper time (or to any other curvilinear coordinates in different metrics) does not change the homotopy class of these spirals—local closed loops are not admissible beneath the photon sphere rim in contrary to the upper neighborhood, where arbitrary small local loops are possible due to the crossing of conic sections.</p>
Full article ">Figure 4
<p>Illustrative drawing of the shift of a firewall from the event horizon to the photon sphere rim. The firewall on the event horizon proposed by Polchinski [<a href="#B6-entropy-26-01035" class="html-bibr">6</a>] in order to cope with the information paradox would be invisible for any remote observer. The decay of Fermi spheres in compressed matter passing the photon sphere rim is the source of intensive e-m radiation emission, which takes away the energy and entropy of matter consumed by a black hole—thus, it can take the role of the firewall, considerably changing the premises of the information paradox. Such a firewall would be visible to any remote observer—in particular, it can be responsible for some giant gamma-ray bursts associated with collapses of neutron star mergers or large non-thermal radiation of superluminous quasars.</p>
Full article ">
Back to TopTop