Search

The extraction algorithm of target characteristics resonance set at the high-frequency band plays a significant role in defense applications like early warning. The paper proposes a new method to extract the characteristic resonance set of radar targets in the resonance frequency region using an autoregressive moving average model optimized by root mean square propagation particle swarm optimization. Considering that the total scattering response in the resonant region consists of early-time and late-time responses, the autoregressive moving average model approximate the total scattering responses to avoid errors caused by intercepting the late-time response. Further, the paper investigated the impact of the swarm optimization algorithm on the accuracy of moving average model parameters when obtaining the resonance set at different target aspects. The extracted characteristic resonance results within a range of azimuth directions through an aircraft target paradigm indicate that the new method is more convenient and precise than the matrix beam prediction method. [ABSTRACT FROM AUTHOR]

In the realm of structural health monitoring (SHM), understanding the expected behavior of a structure is vital for the timely identification of anomalous activities. Existing methods often model only the physical quantities of monitoring data, neglecting the corresponding temporal information. To address this, this paper presents an innovative deep learning framework that synergistically combines a BiLSTM model, fortified by a temporal pattern attention (TPA) mechanism, with time-encoded temperature and traffic-induced deflection-temporal patterns. The arithmetic optimization algorithm (AOA) is employed for optimal hyperparameter tuning, and incremental learning was implemented to enable real-time updates of the model. Based on the proposed framework, an anomaly detection method was subsequently developed. This method is bidirectional: it uses quantile loss to provide expected ranges for structural behavior, identifying isolated anomalies, while the windowed normalized mutual information (WNMI) based on multivariate kernel density estimation (MKDE) helps detect trend variability caused by decreases in structural stiffness. This framework and the anomaly detection method were validated using data from an operational cable-stayed bridge. The results demonstrate that the method effectively predicts structural behavior and detects anomalies, highlighting the critical role of temporal information in SHM. [ABSTRACT FROM AUTHOR]

The security of communication networks can be compromised through both known and novel attack methods. Protection against such attacks may be achieved through the use of an intrusion detection system (IDS), which can be designed by training machine learning models to detect cyberattacks. In this paper, the KOMIG (knapsack optimization and mutual information gain) IDS was developed to detect network intrusions. The KOMIG IDS combined the strengths of optimization and machine learning together to achieve a high intrusion detection performance. Specifically, KOMIG IDS comprises a 2-stage feature selection procedure; the first was accomplished with a knapsack optimization algorithm and the second with a mutual information gain filter. In particular, we developed an optimization model for the selection of the most important features from a network intrusion dataset. Then, a new set of features was synthesized from the selected features and combined with the selected features to form a candidate features set. Next, we applied an information gain filter to the candidate features set to prune out redundant features, leaving only the features that possess the maximum information gain, which were used to train machine learning models. The proposed KOMIG IDS was applied to the UNSW-NB15 dataset, which is a well-known network intrusion evaluation dataset, and the resulting data, after optimization operation, were used to train four machine learning models, namely, logistic regression (LR), random forest (RF), decision tree (DT), and K-nearest neighbors (KNN). Simulation experiments were conducted, and the results revealed that our proposed KNN-based KOMIG IDS outperformed comparative schemes by achieving an accuracy score of 97.14%, a recall score of 99.46%, a precision score of 95.53%, and an F1 score of 97.46%. [ABSTRACT FROM AUTHOR]

Mathematical models that represent food processing operations are characterized by the nonlinearity of their dynamic behavior with possible discrete events, the existence of several variables of interest that are usually distributed in space, and the presence of nonlinear constraints. These features require robust optimization methods to resolve these models and to identify the optimum operating conditions of the processes. Stochastic optimization methods, often referred as metaheuristics, are effective and reliable tools to perform the global and multiobjective optimization of process units and operations involved in food engineering. In this way, this paper surveys recent advances and contributions that have applied stochastic methods for solving global and multiobjective optimization problems in food engineering. The description of the most used stochastic algorithms in food engineering is provided including the application of those methods classified as random search techniques, evolutionary methods, and swarm intelligence methods. It was observed that evolutionary methods are the most applied in solving food engineering optimization problems where the genetic algorithm and differential evolution stand out. Finally, remarks on the limitations and current challenges to improving the numerical performance of stochastic optimization methods for food engineering applications are also discussed. [ABSTRACT FROM AUTHOR]

