Search

Based on the scenario of high-penetration distributed photovoltaic connected to an AC/DC distribution network, this paper analyzes the dynamic characteristics of frequency and voltage in a distribution network after the blocking failure of the flexible interconnection channel. In order to enhance the transient stability of the system after the fault, this paper comprehensively considers the active regulation ability of photovoltaic units, and puts forward an emergency coordinated control strategy for a single-ended distribution network with flexible interconnection channel blocking. Firstly, the non-fault channel is overloaded for a short time, then the comprehensive influence of factors such as electrical distance, response time and adjustment cost on the frequency modulation effect of the system is quantitatively evaluated; according to the evaluation results, the photovoltaic and synchronous units are controlled by "control instead of tripping", and finally, the high-frequency tripping is carried out, based on the principle of "photovoltaics first". After the frequency control is completed, the reactive power optimization model of the system is established, and the improved tabu–particle swarm optimization algorithm is used to solve it, so as to optimize the voltage of the distribution network nodes. Finally, an equivalent simulation model is established to verify the coordinated control strategy. [ABSTRACT FROM AUTHOR]

Stress has emerged as a major concern in modern society, significantly impacting human health and well-being. Statistical evidence underscores the extensive social influence of stress, especially in terms of work-related stress and associated healthcare costs. This paper addresses the critical need for accurate stress detection, emphasising its far-reaching effects on health and social dynamics. Focusing on remote stress monitoring, it proposes an efficient deep learning approach for stress detection from facial videos. In contrast to the research on wearable devices, this paper proposes novel Hybrid Deep Learning (DL) networks for stress detection based on remote photoplethysmography (rPPG), employing (Long Short-Term Memory (LSTM), Gated Recurrent Units (GRU), 1D Convolutional Neural Network (1D-CNN)) models with hyperparameter optimisation and augmentation techniques to enhance performance. The proposed approach yields a substantial improvement in accuracy and efficiency in stress detection, achieving up to 95.83% accuracy with the UBFC-Phys dataset while maintaining excellent computational efficiency. The experimental results demonstrate the effectiveness of the proposed Hybrid DL models for rPPG-based-stress detection. [ABSTRACT FROM AUTHOR]

As space resources become increasingly constrained, the major space-faring nations are establishing large space target monitoring systems. There is a demand for both the number and the detection capability of space-based optical monitoring equipment. The detection range (i.e., field of view) and parasitic capability (lightweight and small size) of a single optical payload will largely reduce the scale and cost of the monitoring system. Therefore, in this paper, the optic-mechanical system of an ultra-lightweight and ultra-compact space camera and the optical alignment method are investigated around a fully freeform off-axis triple-reversal large field of view (FOV) optical system. The optic-mechanical system optimisation design is completed by adopting the optic-mechanical integration analysis method, and the weight of the whole camera is less than 10 kg. In addition, to address the mounting problems caused by the special characteristics of the freeform surface optical system, a dual CGH coreference alignment method is innovatively proposed. The feasibility of the method is verified by the mounting and testing test, and the test results show that the system wavefront difference is better than 1/10 λ. The imaging test of the space camera and the magnitude test results meet the design requirements of the optical system. The optic-mechanical system design method and alignment method proposed in this paper are instructive for the design and engineering of large field of view full freeform optical loads. [ABSTRACT FROM AUTHOR]

Point cloud registration is a fundamental task in computer vision and graphics, which is widely used in 3D reconstruction, object tracking, and atlas reconstruction. Learning-based optimization and deep learning methods have been widely developed in pairwise registration due to their own distinctive advantages. Deep learning methods offer greater flexibility and enable registering unseen point clouds that are not trained. Learning-based optimization methods exhibit enhanced robustness and stability when handling registration under various perturbations, such as noise, outliers, and occlusions. To leverage the strengths of both approaches to achieve a less time-consuming, robust, and stable registration for multiple instances, we propose a novel computational framework called SGRTmreg for multiple pairwise registrations in this paper. The SGRTmreg framework utilizes three components—a Searching scheme, a learning-based optimization method called Graph-based Reweighted discriminative optimization (GRDO), and a Transfer module to achieve multi-instance point cloud registration.Given a collection of instances to be matched, a template as a target point cloud, and an instance as a source point cloud, the searching scheme selects one point cloud from the collection that closely resembles the source. GRDO then learns a sequence of regressors by aligning the source to the target, while the transfer module stores and applies the learned regressors to align the selected point cloud to the target and estimate the transformation of the selected point cloud. In short, SGRTmreg harnesses a shared sequence of regressors to register multiple point clouds to a target point cloud. We conduct extensive registration experiments on various datasets to evaluate the proposed framework. The experimental results demonstrate that SGRTmreg achieves multiple pairwise registrations with higher accuracy, robustness, and stability than the state-of-the-art deep learning and traditional registration methods. [ABSTRACT FROM AUTHOR]

In this paper, we introduce LagunAR, a mobile outdoor Augmented Reality (AR) application for providing heritage information and 3D visualization on a city scale. The LagunAR application was developed to provide historical information about the city of La Laguna in the XVI century, when it was the main city in the Canary Islands. The application provides a reconstructed 3D model of the city at that time that is shown on a mobile phone over-imposed on the actual city using geolocation. The geolocated position is used also for providing information of several points of interest in the city. The paper describes the design and implementation of the application and details the optimization techniques that have been used to manage the full information of the city using a mobile phone as a sensor and visualization tool. We explain the application usability study carried out using a heuristic test; in addition it is probed by users in a qualitative user test developed as preliminary research. Results show that it is possible to develop a real-time application that shows the user a city-scale 3D model and also manages the information of the points of interest. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of tracking a high-speed ballistic target in real time. Particle swarm optimization (PSO) can be a solution to overcome the motion of the ballistic target and the nonlinearity of the measurement model. However, in general, particle swarm optimization requires a great deal of computation time, so it is difficult to apply to realtime systems. In this paper, we propose a parallelized particle swarm optimization technique using field-programmable gate array (FPGA) to be accelerated for realtime ballistic target tracking. The realtime performance of the proposed method has been tested and analyzed on a well-known heterogeneous processing system with a field-programmable gate array. The proposed parallelized particle swarm optimization was successfully conducted on the heterogeneous processing system and produced similar tracking results. Also, compared to conventional particle swarm optimization, which is based on the only central processing unit, the computation time is significantly reduced by up to 3.89×. [ABSTRACT FROM AUTHOR]

This paper explores the potential for communication-efficient federated learning (FL) in modern distributed systems. FL is an emerging distributed machine learning technique that allows for the distributed training of a single machine learning model across multiple geographically distributed clients. This paper surveys the various approaches to communication-efficient FL, including model updates, compression techniques, resource management for the edge and cloud, and client selection. We also review the various optimization techniques associated with communication-efficient FL, such as compression schemes and structured updates. Finally, we highlight the current research challenges and discuss the potential future directions for communication-efficient FL. [ABSTRACT FROM AUTHOR]

