[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 (676)

Search Parameters:
Keywords = vector constraints

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
18 pages, 3303 KiB  
Article
An Enhanced Gas Sensor Data Classification Method Using Principal Component Analysis and Synthetic Minority Over-Sampling Technique Algorithms
by Xianzhang Zeng, Muhammad Shahzeb, Xin Cheng, Qiang Shen, Hongyang Xiao, Cao Xia, Yuanlin Xia, Yubo Huang, Jingfei Xu and Zhuqing Wang
Micromachines 2024, 15(12), 1501; https://doi.org/10.3390/mi15121501 - 16 Dec 2024
Abstract
This study addresses the challenge of multi-dimensional and small gas sensor data classification using a gelatin–carbon black (CB-GE) composite film sensor, achieving 91.7% accuracy in differentiating gas types (ethanol, acetone, and air). Key techniques include Principal Component Analysis (PCA) for dimensionality reduction, the [...] Read more.
This study addresses the challenge of multi-dimensional and small gas sensor data classification using a gelatin–carbon black (CB-GE) composite film sensor, achieving 91.7% accuracy in differentiating gas types (ethanol, acetone, and air). Key techniques include Principal Component Analysis (PCA) for dimensionality reduction, the Synthetic Minority Over-sampling Technique (SMOTE) for data augmentation, and the Support Vector Machine (SVM) and K-Nearest Neighbor (KNN) algorithms for classification. PCA improved KNN and SVM classification, boosting the Area Under the Curve (AUC) scores by 15.7% and 25.2%, respectively. SMOTE increased KNN’s accuracy by 2.1%, preserving data structure better than polynomial fitting. The results demonstrate a scalable approach to enhancing classification accuracy under data constraints. This approach shows promise for expanding gas sensor applicability in fields where data limitations previously restricted reliability and effectiveness. Full article
23 pages, 20798 KiB  
Article
Impacts of Policies on Tourism-Oriented Rural Spaces: A Case Study of Minority Villages in Yanbian Prefecture
by Yu Zhang, Wenxin Xiong and Li Dong
Land 2024, 13(12), 2190; https://doi.org/10.3390/land13122190 - 15 Dec 2024
Viewed by 276
Abstract
In 2005, the Fifth Plenary Session of the 16th Central Committee of the Communist Party of China introduced a strategic plan to advance the construction of a new socialist countryside, thereby providing a policy foundation for the robust development of rural tourism. Against [...] Read more.
In 2005, the Fifth Plenary Session of the 16th Central Committee of the Communist Party of China introduced a strategic plan to advance the construction of a new socialist countryside, thereby providing a policy foundation for the robust development of rural tourism. Against this policy backdrop, the present study investigates the impact of rural tourism policies on the spatial evolution of ethnic minority villages in Yanbian Prefecture, utilizing data from the period 2004–2023. As a representative region in China where ethnic minorities coexist, Yanbian Prefecture exhibits distinctive cultural and spatial features in its Korean villages, making it a key pilot area for rural tourism development. This study utilizes the PMC index model, the coupled coordination degree model, and the vector autoregressive model to analyze the implementation effects of rural tourism policies and to establish an index system for rural spatial construction. By examining the spatial evolution of representative ethnic minority villages in Yanbian Prefecture, the research explores the dynamic interactions between tourism policies and rural construction, as well as the underlying causal mechanisms. The findings indicate that: (1) in ethnic minority villages, geographic characteristics and various constraints contribute to delayed initial policy effects, with negative fluctuations observed, highlighting a distinct lag effect in the policy implementation process; and (2) a significant Granger causality exists between tourism policies and rural spatial construction, with varying effects observed across different dimensions. The study centers on ethnic minority settlements, systematically analyzing the dynamic effects of tourism policies in the context of their spatial evolution characteristics. It offers sustainable development policy recommendations tailored to the unique attributes of ethnic minority villages. lt is suggested that the actual needs of village construction and long-term development goals should be fully considered when formulating and implementing policies to promote the sustainable development of ethnic minority areas. Full article
(This article belongs to the Section Land Environmental and Policy Impact Assessment)
Show Figures

Figure 1

Figure 1
<p>Location map of the study area. (<b>a</b>) is a map of China, (<b>b</b>) is an enlarged map of Jilin Province, (<b>c</b>) is a map of Yanji, (<b>d</b>) Shuinan Village, (<b>e</b>) Guangdong Village, (<b>f</b>) Jindalai Village, (<b>g</b>) Bailong Village, (<b>h</b>) Mingdong Village.</p>
Full article ">Figure 2
<p>Policy PMC index mean radar chart and policy PMC surface chart.</p>
Full article ">Figure 3
<p>(<b>a</b>–<b>f</b>): Impulse response analysis (part 1). (<b>g</b>–<b>j</b>): Impulse response analysis (part 2).</p>
Full article ">Figure 3 Cont.
<p>(<b>a</b>–<b>f</b>): Impulse response analysis (part 1). (<b>g</b>–<b>j</b>): Impulse response analysis (part 2).</p>
Full article ">Figure 4
<p>(<b>a</b>–<b>h</b>): Graph of variance decomposition analysis (part 1). (<b>i</b>,<b>j</b>): Graph of variance decomposition analysis (part 2).</p>
Full article ">Figure 4 Cont.
<p>(<b>a</b>–<b>h</b>): Graph of variance decomposition analysis (part 1). (<b>i</b>,<b>j</b>): Graph of variance decomposition analysis (part 2).</p>
Full article ">
19 pages, 636 KiB  
Article
Analytical Shortcuts to Multiple-Objective Portfolio Optimization: Investigating the Non-Negativeness of Portfolio Weight Vectors of Equality-Constraint-Only Models and Implications for Capital Asset Pricing Models
by Yue Qi, Yue Wang, Jianing Huang and Yushu Zhang
Mathematics 2024, 12(24), 3946; https://doi.org/10.3390/math12243946 - 15 Dec 2024
Viewed by 379
Abstract
Computing optimal-solution sets has long been a topic in multiple-objective optimization. Despite substantial progress, there are still research limitations in the multiple-objective portfolio optimization area. The optimal-solution sets’ structure is barely known. Public-domain software for even three objectives is absent. Alternatively, researchers scrutinize [...] Read more.
Computing optimal-solution sets has long been a topic in multiple-objective optimization. Despite substantial progress, there are still research limitations in the multiple-objective portfolio optimization area. The optimal-solution sets’ structure is barely known. Public-domain software for even three objectives is absent. Alternatively, researchers scrutinize equality-constraint-only models and analytically resolve them. Within this context, this paper extends these analytical methods for nonnegative constraints and thus theoretically contributes to the literature. We prove the existence of positive elements and negative elements for the optimal-solution sets. Practically, we prove that non-negative subsets of the optimal-solution sets can exist. Consequently, the possible existence endorses these analytical methods, because researchers bypass mathematical programming, analytically resolve, and pinpoint some non-negative optima. Moreover, we elucidate these analytical methods’ alignment with capital asset pricing models (CAPMs). Furthermore, we generalize for k-objective models. In conclusion, this paper theoretically reinforces these analytical methods and hints the optimal-solution sets’ structure for multiple-objective portfolio optimization. Full article
(This article belongs to the Special Issue Mathematical Models and Applications in Finance)
Show Figures

Figure 1

Figure 1
<p>Comparing methods to resolve (<a href="#FD4-mathematics-12-03946" class="html-disp-formula">4</a>) with the criterion space in the left part and decision space respectively in the right part.</p>
Full article ">Figure 2
<p>A flow chart of searching a non-negative subset.</p>
Full article ">Figure 3
<p>A convex set and efficient sets of (<a href="#FD3-mathematics-12-03946" class="html-disp-formula">3</a>), (<a href="#FD2-mathematics-12-03946" class="html-disp-formula">2</a>), (<a href="#FD6-mathematics-12-03946" class="html-disp-formula">6</a>) and (<a href="#FD5-mathematics-12-03946" class="html-disp-formula">5</a>) in <math display="inline"><semantics> <msup> <mi mathvariant="double-struck">R</mi> <mi>n</mi> </msup> </semantics></math>.</p>
Full article ">
21 pages, 2779 KiB  
Article
Integrating Spatiotemporal and Travel-Related Information for Accurate Urban Passenger Profiling Using GANs
by Xiaoqi Duan, Jianbing Yang, Sha Yu and Youliang Tian
Land 2024, 13(12), 2178; https://doi.org/10.3390/land13122178 - 13 Dec 2024
Viewed by 256
Abstract
The elaborate description of passenger travel profiles is of significant importance in urban planning, socioeconomic structural design, and individual travel preference analysis. Traditional models often lack consideration of personalized features and exhibit suboptimal performance in constructing spatiotemporal dependencies. To address these issues, this [...] Read more.
The elaborate description of passenger travel profiles is of significant importance in urban planning, socioeconomic structural design, and individual travel preference analysis. Traditional models often lack consideration of personalized features and exhibit suboptimal performance in constructing spatiotemporal dependencies. To address these issues, this paper proposes a method that integrates spatiotemporal information with travel-related information and employs generative adversarial networks (GANs) for adversarial training. This method accurately fits the true distribution of user travel data, thereby providing detailed profiles of public transportation passengers’ travel behavior. Specifically, the proposed approach considers the complete travel chain of individuals, establishes a spatiotemporal constraint representation model, and utilizes GANs to simulate the distribution of passenger travel, obtaining more compact and high-level travel vector features. The empirical results demonstrate that the proposed method accurately captures passengers’ travel patterns in both the temporal and spatial dimensions, offering technical support for urban transportation planning. Full article
Show Figures

Figure 1

Figure 1
<p>Algorithm flowchart.</p>
Full article ">Figure 2
<p>Pre-training process.</p>
Full article ">Figure 3
<p>Passenger profile construction supported by generative adversarial networks.</p>
Full article ">Figure 4
<p>Study area.</p>
Full article ">Figure 5
<p>Quadtree partition grid diagram.</p>
Full article ">Figure 6
<p>Characteristics of travel groups.</p>
Full article ">Figure 7
<p>Spatial distribution patterns of different types of populations (A, C and E represent random mobility area, B and G represent high-traffic commuter area, D and F represent areas with intensive travel activities).</p>
Full article ">
16 pages, 433 KiB  
Article
A Fast Coding Unit Partitioning Decision Algorithm for Versatile Video Coding Based on Gradient Feedback Hierarchical Convolutional Neural Network and Light Gradient Boosting Machine Decision Tree
by Fangmei Liu, Jiyuan Wang and Qiuwen Zhang
Electronics 2024, 13(24), 4908; https://doi.org/10.3390/electronics13244908 - 12 Dec 2024
Viewed by 269
Abstract
Video encoding technology is a foundational component in the advancement of modern technological applications. The latest standard in universal video coding, H.266/VVC, features a quad-tree with nested multi-type tree (QTMT) partitioning structure, which represents an improvement over its predecessor, High-Efficiency Video Coding (H.265/HEVC). [...] Read more.
Video encoding technology is a foundational component in the advancement of modern technological applications. The latest standard in universal video coding, H.266/VVC, features a quad-tree with nested multi-type tree (QTMT) partitioning structure, which represents an improvement over its predecessor, High-Efficiency Video Coding (H.265/HEVC). This configuration facilitates adaptable block segmentation, albeit at the cost of heightened encoding complexity. In view of the aforementioned considerations, this paper puts forth a deep learning-based approach to facilitate CU partitioning, with the aim of supplanting the intricate CU partitioning process observed in the Versatile Video Coding Test Model (VTM). We begin by presenting the Gradient Feedback Hierarchical CNN (GFH-CNN) model, an advanced convolutional neural network derived from the ResNet architecture, enabling the extraction of features from 64 × 64 coding unit (CU) blocks. Following this, a hierarchical network diagram (HND) is crafted to depict the delineation of partition boundaries corresponding to the various levels of the CU block’s layered structure. This diagram maps the features extracted by the GFH-CNN model to the partitioning at each level and boundary. In conclusion, a LightGBM-based decision tree classification model (L-DT) is constructed to predict the corresponding partition structure based on the prediction vector output from the GFH-CNN model. Subsequently, any errors in the partitioning results are corrected in accordance with the encoding constraints specified by the VTM, which ultimately determines the final CU block partitioning. The experimental results demonstrate that, in comparison with VTM-10.0, the proposed algorithm achieves a 48.14% reduction in complexity with only a 0.83% increase in bitrate under the top-three configuration, which is negligible. In comparison, the top-two configuration resulted in a higher complexity reduction of 63.78%, although this was accompanied by a 2.08% increase in bitrate. These results demonstrate that, in comparison to existing solutions, our approach provides an optimal balance between encoding efficiency and computational complexity. Full article
Show Figures

Figure 1

Figure 1
<p>Algorithm flowchart of the GFH-CNN+L-DT model framework.</p>
Full article ">Figure 2
<p>CTU partitioning in VVC. (<b>a</b>) VVC split types. (<b>b</b>) Example of CTU partitioning in MTT.</p>
Full article ">Figure 3
<p>CTU partitioning in VVC. (<b>a</b>) VVC split types. (<b>b</b>) Schematic diagram of different levels of HND.</p>
Full article ">Figure 4
<p>The proposed GFH-CNN model framework takes brightness information as input and outputs probability vectors.</p>
Full article ">Figure 5
<p>Loss and accuracy rate of the GFH-CNN model.</p>
Full article ">Figure 6
<p>Comparison of our algorithm with various algorithms [<a href="#B19-electronics-13-04908" class="html-bibr">19</a>,<a href="#B36-electronics-13-04908" class="html-bibr">36</a>,<a href="#B37-electronics-13-04908" class="html-bibr">37</a>].</p>
Full article ">
32 pages, 10548 KiB  
Article
An Unsupervised Remote Sensing Image Change Detection Method Based on RVMamba and Posterior Probability Space Change Vector
by Jiaxin Song, Shuwen Yang, Yikun Li and Xiaojun Li
Remote Sens. 2024, 16(24), 4656; https://doi.org/10.3390/rs16244656 - 12 Dec 2024
Viewed by 320
Abstract
Change vector analysis in posterior probability space (CVAPS) is an effective change detection (CD) framework that does not require sound radiometric correction and is robust against accumulated classification errors. Based on training samples within target images, CVAPS can generate a uniformly scaled change-magnitude [...] Read more.
Change vector analysis in posterior probability space (CVAPS) is an effective change detection (CD) framework that does not require sound radiometric correction and is robust against accumulated classification errors. Based on training samples within target images, CVAPS can generate a uniformly scaled change-magnitude map that is suitable for a global threshold. However, vigorous user intervention is required to achieve optimal performance. Therefore, to eliminate user intervention and retain the merit of CVAPS, an unsupervised CVAPS (UCVAPS) CD method, RFCC, which does not require rigorous user training, is proposed in this study. In the RFCC, we propose an unsupervised remote sensing image segmentation algorithm based on the Mamba model, i.e., RVMamba differentiable feature clustering, which introduces two loss functions as constraints to ensure that RVMamba achieves accurate segmentation results and to supply the CSBN module with high-quality training samples. In the CD module, the fuzzy C-means clustering (FCM) algorithm decomposes mixed pixels into multiple signal classes, thereby alleviating cumulative clustering errors. Then, a context-sensitive Bayesian network (CSBN) model is introduced to incorporate spatial information at the pixel level to estimate the corresponding posterior probability vector. Thus, it is suitable for high-resolution remote sensing (HRRS) imagery. Finally, the UCVAPS framework can generate a uniformly scaled change-magnitude map that is suitable for the global threshold and can produce accurate CD results. The experimental results on seven change detection datasets confirmed that the proposed method outperforms five state-of-the-art competitive CD methods. Full article
Show Figures

Figure 1

Figure 1
<p>Unsupervised change detection process based on RVMamba and Posterior Probability.</p>
Full article ">Figure 2
<p>Feature extraction network for visual state space modeling. (<b>a</b>) The overarching design of RVMamba. (<b>b</b>) VSS block; SS2D is the core operation in VSS block.</p>
Full article ">Figure 3
<p>Data flow of SS2D. It expands the inputs in four directions according to the serial number, scans them one by one through S6, and then merges them.</p>
Full article ">Figure 4
<p>Context-sensitive Bayesian network model.</p>
Full article ">Figure 5
<p>Experimental datasets and ground truth.</p>
Full article ">Figure 6
<p>Segmentation accuracies of RVMamba, UNet, and KMeans.</p>
Full article ">Figure 7
<p>Change maps obtained by the different most advanced methods on the dataset DS1. (<b>a</b>) ASEA, (<b>b</b>) PCANet, (<b>c</b>) KPCAMNet, (<b>d</b>) DeepCVA, (<b>e</b>) GMCD, (<b>f</b>) RFCC. (Black is TN, white is TP, red is FA, and green is MD).</p>
Full article ">Figure 8
<p>Change maps obtained by the different most advanced methods on the dataset DS2. (<b>a</b>) ASEA, (<b>b</b>) PCANet, (<b>c</b>) KPCAMNet, (<b>d</b>) DeepCVA, (<b>e</b>) GMCD, (<b>f</b>) RFCC. (Black is TN, white is TP, red is FA, and green is MD).</p>
Full article ">Figure 9
<p>Change maps obtained by the different most advanced methods on the dataset DS3. (<b>a</b>) ASEA, (<b>b</b>) PCANet, (<b>c</b>) KPCAMNet, (<b>d</b>) DeepCVA, (<b>e</b>) GMCD, (<b>f</b>) RFCC. (Black is TN, white is TP, red is FA, and green is MD).</p>
Full article ">Figure 10
<p>Change maps obtained with different algorithms tested on the dataset DS1. (<b>a</b>) RFCC, (<b>b</b>) UNet-FCM-CSBN-CVAPS, (<b>c</b>) RVMamba-FCM-SBN-CVAPS, (<b>d</b>) RVMamba-SVM-CVAPS. (Black is TN, white is TP, red is FA, and green is MD).</p>
Full article ">Figure 11
<p>Change maps obtained with different algorithms tested on the dataset DS2. (<b>a</b>) RFCC, (<b>b</b>) UNet-FCM-CSBN-CVAPS, (<b>c</b>) RVMamba-FCM-SBN-CVAPS, (<b>d</b>) RVMamba-SVM-CVAPS. (Black is TN, white is TP, red is FA, and green is MD).</p>
Full article ">Figure 12
<p>Change maps obtained with different algorithms tested on the dataset DS3. (<b>a</b>) RFCC, (<b>b</b>) UNet-FCM-CSBN-CVAPS, (<b>c</b>) RVMamba-FCM-SBN-CVAPS, (<b>d</b>) RVMamba-SVM-CVAPS. (Black is TN, white is TP, red is FA, and green is MD).</p>
Full article ">Figure 13
<p>Evaluation of change magnitude and entropy in bitemporal simulated posterior probability vectors. (<b>a</b>): Low uncertainty. (<b>b</b>): Appropriate reduction in certainty. (<b>c</b>): High uncertainty.</p>
Full article ">Figure 14
<p>Effect of fuzziness q on algorithm results.</p>
Full article ">Figure 15
<p>Effect of window size on algorithm results.</p>
Full article ">Figure 16
<p>Effect of the number of segmentation labels on Kappa and algorithm timeliness.</p>
Full article ">Figure 17
<p>Change maps generated by different techniques in the adaptive experiments. (Black is TN, white is TP, red is FA, and green is MD).</p>
Full article ">Figure 18
<p>Change detection with unsupervised segmentation.</p>
Full article ">Figure 19
<p>Change detection based on RVMamba, K-means, and Fuzzy C-means unsupervised segmentation.</p>
Full article ">
31 pages, 8127 KiB  
Article
Data-Driven Kinematic Model for the End-Effector Pose Control of a Manipulator Robot
by Josué Goméz-Casas, Carlos A. Toro-Arcila, Nelly Abigaíl Rodríguez-Rosales, Jonathan Obregón-Flores, Daniela E. Ortíz-Ramos, Jesús Fernando Martínez-Villafañe and Oziel Gómez-Casas
Processes 2024, 12(12), 2831; https://doi.org/10.3390/pr12122831 - 10 Dec 2024
Viewed by 459
Abstract
This paper presents a data-driven kinematic model for the end-effector pose control applied to a variety of manipulator robots, focusing on the entire end-effector’s pose (position and orientation). The measured signals of the full pose and their computed derivatives, along with a linear [...] Read more.
This paper presents a data-driven kinematic model for the end-effector pose control applied to a variety of manipulator robots, focusing on the entire end-effector’s pose (position and orientation). The measured signals of the full pose and their computed derivatives, along with a linear combination of an estimated Jacobian matrix and a vector of joint velocities, generate a model estimation error. The Jacobian matrix is estimated using the Pseudo Jacobian Matrix (PJM) algorithm, which requires tuning only the step and weight parameters that scale the convergence of the model estimation error. The proposed control law is derived in two stages: the first one is part of an objective function minimization, and the second one is a constraint in a quasi-Lagrangian function. The control design parameters guarantee the control error convergence in a closed-loop configuration with adaptive behavior in terms of the dynamics of the estimated Jacobian matrix. The novelty of the approach lies in its ability to achieve superior tracking performance across different manipulator robots, validated through simulations. Quantitative results show that, compared to a classical inverse-kinematics approach, the proposed method achieves rapid convergence of performance indices (e.g., Root Mean Square Error (RMSE) reduced to near-zero in two cycles vs. a steady-state RMSE of 20 in the classical approach). Additionally, the proposed method minimizes joint drift, maintaining an RMSE of approximately 0.3 compared to 1.5 under the classical scheme. The control was validated by means of simulations featuring an UR5e manipulator with six Degrees of Freedom (DOF), a KUKA Youbot with eight DOF, and a KUKA Youbot Dual with thirteen DOF. The stability analysis of the closed-loop controller is demonstrated by means of the Lyapunov stability conditions. Full article
Show Figures

Figure 1

Figure 1
<p>Closed-loop configuration diagram.</p>
Full article ">Figure 2
<p>CoppeliaSim simulation environment showcasing different types of robots. The figure highlights the reference frames of the world’s origin, end-effector, target object, and the orientation control joystick in each setup: (<b>a</b>) UR5 simulation setup, (<b>b</b>) KY simulation setup, and (<b>c</b>) KYD simulation setup.</p>
Full article ">Figure 3
<p>End-effector user commands.</p>
Full article ">Figure 4
<p>End-effector pose errors.</p>
Full article ">Figure 5
<p>End-effector velocities.</p>
Full article ">Figure 6
<p>Control signals.</p>
Full article ">Figure 7
<p>End-effector user commands.</p>
Full article ">Figure 8
<p>End-effector pose errors.</p>
Full article ">Figure 9
<p>End-effector velocities.</p>
Full article ">Figure 10
<p>Control signals.</p>
Full article ">Figure 11
<p>Commands for the left tip.</p>
Full article ">Figure 12
<p>Commands for the right tip.</p>
Full article ">Figure 13
<p>Pose errors of the left tip.</p>
Full article ">Figure 14
<p>Pose errors of the right tip.</p>
Full article ">Figure 15
<p>Left end-effector velocities.</p>
Full article ">Figure 16
<p>Right end-effector velocities.</p>
Full article ">Figure 17
<p>Control signals.</p>
Full article ">Figure 18
<p>CoppeliaSim simulation environment: the KY’s end-effector performs a trajectory tracking task defined in the <math display="inline"><semantics> <mrow> <mo>(</mo> <mi>x</mi> <mo>,</mo> <mi>y</mi> <mo>)</mo> </mrow> </semantics></math> plane, with a constant height <span class="html-italic">z</span>, while keeping the initial orientation unchanged—the goal is to perform a polishing operation under the surface of the disk. (<b>a</b>) Simulation setup home position. (<b>b</b>) KY under DDMC scheme. (<b>c</b>) KY under classic inverse-kinematics control scheme.</p>
Full article ">Figure 19
<p>Pose control performance indexes while performing a cyclic routine. (<b>a</b>) Performance indexes under DDCM scheme. (<b>b</b>) Performance indexes under classic inverse-kinematics control scheme.</p>
Full article ">
32 pages, 4118 KiB  
Article
Mutual-Energy Inner Product Optimization Method for Constructing Feature Coordinates and Image Classification in Machine Learning
by Yuanxiu Wang
Mathematics 2024, 12(23), 3872; https://doi.org/10.3390/math12233872 - 9 Dec 2024
Viewed by 430
Abstract
As a key task in machine learning, data classification is essential to find a suitable coordinate system to represent the data features of different classes of samples. This paper proposes the mutual-energy inner product optimization method for constructing a feature coordinate system. First, [...] Read more.
As a key task in machine learning, data classification is essential to find a suitable coordinate system to represent the data features of different classes of samples. This paper proposes the mutual-energy inner product optimization method for constructing a feature coordinate system. First, by analyzing the solution space and eigenfunctions of the partial differential equations describing a non-uniform membrane, the mutual-energy inner product is defined. Second, by expressing the mutual-energy inner product as a series of eigenfunctions, it shows the significant advantage of enhancing low-frequency features and suppressing high-frequency noise, compared to the Euclidean inner product. And then, a mutual-energy inner product optimization model is built to extract the data features, and the convexity and concavity properties of its objective function are discussed. Next, by combining the finite element method, a stable and efficient sequential linearization algorithm is constructed to solve the optimization model. This algorithm only solves positive definite symmetric matrix equations and linear programming with a few constraints, and its vectorized implementation is discussed. Finally, the mutual-energy inner product optimization method is used to construct feature coordinates, and multi-class Gaussian classifiers are trained on the MINST training set. Good prediction results of the Gaussian classifiers are achieved on the MINST test set. Full article
(This article belongs to the Special Issue Advances in Machine Learning and Graph Neural Networks)
Show Figures

Figure 1

Figure 1
<p>The means of the samples.</p>
Full article ">Figure 2
<p>Design variables.</p>
Full article ">Figure 3
<p>Reference feature coordinate.</p>
Full article ">Figure 4
<p>Sample distribution.</p>
Full article ">Figure 5
<p>Confusion Matrix.</p>
Full article ">Figure 6
<p>Confusion Matrix.</p>
Full article ">Figure 7
<p>Confusion Matrix.</p>
Full article ">
19 pages, 3016 KiB  
Article
Phase-Only Transmit Beampattern Synthesis Method for Cluttered Environments for Airborne Radar
by Jing Shi, Cao Zeng, Lichu Lai and Jiaqi Zhang
Electronics 2024, 13(23), 4766; https://doi.org/10.3390/electronics13234766 - 2 Dec 2024
Viewed by 329
Abstract
In order to solve the problem of strong downward clutter jamming in airborne radar detection, we propose a phase-only transmit beampattern synthesis method. Firstly, with the aim of minimizing the sidelobe gain in the cluttered region, the desired radiation pattern is constructed by [...] Read more.
In order to solve the problem of strong downward clutter jamming in airborne radar detection, we propose a phase-only transmit beampattern synthesis method. Firstly, with the aim of minimizing the sidelobe gain in the cluttered region, the desired radiation pattern is constructed by using terrain environmental information from where the airborne radar operates. Secondly, an optimization model for phase-only transmit beampattern synthesis accounting for four constraints (the mainlobe gain, the sidelobe gain in the highly cluttered region, the sidelobe gain at other angles, and the amplitude of the weight vector) is established. The Alternating Direction Method of Multipliers (ADMM) is then used to find the iterative solution. Based on the results of four sets of simulation examples designed to verify the effectiveness of the proposed method, it is concluded that the method can reduce the echo intensity in the cluttered region and is suitable for a wide range of array configurations. Full article
(This article belongs to the Special Issue Advances in Array Signal Processing for Diverse Applications)
Show Figures

Figure 1

Figure 1
<p>The program flow of the proposed beampattern synthesis method.</p>
Full article ">Figure 2
<p>The relationship between clutter echo power and <math display="inline"><semantics> <mi>θ</mi> </semantics></math> simulated by using the Morchin model: (<b>a</b>) ground clutter; (<b>b</b>) sea clutter.</p>
Full article ">Figure 3
<p>Simulation results of Example 1: (<b>a</b>) evolution curve; (<b>b</b>) amplitude- and phase-weighted results; (<b>c</b>) beampattern synthesis results; (<b>d</b>) unnormalized beampattern synthesis results; (<b>e</b>) echo signal power.</p>
Full article ">Figure 4
<p>Simulation results of Example 2: (<b>a</b>) evolution curve; (<b>b</b>) amplitude- and phase-weighted results; (<b>c</b>) beampattern synthesis results; (<b>d</b>) unnormalized beampattern synthesis results; (<b>e</b>) echo signal power.</p>
Full article ">Figure 5
<p>Simulation results of Example 3: (<b>a</b>) array position; (<b>b</b>) evolution curve; (<b>c</b>) amplitude- and phase-weighted results; (<b>d</b>) beampattern synthesis results; (<b>e</b>) unnormalized beampattern synthesis results; (<b>f</b>) 3D representations of synthesized beampattern; (<b>g</b>) standard beampattern; (<b>h</b>) unnormalized standard beampattern; (<b>i</b>) 3D representations of standard beampattern; (<b>j</b>) echo signal power of gain-free beampattern; (<b>k</b>) echo signal power of original beampattern; (<b>l</b>) echo signal power of proposed algorithm.</p>
Full article ">Figure 6
<p>Simulation results of Example 4: (<b>a</b>) array position; (<b>b</b>) evolution curve; (<b>c</b>) amplitude- and phase-weighted results; (<b>d</b>) beampattern synthesis results; (<b>e</b>) unnormalized beampattern synthesis results; (<b>f</b>) 3D representations of synthesized beampattern; (<b>g</b>) standard beampattern; (<b>h</b>) unnormalized standard beampattern; (<b>i</b>) 3D representations of standard beampattern; (<b>j</b>) echo signal power of gain-free beampattern; (<b>k</b>) echo signal power of original beampattern; (<b>l</b>) echo signal power of proposed algorithm.</p>
Full article ">Figure 6 Cont.
<p>Simulation results of Example 4: (<b>a</b>) array position; (<b>b</b>) evolution curve; (<b>c</b>) amplitude- and phase-weighted results; (<b>d</b>) beampattern synthesis results; (<b>e</b>) unnormalized beampattern synthesis results; (<b>f</b>) 3D representations of synthesized beampattern; (<b>g</b>) standard beampattern; (<b>h</b>) unnormalized standard beampattern; (<b>i</b>) 3D representations of standard beampattern; (<b>j</b>) echo signal power of gain-free beampattern; (<b>k</b>) echo signal power of original beampattern; (<b>l</b>) echo signal power of proposed algorithm.</p>
Full article ">
18 pages, 12610 KiB  
Article
Automatic Registration of Panoramic Images and Point Clouds in Urban Large Scenes Based on Line Features
by Panke Zhang, Hao Ma, Liuzhao Wang, Ruofei Zhong, Mengbing Xu and Siyun Chen
Remote Sens. 2024, 16(23), 4450; https://doi.org/10.3390/rs16234450 - 27 Nov 2024
Viewed by 431
Abstract
As the combination of panoramic images and laser point clouds becomes more and more widely used as a technique, the accurate determination of external parameters has become essential. However, due to the relative position change of the sensor and the time synchronization error, [...] Read more.
As the combination of panoramic images and laser point clouds becomes more and more widely used as a technique, the accurate determination of external parameters has become essential. However, due to the relative position change of the sensor and the time synchronization error, the automatic and accurate matching of the panoramic image and the point cloud is very challenging. In order to solve this problem, this paper proposes an automatic and accurate registration method for panoramic images and point clouds of urban large scenes based on line features. Firstly, the multi-modal point cloud line feature extraction algorithm is used to extract the edge of the point cloud. Based on the point cloud intensity orthoimage (an orthogonal image based on the point cloud’s intensity values), the edge of the road markings is extracted, and the geometric feature edge is extracted by the 3D voxel method. Using the established virtual projection correspondence for the panoramic image, the panoramic image is projected onto the virtual plane for edge extraction. Secondly, the accurate matching relationship is constructed by using the feature constraint of the direction vector, and the edge features from both sensors are refined and aligned to realize the accurate calculation of the registration parameters. The experimental results show that the proposed method shows excellent registration results in challenging urban scenes. The average registration error is better than 3 pixels, and the root mean square error (RMSE) is less than 1.4 pixels. Compared with the mainstream methods, it has advantages and can promote the further research and application of panoramic images and laser point clouds. Full article
Show Figures

Figure 1

Figure 1
<p>The framework of the registration.</p>
Full article ">Figure 2
<p>Virtual projection segmentation of panoramic image. (<b>A</b>) Front view after projection; (<b>B</b>) Right view after projection; (<b>C</b>) Back view after projection; (<b>D</b>) Left view after projection.</p>
Full article ">Figure 3
<p>Transformation of panoramic image and point cloud coordinate.</p>
Full article ">Figure 4
<p>Overview of the experimental areas. (<b>a</b>) Beijing; (<b>b</b>) Guangzhou; (<b>c</b>) Hong Kong.</p>
Full article ">Figure 5
<p>Point of cloud road marking edge detection: (<b>a</b>) original point cloud; (<b>b</b>) intensity orthoimage; (<b>c</b>) semantic segmentation; (<b>d</b>) road marking edge points.</p>
Full article ">Figure 6
<p>Point cloud geometric edge: (<b>a</b>) point cloud voxel; (<b>b</b>) geometric feature edge points.</p>
Full article ">Figure 7
<p>Panoramic segmentation and edge line extraction: (<b>a</b>) directly extracted from the panoramic image; (<b>b</b>) extracted after virtual projection segmentation.</p>
Full article ">Figure 7 Cont.
<p>Panoramic segmentation and edge line extraction: (<b>a</b>) directly extracted from the panoramic image; (<b>b</b>) extracted after virtual projection segmentation.</p>
Full article ">Figure 8
<p>Visualization of the registration process: (<b>a</b>) initial registration; (<b>b</b>) final registration.</p>
Full article ">Figure 9
<p>Panorama and point cloud registration effect diagram: (<b>a</b>) before the algorithm processing; (<b>b</b>) after algorithm processing.</p>
Full article ">Figure 10
<p>The visualization effects of different methods: (<b>a</b>–<b>d</b>) results of the proposed method A–D; (<b>e</b>) the overall effect diagram of method D. The number (<b>1</b>–<b>3</b>) represents the results on datasets I–III.</p>
Full article ">Figure 10 Cont.
<p>The visualization effects of different methods: (<b>a</b>–<b>d</b>) results of the proposed method A–D; (<b>e</b>) the overall effect diagram of method D. The number (<b>1</b>–<b>3</b>) represents the results on datasets I–III.</p>
Full article ">
18 pages, 1365 KiB  
Article
LIO-SAM++: A Lidar-Inertial Semantic SLAM with Association Optimization and Keyframe Selection
by Bingke Shen, Wenming Xie, Xiaodong Peng, Xiaoning Qiao and Zhiyuan Guo
Sensors 2024, 24(23), 7546; https://doi.org/10.3390/s24237546 - 26 Nov 2024
Viewed by 530
Abstract
Current lidar-inertial SLAM algorithms mainly rely on the geometric features of the lidar for point cloud alignment. The issue of incorrect feature association arises because the matching process is susceptible to influences such as dynamic objects, occlusion, and environmental changes. To address this [...] Read more.
Current lidar-inertial SLAM algorithms mainly rely on the geometric features of the lidar for point cloud alignment. The issue of incorrect feature association arises because the matching process is susceptible to influences such as dynamic objects, occlusion, and environmental changes. To address this issue, we present a lidar-inertial SLAM system based on the LIO-SAM framework, combining semantic and geometric constraints for association optimization and keyframe selection. Specifically, we mitigate the impact of erroneous matching points on pose estimation by comparing the consistency of normal vectors in the surrounding region. Additionally, we incorporate semantic information to establish semantic constraints, further enhancing matching accuracy. Furthermore, we propose an adaptive selection strategy based on semantic differences between frames to improve the reliability of keyframe generation. Experimental results on the KITTI dataset indicate that, compared to other systems, the accuracy of the pose estimation has significantly improved. Full article
Show Figures

Figure 1

Figure 1
<p>The structure of the LIO-SAM++.</p>
Full article ">Figure 2
<p>The number of times use of 01 sequence correlation points. (<b>a</b>) Traditional method. (<b>b</b>) Proposed method.</p>
Full article ">Figure 3
<p>The number of times of 06 sequence correlation points. (<b>a</b>) Traditional method. (<b>b</b>) Proposed method.</p>
Full article ">Figure 4
<p>In the same sequence, the keyframe sequence numbers selected by the traditional pose change method and the method using the scene semantic information were compared. (<b>a</b>) sequence 06. (<b>b</b>) sequence 07.</p>
Full article ">Figure 5
<p>Comparative analysis of the estimated trajectories against the GT in sequence 02. (<b>a</b>) trajectories. (<b>b</b>) position. (<b>c</b>) rotation.</p>
Full article ">Figure 6
<p>Comparative analysis of the estimated trajectories against the GT in sequence 09. (<b>a</b>) trajectories. (<b>b</b>) position. (<b>c</b>) rotation.</p>
Full article ">Figure 7
<p>Comparative analysis of the estimated trajectories against the GT in sequence 10. (<b>a</b>) trajectories. (<b>b</b>) position. (<b>c</b>) rotation.</p>
Full article ">
25 pages, 2657 KiB  
Article
Domain-Specific Modeling Language for Security Analysis of EV Charging Infrastructure
by Anas Motii, Mahmoud El Hamlaoui and Robert Basmadjian
Energies 2024, 17(23), 5832; https://doi.org/10.3390/en17235832 - 21 Nov 2024
Viewed by 575
Abstract
Electric vehicles (EVs) and their ecosystem have unquestionably made significant technological strides. Indeed, EVs have evolved into sophisticated computer systems with extensive internal and external communication capabilities. This interconnection raises concerns about security, privacy, and the expanding risk of cyber-attacks within the electric [...] Read more.
Electric vehicles (EVs) and their ecosystem have unquestionably made significant technological strides. Indeed, EVs have evolved into sophisticated computer systems with extensive internal and external communication capabilities. This interconnection raises concerns about security, privacy, and the expanding risk of cyber-attacks within the electric vehicle landscape. In particular, the charging infrastructure plays a crucial role in the electric mobility ecosystem. With the proliferation of charging points, new attack vectors are opened up for cybercriminals. The threat landscape targeting charging systems encompasses various types of attacks ranging from physical attacks to data breaches including customer information. In this paper, we aim to leverage the power of model-driven engineering to model and analyze EV charging systems at early stages. We employ domain-specific modeling language (DSML) techniques for the early security modeling and analysis of EV charging infrastructure. We accomplish this by integrating the established EMSA model for electric mobility, which encapsulates all key stakeholders in the ecosystem. To our knowledge, this represents the first instance in the literature of applying DSML within the electric mobility ecosystem, highlighting its innovative nature. Moreover, as our formalization based on DSML is an iterative, continuous, and evolving process, this approach guarantees that our proposed framework adeptly tackles the evolving cyber threats confronting the EV industry. Specifically, we use the Object Constraint Language (OCL) for precise specification and verification of security threats as properties of a modeled system. To validate our framework, we explore a set of representative threats targeting EV charging systems from real-world scenarios. To the best of our knowledge, this is the first attempt to provide a comprehensive security modeling framework for the electric mobility ecosystem. Full article
(This article belongs to the Section E: Electric Vehicles)
Show Figures

Figure 1

Figure 1
<p>On the left side of the figure lies the component layer within the EMSA model, delineating the diverse zones and domains constituting the electric mobility ecosystem. Represented by blue boxes are the actors and stakeholders, interconnected by arrows to showcase the dynamic relationships among them. On the right side, the EMSA model unfolds its five interoperability layers, commencing from the uppermost tier, business, and cascading down to the lowermost tier, component. Each layer embodies distinct functionalities and interactions crucial for seamless operations within the electric mobility landscape.</p>
Full article ">Figure 2
<p>A methodology to analyze EV infrastructure.</p>
Full article ">Figure 3
<p>The considered extraction process based on a threat identified in [<a href="#B15-energies-17-05832" class="html-bibr">15</a>].</p>
Full article ">Figure 4
<p>E-mobility metamodel kernel.</p>
Full article ">Figure 5
<p>E-mobility metamodel—energy transfer element view.</p>
Full article ">Figure 6
<p>E-mobility metamodel—EV user element view.</p>
Full article ">Figure 7
<p>E-mobility metamodel—data view.</p>
Full article ">Figure 8
<p>EV charging infrastructure model instance and security analysis results.</p>
Full article ">Figure 9
<p>Excerpt of the grammar implemented with Xtext.</p>
Full article ">Figure 10
<p>Screenshot of our prototype showing the textual editor, the auto completion, and the result.</p>
Full article ">Figure 11
<p>Threats formalization with OCL in Obeo Designer.</p>
Full article ">Figure 12
<p>At the upper part of the figure, security needs for each component, communication and data are described. Threats, STRIDE category, risk level, and mitigations are shown at the lower part.</p>
Full article ">Figure 13
<p>Risk matrix showing the risks, their likelihood, severity, and risk level.</p>
Full article ">Figure 14
<p>ISO 21434 [<a href="#B36-energies-17-05832" class="html-bibr">36</a>] standard components highlighting in the red colored box the positioning of our approach.</p>
Full article ">
16 pages, 2004 KiB  
Article
Constraint Optimal Model-Based Disturbance Predictive and Rejection Control Method of a Parabolic Trough Solar Field
by Shangshang Wei, Xianhua Gao and Yiguo Li
Energies 2024, 17(22), 5804; https://doi.org/10.3390/en17225804 - 20 Nov 2024
Viewed by 435
Abstract
The control of the field outlet temperature of a parabolic trough solar field (PTSF) is crucial for the safe and efficient operation of the solar power system but with the difficulties arising from the multiple disturbances and constraints imposed on the variables. To [...] Read more.
The control of the field outlet temperature of a parabolic trough solar field (PTSF) is crucial for the safe and efficient operation of the solar power system but with the difficulties arising from the multiple disturbances and constraints imposed on the variables. To this end, this paper proposes a constraint optimal model-based disturbance predictive and rejection control method with a disturbance prediction part. In this method, the steady-state target sequence is dynamically corrected in the presence of constraints, the lumped disturbance, and its future dynamics predicted by the least-squares support vector machine. In addition, a maximum controlled allowable set is constructed in real time to transform an infinite number of constraint inequalities into finite ones with the integration of the corrected steady-state target sequence. On this basis, an equivalent quadratic programming constrained optimization problem is constructed and solved by the dual-mode control law. The simulation results demonstrate the setpoint tracking and disturbance rejection performance of our design under the premise of constraint satisfaction. Full article
(This article belongs to the Section A2: Solar Energy and Photovoltaic Systems)
Show Figures

Figure 1

Figure 1
<p>The diagram of the PTSF (<b>a</b>); the sectional drawing of A-A (<b>b</b>).</p>
Full article ">Figure 2
<p>The scheme of the proposed C-ODPRC.</p>
Full article ">Figure 3
<p>Response curves of different controllers with field disturbances under constant conditions. (<b>a</b>) Field disturbances and lumped disturbance; (<b>b</b>) Field outlet temperature; (<b>c</b>) The flow rate of heat transfer fluid; (<b>d</b>) Control degree of freedom of C-ODPRC.</p>
Full article ">Figure 4
<p>Response curves of different controllers with field disturbances under setpoint tracking conditions. (<b>a</b>) Field disturbances and lumped disturbance; (<b>b</b>) Field outlet temperature; (<b>c</b>) The flow rate of heat transfer fluid; (<b>d</b>) The control of degree of freedom of C-ODPRC.</p>
Full article ">
19 pages, 39662 KiB  
Article
Gravity Predictions in Data-Missing Areas Using Machine Learning Methods
by Yubin Liu, Yi Zhang, Qipei Pang, Sulan Liu, Shaobo Li, Xuguo Shi, Shaofeng Bian and Yunlong Wu
Remote Sens. 2024, 16(22), 4173; https://doi.org/10.3390/rs16224173 - 8 Nov 2024
Viewed by 645
Abstract
Gravity data, comprising a key foundational dataset, are crucial for various research, including land subsidence monitoring, geological exploration, and navigational positioning. However, the collection of gravity data in specific regions is difficult because of environmental, technical, and economic constraints, resulting in a non-uniform [...] Read more.
Gravity data, comprising a key foundational dataset, are crucial for various research, including land subsidence monitoring, geological exploration, and navigational positioning. However, the collection of gravity data in specific regions is difficult because of environmental, technical, and economic constraints, resulting in a non-uniform distribution of the observational data. Traditionally, interpolation methods such as Kriging have been widely used to deal with data gaps; however, their predictive accuracy in regions with sparse data still needs improvement. In recent years, the rapid development of artificial intelligence has opened up a new opportunity for data prediction. In this study, utilizing the EGM2008 satellite gravity model, we conducted a comprehensive analysis of three machine learning algorithms—random forest, support vector machine, and recurrent neural network—and compared their performances against the traditional Kriging interpolation method. The results indicate that machine learning methods exhibit a marked advantage in gravity data prediction, significantly enhancing the predictive accuracy. Full article
(This article belongs to the Special Issue Deep Learning for Remote Sensing and Geodata)
Show Figures

Figure 1

Figure 1
<p>Terrain relief for large-scale dataset area.</p>
Full article ">Figure 2
<p>Terrain relief for small-scale dataset area.</p>
Full article ">Figure 3
<p>Fixed selection experiment configuration for the large-scale dataset (the black dots represent the data points of the testing set).</p>
Full article ">Figure 4
<p>Fixed selection experiment configuration for the small-scale dataset (the black dots represent the data points of the testing set).</p>
Full article ">Figure 5
<p>Predicted and true values of the four methods for the large-scale dataset. The blue curve is the true gravity value, and the green, orange, black, and red curves are predicted values for the RNN, RF, SVM, and Kriging methods, respectively. The horizontal axis is the number of samples, and the vertical axis is the predicted values.</p>
Full article ">Figure 6
<p>Predicted and true values of the four methods for the small-scale dataset. The blue curve is the true gravity value, and the green, orange, black, and red curves are predicted values for the RNN, RF, SVM, and Kriging methods, respectively. The horizontal axis is the number of samples, and the vertical axis is the predicted values.</p>
Full article ">Figure 7
<p>Predicted gravity data for the large-scale dataset; (<b>a</b>–<b>d</b>) the predicted values for RF, RNN, SVM, and Kriging methods, respectively.</p>
Full article ">Figure 8
<p>Predicted gravity data for the small-scale dataset; (<b>a</b>–<b>d</b>) the predicted values for RF, RNN, SVM, and Kriging methods, respectively.</p>
Full article ">Figure 8 Cont.
<p>Predicted gravity data for the small-scale dataset; (<b>a</b>–<b>d</b>) the predicted values for RF, RNN, SVM, and Kriging methods, respectively.</p>
Full article ">Figure 9
<p>FDD of four methods for the large-scale dataset. The horizontal axis represents the difference, and the vertical axis represents frequency. (<b>a</b>–<b>d</b>) The RNN, RF, SVM, and Kriging methods, respectively.</p>
Full article ">Figure 9 Cont.
<p>FDD of four methods for the large-scale dataset. The horizontal axis represents the difference, and the vertical axis represents frequency. (<b>a</b>–<b>d</b>) The RNN, RF, SVM, and Kriging methods, respectively.</p>
Full article ">Figure 10
<p>FDD of four methods for the small-scale dataset. The horizontal axis represents the difference, and the vertical axis represents frequency. (<b>a</b>–<b>d</b>) The RNN, RF, SVM, and Kriging methods, respectively.</p>
Full article ">Figure 11
<p>Predicted and true values of the four methods for the large-scale dataset. The blue curve is the true gravity value, and the green, orange, black, and red curves are predicted values for the RNN, RF, SVM, and Kriging methods, respectively. The horizontal axis is the number of samples, and the vertical axis is the predicted values.</p>
Full article ">Figure 12
<p>Predicted and true values of the four methods for the small-scale dataset. The blue curve is the true gravity value, and the green, orange, black, and red curves are predicted values for the RNN, RF, SVM, and Kriging methods, respectively. The horizontal axis is the number of samples, and the vertical axis is the predicted values.</p>
Full article ">Figure 13
<p>Predicted gravity data for the large-scale dataset. (<b>a</b>–<b>d</b>) The predicted values for RF, RNN, SVM, and Kriging methods, respectively.</p>
Full article ">Figure 14
<p>Predicted gravity data for the small-scale dataset. (<b>a</b>–<b>d</b>) The predicted values for RF, RNN, SVM, and Kriging methods, respectively.</p>
Full article ">Figure 15
<p>FDD of the four methods for the large-scale dataset. The horizontal axis represents the difference, and the vertical axis represents frequency. (<b>a</b>–<b>d</b>) The RNN, RF, SVM, and Kriging methods, respectively.</p>
Full article ">Figure 16
<p>FDD of the four methods for the small-scale dataset. The horizontal axis represents the difference, and the vertical axis represents frequency. (<b>a</b>–<b>d</b>) The RNN, RF, SVM, and Kriging methods, respectively.</p>
Full article ">
21 pages, 3432 KiB  
Article
Mathematical Model of a Nonlinear Electromagnetic Circuit Based on the Modified Hamilton–Ostrogradsky Principle
by Andriy Chaban, Andrzej Popenda, Tomasz Perzyński, Andrzej Szafraniec and Vitaliy Levoniuk
Energies 2024, 17(21), 5365; https://doi.org/10.3390/en17215365 - 28 Oct 2024
Viewed by 546
Abstract
This paper presents a mathematical model of a typical lumped-parameter electromagnetic assembly, which consists of two subassemblies: one includes a magnetic circuit and the other with selected elements of electric circuits. An interdisciplinary research approach is used, which assumes the use of a [...] Read more.
This paper presents a mathematical model of a typical lumped-parameter electromagnetic assembly, which consists of two subassemblies: one includes a magnetic circuit and the other with selected elements of electric circuits. An interdisciplinary research approach is used, which assumes the use of a modified integral method based on the variational Hamilton–Ostrogradsky principle. The modification of the method is the extension of the Lagrange function by two components. The first one reflects the dissipation of electromagnetic energy in the system, while the second one reflects the effect of external non-potential forces acting on the electromagnetic system. This approach allows for the avoidance of the inconvenience of the classical theory, which assumes the decomposition of the entire integrated system into individual electrical subsystems. The state equations of the electromagnetic subassembly are presented solely on the basis of the energy approach, which in turn allows taking into account various latent motions in the system, because the equations are derived based on non-stationary constraints between subsystems. The adopted theory allows for the formulation of the model of the system in a vector form, which gives much more possibilities for the analysis of higher-order electromagnetic circuits. Another important advantage is that the state equations of the considered electrical object are given in Cauchy normal form. In this way, the equations can be integrated both explicitly and implicitly. The results of computer simulations are presented in graphical form, analysed, and discussed. Full article
(This article belongs to the Special Issue Applications of Electromagnetism in Energy Efficiency)
Show Figures

Figure 1

Figure 1
<p>Circuit diagram of an electric circuit element.</p>
Full article ">Figure 2
<p>Calculation diagram of an electric circuit element.</p>
Full article ">Figure 3
<p>The circuit diagram of an electromagnetic object.</p>
Full article ">Figure 4
<p>The calculation diagram of an electromagnetic object.</p>
Full article ">Figure 5
<p>Electric steel magnetisation curve in reverse dependences <math display="inline"><semantics> <mrow> <mi>H</mi> <mo stretchy="false">(</mo> <mi>B</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mn>65</mn> <mi>B</mi> <mo>+</mo> <mn>270</mn> <msup> <mi>B</mi> <mn>5</mn> </msup> </mrow> </semantics></math>.</p>
Full article ">Figure 6
<p>Dynamic reverse magnetic permeability for the magnetisation curve <math display="inline"><semantics> <mrow> <mi>H</mi> <mo stretchy="false">(</mo> <mi>B</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mn>65</mn> <mi>B</mi> <mo>+</mo> <mn>270</mn> <msup> <mi>B</mi> <mn>5</mn> </msup> </mrow> </semantics></math>.</p>
Full article ">Figure 7
<p>Static reverse magnetic permeability for the magnetisation curve <math display="inline"><semantics> <mrow> <mi>H</mi> <mo stretchy="false">(</mo> <mi>B</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mn>65</mn> <mi>B</mi> <mo>+</mo> <mn>270</mn> <msup> <mi>B</mi> <mn>5</mn> </msup> </mrow> </semantics></math>.</p>
Full article ">Figure 8
<p>Transient current across the coil winding in the first magnetic circuit branch.</p>
Full article ">Figure 9
<p>Transient current across the first coil winding in the third magnetic circuit branch.</p>
Full article ">Figure 10
<p>Transient current across the second coil winding in the third magnetic circuit branch.</p>
Full article ">Figure 11
<p>Transient magnetic flux across the first magnetic circuit branch.</p>
Full article ">Figure 12
<p>Transient magnetic flux across the second magnetic circuit branch.</p>
Full article ">Figure 13
<p>Transient magnetic flux across the third magnetic circuit branch.</p>
Full article ">Figure 14
<p>Transient dynamic reverse magnetic permeability in the second magnetic circuit branch.</p>
Full article ">Figure 15
<p>Transient static reverse magnetic permeability in the second magnetic circuit branch.</p>
Full article ">
Back to TopTop