The rolling bearing is one of the commonly used mechanical components in rotating machinery, and its health directly affects the normal operation of equipment. However, the fault signal of rolling bearing is susceptible to noise interference, which makes it difficult to extract the fault characteristics of the rolling bearing and thus affects the accuracy of the diagnosis results. To address this problem, this paper proposes a method by using a snake optimization algorithm to optimize variational mode decomposition (SOA-VMD) and applies it to the extraction of the fault feature of rolling bearing. First, the minimum Shannon entropy to kurtosis ratio (EKR) is used as the fitness function of SOA to search for the best parameter combination of VMD. Second, the optimized VMD is used to decompose the vibration signal of rolling bearing to obtain K intrinsic mode functions (IMFs). Then, the IMF with the most fault information is selected for reconstruction through EKR. The Teager–Kaiser energy operator (TKEO) spectrum analysis is performed on the reconstructed signal. Finally, this method is used to analyze the simulation signal and rolling bearing vibration signal and compared with empirical mode decomposition (EMD), ensemble empirical mode decomposition (EEMD), and complete ensemble empirical mode decomposition adaptive noise (CEEMDAN) algorithms to verify the feasibility and effectiveness of the SOA-VMD method. [ABSTRACT FROM AUTHOR]

Regarding the issue of information freshness in systems that aid in data collection using unmanned aerial vehicles (UAVs), a data collection algorithm that is based on freshness and UAV assistance is proposed. Under the limitations of wireless sensor node communication distance and UAV parameters, the optimization problem of minimizing the average spatial correlation age of information (SCAoI) of all nodes in the area is set up. This problem is solved by optimizing the number of clusters, UAV flight trajectories, and the order of data collection from cluster member nodes. The maximum communication distance of the nodes is used as the cluster formation radius, and the maximum-minimum distance clustering algorithm is used to cluster the nodes in the region to obtain the minimum number of clusters. After it has been proven that the trajectory optimization problem in this study is NP-hard, the ant colony algorithm is applied to obtain the minimum flight time and the corresponding trajectory. By using the greedy algorithm to determine the member nodes in the sequence of data collection for a cluster, the instantaneous SCAoI of the UAV arriving at the cluster head is solved. Simulation results show that the proposed algorithm in this paper can effectively improve the freshness of data and reduce the average SCAoI of the system compared with the algorithm in the comparative literature, reducing the average SCAoI by about 61%. [ABSTRACT FROM AUTHOR]

Digital twin (DT) is a prolific buzzword in this era, where digitization plays a significant role. The perception of solar energy harvesting has been gaining popularity with the advent of solar panels. Solar asset maintenance is a need of the hour for investors because of the smart city scheme and green building certificate evaluation for all industries, educational institutions, etc. Among the list of factors that reduce PV system efficiency, the issue of partial shading is a vital distress that must be resolved. This paper focuses on the development of a digital twin framework that is proactively driven by shading patterns and a proposed optimization-based reconfiguration embedded controller that electronically relocates the panel in the physical world. The real-time system has been created for a three-by-three series parallel panel arrangement. The proposed switching matrix controller achieves the maximum power, i.e., 40% of increased power output, row current difference is made almost zero from 3 to 4 A, and fill factor increases by 20% by reconfiguring the solar array. It is done based on a decision taken by a nature-inspired (equal irradiation distribution algorithm) or puzzle-based (skyscraper) optimization algorithm. Switching matrix controllers overcome the disadvantages of physical relocation. The users can query the digital twin build to know the historical performance and current operating conditions of the system. It can trigger alarms as early warnings and make predictions about possible system anomalies, if and when they occur using a digital twin. [ABSTRACT FROM AUTHOR]