When the pulse current method is used for partial discharge (PD) monitoring of mining cables, the detected PD signals are seriously disturbed by the field noise, which are easily submerged in the noise and cannot be extracted. In order to realize the effective separation of the PD signal and the interference signal of the mining cable and improve the signal-to-noise ratio of the PD signal, a denoising method for the PD signal of the mining cable based on genetic algorithm optimization of variational mode decomposition (VMD) and wavelet threshold is proposed in this paper. Firstly, the genetic algorithm is used to optimize the VMD, and the optimal value of the number of modal components K and the quadratic penalty factor α is determined; secondly, the PD signal is decomposed by the VMD algorithm to obtain K intrinsic mode functions (IMF). Then, wavelet threshold denoising is applied to each IMF, and the denoised IMFs are reconstructed. Finally, the feasibility of the denoising method proposed in this paper is verified by simulation and experiment. [ABSTRACT FROM AUTHOR]

Modern homes are experiencing unprecedented levels of convenience because of the proliferation of smart devices. In order to improve communication between smart home devices, this paper presents a novel approach that particularly addresses interference caused by different transmission systems. The core of the suggested framework is an intelligent Internet of Things (IoT) system designed to reduce interference. By using adaptive communication protocols and sophisticated interference management algorithms, the framework minimizes interference caused by overlapping transmissions and guarantees effective data sharing. This can be accomplished by creating an optimization model that takes into account the dynamic nature of the smart home environment and intelligently allocates resources. By maximizing the signal quality at the destination and optimizing the distribution of frequency channels and transmission power levels, the model seeks to minimize interference. A deep learning technique is used to augment the optimization model by adaptively learning and predicting interference patterns from real-time observations and historical data. The experimental results show how effective the suggested hybrid strategy is. While the deep learning model adjusts to shifting interference dynamics, the optimization model efficiently controls resource allocation, leading to better data reception performance at the destination. The system's robustness is assessed in various kinds of situations to demonstrate its flexibility in responding to changing smart home settings. This work not only offers a thorough framework for interference reduction but also clarifies how deep learning and mathematical optimization can work together to improve the dependability of data reception in smart homes. [ABSTRACT FROM AUTHOR]

Recently, low THz radar-based measurement and classification for archaeology emerged as a new imaging modality. In this paper, we investigate the classification of pottery shards, a key enabler to understand how the agriculture was introduced from the Fertile Crescent to Europe. Our purpose is to jointly design the measuring radar system and the classification neural network, seeking the maximal compactness and the minimal cost, both directly related to the number of sensors. We aim to select the least possible number of sensors and place them adequately, while minimizing the false recognition rate. For this, we propose a novel version of the Binary Grey Wolf Optimizer, designed to reduce the number of sensors, and a Ternary Grey Wolf Optimizer. Together with the Continuous Grey Wolf Optimizer, they yield the CBTGWO (Continuous Binary Ternary Grey Wolf Optimizer). Working with 7 frequencies and starting with 37 sensors, the CBTGWO selects a single sensor and yields a 0-valued false recognition rate. In a single-frequency scenario, starting with 217 sensors, the CBTGWO selects 2 sensors. The false recognition rate is 2%. The acquisition time is 3.2 s, outperforming the GWO and adaptive mixed GWO, which yield 86.4 and 396.6 s. [ABSTRACT FROM AUTHOR]

The growth in linked and autonomous vehicles has led to the emergence of vehicular ad hoc networks (VANETs) as a means to enhance road safety, traffic efficiency, and passenger comfort. However, VANETs face challenges in facilitating trustworthiness and high-quality services due to communication delays caused by traffic, dynamic topology changes, variable speeds, and other influencing factors. Hence, there is a need for a reliable data dissemination scheme capable of reducing communication delays among hops by identifying effective forwarder nodes. In this paper, we propose a novel, weighted, estimated, spider monkey-based, nature-inspired optimization (w-SMNO) method to generate a set of efficient relays. Additionally, we introduce a dynamic weight assignment and configuration model to enhance system accuracy using a neural network based on backpropagation with gradient descent optimization techniques to minimize errors in the machine learning model. The w-SMNO also incorporates a distinct algorithm for effective relay selection among multiple monkey spider groups. The simulation results demonstrate substantial improvements in w-SMNO, with a 35.7% increase in coverage, a 41.2% reduction in the end-to-end delay, a 36.4% improvement in the message delivery rate, and a 38.4% decrease in the collision rate compared to the state-of-the-art approaches. [ABSTRACT FROM AUTHOR]

In this paper, we propose an improved clustering algorithm for wireless sensor networks (WSNs) that aims to increase network lifetime and efficiency. We introduce an enhanced fuzzy spider monkey optimization technique and a hidden Markov model-based clustering algorithm for selecting cluster heads. Our approach considers factors such as network cluster head energy, cluster head density, and cluster head position. We also enhance the energy-efficient routing strategy for connecting cluster heads to the base station. Additionally, we introduce a polling control method to improve network performance while maintaining energy efficiency during steady transmission periods. Simulation results demonstrate a 1.2% improvement in network performance using our proposed model. [ABSTRACT FROM AUTHOR]

The purpose of geographic location selection is to make the best use of space. Geographic location selection contains a large amount of spatiotemporal data and constraints, resulting in too many solutions. Therefore, this paper adopts the ant colony algorithm in the meta-heuristic search method combined with the incomplete quadtree to improve the searchability of the space. This paper proposes an improved ant colony algorithm in nonuniform space to solve the P-center facility location problem. The geographic space is divided by the incomplete quadtree, and the ant colony path is constructed on the level of the quadtree division. Ant colonies can leave pheromones on multiple search paths, and optimized quadtree encoding in nonuniform space stores pheromone matrices and distance matrices. The algorithm proposed in this paper improves the pheromone diffusion algorithm and the optimization objective at the same time to update the pheromone in the nonuniform space and obtain the ideal solution. The results show that the algorithm has excellent performance in solving the location problem with good convergence accuracy and calculation time. [ABSTRACT FROM AUTHOR]

Algorithms for machine learning have found extensive use in numerous fields and applications. One important aspect of effectively utilizing these algorithms is tuning the hyperparameters to match the specific task at hand. The selection and configuration of hyperparameters directly impact the performance of machine learning models. Achieving optimal hyperparameter settings often requires a deep understanding of the underlying models and the appropriate optimization techniques. While there are many automatic optimization techniques available, each with its own advantages and disadvantages, this article focuses on hyperparameter optimization for well-known machine learning models. It explores cutting-edge optimization methods such as metaheuristic algorithms, deep learning-based optimization, Bayesian optimization, and quantum optimization, and our paper focused mainly on metaheuristic and Bayesian optimization techniques and provides guidance on applying them to different machine learning algorithms. The article also presents real-world applications of hyperparameter optimization by conducting tests on spatial data collections for landslide susceptibility mapping. Based on the experiment's results, both Bayesian optimization and metaheuristic algorithms showed promising performance compared to baseline algorithms. For instance, the metaheuristic algorithm boosted the random forest model's overall accuracy by 5% and 3%, respectively, from baseline optimization methods GS and RS, and by 4% and 2% from baseline optimization methods GA and PSO. Additionally, for models like KNN and SVM, Bayesian methods with Gaussian processes had good results. When compared to the baseline algorithms RS and GS, the accuracy of the KNN model was enhanced by BO-TPE by 1% and 11%, respectively, and by BO-GP by 2% and 12%, respectively. For SVM, BO-TPE outperformed GS and RS by 6% in terms of performance, while BO-GP improved results by 5%. The paper thoroughly discusses the reasons behind the efficiency of these algorithms. By successfully identifying appropriate hyperparameter configurations, this research paper aims to assist researchers, spatial data analysts, and industrial users in developing machine learning models more effectively. The findings and insights provided in this paper can contribute to enhancing the performance and applicability of machine learning algorithms in various domains. [ABSTRACT FROM AUTHOR]

With the increasingly widespread application of UAV intelligence, the need for autonomous navigation and positioning is becoming more and more important. To solve the problem that UAV cannot perform localization in complex scenes, a new multi-source fusion framework factor graph optimization algorithm is used for UAV localization state estimation in this paper, which is based on IMU/GNSS/VO multi-source sensors. Based on the factor graph model and the iSAM incremental inference algorithm, a multi-source fusion model of IMU/GNSS/VO is established, including the IMU pre-integration factor, IMU bias factor, GNSS factor, and VO factor. Mathematical simulations and validations on the EuRoC dataset show that, when the selected sliding window size is 30, the factor graph optimization (FGO) algorithm can not only meet the requirements of real time and accuracy at the same time, but it also achieves a plug-and-play function in the event of local sensor failures. Finally, compared with the traditional federated Kalman algorithm and the adaptive federated Kalman algorithm, the positioning accuracy of the FGO algorithm in this paper is improved by 1.5–2-fold, and can effectively improve autonomous navigation system robustness and flexibility in complex scenarios. Moreover, the multi-source fusion framework in this paper is a general algorithm framework that can satisfy other scenarios and other types of sensor combinations. [ABSTRACT FROM AUTHOR]

In recent years, different types of monitoring systems have been designed for various applications, in order to turn the urban environments into smart cities. Most of these systems consist of wireless sensor networks (WSN)s, and the designing of these systems has faced many problems. The first and most important problem is sensor node deployment. The main function of WSNs is to gather the required information, process it, and send it to remote places. A large number of sensor nodes were deployed in the monitored area, so finding the best deployment algorithm that achieves maximum coverage and connectivity with the minimum number of sensor nodes is the significant point of the research. This paper provides a systematic mapping study that includes the latest recent studies, which are focused on solving the deployment problem using optimization algorithms, especially heuristic and meta-heuristic algorithms in the period (2015–2022). It was found that 35% of these studies updated the swarm optimization algorithms to solve the deployment problem. This paper will be helpful for the practitioners and researchers, in order to work out new algorithms and seek objectives for the sensor deployment. A comparison table is provided, and the basic concepts of a smart city and WSNs are presented. Finally, an overview of the challenges and open issues are illustrated. [ABSTRACT FROM AUTHOR]

In a time where sustainability and CO2 efficiency are of ever-increasing importance, heating systems deserve special considerations. Despite well-functioning hardware, inefficiencies may arise when controller parameters are not well chosen. While monitoring systems could help to identify such issues, they lack improvement suggestions. One possible solution would be the use of digital twins; however, critical values such as the water consumption of the residents can often not be acquired for accurate models. To address this issue, coarse models can be employed to generate quantitative predictions, which can then be interpreted qualitatively to assess "better or worse" system behavior. In this paper, we present a simulation and calibration framework as well as a preprocessing module. These components can be run locally or deployed as containerized microservices and are easy to interface with existing data acquisition infrastructure. We evaluate the two main operating modes, namely automatic model calibration, using measured data, and the optimization of controller parameters. Our results show that using a coarse model of a real heating system and data augmentation through preprocessing, it is possible to achieve an acceptable fit of partially incomplete measured data, and that the calibrated model can subsequently be used to perform an optimization of the controller parameters in regard to the simulated boiler gas consumption. [ABSTRACT FROM AUTHOR]

Navigating safely in complex marine environments is a challenge for submarines because proper path planning underwater is difficult. This paper decomposes the submarine path planning problem into global path planning and local dynamic obstacle avoidance. Firstly, an artificial potential field ant colony algorithm (APF-ACO) based on an improved artificial potential field algorithm and improved ant colony algorithm is proposed to solve the problem of submarine underwater global path planning. Compared with the Optimized ACO algorithm proposed based on a similar background, the APF-ACO algorithm has a faster convergence speed and better path planning results. Using an inflection point optimization algorithm greatly reduces the number and length of inflection points in the path. Using the Clothoid curve fitting algorithm to optimize the path results, a smoother and more stable path result is obtained. In addition, this paper uses a three-dimensional dynamic obstacle avoidance algorithm based on the velocity obstacle method. The experimental results show that the algorithm can help submarines to identify threatening dynamic obstacles and avoid collisions effectively. Finally, we experimented with the algorithm in the submarine underwater semi-physical simulation system, and the experimental results verified the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

This paper researches the recognition of modulation signals in underwater acoustic communication, which is the fundamental prerequisite for achieving noncooperative underwater communication. In order to improve the accuracy of signal modulation mode recognition and the recognition effects of traditional signal classifiers, the article proposes a classifier based on the Archimedes Optimization Algorithm (AOA) and Random Forest (RF). Seven different types of signals are selected as recognition targets, and 11 feature parameters are extracted from them. The decision tree and depth obtained by the AOA algorithm are calculated, and the optimized random forest after the AOA algorithm is used as the classifier to achieve the recognition of underwater acoustic communication signal modulation mode. Simulation experiments show that when the signal-to-noise ratio (SNR) is higher than −5dB, the recognition accuracy of the algorithm can reach 95%. The proposed method is compared with other classification and recognition methods, and the results show that the proposed method can ensure high recognition accuracy and stability. [ABSTRACT FROM AUTHOR]

With the emergence of more and more computing-intensive and latency-sensitive applications, insufficient computing power and energy of user devices has become a common phenomenon. Mobile edge computing (MEC) is an effective solution to this phenomenon. MEC improves task execution efficiency by offloading some tasks to edge servers for execution. In this paper, we consider a device-to-device technology (D2D)-enabled MEC network communication model, and study the subtask offloading strategy and the transmitting power allocation strategy of users. The objective function is to minimize the weighted sum of the average completion delay and average energy consumption of users, which is a mixed integer nonlinear problem. We first propose an enhanced particle swarm optimization algorithm (EPSO) to optimize the transmit power allocation strategy. Then, we utilize the Genetic Algorithm (GA) to optimize the subtask offloading strategy. Finally, we propose an alternate optimization algorithm (EPSO-GA) to jointly optimize the transmit power allocation strategy and the subtask offloading strategy. The simulation results show that the EPSO-GA outperforms other comparative algorithms in terms of the average completion delay, average energy consumption, and average cost. In addition, no matter how the weight coefficients of delay and energy consumption change, the average cost of the EPSO-GA is the least. [ABSTRACT FROM AUTHOR]