Accurate fault detection in high-voltage direct current (HVDC) transmission lines plays a pivotal role in enhancing operational efficiency, reducing costs, and ensuring grid reliability. This research aims to develop a cost-effective and high-performance fault detection solution for HVDC systems. The primary objective is to accurately identify and localize faults within the power system. In pursuit of this goal, the paper presents a comparative analysis of current and voltage characteristics between the rectifier and inverter sides of the HVDC transmission system and their associated alternating current (AC) counterparts under various fault conditions. Voltage and current features are extracted and optimized using a metaheuristic approach, specifically Harris Hawk's optimization method. Leveraging machine learning (ML) and artificial neural networks (ANN), this technique demonstrates its effectiveness in generating a fault locator with exceptional accuracy. With a substantial volume of data employed for learning and training, the Harris Hawks optimization method exhibits faster convergence compared to other metaheuristic methods examined in this study. The research findings are applied to simulate diverse fault types and unknown fault locations at multiple system points. Evaluating the fault detection system's effectiveness, quantified through metrics such as specificity, accuracy, F1 score, and sensitivity, yields remarkable results, with percentages of 99.01%, 98.69%, 98.64%, and 98.67%, respectively. This research underscores the critical role of accurate fault detection in HVDC systems, offering valuable insights into optimizing grid performance and reliability. [ABSTRACT FROM AUTHOR]

In this paper, a multiobjective framework for simultaneous reconfiguration and allocation of photovoltaic (PV) energy resources in radial distribution networks is performed for minimizing the power losses, lowering network loading factor, and reducing cost of energy resources as well as increasing the voltage stability index. A novel algorithm called the improved clouded leopard algorithm is used to find the set of optimum decision factors in the combined execution of restructuring and also PV resource distribution. The clouded leopard optimization (CLO) algorithm, which is widely used, takes its cues from the sleeping and foraging habits of the animal, and the improved CLO (ICLO) is formed using adaptive inertia weight to overcome premature convergence. In five cases of base distribution network and different contribution of reconfiguration and PV allocation, single- and multiobjective approach has been applied on 33- and 69-bus distribution networks. According to the findings, the best case includes simultaneous reconfiguration and PV allocation in the radial networks based on the multiobjective approach unlike the single-objective method which obtained the highest network performance with the best compromise between different goals. Also, in the best lowest losses, the decrease in the network loading and cost of energy resources and the better voltage profile and stability are obtained satisfying the constraints. The losses, network loading, voltage profile, and voltage stability are improved by 60.40%, 37.89%, 6.17%, and 27.5% for 33-bus network and also enhanced by 71.77%, 41.23%, 4.76%, and 20.48% for 69-bus network, respectively. Also, the results showed that network reconfiguration only has the weakest performance among other cases based on reconfiguration or photovoltaic sources. Moreover, the superior capability of the ICLO in addressing the aim of the study is proved in comparison with the traditional CLO and well-known particle swarm optimization (PSO) and manta ray foraging optimization (MRFO) to obtain the better objective value and statistical criteria to solve the best case. [ABSTRACT FROM AUTHOR]

This paper uses an augmented Lagrangian method based on an inexact exponential penalty function to solve constrained multiobjective optimization problems. Two algorithms have been proposed in this study. The first algorithm uses a projected gradient, while the second uses the steepest descent method. By these algorithms, we have been able to generate a set of nondominated points that approximate the Pareto optimal solutions of the initial problem. Some proofs of theoretical convergence are also proposed for two different criteria for the set of generated stationary Pareto points. In addition, we compared our method with the NSGA-II and augmented the Lagrangian cone method on some test problems from the literature. A numerical analysis of the obtained solutions indicates that our method is competitive with regard to the test problems used for the comparison. [ABSTRACT FROM AUTHOR]

Substation automation systems (SAS) are critical infrastructures whose design and maintenance must be optimised to guarantee a suitable performance. In order to provide a collection of solutions that balance availability and cost, this paper explores the optimisation of the design and maintenance of a section of SAS. Multiobjective evolutionary algorithms are combined with discrete event simulation while the performance of two state-of-the-art multiobjective evolutionary algorithms is studied. On the one hand, the nondominated sorting genetic algorithm II (NSGA-II), and on the other hand, the S-metric selection evolutionary multiobjective optimisation algorithm (SMS-EMOA). Such a problem is solved from 2 and 3-objective approaches by attending to the multiobjectivisation concept. The robustness of the methodology is brought to light, and benefits were observed from the multiobjectivisation approach. Decision-makers can employ this knowledge to make informed decisions based on economic and reliability criteria. [ABSTRACT FROM AUTHOR]