In this research paper, the spatial distributions of five different services—Voice over Internet Protocol (VoIP), Video Conferencing (VC), Hypertext Transfer Protocol (HTTP), and Electronic Mail—are investigated using three different approaches: circular, random, and uniform approaches. The amount of each service varies from one to another. In certain distinct settings, which are collectively referred to as mixed applications, a variety of services are activated and configured at predetermined percentages. These services run simultaneously. Furthermore, this paper has established a new algorithm to assess both the real-time and best-effort services of the various IEEE 802.11 technologies, describing the best networking architecture as either a Basic Service Set (BSS), an Extended Service Set (ESS), or an Independent Basic Service Set (IBSS). Due to this fact, the purpose of our research is to provide the user or client with an analysis that suggests a suitable technology and network configuration without wasting resources on unnecessary technologies or requiring a complete re-setup. In this context, this paper presents a network prioritization framework for enabling smart environments to determine an appropriate WLAN standard or a combination of standards that best supports a specific set of smart network applications in a specified environment. A network QoS modeling technique for smart services has been derived for assessing best-effort HTTP and FTP, and the real-time performance of VoIP and VC services enabled via IEEE 802.11 protocols in order to discover more optimal network architecture. A number of IEEE 802.11 technologies have been ranked by using the proposed network optimization technique with separate case studies for the circular, random, and uniform geographical distributions of smart services. The performance of the proposed framework is validated using a realistic smart environment simulation setting, considering both real-time and best-effort services as case studies with a range of metrics related to smart environments. [ABSTRACT FROM AUTHOR]

Removing redundant features and improving classifier performance necessitates the use of meta-heuristic and deep learning (DL) algorithms in feature selection and classification problems. With the maturity of DL tools, many data-driven polarimetric synthetic aperture radar (POLSAR) representation models have been suggested, most of which are based on deep convolutional neural networks (DCNNs). In this paper, we propose a hybrid approach of a new multi-objective binary chimp optimization algorithm (MOBChOA) and DCNN for optimal feature selection. We implemented the proposed method to classify POLSAR images from San Francisco, USA. To do so, we first performed the necessary preprocessing, including speckle reduction, radiometric calibration, and feature extraction. After that, we implemented the proposed MOBChOA for optimal feature selection. Finally, we trained the fully connected DCNN to classify the pixels into specific land-cover labels. We evaluated the performance of the proposed MOBChOA-DCNN in comparison with nine competitive methods. Our experimental results with the POLSAR image datasets show that the proposed architecture had a great performance for different important optimization parameters. The proposed MOBChOA-DCNN provided fewer features (27) and the highest overall accuracy. The overall accuracy values of MOBChOA-DCNN on the training and validation datasets were 96.89% and 96.13%, respectively, which were the best results. The overall accuracy of SVM was 89.30%, which was the worst result. The results of the proposed MOBChOA on two real-world benchmark problems were also better than the results with the other methods. Furthermore, it was shown that the MOBChOA-DCNN performed better than methods from previous studies. [ABSTRACT FROM AUTHOR]

The prediction of cyber security situation plays an important role in early warning against cyber security attacks. The first-order accumulative grey model has achieved remarkable results in many prediction scenarios. Since recent events have a greater impact on future decisions, new information should be given more weight. The disadvantage of first-order accumulative grey models is that with the first-order accumulative method, equal weight is given to the original data. In this paper, a fractional-order cumulative grey model (FAGM) is used to establish the prediction model, and an intelligent optimization algorithm known as particle swarm optimization (PSO) combined with a genetic algorithm (GA) is used to determine the optimal order. The model discussed in this paper is used for the prediction of Internet cyber security situations. The results of a comparison with the traditional grey model GM(1,1), the grey model GM(1,n), and the fractional discrete grey seasonal model FDGSM(1,1) show that our model is suitable for cases with insufficient data and irregular sample sizes, and the prediction accuracy and stability of the model are better than those of the other three models. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc networks (VANETs) are a fundamental component of intelligent transportation systems in smart cities. With the support of open and real-time data, these networks of inter-connected vehicles constitute an 'Internet of vehicles' with the potential to significantly enhance citizens' mobility and last-mile delivery in urban, peri-urban, and metropolitan areas. However, the proper coordination and logistics of VANETs raise a number of optimization challenges that need to be solved. After reviewing the state of the art on the concepts of VANET optimization and open data in smart cities, this paper discusses some of the most relevant optimization challenges in this area. Since most of the optimization problems are related to the need for real-time solutions or to the consideration of uncertainty and dynamic environments, the paper also discusses how some VANET challenges can be addressed with the use of agile optimization algorithms and the combination of metaheuristics with simulation and machine learning methods. The paper also offers a numerical analysis that measures the impact of using these optimization techniques in some related problems. Our numerical analysis, based on real data from Open Data Barcelona, demonstrates that the constructive heuristic outperforms the random scenario in the CDP combined with vehicular networks, resulting in maximizing the minimum distance between facilities while meeting capacity requirements with the fewest facilities. [ABSTRACT FROM AUTHOR]

The merging of environmental maps constructed by individual UAVs alone and the sharing of information are key to improving the efficiency of distributed multi-UAVexploration. This paper investigates the raster map-merging problem in the absence of a common reference coordinate system and the relative position information of UAVs, and proposes a raster map-merging method with a directed crossover multidimensional perturbation variational genetic algorithm (DCPGA). The algorithm uses an optimization function reflecting the degree of dissimilarity between the overlapping regions of two raster maps as the fitness function, with each possible rotation translation transformation corresponding to a chromosome, and the binary encoding of the coordinates as the gene string. The experimental results show that the algorithm could converge quickly and had a strong global search capability to search for the optimal overlap area of the two raster maps, thus achieving map merging. [ABSTRACT FROM AUTHOR]

Laser ultrasound signal echoes are easily drowned out by the surrounding environmental noise in industrial field applications, and it is worthwhile to study methods of retaining the weak ultrasound signal during signal processing. To address this problem, this paper proposes to adopt the parameters optimized by the whale optimization algorithm to the variational mode decomposition (VMD) of laser ultrasound signals. The optimized parameters can avoid the frequency mixing and incomplete noise separation caused by the choice of artificial VMD parameters. The Hausdorff distance is applied in the process of reconstructing the signal to help accurately select the relevant modes and improve the signal-to-noise ratio. Simulation and experimental results show that the proposed method is feasible and effective compared with the other three available denoising methods. [ABSTRACT FROM AUTHOR]

The rapid change of motion direction during running is beneficial to improving the movement flexibility of the quadruped robot, which is of great relevance to its research. How to make the robot change its motion direction during running and achieve good dynamic stability is a problem to be solved. In this paper, a method to change the running direction of the cheetah-inspired quadruped robot is proposed. Based on the analysis of the running of the cheetah, a dynamic model of the quadruped robot is established, and a two-level stability index system, including a minimum index system and a range index system, is proposed. On this basis, the objective function based on the stability index system and optimization variables, including leg landing points, trunk movement trajectory, and posture change rule, are determined. Through these constraints, the direction changes with good dynamic stability of the cheetah-inspired quadruped robot during running is realized by controlling the leg parameters. The robot will not roll over during high-speed movement. Finally, the correctness of the proposed method is proven by simulation. This paper provides a theoretical basis for the quadruped robot's rapid change of direction in running. [ABSTRACT FROM AUTHOR]

Facial emotion recognition (FER) systems are imperative in recent advanced artificial intelligence (AI) applications to realize better human–computer interactions. Most deep learning-based FER systems have issues with low accuracy and high resource requirements, especially when deployed on edge devices with limited computing resources and memory. To tackle these problems, a lightweight FER system, called Light-FER, is proposed in this paper, which is obtained from the Xception model through model compression. First, pruning is performed during the network training to remove the less important connections within the architecture of Xception. Second, the model is quantized to half-precision format, which could significantly reduce its memory consumption. Third, different deep learning compilers performing several advanced optimization techniques are benchmarked to further accelerate the inference speed of the FER system. Lastly, to experimentally demonstrate the objectives of the proposed system on edge devices, Light-FER is deployed on NVIDIA Jetson Nano. [ABSTRACT FROM AUTHOR]

SLAM (Simultaneous Localization and Mapping) is mainly composed of five parts: sensor data reading, front-end visual odometry, back-end optimization, loopback detection, and map building. And when visual SLAM is estimated by visual odometry only, cumulative drift will inevitably occur. Loopback detection is used in classical visual SLAM, and if loopback is not detected during operation, it is not possible to correct the positional trajectory using loopback. Therefore, to address the cumulative drift problem of visual SLAM, this paper adds Indoor Positioning System (IPS) to the back-end optimization of visual SLAM, and uses the two-label orientation method to estimate the heading angle of the mobile robot as the pose information, and outputs the pose information with position and heading angle. It is also added to the optimization as an absolute constraint. Global constraints are provided for the optimization of the positional trajectory. We conducted experiments on the AUTOLABOR mobile robot, and the experimental results show that the localization accuracy of the SLAM back-end optimization algorithm with fused IPS can be maintained between 0.02 m and 0.03 m, which meets the requirements of indoor localization, and there is no cumulative drift problem when there is no loopback detection, which solves the problem of cumulative drift of the visual SLAM system to some extent. [ABSTRACT FROM AUTHOR]

This paper presents a comparative study that explores the performance of various meta-heuristics employed for Optimal Signal Design, specifically focusing on estimating parameters in nonlinear systems. The study introduces the Robust Sub-Optimal Excitation Signal Generation and Optimal Parameter Estimation (rSOESGOPE) methodology, which is originally derived from the well-known Particle Swarm Optimization (PSO) algorithm. Through a real-life case study involving an Autonomous Surface Vessel (ASV) equipped with three Degrees of Freedom (DoFs) and an aerial holonomic propulsion system, the effectiveness of different meta-heuristics is thoroughly evaluated. By conducting an in-depth analysis and comparison of the obtained results from the diverse meta-heuristics, this study offers valuable insights for selecting the most suitable optimization technique for parameter estimation in nonlinear systems. Researchers and experimental tests in the field can benefit from the comprehensive examination of these techniques, aiding them in making informed decisions about the optimal approach for optimizing parameter estimation in nonlinear systems. [ABSTRACT FROM AUTHOR]

Complex systems involve monitoring, assessing, and predicting the health of various systems within an integrated vehicle health management (IVHM) system or a larger system. Health management applications rely on sensors that generate useful information about the health condition of the assets; thus, optimising the sensor network quality while considering specific constraints is the first step in assessing the condition of assets. The optimisation problem in sensor networks involves considering trade-offs between different performance metrics. This review paper provides a comprehensive guideline for practitioners in the field of sensor optimisation for complex systems. It introduces versatile multi-perspective cost functions for different aspects of sensor optimisation, including selection, placement, data processing and operation. A taxonomy and concept map of the field are defined as valuable navigation tools in this vast field. Optimisation techniques and quantification approaches of the cost functions are discussed, emphasising their adaptability to tailor to specific application requirements. As a pioneering contribution, all the relevant literature is gathered and classified here to further improve the understanding of optimal sensor networks from an information-gain perspective. [ABSTRACT FROM AUTHOR]

Backbone satellites in a space information network (SIN) can be used as air base stations or data relay satellites (DRSs) to realize cross-system, cross-network and long-distance relay transmission. In this paper, a traffic load optimization problem for multi-satellite relay systems in SIN is considered to achieve highly efficient cooperative transmission and improve resource utility. A model of SIN based on a distributed satellite cluster (DSC) is considered, and the characteristics of the model are analyzed. Based on this, a hybrid resource management architecture combining distributed and central resources control schemes is proposed to realize a centrally controllable and distributed optimization of resources to meet various comprehensive service requirements. Two scenarios of multi-satellite relay systems in SIN are given, and traffic load optimization problems with joint bandwidth and power allocation for these two scenarios are formulated based on proportional fairness (PF) criterion to achieve traffic load balancing with considerable system capacity. The optimization problems in these two scenarios are proved to be a convex optimization problem with mathematical analysis, and the closed-form solutions of two problems in their dual domain are derived by dual transformation. With the closed-form solutions, two iterative algorithms based on the subgradient method are designed under the proposed hybrid resource management architecture to solve the problems in this paper. Simulation results show that the proposed schemes can effectively improve the upper bound of system capacity by resource sharing and cooperative relay, and it can balance the traffic load well with guarantees of a reasonable level system capacity compared with existing methods. [ABSTRACT FROM AUTHOR]

The main temperature compensation method for MEMS piezoresistive pressure sensors is software compensation, which processes the sensor data using various algorithms to improve the output accuracy. However, there are few algorithms designed for sensors with specific ranges, most of which ignore the operating characteristics of the sensors themselves. In this paper, we propose three temperature compensation methods based on swarm optimization algorithms fused with machine learning for three different ranges of sensors and explore the partitioning ratio of the calibration dataset on Sensor A. The results show that different algorithms are suitable for pressure sensors of different ranges. An optimal compensation effect was achieved on Sensor A when the splitting ratio was 33.3%, where the zero-drift coefficient was 2.88 × 10−7/°C and the sensitivity temperature coefficient was 4.52 × 10−6/°C. The algorithms were compared with other algorithms in the literature to verify their superiority. The optimal segmentation ratio obtained from the experimental investigation is consistent with the sensor operating temperature interval and exhibits a strong innovation. [ABSTRACT FROM AUTHOR]

The paper presents research on a specific approach to the issue of computed tomography with an incomplete data set. The case of incomplete information is quite common, for example when examining objects of large size or difficult to access. Algorithms devoted to this type of problems can be used to detect anomalies in coal seams that pose a threat to the life of miners. The most dangerous example of such an anomaly may be a compressed gas tank, which expands rapidly during exploitation, at the same time ejecting rock fragments, which are a real threat to the working crew. The approach presented in the paper is an improvement of the previous idea, in which the detected objects were represented by sequences of points. These points represent rectangles, which were characterized by sequences of their parameters. This time, instead of sequences in the representation, there are sets of objects, which allow for the elimination of duplicates. As a result, the reconstruction is faster. The algorithm presented in the paper solves the inverse problem of finding the minimum of the objective function. Heuristic algorithms are suitable for solving this type of tasks. The following heuristic algorithms are described, tested and compared: Aquila Optimizer (AQ), Firefly Algorithm (FA), Whale Optimization Algorithm (WOA), Butterfly Optimization Algorithm (BOA) and Dynamic Butterfly Optimization Algorithm (DBOA). The research showed that the best algorithm for this type of problem turned out to be DBOA. [ABSTRACT FROM AUTHOR]

With the rise of mobile edge computing (MEC), mobile services with the same or similar functions are gradually increasing. Usually, Quality of Service (QoS) has become an indicator to measure high-quality services. In the real MEC service invocation environment, due to time and network instability factors, users' QoS data feedback results are limited. Therefore, effectively predicting the Qos value to provide users with high-quality services has become a key issue. In this paper, we propose a truncated nuclear norm Low-rank Tensor Completion method for the QoS data prediction. This method represents complex multivariate QoS data by constructing tensors. Furthermore, the truncated nuclear norm is introduced in the QoS data tensor completion in order to mine the correlation between QoS data and improve the prediction accuracy. At the same time, the general rate parameter is introduced to control the truncation degree of tensor mode. Finally, the prediction approximate tensor is obtained by the Alternating Direction Multiplier Method iterative optimization algorithm. Numerical experiments are conducted based on the public QoS dataset WS-Dream. The results indicate that our QoS prediction method has better prediction accuracy than other methods under different missing density QoS data. [ABSTRACT FROM AUTHOR]

Structural health monitoring (SHM) systems may allow a reduction in maintenance costs and extend the lifetime of the structure. As a result, they are of interest to the research community. Ideally, the SHM methods should be low cost, while being able to detect and localize small levels of damage reliably and accurately. The fiber Bragg grating (FBG) sensors are light in weight, insensitive to electric and magnetic fields, and can be embedded. The edge filtering configuration for transduction allows the use of FBG for guided wave (GW) sensing. This sensitivity may be further enhanced through their application in the remote bonded configuration. This paper provides a proof-of-concept for the use of remotely bonded FBG for damage localization. In order to improve the computational efficiency, a particle swarm optimization (PSO) based algorithm is developed. The PSO allows a significant improvement in the computation time which makes it better suited for real-time damage localization. The proposed objective function is based on the exponential elliptical approach. First, the suitability of the PSO for damage localization is shown. Then the performance of the chosen objective function is compared with the brute-force algorithm as well as other objective functions found in the literature. The methodology is employed on a simple aluminum plate. The results indicate that indeed the objective function along with the PSO is suitable for damage localization. Also as the objective function is developed taking into consideration the specific challenges with the use of FBG sensors, performs better than the other objective functions as well as the brute force algorithm. [ABSTRACT FROM AUTHOR]

This paper considers the problem of finding the position of a passive target using noisy time difference of arrival (TDOA) measurements, obtained from multiple transmitters and a single receiver. The maximum likelihood (ML) estimator's objective function is extremely nonlinear and non-convex, making it impossible to use traditional optimization techniques. In this regard, this paper proposes the chaos-enhanced adaptive hybrid butterfly particle swarm optimization algorithm, named CAHBPSO, as the hybridization of butterfly optimization (BOA) and particle swarm optimization (PSO) algorithms, to estimate passive target position. In the proposed algorithm, an adaptive strategy is employed to update the sensory fragrance of BOA algorithm, and chaos theory is incorporated into the inertia weight of PSO algorithm. Furthermore, an adaptive switch probability is employed to combine global and local search phases of BOA with the PSO algorithm. Additionally, the semidefinite programming is employed to convert the considered problem into a convex one. The statistical comparison on CEC2014 benchmark problems shows that the proposed algorithm provides a better performance compared to well-known algorithms. The CAHBPSO method surpasses the BOA, PSO and semidefinite programming (SDP) algorithms for a broad spectrum of noise, according to simulation findings, and achieves the Cramer–Rao lower bound (CRLB). [ABSTRACT FROM AUTHOR]

Driving propensity is the driver's attitude towards the actual traffic situation and the corresponding decision-making or behavior during the driving process. It is of great significance to improve the accuracy of safety early warning and reduce traffic accidents. In this paper, a real-time identification system of driving propensity based on AutoNavi navigation data is proposed. The main work includes: (1) A dynamic data acquisition method of AutoNavi navigation is proposed to obtain the time, speed and acceleration of the driver during the navigation process. (2) The dynamic data collection method of AutoNavi navigation is analyzed and verified through the dynamic data obtained in the real vehicle experiment. The principal component analysis method is used to process the experimental data to extract the driving propensity characteristics variables. (3) The fruit fly optimization algorithm combined with GRNN (generalized neural network) and the feature variable set are used to build a FOA-GRNN-based model. The results show that the overall accuracy of the model can reach 94.17%. (4) A driving propensity identification system is constructed. The system has been verified through real vehicle test experiments. This paper provides a novel and convenient method for building personalized intelligent driver assistance systems in practical applications. [ABSTRACT FROM AUTHOR]

This paper introduces a novel methodology to optimize the design of a ratiometric rotary inductive position sensor (IPS) fabricated in printed circuit board (PCB) technology. The optimization aims at reducing the linearity error of the sensor and amplitude mismatch between the voltages on the two receiving (RX) coils. Distinct from other optimization techniques proposed in the literature, the sensor footprint and the target geometry are considered as a non-modifiable input. This is motivated by the fact that, for sensor replacement purposes, the target has to fit a predefined space. For this reason, the original optimization technique proposed in this paper modifies the shape of the RX coils to reproduce theoretical coil voltages as much as possible. The optimized RX shape was obtained by means of a non-linear least-square solver, whereas the electromagnetic simulation of the sensor is performed with an original surface integral method, which are orders of magnitude faster than commercial software based on finite elements. Comparisons between simulations and measurements performed on different prototypes of an absolute rotary sensor show the effectiveness of the optimization tool. The optimized sensors exhibit a linearity error below 0.1% of the full scale (FS) without any signal calibration or post-processing manipulation. [ABSTRACT FROM AUTHOR]

Photoelectric encoders are widely used in high-precision measurement fields such as industry and aerospace because of their high precision and reliability. In order to improve the subdivision accuracy of moiré grating signals, a particle swarm optimization compensation model for grating the subdivision error of a photoelectric encoder based on parallel iteration is proposed. In the paper, an adaptive subdivision method of a particle swarm search domain based on the honeycomb structure is proposed, and a raster signal subdivision error compensation model based on the multi-swarm particle swarm optimization algorithm based on parallel iteration is established. The optimization algorithm can effectively improve the convergence speed and system accuracy of traditional particle swarm optimization. Finally, according to the subdivision error compensation algorithm, the subdivision error of the grating system caused by the sinusoidal error in the system is quickly corrected by taking advantage of the high-speed parallel processing of the FPGA pipeline architecture. The design experiment uses a 25-bit photoelectric encoder to verify the subdivision error algorithm. The experimental results show that the actual dynamic subdivision error can be reduced to ½ before compensation, and the static subdivision error can be reduced from 1.264″ to 0.487″ before detection. [ABSTRACT FROM AUTHOR]

Over recent years, traditional manufacturing factories have been accelerating their transformation and upgrade toward smart factories, which are an important concept within Industry 4.0. As a key communication technology in the industrial internet architecture, time-sensitive networks (TSNs) can break through communication barriers between subsystems within smart factories and form a common network for various network flows. Traditional routing algorithms are not applicable for this novel type of network, as they cause unnecessary congestion and latency. Therefore, this study examined the classification of TSN flows in smart factories, converted the routing problem into two graphical problems, and proposed two heuristic optimization algorithms, namely GATTRP and AACO, to find the optimal solution. The experiments showed that the algorithms proposed in this paper could provide a more reasonable routing arrangement for various TSN flows with different time sensitivities. The algorithms could effectively reduce the overall delay by up to 74% and 41%, respectively, with promising operating performances. [ABSTRACT FROM AUTHOR]

Photovoltaic (PV) systems are crucial to the production of electricity for a newly established community in Egypt, especially in grid-tied systems. Power quality (PQ) issues appear as a result of PV connection with the power grid (PG). PQ problems cause the PG to experience faults and harmonics, which affect consumers. A series compensator dynamic voltage restorer (DVR) is the most affordable option for resolving the abovementioned PQ problems. To address PQ difficulties, this paper describes a grid-tied PV combined with a DVR that uses a rotating dq reference frame (dqRF) controller. The main goal of this study is to apply and construct an effective PI controller for a DVR to mitigate PQ problems. The artificial rabbits optimization (ARO) is used to obtain the best tune of the PI controller. The obtained results are compared with five optimization techniques (L-SHADE, CMAES, WOA, PSO, and GWO) to show its impact and effectiveness. Additionally, Lyapunov's function is used to analyze and evaluate the proposed controller stability. Also, a mathematical analysis of the investigated PV, boost converter, and rotating dqRF control is performed. Two fault test scenarios are examined to confirm the efficacy of the suggested control approach. The parameters' (voltage, current, and power) waveforms for the suggested system are improved, and the system is kept running continuously under fault periods, which improves the performance of the system. Moreover, the findings demonstrate that the presented design successfully keeps the voltage at the required level with low THD% values at the load side according to the IEEE standards and displays a clear enhancement in voltage waveforms. The MATLAB/SIMULINK software is used to confirm the proposed system's performance. [ABSTRACT FROM AUTHOR]

Precision object handling and manipulation require the accurate positioning of industrial robots. A common practice for performing end effector positioning is to read joint angles and use industrial robot forward kinematics (FKs). However, industrial robot FKs rely on the robot Denavit–Hartenberg (DH) parameter values, which include uncertainties. Sources of uncertainty associated with industrial robot FKs include mechanical wear, manufacturing and assembly tolerances, and robot calibration errors. It is therefore necessary to increase the accuracy of DH parameter values to reduce the impact of uncertainties on industrial robot FKs. In this paper, we use differential evolution, particle swarm optimization, an artificial bee colony, and a gravitational search algorithm to calibrate industrial robot DH parameters. A laser tracker system, Leica AT960-MR, is utilized to register accurate positional measurements. The nominal accuracy of this non-contact metrology equipment is less than 3 μm/m. Metaheuristic optimization approaches such as differential evolution, particle swarm optimization, an artificial bee colony and a gravitational search algorithm are used as optimization methods to perform the calibration using laser tracker position data. It is observed that, using the proposed approach with an artificial bee colony optimization algorithm, the accuracy of industrial robot FKs in terms of mean absolute errors of static and near-static motion over all three dimensions for the test data decreases from its measured value of 75.4 μm to 60.1 μm (a 20.3% improvement). [ABSTRACT FROM AUTHOR]

Advances in acoustic technology and instrumentation now make it possible to explore marine resources. As a significant component of ocean exploration, underwater acoustic target tracking has aroused wide attention both in military and civil fields. Due to the complexity of the marine environment, numerous techniques have been proposed to obtain better tracking performance. In this paper, we survey over 100 papers ranging from innovative papers to the state-of-the-art in this field to present underwater tracking technologies. Not only the related knowledge of acoustic tracking instrument and tracking progress is clarified in detail, but also a novel taxonomy method is proposed. In this paper, algorithms for underwater acoustic target tracking are classified based on the methods used as: (1) instrument-assisted methods; (2) mode-based methods; (3) tracking optimization methods. These algorithms are compared and analyzed in the aspect of dimensions, numbers, and maneuvering of the tracking target, which is different from other survey papers. Meanwhile, challenges, countermeasures, and lessons learned are illustrated in this paper. [ABSTRACT FROM AUTHOR]

Systems engineering plays a key role in the naval sector, focusing on how to design, integrate, and manage complex systems throughout their life cycle; it is therefore difficult to conceive functional warships without it. To this end, specialized information systems for logistical support and the sustainability of material solutions are essential to ensure proper provisioning and to know the operational status of the frigate. However, based on an architecture composed of a set of logistics applications, this information system may require highly qualified operators with a deep knowledge of the behavior of onboard systems to manage it properly. In this regard, failure detection systems have been postulated as one of the main cutting-edge methods to address the challenge, employing intelligent techniques for observing anomalies in the normal behavior of systems without the need for expert knowledge. In this paper, the study is concerned to the scope of the Spanish navy, where a complex information system structure is responsible for ensuring the correct maintenance and provisioning of the vessels. In such context, we hereby suggest a comparison between different one-class techniques, such as statistical models, geometric boundaries, or dimensional reduction to face anomaly detection in specific subsystems of a warship, with the prospect of applying it to the whole ship. [ABSTRACT FROM AUTHOR]

NV centers are among the most promising platforms in the field of quantum sensing. Magnetometry based on NV centers, especially, has achieved concrete development in areas of biomedicine and medical diagnostics. Improving the sensitivity of NV center sensors under wide inhomogeneous broadening and fieldamplitude drift is a crucial issue of continuous concern that relies on the coherent control of NV centers with high average fidelity. Quantum optimal control (QOC) methods provide access to this target; nevertheless, the high time consumption of current methods due to the large number of needful sample points as well as the complexity of the parameter space has hindered their usability. In this paper, we propose the Bayesian estimation phase-modulated (B-PM) method to tackle this problem. In the case of the state transforming of an NV center ensemble, the B-PM method reduced the time consumption by more than 90 % compared with the conventional standard Fourier basis (SFB) method while increasing the average fidelity from 0.894 to 0.905 . In the AC magnetometry scenario, the optimized control pulse obtained with the B-PM method achieved an eight-fold extension of coherence time T 2 compared with the rectangular π pulse. Similar application can be made in other sensing situations. As a general algorithm, the B-PM method can be further extended to the open- and closed-loop optimization of complex systems based on a variety of quantum platforms. [ABSTRACT FROM AUTHOR]

Cloud-fog computing is a wide range of service environments created to provide quick, flexible services to customers, and the phenomenal growth of the Internet of Things (IoT) has produced an immense amount of data on a daily basis. To complete tasks and meet service-level agreement (SLA) commitments, the provider assigns appropriate resources and employs scheduling techniques to efficiently manage the execution of received IoT tasks in fog or cloud systems. The effectiveness of cloud services is directly impacted by some other important criteria, such as energy usage and cost, which are not taken into account by many of the existing methodologies. To resolve the aforementioned problems, an effective scheduling algorithm is required to schedule the heterogeneous workload and enhance the quality of service (QoS). Therefore, a nature-inspired multi-objective task scheduling algorithm called the electric earthworm optimization algorithm (EEOA) is proposed in this paper for IoT requests in a cloud-fog framework. This method was created using the combination of the earthworm optimization algorithm (EOA) and the electric fish optimization algorithm (EFO) to improve EFO's potential to be exploited while looking for the best solution to the problem at hand. Concerning execution time, cost, makespan, and energy consumption, the suggested scheduling technique's performance was assessed using significant instances of real-world workloads such as CEA-CURIE and HPC2N. Based on simulation results, our proposed approach improves efficiency by 89%, energy consumption by 94%, and total cost by 87% over existing algorithms for the scenarios considered using different benchmarks. Detailed simulations demonstrate that the suggested approach provides a superior scheduling scheme with better results than the existing scheduling techniques. [ABSTRACT FROM AUTHOR]

This paper presents a data-driven structural health monitoring (SHM) method by the use of so-called reduced-order models relying on an offline training/online use for unidirectional fiber and matrix failure detection in a 3D woven composite plate. During the offline phase (or learning) a dataset of possible damage localization, fiber and matrix failure ratios is generated through high-fidelity simulations (ABAQUS software). Then, a reduced model in a lower-dimensional approximation subspace based on the so-called sparse proper generalized decomposition (sPGD) is constructed. The parametrized approach of the sPGD method reduces the computational burden associated with a high-fidelity solver and allows a faster evaluation of all possible failure configurations. However, during the testing phase, it turns out that classical sPGD fails to capture the influence of the damage localization on the solution. To alleviate the just-referred difficulties, the present work proposes an adaptive sPGD. First, a change of variable is carried out to place all the damage areas on the same reference region, where an adapted interpolation can be done. During the online use, an optimization algorithm is employed with numerical experiments to evaluate the damage localization and damage ratio which allow us to define the health state of the structure. [ABSTRACT FROM AUTHOR]

Artificial Intelligence (Al) models are being produced and used to solve a variety of current and future business and technical problems. Therefore, AI model engineering processes, platforms, and products are acquiring special significance across industry verticals. For achieving deeper automation, the number of data features being used while generating highly promising and productive AI models is numerous, and hence the resulting AI models are bulky. Such heavyweight models consume a lot of computation, storage, networking, and energy resources. On the other side, increasingly, AI models are being deployed in IoT devices to ensure real-time knowledge discovery and dissemination. Real-time insights are of paramount importance in producing and releasing real-time and intelligent services and applications. Thus, edge intelligence through on-device data processing has laid down a stimulating foundation for real-time intelligent enterprises and environments. With these emerging requirements, the focus turned towards unearthing competent and cognitive techniques for maximally compressing huge AI models without sacrificing AI model performance. Therefore, AI researchers have come up with a number of powerful optimization techniques and tools to optimize AI models. This paper is to dig deep and describe all kinds of model optimization at different levels and layers. Having learned the optimization methods, this work has highlighted the importance of having an enabling AI model optimization framework. [ABSTRACT FROM AUTHOR]

Single image dehazing has been a challenge in the field of image restoration and computer vision. Many model-based and non-model-based dehazing methods have been reported. This study focuses on a model-based algorithm. A popular model-based method is dark channel prior (DCP) which has attracted a lot of attention because of its simplicity and effectiveness. In DCP-based methods, the model parameters should be appropriately estimated for better performance. Previously, we found that appropriate scaling factors of model parameters helped dehazing performance and proposed an improved DCP (IDCP) method that uses heuristic scaling factors for the model parameters (atmospheric light and initial transmittance). With the IDCP, this paper presents an approach to find optimal scaling factors using the whale optimization algorithm (WOA) and haze level information. The WOA uses ground truth images as a reference in a fitness function to search the optimal scaling factors in the IDCP. The IDCP with the WOA was termed IDCP/WOA. It was observed that the performance of IDCP/WOA was significantly affected by hazy ground truth images. Thus, according to the haze level information, a hazy image discriminator was developed to exclude hazy ground truth images from the dataset used in the IDCP/WOA. To avoid using ground truth images in the application stage, hazy image clustering was presented to group hazy images and their corresponding optimal scaling factors obtained by the IDCP/WOA. Then, the average scaling factors for each haze level were found. The resulting dehazing algorithm was called optimized IDCP (OIDCP). Three datasets commonly used in the image dehazing field, the RESIDE, O-HAZE, and KeDeMa datasets, were used to justify the proposed OIDCP. Then a comparison was made between the OIDCP and five recent haze removal methods. On the RESIDE dataset, the OIDCP achieved a PSNR of 26.23 dB, which was better than IDCP by 0.81 dB, DCP by 8.03 dB, RRO by 5.28, AOD by 5.6 dB, and GCAN by 1.27 dB. On the O-HAZE dataset, the OIDCP had a PSNR of 19.53 dB, which was better than IDCP by 0.06 dB, DCP by 4.39 dB, RRO by 0.97 dB, AOD by 1.41 dB, and GCAN by 0.34 dB. On the KeDeMa dataset, the OIDCP obtained the best overall performance and gave dehazed images with stable visual quality. This suggests that the results of this study may benefit model-based dehazing algorithms. [ABSTRACT FROM AUTHOR]