Computer network attacks are evolving in parallel with the evolution of hardware and neural network architecture. Despite major advancements in Network Intrusion Detection System (NIDS) technology, most implementations still depend on signature-based intrusion detection systems, which can’t identify unknown attacks. Deep learning can help NIDS to detect novel threats since it has a strong generalization ability. The deep neural network’s architecture has a significant impact on the model’s results. We propose a genetic algorithm based model to find the optimal number of hidden layers and the number of neurons in each layer of the deep neural network (DNN) architecture for the network intrusion detection binary classification problem. Experimental results demonstrate that the proposed DNN architecture shows better performance than classical machine learning algorithms at a lower computational cost.

In this note we study the computation of the minimum polynomial of a matrix $A$ and how we can use it for the computation of the matrix $A^n$. We also describe the form of the elements of the matrix $A^{-n}$ and we will see that it is closely related with the computation of the Drazin generalized inverse of $A$. Next we study the computation of the exponential matrix and finally we give a simple proof of the Leverrier - Faddeev algorithm for the computation of the characteristic polynomial.

As a stimulus signal, coded electrical signals can control the motion behavior of animals, which has been widely used in the field of animal robots. In current research, most of the stimulus signals used by researchers are traditional waveform, such as square waves. To enrich the stimulus waveform, a wireless animal robot stimulation system based on neuronal electrical signal characteristics is presented in this paper. The stimulator uses the CC1101 wireless module to control animal behavior through brain stimulation. The LabVIEW-based graphical user interface(GUI) can manipulate brain stimulation remotely while the stimulator powered by battery. Additionally, the spikes of animals have been simulated by this system through Direct Digital Synthesizer(DDS) algorithm. The GUI enable users to customize the combination of these analog spike signals. The recombined signals are sent to the stimulator through CC1101 as stimulus signals. In vivo experiments conducted on five pigeons verified the efficacy of the stimulation mechanism. The analog spike signal with an amplitude of 3-5V successfully caused the pigeon’s turning behavior. The feasibility of the analog spike signals as stimulus signals was successfully verified. Increased the diversity of stimulus waveform in the field of animal robots.

Nowadays, speed up development and use of digital devices such as smartphones have put people at risk of internet crimes. The evidence of present crimes in a computer file can be easily unreachable by changing the prefix of a file or other algorithms. In more complex cases, either file divided into different parts or the parts of a file that has information about the file type are deleted, where the file fragment recognition issue is discussed. The known files are divided into different fragments, and different classification algorithms to solve the problems of file fragment recognition. A confusion matrix measures the accuracy of type recognition. In the present study, first, the file is divided into different fragments. Then, the file fragment features, which are obtained from Binary Frequency Distribution (BFD), are reduced by 2 feature reduction algorithms; Sequential Forward Selection algorithm (SFS) as well as Sequential Floating Forward Selection algorithm (SFFS) to delete sparse features that result in increased accuracy and speed. Finally, the reduced features are given to 3 classifier algorithms, Multilayer Perceptron (MLP), Support Vector Machines (SVM), and K-Nearest Neighbor (KNN) for classification and comparison of the results. In this paper, we proposed the algorithm of file type recognition that can recognize 6 types of useful files ( pdf, txt, jpg, doc, html, exe), which may distinguish a type of file fragments with higher accuracy than the similar works done.

Considering the significant advancements in autonomous vehicle technology, research in this field is of interest to researchers. To automatic parking, controlling steer angle, gas hatch, and brakes need to be learned. Due to the increase in the number of cars and road traffic, car parking space has decreased. Its main reason is information error. Because the driver does not receive the necessary information or receives it too late, he cannot take appropriate action against it. This paper uses two phases: the first phase, for goal coordination, was used genetic algorithms and the Cuckoo search algorithm was used to increase driver information from the surroundings. Using the Cuckoo search algorithm and considering the limitations, it increases the driver’s level of information from the environment. Also, by exchanging information through the application, it enables the information to reach the driver much more quickly and the driver reacts appropriately at the right time. The suggested protocol is called the MODM-based solution. Here, the technique is assessed through extensive simulations performed in the NS-3 environment. Based on the simulation outcomes, it is indicated that the parking system performance metrics are enhanced based on the detection rate, false-negative rate, and false-positive rate.

Cluster-based routing in Mobile Ad-Hoc Networks is considered one of the convenient methods of routing. The existence of Cluster Head (CH) in a group of nodes for data forwarding improves the performance of routing in terms of routing overhead and power consumption. In this paper, a clustering algorithm using hierarchical routing for mobile ad hoc networks is proposed. In the proposed method, first, clusters are formed by the FLOC clustering method with low overlapping. Then, according to the most important network criteria, including hop count, noise ratio, distance, remaining energy, and link expiration time, head clusters are selected based on the weighting algorithm. To transfer data in the proposed method, two types of communication are used, e.g., inter-cluster communication and intra-cluster communication in which the shortest path to the target cluster is selected. The proposed P-METHOD technique is based on hierarchy and clustering as well as using a weighted algorithm that reduces delay in data transmission on the network. Moreover, P-METHOD is evaluated here via extensive simulations carried out in NS-2. The simulation results indicate that the MANET network performance metrics are improved in terms of average throughput, Packet Delivery Ratio (PDR), delay, residual energy, and lifetime.

Dyadic data which is also called co-occurrence data (COD) contains co-occurrences of objects. Searching for statistical models to represent dyadic data is necessary. Fortunately, finite mixture model is a solid statistical model to learn and make inference on dyadic data because mixture model is built smoothly and reliably by expectation maximization (EM) algorithm which is suitable to inherent spareness of dyadic data. This research summarizes mixture models for dyadic data. When each co-occurrence in dyadic data is associated with a value, there are many unaccomplished values because a lot of co-occurrences are inexistent. In this research, these unaccomplished values are estimated as mean (expectation) of random variable given partial probabilistic distributions inside dyadic mixture model.

We developed a novel hybrid approach for solving global optimization, computer science, bio-medical and engineering real life applications that is based on the coupling of the Whale Optimizer and Sine Cosine Algorithms via a surrogate model. We relate the whale optimizer algorithm to balance between the exploitation and the exploration process in the proposed method. There exist confirmed techniques for searching approximate best optimal solutions, but our algorithm will further guarantee that such numerical and statistical solutions satisfy physical bounds of the standard and real life functions. Our experiments with the benchmark, bio-medical, computer science and engineering real life problems have illustrated the advantages of using a newly hybrid approach based on mixing Whale Optimizer and Sine Cosine algorithms. It holds considerable potential for reducing execution time for solving standard and real life problems and at the same time improving the quality of the solution.

This article proposes a monitoring system that allows to track transitions between different stages in the berry harvesting process (berry picking, waiting for transport, transport, and arrival to the packing) solely using information from temperature and vibration sensors located in the basket. The monitoring system assumes a characterization of the process based on Hidden Markov Models and uses the Viterbi algorithm to perform inference and estimate the most likely state trajectory. The obtained state trajectory estimate is then used to compute a potential damage indicator in real-time. The proposed methodology does not require information about the weight of the basket to identify each of the different stages, which makes it effective and more efficient than other alternatives available in the industry.

The tsscds method, recently developed in our group, discovers chemical reaction mechanisms with minimal human intervention. It employs accelerated molecular dynamics, spectral graph theory, statistical rate theory and stochastic simulations to uncover chemical reaction paths and to solve the kinetics at the experimental conditions. In the present review, its application to solve mechanistic/kinetics problems in different research areas will be presented. Examples will be given of reactions involved in photodissociation dynamics, mass spectrometry, combustion chemistry and organometallic catalysis. Some planned improvements will also be described.

In the past, Unmanned Aerial Vehicles (UAVs) were mostly used in the military operations to prevent pilot losses. Nowadays, the fast technological evolution enables the production of a class of cost-effective UAVs which can service a plethora of public and civilian applications, specially when configured to work cooperatively to accomplish a task. However, designing a communication network among the UAVs is challenging task. In this article, we propose a centralized UAV placement strategy, where UAVs are used as flying access points forming a mesh network, providing connectivity to ground nodes deployed in a target area. The geographical placement of UAVs is optimized based on a Multi-Objective Evolutionary Algorithm (MOEA). The goal of the proposed scheme is to cover all ground nodes using a minimum number of UAVs, while maximizing the fulfillment of their data rate requirements. The UAVs can employ different data rates depending on the channel conditions, which are expressed by the Signal-to-Noise-Ratio (SNR). In this work, elitist Non-Dominated Sorting Genetic Algorithm II (NSGA-II) is used to find a set of optimal positions to place UAVs, given the positions of the ground nodes. We evaluate the trade-off between the number of UAVs used to cover the target area and the data rate requirement of the ground nodes. Simulation results show that the proposed algorithm can optimize the UAV placement given the requirement and the positions of the ground nodes in the geographical area.

The identification of linear dynamic systems with static nonlinearities in the delta domain has been presented in this paper applying a firefly based hybrid meta-heuristic algorithm integrating Firefly algorithm (FA) and Gray wolf optimizer (GWO). FA diversifies the search space globally while GWO intensifies the solutions through its local search abilities. A test system with continuous polynomial nonlinearities has been considered for hammerstein and wiener system identification in continuous, discrete and delta domain. Delta operator modelling unifies system identification of continuous-time systems with discrete domain at higher sampling frequency. Pseudo random binary sequence, contaminated with white noise, has been taken up as the input signal to estimate the unknown model parameters as well as static nonlinear coefficients. The hybrid algorithm not only outperforms the parent heuristics of which they are constituted but also proves better as compared to some standard and latest heuristic approaches reported in the literature.

Academic publishing appears to be the most important key of the academic functions (academic research, excellence in teaching and learning and community services). Selecting the right journal to publish research results is a challenge to academics. Yet, there is inadequate knowledge about a model specifically directed at the topic of the journal selection process with a mathematical certainty. The objectives of this research are: to identify the main factors that an author or researchers consider when selecting an academic journal for submitting a manuscript, and, to develop a mathematical algorithm of journal selection that provide the best journal choice with a mathematical certainty based on difficulty of each factor. Quantitative research through questionnaires has been applied as an appropriate instrument base to address the researcher’s identification of the factors that should be considered when selecting a journal. Questionnaire developed and emailed to academics in 31 public and private universities in the developing countries. Academics reported that the most important publication difficulty factors were publishing in reputable journals, and publishing in a journal that has an impact factor. However, the most least publication difficulty factors were found to be: number of issues per year and if the journal is an open access. The proposed mathematical algorithm of journal’s publication difficulty factors was developed and tested.

Nowadays, we live in a world in which people are facing with a lot of data that should be stored or displayed. One of the key methods to control and manage this data refers to grouping and classifying them in clusters. Today, clustering has a critical role in information retrieval methods for organizing large collections inside a few significant clusters. One of the main motivations for the use of clustering is to determine and reveal the hidden and inherent structure of a set of data. Ensemble clustering algorithms combine multiple clustering algorithms to finally reach an overall clustering system. Ensemble clustering methods by lack of information fusing utilize several primary partitions of data to find better ways. Since various clustering algorithms look at the different data points, they can produce various partitions from such data. It is possible to create a partition with high performance by combining the partitions obtained from different algorithms, even if the clusters to be very dense from each other. Most studies in this area have examined all the initial clusters. In this study, a new method is used in which the most sustainable clusters are utilized instead of all primary produced clusters. Consensus function based on co-association matrixes used to select more stable clusters. The most stable clusters selection method is done by cluster stability criterion based on F-measure. Optimization functions are used to optimize the obtained final clusters. The genetic algorithm is the optimizer used in this article to find the ultimate clusters participated in a consensus. Experimental results on several datasets show that the output of proposed method is various clusters with high stability.

This study introduces an advanced dual-mode composite attitude control framework for reusable launch vehicles (RLVs), underpinned by an enhanced particle swarm optimization (PSO) algorithm. This innovative strategy is tailored to meet the stringent demands for precision and robust anti-interference capabilities across the entire flight envelope of RLVs. The research commences with the formulation of a comprehensive attitude dynamics model and diverse heterogeneous actuator representations, meticulously crafted to reflect the distinct phases of RLV flight. Building upon this foundation, a synergistic control paradigm is engineered, integrating PID and fuzzy PID controllers, complemented by a refined fitness evaluation function. The crux of the study is the application of an upgraded PSO algorithm to fine-tune the controllers' weighting coefficients, culminating in an optimized dual-mode composite attitude control system. A series of comparative simulation analyses are meticulously executed to appraise the system's responsiveness, stability, precision, and resilience to interference. The findings unequivocally substantiate the superior performance of the proposed control system, affirming its substantial contribution to the advancement of RLV attitude control.

Unmanned aerial vehicles (UAVs, drones) are not just a technological achievement based on modern ideas of artificial intelligence; they also provide a sustainable solution for green technologies in logistics, transport and material handling. In particular, using battery-powered UAVs to transport products can significantly decrease energy and fuel expenses, reduce environmental pollution, and improve the efficiency of clean technologies through improved energy-saving efficiency. We consider the problem of maximizing the average environmental benefit of a fleet of drones given a periodic schedule of tasks performed by the fleet of vehicles. To solve the problem efficiently, we formulate it as an optimization problem on an infinite periodic graph and reduce it to a special type of parametric assignment problem. We exactly solve the problem under consideration in O(n³) time, where n is the number of tasks performed by vehicles.

Given the landscape of intricate and constantly evolving cyber threats, organizations demand refined strategies to deploy a Security Information and Event Management to support the management of a Cyber Security Operations Center. The dynamic nature of cyber threats complicates the efficient allocation of the location of network intrusion detection sensors, a critical component of a robust cybersecurity framework. Our research introduces an approach that integrates the precision of biomimetic optimization algorithms with the adaptability of Deep Q–Learning. By employing different biomimetic algorithms enhanced with deep learning, we aim to refine the deployment of sensors in network infrastructures, balancing the network security imperative against deployment costs. The results of computational tests demonstrate that the improved iterations leveraging Deep Q–Learning have outperformed their native counterparts. These findings underscore the importance of reinforcement learning, specifically through Deep Q–Learning, as a powerful tool to enhance the effectiveness of metaheuristics in addressing optimization challenges.

: This paper presents a comparison between direct integer orders or classical model reference adaptive control (IO-DMRAC) versus its fractional orders counterpart (FO-DMRAC) applied to the F-16 aircraft longitudinal model pitch rate control. A substantial improvement is achieved when using fractional order adaptive control, since, in addition to performance indices, such as Integral Square-Error criterion (ISE) and Integral Square-Input criterion (ISU) being lower, the oscillations of the system output (pitch rate) in the transient period, are eliminated. Moreover, it is the first attempt in literature of adaptive control that a FO-DMRAC is applied to the pitch rate control of an aircraft. A F-16 short-period model, whose relative degree is equal to 1 (n^*=1) is analyzed by mean of simulations with good results. A FO-DMRAC is designed, for a specific operating flight conditions and compared with its IO-DMRAC counterpart. Furthermore, the boundedness of all signals, including the internal ones ω(t) are assured.

Educational institutions must identify students who are academically struggling to provide them with necessary support to improve their performance. In this context, recommendation systems powered by deep learning techniques are vital for detecting and categorizing such students. These systems help students plan their future by uncovering patterns in their historical academic data. This study introduces a new deep learning model designed to classify academically underperforming students in educational settings. The model incorporates a Gated Recurrent Neural Network (GRU) and includes specific neural network features like a dense layer, max-pooling layer, and the ADAM optimization algorithm. The model's training and evaluation were conducted using a dataset comprising 15,165 student assessment records from various academic institutions. The performance of the developed GRU model was benchmarked against other educational recommendation systems, including Recurrent Neural Network models, AdaBoost, and the Artificial Immune Recognition System v2. The proposed GRU model demonstrated remarkable accuracy, achieving an overall rate of 99.70%.

The exceptional performance advantages of the fiber optic gyroscope (FOG) position it as a dominant player in middle and high-end inertial navigation systems. To prevent the loss of sensor precision caused by algorithm design and simplify the complex modeling strategy in traditional methods. We gradually demonstrate the significant role of Convolutional Neural Network (CNN) in the navigation system based on FOG, and utilize the particle swarm optimization algorithm (PSO) to expedite the convergence of the network. The experimental results demonstrate that the initial alignment method based on deep learning is more accurate than the traditional method. The attitude angle error is reduced by 81.25%, 92.54% and 36.53% respectively. The research provides support for the future application of deep learning in optical navigation systems.

In this work, we propose a Fog-enabled UAV-as-a-Service (FU-Serve) architecture to address the issues of data transmission delay for serving time-critical Internet of Things (IoT) applications. Traditionally, in a UAV-as-a-Service (UaaS) platform, different UAVs host heterogeneous sensors, which sense the physical phenomenon and transmit the sensed data to a centralized entity. Transmission of data from the sensors to the centralized entity and making any decision for an application consumes a significant amount of time. Consequently, the traditional UaaS architecture is unsuitable for serving time-critical IoT applications such as transportation, healthcare, and industries. To address these issues of service latency for time-critical IoT applications, we present the FU-Serve architecture by introducing the concept of fog computing in the UaaS platform. We discuss all the components of FU-Serve elaborately in this paper. Additionally, we architect optimal and dynamic fog node selection mechanisms for FU-Serve, which reduce the transmission delay in the networks. The simulation results show that the FU-Serve outperforms by $75\%$ compared to the traditional UaaS platform.

With the continuous breakthrough of natural language processing, the application of intelligent question answering technology in electric power system has attracted wide attention. However, at present, the traditional question answering system has poor performance and is difficult to be applied in engineering practice. This paper proposes an improved BERTserini algorithm for intelligent answering of electric power regulations based on a BERT model. The proposed algorithm is implemented in two stages. The first stage is the text segmentation stage, where a multi-document long text preprocessing technique is utilized that accommodates the rules and regulations text, and then Anserini is used to extract paragraphs with high relevance to the given question. The second stage is answer generation and source retrieval stage, where a two-step fine-tuning based on the Chinese BERT model is applied to generate precise answers based on given questions, while the information regarding documents, chapters, and page numbers of these answers are also output simultaneously. The algorithm proposed in this paper eliminates the necessity for manual organization of professional question-answer pairs, thereby effectively reducing the manual labor cost compared to traditional question answering systems. Additionally, this algorithm exhibits a higher degree of exact match rate and a faster response time for providing answers.

This work is devoted to the construction and study of commutative gates for a two-qubit quantum system. Using four-dimensional algebra developed by the Kazakh mathematician Abenov M.M. all groups of commutative gates have been constructed, and among all states of a two-qubit quantum system, unitary states with which a specific gate is connected have been identified. An explicit type of gate is described that transfers a quantum system from one unitary state to another unitary state. The proposed approach opens up new possibilities for the design of quantum algorithms not only for two-qubit quantum systems, but also for $n$-qubit quantum systems.

This article describes the choice of an optimization algorithm for solving problems and the optimal design of an unmanned aerial vehicle propeller. To solve the problem using evolutionary algorithms, it was transformed into an unconstrained optimization problem using a penalty function. The airfoil contours were constructed using a Bezier curve. Design variables were divided into two types: those that describe in general terms the propeller geometry or operation, such as propeller diameter, number of blades, and rev/min; and those that vary with propeller radius, such as chord length, effective airfoil angle, and airfoil geometry. The objective function is the calculation of the propeller power required to achieve a given thrust. The differential evolution algorithm was used to solve this problem.

The need to find the global minimum in multi-dimensional functions is a critical problem in many fields of science and technology. Effectively solving this problem requires the creation of initial solution estimates, which are subsequently used by the optimization algorithm to search for the best solution in the solution space. In the context of this article, a novel approach to generating the initial solution distribution is presented which is applied to a genetic optimization algorithm. Using the k-means clustering algorithm, a distribution based on data similarity is created. This helps in generating initial estimates that may be more tailored to the problem. Additionally, the proposed method employs a rejection sampling algorithm to discard samples that do not yield better solution estimates in the optimization process. This allows the algorithm to focus on potentially optimal solutions, thus improving its performance. Finally, the article presents experimental results from the application of this approach to various optimization problems, providing the scientific community with a new method for addressing this significant problem.

The flour milling industry, a vital component of global food production, is undergoing a transformative phase driven by the integration of smart devices and advanced technologies. This transition promises improved efficiency, quality, and sustainability in flour production. Accurate estimation of protein, moisture and ash content in wheat grains and flour is of paramount importance due to their direct impact on product quality and compliance with industry standards. This paper explores the application of Near-Infrared (NIR) spectroscopy as a non-destructive, efficient, and cost-effective method for measuring the aforementioned essential parameters in wheat and flour, by investigating the effectiveness of a low-cost handle NIR spectrometer. Furthermore, a novel approach using Fuzzy Cognitive Maps (FCMs) is proposed to estimate protein, moisture and ash content in grain seeds and flour, marking the first known application of FCMs in this context. Our study includes an experimental setup that assesses different types of wheat seeds and flour samples and evaluates three NIR pre-processing techniques to enhance parameter estimation accuracy. The results indicate that low-cost NIR equipment can contribute to the estimation of the under-study parameters.

Blasting pattern optimization is an attempt to optimize blast design parameters aiming to achieve optimum fragmentation, reduce mining operating costs as well as environmental side consequences. The present study aims to propose a multi-objective optimization model, employing artificial intelligence and metaheuristics, to simultaneously minimize the mine-to-crusher operating costs and the impact of blasting consequences including fly-rock and back-break. To achieve the purpose of the study, a multi-variable regression model was developed to model total costs from drilling to crushing. In addition to the costs, multilayer perception neural networks were implemented to predict the blast-induced back-break and fly-rock as a function of collected variables such as number of holes, hole length, burden, spacing, hole slope, stemming, blasted rock per hole, powder factor, and charge per delay. High-precise estimations for both back-break and fly-rock were achieved with the average of 99% coefficient of determination for train, test and validation data sets. Then, the developed regression model and the neural networks were used in an optimization framework, employing Grasshopper algorithm, to find the optimum blast design satisfying practical constraints. The proposed model was tested on a lead-zinc open-pit mine, where 1032 blasting patterns were recorded and analyzed. The results of the optimization model provide a Pareto set of solutions, such that any of these solutions can be implemented according to the strategy of the mining operation management team. The blast pattern with the lowest cost, result in a relatively high fly-rock and back-break, while the pattern with low fly-rock and back-break raises the cost by 20.13 % compared the minimum cost blast design.

This study investigates the application of Unmanned Aerial Vehicles (UAVs) equipped with a Micasense RedEdge-MX multispectral camera for the estimation of Secchi Depth (SD) in inland water bodies. The research analyzed and compared five sun-glint correction methodologies — Hedley, Goodman, Lyzenga, Joyce, and threshold removed glint to model the SD values derived from UAV multispectral imagery, highlighting the role of reflectance accuracy and algorithmic precision in SD modeling. While Goodman's method showed a higher correlation (0.92) with in situ SD measurements, Hedley's method exhibited the smallest average deviation (0.65 m), suggesting its potential in water resource management, environmental monitoring, and ecological modeling. The study also underscored the Quasi-Analytical Algorithm (QAA) potential in estimating SD due to its flexibility to process data from various sensors without requiring in situ measurements, offering scalability for large-scale water quality surveys. The accuracy of SD measures, calculated using QAA, was related to variability in water constituents of coloured dissolved organic matter and the solar zenith angle. A practical workflow for SD acquisition using UAVs and multispectral data was proposed for monitoring inland water bodies.

Hospital readmission and length of stay prediction provide info to manage hospitals’ bed capacity and the number of required staff, especially during pandemics. We present a hybrid deep model called Genetic Algorithm-Optimized Convolutional Neural Network (GAOCNN) with a unique preprocessing method to predict hospital readmission and the length of stay in patients having various conditions. GAOCNN uses one-dimensional convolutional layers to predict hospital readmission and length of stay. The parameters of the layers are optimized using a genetic algorithm. To show the performance of the proposed model in patients with various conditions, we evaluate the model under three healthcare datasets; the Diabetes 130-US hospitals dataset, the COVID-19 dataset, and the MIMIC-III dataset. The diabetes 130-US hospitals dataset has information on both readmission and the length of stay, while COVID-19 and MIMIC-III datasets just include information on the length of stay. Experimental results show that the proposed model’s accuracy for hospital readmission is 97.2% for diabetic patients. Also, the accuracy of the length of stay prediction is 89%, 99.4%, and 94.1% for diabetic, COVID-19, and ICU patients, respectively. These results confirm the superiority of the proposed model compared to existing methods. Our findings offer a platform for managing healthcare funds and resources for patients with various diseases.

Distributed electric propulsion technology has great potential and advantage in the development of drones. In this paper, to study the slipstream effect of distributed propeller, the actuator disk method was used to verify a single propeller, and the calculated thrust was in good agreement with the test results. Then, based on the actuator disk method, the influence of different installation positions on the slipstream effect was studied, and the distributed propeller layout was optimized by genetic algorithm. The analysis results showed that lift of the wing will be larger when the propellers are higher than the wing. When the relative height between the propeller and the wing is zero, the drag is the lowest. The influence of disk diameter on the slipstream is that the larger the diameter is, the higher the lift force and the drag force are. The slipstream effect of the optimized propeller distribution improves the lift-drag ratio of the wing, by 108.5% in the initial lift-drag ratio.

Quantum computing has attracted significant interest in the optimization community because it potentially can solve classes of optimization problems faster than conventional supercomputers. Several researchers proposed quantum computing methods, especially Quantum Interior Point Methods (QIPMs), to solve convex optimization problems, such as Linear Optimization, Semidefinite Optimization, and Second-order Cone Optimization problems. Most of them have applied a Quantum Linear System Algorithm at each iteration to compute a Newton step. However, using quantum linear solvers in QIPMs comes with many challenges, such as having ill-conditioned systems and the considerable error of quantum solvers. This paper investigates how one can efficiently use quantum linear solvers in QIPMs. Accordingly, an Inexact Infeasible Quantum Interior Point Method is developed to solve linear optimization problems. We also discuss how we can get an exact solution by Iterative Refinement without excessive time of quantum solvers. Finally, computational results with a QISKIT implementation of our QIPM using quantum simulators are analyzed.

Phosphorus (P) is the most important substance in inorganic fertilizers used in agriculture industry. In this study, a multi-product and multi-objective model is presented considering economic and environmental concerns to design a renewable and sustainable P-fertilizer supply chain management (PFSCM). To handle complexities of the proposed model, an ensemble knowledge-based three-stage heuristic-metaheuristic algorithm utilizing heuristic information available in the model, whale optimization algorithm, and variable neighborhood search (named H-WOA-VNS) is proposed. At first, a problem-dependent heuristic is designed to generate a set of near-optimal feasible solutions. These solutions are fed into a population-based whale optimization algorithm which benefits from both exploration and exploitation strategies. Finally, a single-solution metaheuristic based on variable neighborhood search is applied to further improve the quality of the solution using local search operators. The objective function of the algorithm is formulated as a weighted average function to minimize total economic cost, while increasing crop yield and P use efficiency. Experimental results over five synthetic datasets and a real case study of the P-fertilizer supply chain confirm the superiority of the proposed method against the state-of-the-art techniques. The results demonstrate that the proposed method performs well in optimizing both the economic cost and environmental issues.

Matrix multiplication is probably one of the most basic and important operations having a wide range of applications in studying Linear algebra. We will be primarily focused on reviewing different algorithms for the multiplication of two n×n matrices. The most Naive method has a complexity of O(n3) but interestingly, algorithms with better complexity have been achieved. We will get to see how the complexity can be improved further, occasionally giving a survey.

By combining stochastic variational inference with message passing algorithms we show how to solve the highly complex problem of navigation and avoidance in distributed multi-robot systems in a computationally tractable manner, allowing online implementation. Subsequently, the proposed variational method lends itself to more flexible solutions than prior methodologies. Furthermore, the derived method is verified both through simulations with multiple mobile robots and a real world experiment with two mobile robots. In both cases the robots shares the operating space and needs to cross each other’s paths multiple times without colliding.

The spatial distribution of elements can be regarded as a numerical field of concentration values with a continuous spatial coverage. An active area of research is to discover geologically meaningful relationships among elements from their spatial distribution. To solve this problem, we propose an association rule mining method based on clustered events of spatial auto-correlation and applied it to the polymetallic deposits of the Chahanwusu River area, Qinghai Province, China. The elemental data for stream sediments were first clustered into HH (high-high), LL (low-low), HL (high-low), and LH (low-high) groups by using local Moran’s I clustering map (LMIC). Then the Apriori algorithm was used to mine the association rules among different elements in these clusters. More than 86% of the mined rule points are located within 1000 m of faults and near known ore occurrences, and occur in the upper reaches of the stream and catchment areas. In addition, we found that the Indosinian granodiorite is enriched in sulfophile elements, e.g., Zn, Ag and Cd, and the Variscan granite quartz diorite (P1γδο) coexists with Cu and associated elements. Therefore, the proposed algorithm is an effective method for mining co-existence patterns of elements and provides an insight into their enrichment mechanisms.

Time series data are significant and are derived from temporal data, which involve real numbers representing values collected regularly over time. Time series have a great impact on many types of data. However, time series have anomalies. We introduce hybrid algorithm named novel matrix profile (NMP) to solve the all-pairs similarity search problem for time series data. The proposed NMP inherits the features from two state-of-the art algorithms: similarity time-series automatic multivariate prediction (STAMP), and short text online microblogging protocol (STOMP). The proposed algorithm caches the output in an easy-to-access fashion for single- and multidimensional data. The proposed NMP algorithm can be used on large data sets and generates approximate solutions of high quality in a reasonable time. The proposed NMP can also handle several data mining tasks. It is implemented on a Python platform. To determine its effectiveness, it is compared with the state-of-the-art matrix profile algorithms i.e., STAMP and STOMP. The results confirm that the proposed NMP provides higher accuracy than the compared algorithms.

Although educational timetabling problems have been studied for decades, one type, the STP, has not developed as quickly as the other two types due to its diversity and complexity. Also, most of the STP research has only focused on the educators’ availabilities when studying the educator aspect, and the educators’ preferences and expertise have not been taken into consideration. This paper proposes a conceptual model for the school timetabling problem considering educators’ availabilities, preferences and expertise as a whole, and chooses a common real-world school timetabling scenario to study. A mathematical model is presented. A Virtual search space for dealing with the large search space is introduced, and the artificial bee colony algorithm is adapted and applied to the proposed model. The proposed approach is simulated with a random-generated large dataset. The experimental results demonstrate that the proposed approach is able to solve the STP and handle a large dataset in an ordinary computer hardware environment, which significantly reduces computational costs. Compared to the traditional CP method, the proposed approach is more effective and can provide more satisfactory solutions in considering educators’ availabilities, preferences, and expertise levels.

Based on the satellite attitude control method, this paper proposes an attitude control method based on neural network disturbance compensation. The paper firstly analyzes the neural network algorithm and proposes an orthogonal least squares algorithm to implement network learning. In this paper, a set of high-precision directional neural network compensation controllers is designed for the attitude control of acupuncture small satellites. The feasibility of the improved orthogonal least-squared algorithm combined with the neural network supplementary control method in satellite attitude control is verified by experiments.

Image registration has an imperative role in medical imaging. In this work, a grey-wolf optimizer (GWO) based non-rigid demons registration is proposed to support the retinal image registration process. A comparative study of the proposed GWO-based demons registration framework with cuckoo search, firefly algorithm, and particle swarm optimization- based demons registration is conducted. In addition, a comparative analysis of different demons registration methods, such as Wang’s demons, Tang’s demons, and Thirion’s demons which are optimized using the proposed GWO is carried out. The results established the superiority of the GWO-based framework which achieved 0.9977 correlation, and fast processing compared to the use of the other optimization algorithms. Moreover, GWO-based Wang’s demons performed better accuracy compared to the Tang’s demons and Thirion’s demons framework. It also achieved the best less registration error of 8.36×10^-5.

The power converter is the significant device in a wind power system. Wind turbine will be shut down and off grid immediately with the occurrence of the IGBT module open-circuit fault of power converter, which will seriously impact the stability of grid and even threaten personal safety. However, in the existing diagnosis strategies of power converter, there are few single and double IGBT modules open-circuit fault diagnosis methods producing negative results including erroneous judgment, omissive judgment and low accuracy. In this paper, a novel method to diagnose the single and double IGBT modules open-circuit faults of the permanent magnet synchronous generator (PMSG) wind turbine grid-side converter (GSC) is proposed. Above all, collecting the three-phase current varying with wind speed of 22 failure states including a normal state of PMSG wind turbine GSC as the original signal data. Afterward, the original signal data are decomposed by using variational mode decomposition (VMD) to obtain the mode coefficient series, which are analyzed by the proposed method base on fault trend feature for extracting the trend feature vectors. Finally, the trend feature vectors are used as the input of deep belief network (DBN) for decision-making and obtaining the classification results. The simulation and experimental results show that the proposed method can diagnose the single and double IGBT modules open-circuit faults of GSC, and the accuracy is higher than the benchmark models.

The node position information is critical in the wireless sensor network (WSN). However, the existing positioning algorithms commonly have low positioning accuracy because of noise interferences in communication. To solve this problem, this paper presents an iterative positioning model based on distance correction to improve the positioning accuracy of the target node in WSN. First, the log-distance distribution model of received signal strength indication (RSSI) ranging is built and the noise impact factor is derived based on the model. Second, the initial position coordinates of the target node are obtained based on the triangle centroid localization algorithm, thereby calculating the distance deviation coefficient under the influence of noise. Then, the ratio of the distance measured by the log-normal distribution model to the median distance deviation coefficient is taken as the new distance between the anchor node and the target node. Based on the new distance, the triangular centroid positioning algorithm is used again to calculate the target node coordinates. Finally, the iterative positioning model is constructed, and the distance deviation coefficient is updated repeatedly to update the positioning result until the set number of iterations is reached. Experiment results show that the proposed iterative positioning model can improve positioning accuracy effectively.

For the task planning problem of the command and control architecture, the existing algorithms have problems such as low efficiency and poor re-planning quality under abnormal conditions. Based on the requirements of the current accusation architecture, this paper constructs a distributed command and control architecture model based on multi-agents, which makes use of the superiority of multi-agents in dealing with complex tasks. The concept of MultiAgents-HTN is proposed under the framework. The original hierarchical task network planning algorithm is optimized, the multi-agent collaboration framework is redefined, and the coordination mechanism of local conflict is designed. Taking the classical resource scheduling problem as the experimental background, the comparison between the proposed algorithm and the classical HTN algorithm is carried out. The experimental results show that the proposed algorithm has higher quality and higher efficiency than the existing algorithm, and the space anomaly is heavy during processing. The planning is more efficient, and the time is more complicated and superior in dealing with the same problem, with good convergence and adaptability. The conclusion proves that the distributed command and control architecture proposed in this paper has high practicability in related fields and can solve the problem of distributed command and control architecture in multi-agent environment.

A new variant of two-echelon routing problem is investigated, where the truck and the drone are used to cooperatively complete the deliveries of all parcels. The truck not only acts as a tool for parcel delivery, but also serves as a moving depot for the drone. The drone can carry several parcels and take off from the truck, while returning to the truck after completing the delivery. The energy consumption model for the routing process of the drone is analyzed, when it is utilized to deliver multiple parcels. A two-stage route-based modelling approach is proposed to optimize both the truck’s main route and the drone’s adjoint flying routes. A hybrid heuristic integrating nearest neighbor and cost saving strategies is developed to quickly construct a feasible solution. The simulated annealing algorithm is applied to improve the quality of the solution, where a Tabu list is employed to improve the search efficiency. Random instances at different scales are used to test the performance of the proposed algorithm. A case study based on the practical road network in Changsha, China, is presented, through which the sensitivity analysis is conducted with respect to some critical factors.

This paper proposes a method based on genetic algorithm (GA) for the security-constrained optimal dispatch of integrated natural gas and electricity networks, considering operating scenarios in both energy systems. The mathematical formulation of the optimization problem consists of a multi-objective function which aims to minimize both cost of thermal generation (diesel and natural gas) as well as the production and transportation of natural gas. The joint gas-electricity system is modeled by two separate groups of nonlinear equation, which are solved by the combination of Newton's method with the GA. The applicability of the proposed method is tested in the Belgian gas network integrated with the IEEE 14-bus test system and a 15-node natural gas network integrated with the IEEE 118-bus test system. The results demonstrate that the proposed method provides efficient and secure solutions for different operating scenarios in both energy systems.

The use of unmanned aerial vehicle (UAV) during emergency response of a disaster has been widespread in recent years and the terrain images captured by the cameras on board these vehicles are significant sources of information for such disaster monitoring operations. Thus, analyzing such images are important for assessing the terrain of interest during such emergency response operations. Further, these UAVs are mainly used in disaster monitoring systems for the automated deployment of sensor nodes in real time. Therefore, deploying and localizing the wireless sensor nodes optimally, only in the regions of interest that are identified by segmenting the images captured by UAVs, hold paramount significance thereby effecting their performance. In this paper, the highly effective nature-inspired Plant Growth Simulation Algorithm (PGSA) has been applied for the segmentation of such terrestrial images and also for the localization of the deployed sensor nodes. The problem is formulated as a multi-dimensional optimization problem and PGSA has been used to solve it. Furthermore, the proposed method has been compared to other existing evolutionary methods and simulation results show that PGSA gives better performance with respect to both speed and accuracy unlike other techniques in literature.

: To improve the efficiency of rhizobial inoculation operations and address the current situation of rhizobial inoculation being labor-intensive, a spraying and control system for variable rate application (VRA) of liquid rhizobia was developed. The system can accurately regulate the spraying rate of liquid rhizobia according to the desired rate of rhizobia by incremental Proportional Integral Derivative (PID) closed-loop control algorithm, making it particularly suitable for precise spraying with small amounts. In the laboratory experiment of precise flow control, variation coefficient of spraying nozzle from 0.10 MP to 0.20 MP pressure were no more than 1.2%. A clear linear relationship was observed between the spraying rate and pressure. The maximum response time was 1.93 seconds, while the average response time was 1.62 seconds when controlling the spraying system for small amounts. Field trial was conducted in Heilongjiang Agricultural Xianghe Farm of China. Average seeds number and 100-seed weight of soybean plant with rhizobia inoculation treatment were better than control group, and average yield of spraying liquid rhizobia agent with full base fertilizer increased by 232.5 kg/hm2, representing a significant 7.4% improvement over the control group. The results of these trails clearly showed the positive effect of the spraying and control system for liquid rhizobial inoculation, which has superior to existing inoculation manners, and provides an important technical support for the widespread adoption of rhizobia technology.

This study explores the application of the Fully Convolutional Network (FCN) algorithm to the field of meteorology, specifically for the short-term nowcasting of severe convective weather events such as hail, convective wind gust (CG) and thunderstorms, short-term heavy rain(STHR) in Gansu. Training data comes from the European Center for Medium-Range Weather Forecasts (ECMWF) and real-time ground observations, the performance of the proposed FCN model based on 2017 to 2021 training datasets demonstrate a high prediction accuracy, with an overall error rate of 16.6%. Furthermore, the model exhibited an error rate of 18.6% across both severe and non-severe weather conditions when testing against the 2022 dataset. Operational deployment in 2023 has yielded an average Critical Success Index (CSI) of 24.3%, a Probability of Detection (POD) of 62.6%, and a False Alarm Ratio (FAR) of 71.2% for these convective events. It is noteworthy that the predicting performance for STHR was particularly effective with the highest POD and CSI, as well as the lowest FAR. CG and hail predictions had comparable CSI and FAR scores, although the POD for CG surpassed that for hail. The FCN model’s optimal performance for hail prediction occurred at the 4th, 8th, and 10th forecast hours, while for CG, the 6th hour was most accurate, and for STHR, the 2nd and 4th hours were most effective. These findings underscore the FCN model's ideal suitability for short-term forecasting of severe convective weather, presenting extensive prospects for the automation of meteorological operations in the future.

The Internet of Things (IoT) aims to connect all objects and facilitate data interchange, with data accuracy being paramount. While IoT has seen extensive adoption in conventional sectors, its application in the petroleum industry, especially with downhole equipment, poses challenges due to the extreme high-temperature and high-pressure conditions, making accurate measurements elusive. This Paper we aim to enhance the accuracy of downhole pressure measurements in slim-hole drilling parameter monitoring, mitigate the temperature influences on strain gauges, and surmount the intrinsic limitations of the traditional BP neural network, such as sluggish convergence speeds, high sensitivity to initial weights and biases, unstable learning rates, and a tendency to fall into local minima. This study introduces a temperature compensation model using a chaotic-initiated adaptive whale optimization algorithm (C-I-WOA) to optimize a BP neural network, which is henceforth referred to as the C-I-WOA-BP model. Initially, we harnessed chaotic mapping techniques to refine the initialization process of the whale optimization algorithm (WOA) population, thereby bolstering the heterogeneity of the algorithm. Subsequently, we integrated an adaptive weight recalibration mechanism, refined the encompassing methodology of the WOA, and bolstered its capabilities for expansive global scouting and meticulous local refinement in the solution arena. Subsequently, the WOA was used to optimize the weight coefficients of the BP neural network. Finally, we conducted a detailed comparative analysis by juxtaposing the performance metrics of the BP, C-WOA-BP, I-WOA-BP, and C-I-WOA-BP networks. The experimental results indicate that the C-I-WOA-BP model demonstrates faster convergence speed, superior global search capabilities, and enhanced local exploitation potential compared to the other models. Additionally, it provides a more stable and accurate reduction in temperature-induced errors in drilling pressure parameter measurements.

Due to the highly nonlinear, multi-stage, and strongly time-varying marine lysozyme fermentation process, it is difficult to assure the stability and prediction accuracy of the traditional single global soft sensor model on a global scale. This study innovatively proposed a soft sensor model based on an improved seagull optimization algorithm (ISOA) combined with Gaussian process regression (GPR) weighted ensemble learning. First, the sample data set is divided into multiple local sample subsets by the improved density peak clustering algorithm (ADPC). Second, the Gaussian process regression model is optimally altered with an improved seagull optimization algorithm for the purpose of establishing the corresponding sub-prediction model. Finally, the prediction model's fusion strategy is ultimately determined depending on the degree of connection between the test samples and a subset of local pieces. Simulation results show that the proposed soft sensor model, which searches GPR based on ISOA and combines various sub-models, can predict the key biochemical parameters of the marine lysozyme fermentation process better with less prediction error under the condition of fewer training data, and it can be expanded to the soft sensor models of general nonlinear systems, according to simulation results.

When using meta-heuristic optimization approaches for optimization, a large number of samples are required. In particular, when generating subgeneration, the utilization of existing samples is low and the number of individuals is high. Therefore, surrogate-based optimization has been developed, which greatly reduces the number of individuals in the subgeneration and the cost of optimization. In complex air supply scenarios, single-objective optimization results may not be comprehensive; therefore, this paper developed a double-objective air supply optimization method based on the Kriging surrogate model and Non-dominated Sorting Genetic Algorithms-II. And proposed the infill criteria based on clustering to advance the Pareto Frontier. The method was validated by an inverse prediction case, and in particular, the problems when based on 3D steady-state simulations were analyzed. The results showed that the method can quickly achieve an approximate prediction of the boundary conditions (when prediction were made based on experimental data, the number of simulations was 82 and the average error was 6.8%). Finally, the method was used to optimize the air supply parameters of a dual-aisle, single-row cabin. The Pareto set suggested that an airflow organization with dual circulation may be optimal.

The multiobjective optimization problem is a key research direction in the field of optimization. Based on the multivariant optimization algorithm (MOA), this paper puts forward a multiobjective multivariant optimization algorithm (MMOA). A good point set is adopted for population initialization and to ensure the homogeneity of the initial solution set and avoid prematurity; global atoms are acquired by non-dominated sorting and an external archiving strategy; a nonlinear search radius is designed to balance global and local searches and enhance the convergence precision of the algorithm. Levy Flight and Sine chaotic mapping are introduced to redesign the update formula for local atoms, increase the convergence rate of the algorithm, and boost the optimization efficiency. Comparative experiments are conducted between MMOA and NSGA-II, MOEA/D, NSWOA, MOGWO, NSMFO on multiobjective test functions and an engineering example. The simulation results show that MMOA has superior convergence and diversity to the other five algorithms.

The extensive utilization of rebar during the construction of the project generates immense rebar waste, leading to increased construction costs and significant greenhouse gas emissions. Various approaches have been explored focusing on the minimization of rebar-cutting waste, such as optimizing cutting patterns, lap splice position, and special-length rebar utilization. Nonetheless, reducing rebar usage by minimizing the number of splices remains uninvestigated. In response to these issues, a two-stage optimization algorithm was developed, prioritizing special-length rebar to achieve near-zero rebar-cutting waste of less than 1% and concurrently reduce rebar usage, thereby promoting sustainable construction practices. The two-stage algorithm presented in this study involves the optimization of the lap splice position for the continuous rebar with a reduction of splices number. Furthermore, it integrates a special-length minimization algorithm for the additional rebars. Applying the algorithm to beam structures in a small-sized factory building project led to a notable reduction of 29.624 tons of rebar, equivalent to 12.31% of the total purchased quantity. Greenhouse gas emissions were reduced by 102.68 tons, and associated costs decreased by USD 30,256. A rebar-cutting waste of 0.99% which is near zero was achieved. These findings highlight the significant potential of the proposed algorithm in reducing rebar waste and facilitating sustainable construction practices. In addition, the application of the proposed algorithm in reinforced concrete construction projects will amplify the associated advantages accordingly.

This paper considers the reasonability of using GSDMM as a method for clustering short texts - titles and abstracts of publications 2021-2023 of MDPI journals on sustainable energy topics. The paper proposes an approach to identifying relevant research topics based on the use of the Python script Yake!, the Krovetz streamer, the GSDMM algorithm, and short text annotations. It is emphasized that researchers prefer to rely on specific publications rather than keywords when searching for information on a topic of interest. The bibliometric records of sustainable energy publications from 2021 to 2023 in Sustainability (Energy Sustainability section — 1,926 search results) and Energies (Sustainable Energy section — 994 search results) were used as data for analysis. The GSDMM algorithm was used to cluster the texts, and Yake! to extract the keywords for the GSDMM algorithm's vocabulary. This article summarizes topics found in 9 clusters, including general sustainable energy issues, biomass recycling, region-specific issues, building energy use, economic growth and investment, numerical flow modeling, generation cost optimization, heat to energy conversion, weather-related risks, and false data attacks.

The integration of transportation systems with land use through the Transit-Oriented Development (TOD) model can effectively promote sustainable development in cities. By increasing the intensive use of land within the supply capacity of urban public transportation, this model can comprehensively improve the efficiency of urban transportation and land use, while also addressing problems such as traffic congestion and environmental pollution. To implement this model, a "Node-Place-Function" (NPF) framework is proposed based on the coordination degree between rail transit and land use in Qingdao. A comprehensive evaluation system is constructed to quantitatively assess the TOD level and comprehensive development level of land use around rail transit stations from three dimensions. By applying the NSGA-II genetic algorithm, a land use allocation optimization model is developed to maximize rail transit station accessibility, land economic benefits, and environmental comfort. The research results guide other cities in China to implement TOD in land use planning and promote coordinated development between urban rail transit and land use.

The paper portrays predictive models for dissolved oxygen (DO) levels in an urban lake using common water quality parameters like Temperature, pH, Conductivity and ORP at a time. Data were sampled using three real-time, industry-standard sensors, OPTOD, CTZN, and PHEHT, and then interpolated using the ArcGIS kriging technique. Correlation studies were analyzed through the ML algorithm, the correlation study signified a highly positive correlation between DO and other water parameters and the model was corroborated by R-score in order to create the linear regression model. In addition, an artificial neural network- a machine learning method using the Levenberg-Marquardt algorithm was developed to build a model to predict the do as well. Then, the performance of the models was validated and also the R² accuracy was checked of the predicted data against the actual data. Thus, the appropriateness of the ANN model for the forecasting of investigated attributes is indicated by the fact that the discrepancy between the forecasted and real ANN model is significantly lesser than that of the regression model. However, the model can be used to reveal DO data from unknown urban lake water.

The current work aims to develop an approximation of the slice of Minkowski sum of finite number of ellipsoids, sliced up by an arbitrarily oriented plane in Euclidean space $\mathbb{R}^3$ that, to the best of the author's knowledge, has not been addressed yet. This approximation of the actual slice is in a closed form of an explicit parametric equation in the case that the slice is not passing through those zones of the Minkowski surface with high curvatures, namely the "corners". At corners with high curvatures an alternative computational algorithm is introduced in which a family of ellipsoidal inner and outer bounds of the Minkowski's sum are used to construct a "narrow strip" for the actual slice of Minkowski sum. This strip can narrow persistently for a few more number of constructing bounds to precisely coincide on the actual slice of Minkowski sum. This algorithm is also applicable to the cases of slice of Minkowski sum of ellipsoids with high aspect ratio. In line with the main goal, some ellipsoidal inner and outer bounds of the Minkowski sum are reviewed, including the so called "Kurzhanski's" bounds. Also some ellipsoidal approximations are suggested for the Minkowski sum, which they can be used, as well as the inner and outer bounds, in calculation of the suggested parametric approximation of the slice of Minkowski sum.

Real-world optimization problems are often gov- erned by one or more constraints. Over the last few decades, extensive research has been performed in Constrained Opti- mization Problems (COPs) fueled by advances in computational power. In particular, Evolutionary Algorithms (EAs) are a preferred tool for practitioners for solving these COPs within practicable time limits. We propose a novel hybrid Evolutionary Algorithm based on the Differential Evolution algorithm and Adaptive Parameter Gaining Sharing Knowledge-based algo- rithm to solve global real-world constrained parameter space. The proposed CHAGSKODE algorithm leverages the power of multiple adaptation strategies concerning the control parameters, search mechanisms, as well as uses knowledge sharing between junior and senior phases. We test our method on the benchmark functions taken from the CEC2020 special session & competition on real-world constrained optimization. Experimental results indicate that CHAGSKODE is able to achieve state-of-the- art performance on real-world constrained global optimization when compared against other well-known real-world constrained optimizers.

In many Bayesian computations, first, we obtain the expression of the joint distribution of all the unknown variables given the observed data. In general, this expression is not separable in those variables. Thus, obtaining their marginals for each variable and computing the expectations are difficult and costly. This problem becomes even more difficult in high dimensional quandaries, which is an important issue in inverse problems. We may then try to propose a surrogate expression with which we can do approximate computations. Often a separable expression approximation can be useful enough. The Variational Bayesian Approximation (VBA) is a technique that approximates the joint distribution $p$ with an easier, for example separable, one $q$ by minimizing Kullback–Leibler Divergence $KL(q|p)$. When $q$ is separable in all the variables, the approximation is also called Mean Field Approximation (MFA) and so $q$ is the product of the approximated marginals. A first standard and general algorithm is alternate optimization of $KL(q|p)$ with respect to $q_i$. A second general approach is its optimization in the Riemannian manifold. However, in this paper, for practical reasons, we consider the case where $p$ is in the exponential family and so is $q$. For this case, $KL(q|p)$ becomes a function of the parameters $\thetab$ of the exponential family. Then, we can use any other optimization algorithm to obtain those parameters. In this paper, we compare three optimization algorithms: standard alternate optimization, a gradient-based algorithm and a natural gradient algorithm and study their relative performances on three examples.

Since the conventional split-merge algorithm is sensitive to the object scale variance and splitting starting point, a piecewise split-merge polygon approximation method is proposed to extract the object contour features. Specifically, the contour corner is used as the starting point for the contour piecewise approximation to reduce the sensitivity of the contour segment on the starting point; then, the split-merge algorithm is used to implement the polygon approximation for each contour segments. Both the distance ratio and the arc length ratio instead of the distance error are used as the iterative stop condition to improve the robustness to the object scale variance. Both the angle and length as two features describe the shape of the contour polygon, and affect each other along the contour order relationship. Since they have a strong coupling relationship. To improve the description correction of the contour, these two features are combined to construct a Coupled Hidden Markov Model to detect the object by calculating the probability of the contour feature. The proposed algorithm is validated on ETHZ Shape Classes and INRIA Horses standard datasets. Compared with other contour-based object detection algorithms, the proposed algorithm reduces the complexity of contour description, improves the robustness of contour features to scale variance, and has a higher object detection rate.

Due to production space and operating environment requirements, mine production equipment often breaks down, which seriously affects the mine’s production schedule. To ensure the smooth completion of the haulage operation plan under abnormal conditions, a model of the haulage equipment rescheduling plan based on the random simulation of equipment breakdowns is established in this paper. The model aims to accomplish both the maximum completion rate of the original mining plan and the minimum fluctuation of the ore grade during the rescheduling period. This model is optimized by improving the wolf colony algorithm and changing the location update formula of the individuals in the wolf colony. Then, the optimal model solution can be used to optimize the rescheduling of the haulage plan by considering equipment breakdowns. The application of the proposed method in an underground mine revealed that the completion rate of the mine’s daily mining plan reached 83.40% without increasing the number of the equipment, while and the ore quality was stable. Moreover, the improved optimization algorithm converged fast and was characterized by high robustness.

Advances in communication technologies have made the interaction of small devices, such as smartphones, wearables, and sensors, scattered on the Internet, bringing a whole new set of complex applications with ever greater task processing needs. These Internet of Things (IoT) devices run on batteries with strict energy restrictions. They tend to offload task processing to remote servers, usually to Cloud Computing (CC) in datacenters geographically located away from the IoT device. In such a context, this work proposes a dynamic cost model to minimize energy consumption and task processing time for IoT scenarios in Mobile Edge Computing environments. Our approach allows for a detailed cost model, with an algorithm called TEMS that considers energy, time consumed during processing, the cost of data transmission, and energy in idle devices. The task scheduling chooses among Cloud or Mobile Edge Computing (MEC) server or local IoT devices to better execution time with lower cost. The simulated environment evaluation saved up to 51.6% energy consumption and improved task completion time up to 86.6%.

Flood routing in flood forecasting issue, calculation the height of flood bands, determining the river boundaries, and estimation of protective facilities for flood –exposed building is applicable. In many cases, due to the lack of measuring stations, the status of the upstream flood generating hydrograph is not known. The purpose of this study is to present an integrated method comprising of an optimization model and a hydrodynamic numerical model for flood modeling to determine the upstream hydrograph using the provided hydrograph at the downstream measuring station of a river. The routing procedure consists of three steps: (1) generating a hypothetical upstream hydrograph using genetic algorithm method; (2) hydrodynamic modeling using a numerical simulation model for flood routing according to the hypothetical hydrograph which is generated in the first step; (3) compare the calculated and observed hydrograph in downstream by using a fitness function. This recommended procedure was named as Reverse Flood Routing Method (RFRM) and was then applied to Karun River, the largest river in Iran. Comparing the generated upstream hydrograph by the RFRM model with the corresponding measured hydrograph at Ahvaz hydrometric station, as an ungauged river location, shows the high accuracy of the recommended model in this study.

This article presents a quantitative assessment of pedagogical support aimed at improving collaborative education at a modern technical university. The article analyzes the structural composition of the universal communicative competence in a foreign language to identify the advantages of the proposed content detailization. An algorithm for constructing educational and speech actions of students with the use of collaborative digital technology, regarding the monitoring and control of tools, is developed and theoretically justified. Microsoft Teams is offered as a platform for implementing digital collaborative learning technology. The didactic possibilities and methodological functions of Microsoft Teams in foreign language teaching are revealed. The digital technology of the collaborative learning algorithm is relevant for building collaborative actions is relevant, since it contributes to the development of the ability to solve common professional tasks. The algorithm of the dialogic communication, including problem, contradiction, conflict, intellectual difficulty, having general professional context as a stimulus to enhance the interaction in pair work is proposed as pedagogical support. The analysis and quantitative assessment of students' oral responses showed that the dialogue in a foreign language, based on the algorithmic component, is more structured and stimulates students' communication on relevant professional-oriented topics.

Background: Administrative healthcare databases are widespread and are often standardized with regard to their content and data coding, thus they can be used also as data sources for surveillance and epidemiological research. Chronic dialysis requires patients to frequently access hospital and clinic services, causing a heavy burden to healthcare providers. This also means that these patients are routinely tracked on administrative databases, yet very few case definitions for their identification are currently available. The aim of this study was to develop two algorithms derived from administrative data for identifying incident chronic dialysis patients and test their validity compared to the reference standard of the regional dialysis registry. Methods: The algorithms are based on data retrieved from hospital discharge records (HDR) and ambulatory specialty visits (ASV) to identify incident chronic dialysis patients in an Italian region. Subjects are included if they have at least one event in the HDR or ASV databases based on the ICD9-CM dialysis-related diagnosis or procedure codes in the study period. Exclusion criteria comprise non-residents, prevalent cases, or patients undergoing temporary dialysis, and are evaluated only on ASV data by the first algorithm, on both ASV and HDR data by the second algorithm. We validated the algorithms against the Emilia-Romagna regional dialysis registry by searching for incident patients in 2014. Results: Algorithm 1 identified 680 patients and algorithm 2 identified 676 initiating dialysis in 2014, compared to 625 patients included in the regional dialysis registry. Sensitivity for the two algorithms was respectively 90.8% and 88.4%, positive predictive value 84.0% and 82.0%, and percentage agreement was 77.4% and 74.1%. Conclusions: These results suggest that administrative data have high sensitivity and positive predictive value for the identification of incident chronic dialysis patients. Algorithm 1, which showed the higher accuracy and has a simpler case definition, can be used in place of regional dialysis registries when they are not present or sufficiently developed in a region, or to improve the accuracy and timeliness of existing registries.

Owing to the time-varying characteristics and nonlinearities of industrial processes, control has higher difficulties and results in challenges for advanced technology. In this paper, a self-tuning controller that includes a nonlinear proportional-integral-derivative (NPID) control function as well as a self-tuning function is proposed for first-order plus time delay (FOPTD) process control. The NPID control function is implemented using the nonlinear PID controller whose optimum parameters are adapted by a neural network (NN). The self-tuning function is able to identify the process dynamics using a short period of process behavior and tune NPID parameters based on the identified parameters. The advantage of the proposed method is validated with a set of simulation works on three processes and the comparison results are presented.

The continuous development in the field of industrial automation and electric mobility has led to the need for more efficient electrical machines with high power density. The improvement of electrical machines slot filling factors is one of the measures to satisfy these requirements. In recent years, this topic has aroused greater interest in the industrial sector, since the evolution of the winding technological manufacturing processes allows an economically sustainable realization of ordered winding arrangements, rather than random ones. Moreover, the manufacture of electrical machines windings must be preceded by an accurate design phase in which it is possible to evaluate the maximum slot filling factor obtainable for a given wire shape and for its dimensions. For this purpose, this paper presents an algorithmic approach for the evaluation of maximum slot filling factors in electrical machines under ideal geometric premise. In particular, this algorithm has a greater degree of flexibility with respect to the algorithm approaches found in the literature, since the study has been extended to round, rectangular and hexagonal wire sections. Furthermore, the slot filling factor calculation was carried out both for standard and non-standard slots. The algorithmic approach proposed can be considered as an additional useful tool for the fast design of electrical machine windings.

Recently natural gas (NG) global market attracted much attention in case it is cleaner than oil, and simultaneously in most regions is cheaper than renewable energy sources. However, price fluctuations, environmental concerns, technological development, emerging unconventional resources, energy security challenges, and shipment are some of the forces that made the NG market more dynamic and complex. From a policy-making perspective, it is vital to uncover demand-side future trends. This paper proposed an intelligent forecasting model to forecast NG global demand, however investigating a multi-dimensional purified input vector. The model starts with a data mining (DM) step to purify input features, identify the best time lags, and to pre-process selected input vector. Then a hybrid artificial neural network (ANN) which equipped with genetic optimizer is applied to set up ANN’s characteristics. Among 13 available input features, six features (e.g. Alternative and Nuclear Energy, CO2 Emissions, GDP per Capita, Urban Population, Natural Gas Production, Oil Consumption) selected as the most critical feature via the DM step. Then, the hybrid prediction model is designed to extrapolate the consumption of future trends. The proposed model overcomes competitive models refer to different error based evaluation statistics. Besides, as the model proposed the best input feature set, results compared to the model which used the raw input set, with no DM purification process.

The underground complicated testing environment and the fan operation instability cause large random errors and outliers of the wind speed signals. The outliers and large random errors result in distortion of mine wind speed monitoring, which possesses safety hazards in mine ventilation system. Application of Kalman filter in velocity monitoring can improve the accuracy of velocity measurement and eliminate the outliers. Adaptive Kalman Filter was built by automatically adjusting process noise covariance and measurement noise covariance depending on the differences between measured and expected speed signals. We analyzed the fluctuation of airflow flow using data of wind speed flow and distribution characteristics of the tunnel obtained by the Laser Doppler Velocimetry system (LDV) studies. A state-space model was built based on the tunnel airflow fluctuations and wind speed signal distribution. The adaptive Kalman Filter was calculated according to the actual measurement data and the Expectation Maximization (EM) algorithm. The adaptive Kalman filter was used to shield fluid pulsation while preserving system-induced fluctuations. Using the Kalman filter to treat offline wind speed signal acquired by LDV, the reliability of Kalman filter wind speed state model and the characteristics of adaptive Kalman Filter were investigated. Results showed that the adaptive Kalman filter effectively eliminated the outliers and reduced the root-mean-squares error (RMSE), and the adaptive Kalman filter had better performance than the traditional Kalman filter in eliminating outliers and reducing RMSE. Field experiments in online wind speed monitoring were conducted using the optimized adaptive Kalman Filter. Results showed that adaptive Kalman filter treatment could monitor the wind speed with smaller RMSE compared with LVD monitor. The study data demonstrated that the adaptive Kalman filter is reliable and suitable for online signal processing of mine wind speed monitor.

Automatic methods for constructing navigation routes do not fully meet all requirements. The aim of this study was to modify the methodology for generating indoor navigation models based on the Medial Axis Transformation (MAT) algorithm. The simplified method for generating corridor axes relies on the Node-Relation Structure (NRS) methodology. The axis of the modeled structure (corridor) is determined based the points of the middle lines intersecting the structure (polygon). The proposed solution involves a modified approach to the segmentation of corridor space. Traditional approaches rely on algorithms to construct Triangulated Irregular Networks (TINs) by Delaunay triangulation or algorithms for generating Thiessen polygons known as Voronoi diagrams (VDs). In this study, both algorithms were used in the segmentation process. The edges of TINs intersect structures. Selected midpoints on TIN edges, which are located in the central part of the structure, are used to generate VDs. Polygon VDs segment corridor structures. The identifiers or structure nodes are the midpoints on TIN edges rather than the calculated centroids. The generated routes are not zigzag lines, and they approximate natural paths. The main advantage of the proposed solution is its simplicity which can be attributed to the use of standard tools for processing spatial data in a geographic information system.

Multi-threshold image segmentation is a relevant research field in further higher-level image preprocessing and computer vision. This paper adopts the Bayesian Forecasting Evolutionary Algorithm (BFEA) for natural scenery image segmentation using multilevel thresholding. An update method for the prediction vector is designed for image segmentation. The design idea of the BFEA algorithm for multilevel thresholding is based on the basic principle of Evolutionary Computation, the probability distribution of promising solutions, and the Bayesian theorem. BFEA could effectively solve the curse of dimensionality. Extensive experiments have demonstrated that the proposed algorithm dominated the state-of-the-art population-based thresholding method in term of the quality of image, function fitness value, optimal threshold value, SSIM value, PSNR value, computation time, dimensionality issue and convergence rate. The proposed method is very effective for color image segmentation.

This study is based on the BP neural network regression model optimised by genetic algorithm and dedicated to predicting the amount of car purchase, this study is important for all parties in the automotive industry. By plotting the violins of six indicators, including gender, age, annual salary, credit card debt, net worth, and car purchase amount, we found that, except for gender, the other data showed a trend of dense in the middle gradually decreasing to the upper and lower sides, with an overall normal distribution. The correlation analysis shows that the amount of car purchase has a high positive correlation with age (0.63), followed by annual income (0.62), the correlation between net worth and the amount of car purchase is 0.49, while the correlation between credit card debt and the amount of car purchase is low (0.03). In the experimental part, we analyse the predicted-actual values of the training and test sets in comparison and find that the model predicted values are very close to the actual values. The RMSE of the training set is 11.559 and the RMSE of the test set is 11.4835, which is not much different from each other, indicating that the model has good generalisation ability. In addition, the R2 of both the training and test sets is 1, indicating that the model fits well. The MAE of the training set is 8.2512 and the MAE of the test set is 9.578; the MBE of the training set is -4.3035 and the MBE of the test set is -2.4547.These metrics indicate that the model performs well in predicting the amount of car purchase. In conclusion, this study provides an effective and reliable method to predict the amount of car purchase, creating a useful bridge between car manufacturers, dealers and consumers.

Without an established energy management plan, human lifestyle improvement is incomprehensible. Adequate energy assets are the key to human lifestyle development, however, energy assets are restricted and exorbitant too. In this paper, an energy control system for a green environment called PMC (Power Management and Control) is proposed. The system is based on hybrid energy optimization, energy prediction, and multi-preprocessing. The blend of GA (Genetic Algorithm) and PSO (Particle Swarm Optimization) is utilized to make a fusion methodology to improve occupant comfort index (OCI) and decrease energy utilization. The main theme of the proposed PMC technique is to improve OCI and decrease energy utilization. The proposed framework gives better OCI when compared with its counterpart Ant Bee Colony along with Knowledge Base framework (ABCKB), GA-based prediction framework (GAP), Hybrid Prediction with Single Optimization framework (SOHP), and PSO-based power consumption framework. Compared with the existing AEO framework, the proposed PMC methodology gives practically the same OCI, but consumes less energy. The proposed PMC methodology additionally accomplished the most extreme OCI (i-e 1) when compared with the existing model FA-GA (i-e 0.98). The proposed PMC model consumed less energy as compared to existing models ABCKB, GAP, PSO and AEO. The proposed model consumed more energy than SOHP but provided better OCI. The comparative outcomes show the viability of the proposed PMC framework in lessening energy utilization and improving the OCI. Unlike other existing mythologies except for the AEO framework, the proposed PMC technique is additionally confirmed through a simulated climate by controlling indoor climate using actuators, like Fan, light, AC and boiler.

Cloud data centers play a vital role in modern computing infrastructure, offering scalable resources for diverse applications. However, managing costs and resources efficiently in these centers has become a crucial concern due to the exponential growth of cloud computing. User applications exhibit complex behavior, leading to fluctuations in system performance and increased power usage. To tackle these obstacles, we propose the consolidation of virtual machines (VMs) to optimize resource utilization and reduce operational costs. This paper introduces a novel algorithm, leveraging the Modified Artificial Feeding Birds Algorithm (ModAFBA), to manage cost optimally in cloud data centers by reducing power usage while meeting service level agreements (SLAs). The ModAFBA algorithm, inspired by bird foraging behavior, dynamically adjusts solutions based on environmental changes. Comprehensive experimental evaluation demonstrates the superiority of the proposed algorithm in terms of power usage, migration count, and SLA compliance. Through this research, we aim to advance cost management and resource optimization in cloud data centers, providing a valuable tool for cloud service providers to enhance infrastructure efficiency and achieve cost savings.

In the last decades we have experienced great social, cultural, and educational changes, spending more time performing tasks in near vision and less hours in outdoor activities, having more overexposure to digital screens, especially the youngest and increasingly from younger ages. It is common to see cases when performing tasks in near vision the posture or position of the head is not adequate, especially the youngest, being essential to have a correct posture of the head to avoid visual, muscular, or articular problems. We present a procedure to try to control the correct position of the head in real time when performing close-up activities. The aim is to detect the inclination of the head and to know if a bad position is adopted due to a visual problem or simply to inadequate visio-postural habits, warning us of the postural anomaly to correct it.

Wireless Sensor networks (WSNs) are gaining more and more research interest due to their ability to monitor large areas more or less independent. However, their reliability is an important issue, since their system reliability is influenced from a hardware, a data and an energetic point of view due to different factors like loading conditions, signal attenuation and battery lifetime. Regarding these issues, the positions of sensor nodes have to be chosen correctly to maximize the system reliability, which has to be considered during the development of new products equipped with WSNs. In this paper, an approach to estimate a WSNs system reliability during the development phase based on the analysis of the measurements on the example of strain measurements in finite elements (FE) models is presented. For that, the part under consideration is divided into regions with similar strains by the use of a Region Growing Algorithm (RGA). Afterwards, the WSN’s configuration is analyzed regarding its reliability in accordance to the data paths and measurement redundancy due to the sensor positions in the found measuring regions. This methodology is tested on an exemplary WSN configuration at an aircraft wing box under bending load and was found to work very well regarding the estimation of the hardware perspective on the system reliability. Therefore, the methodology and the developed algorithm show potentials for optimizations in sensor node positions for better reliability results.

The state-of-the-art smart city has been calling for an economic but efficient energy management over large-scale network, especially for the electric power system. It is a critical issue to monitor, analyze and control electric loads of all users in system. In this paper, we employ the popular computer vision techniques of AI to design a non-intrusive load monitoring method for smart electric energy management. First of all, we utilize both signal transforms (including wavelet transform and discrete Fourier transform) and Gramian Angular Field (GAF) methods to map one-dimensional current signals onto two-dimensional color feature images. Second, we propose to recognize all electric loads from color feature images using a deep neural network with multi-scale feature extraction and attention mechanism. Third, we design our method as a cloud-based, non-intrusive monitoring of all users, thereby saving energy cost during electric power system control. Experimental results on both public and our private datasets have demonstrated our method achieves superior performances than its peers, and thus supports efficient energy management over large-scale Internet of Things.

Traditional path planning algorithms have drawbacks in unmanned vehicle path planning, such as low efficiency, unsuitability for dynamic environments, and high computational complexity. To address these issues, this paper proposes a dynamic path planning method for unmanned vehicles that combines the A* algorithm with an improved Dynamic Window Approach (DWA). Firstly, a collision risk function is incorporated into the DWA algorithm to evaluate scores based on the braking distance corresponding to the current vehicle speed and the distance to obstacles, determining whether timely braking or obstacle avoidance is feasible. The earlier the braking or obstacle avoidance, the higher the score, thereby enhancing the evaluation algorithm of the DWA. Secondly, the key points extracted by the A* algorithm are used as temporary target points for the DWA algorithm, reducing the eight search directions to five. Finally, the key points of the A* algorithm’s path are set as the temporary end points for the DWA algorithm, integrating the two algorithms to plan a smoother curved path that can avoid unknown and dynamic obstacles. Simulation data demonstrates that compared to traditional artificial potential field methods, RRT, and Dijkstra’s algorithm, the new fusion algorithm reduces time by 11.71 seconds, a decrease of 6.9%, and shortens path length by 3.093 meters, a reduction of 4.16%, while increasing average linear velocity by 2.9%. The proposed algorithm ensures smoother paths while also making paths more rational and efficient

Efficient fixed crane position analysis is critical in precast buildings construction to maximize lifting efficiency for precast elements. The primary objective is to minimize the travel distances of fixed cranes, thereby enhancing operational efficiency and cost control. This involves strategically reducing the distances between the transport truck parking, where elements are stored, the fixed crane, and the construction installation point. Despite its significance, existing studies often overlook the dynamic movement efficiency of transport trucks, particularly when dealing with multiple transport trucks and various models of fixed cranes, rendering the opti-mization of this scenario a challenging NP-hard problem susceptible to combinatorial explosion. This study presents a novel mathematical model leveraging the Genetic Algorithm (GA). The model aims to solve optimal model and position of fixed cranes, along with identifying ideal positions for transport truck parking. The study's methodology is validated and demonstrated through a project case study. Comparative analyses between the proposed model and the original planning underscore a noteworthy 6% reduction in both duration and costs when lifting elements directly from transport trucks, as opposed to establishing an on-site stock yard. Furthermore, the developed GA exhibits a substantial improvement in final solutions, achieving a remarkable 30% reduction in both operational duration and costs. This research contributes valuable insights into fixed crane position analysis of precast building construction, providing foundation for enhanced operational efficiency and cost-effectiveness in the industry.

(1) Background: Hepatitis C virus (HCV) screening mostly uses a one-assay anti-HCV testing approach, which has a higher probability of false-positive results in populations with low HCV prevalence. (2) Methods: In this investigation, 17,926 participants, were screened for HCV, and the reactives were tested using a two-assay anti-HCV approach: Elecsys ElectroChemiLuminescence (ECL) and a ChemiLuminescence ImmunoAssay (CLIA), respectively. A recombinant immunoblot assay (RIBA) was performed to confirm anti-HCV positivity. Statistical analysis was performed. (3) Results: A total of 350 specimens resulted reactive in the ECL screening, of which CLIA retesting showed that 292 (83.4%) were anti-HCV reactive (283 positive, 9 indeterminate, none negative by RIBA), but 58 (16.6%) were not anti-HCV reactive (15 positive, 12 indeterminate, 31 negative by RIBA). The two-assay strategy significantly improved the positive predictive value (PPV: 95.00%) with χ2: 7.59(p<0.01) then the PPV assessed by one assay (PPV: 90.6%) with χ2: 34.51 (p< 0.001). The ROC curve defined a sensibility and specificity for the dual approach of: 99.66% and 100.00%. (4) Conclusions: Compared with a one-assay testing strategy, the two-assay testing strategy may significantly reduce false positives in anti-HCV testing and identify inactive HCV infection in low seroprevalence populations.

This study addressed the need for efficient data collection in micro-mobility using low-end hardware, focusing on developing a system capable of handling large real-time data streams. We proposed a novel data collection system that leverages incremental learning techniques, enabling AI-based services for micro-mobility passengers through smartphones. Our approach utilizes 3-axis acceleration sensors integrated into micro-mobility devices, collecting motion data in real-time. This data is processed through an incremental learning pre-processing server, employing the Broad Learning System algorithm, to ensure robust performance in noisy, real-world environments. The use of incremental learning is pivotal, allowing our system to adapt continuously to new data, enhancing the accuracy and relevance of the AI services provided to passengers. This research not only advances the technical capabilities in micro-mobility data handling but also has the potential to enhance the overall passenger experience through improved AI-based services.

Fabry-Pérto (FP) cavity is the essential component of ultra-stable laser (USL) for gravitational wave detection, which couples multi-physic (Optical/Thermal/Mechanics) fields and requires ultra-high precision. To satisfy the requirements of precise and efficient design, a multi-physic coupling optimization method for fixing cubic FP cavity based on data learning is proposed. A multi-physic model for the cubic FP cavity is established and the performance is obtained by finite element analysis. The key performance indices (V, wF, wF) and key design variables (d, l, F) are determined considering the features of the FP cavity. The 49 sets of data by orthogonal experiment are acquired for the establishment and comparison of different data learning models (NN, RSF, KRG). The result turns out that the neural network has the best performance. Based on NSGA-II, the Pareto optimal front is obtained and the optimal combination of design variables is finally determined as {5,32,250}. The performance after optimization has proven to be a great improvement, of which the displacement under the fixing force and vibration test are decreased by more than 60%. The optimization strategy can not only help the design of the FP cavity but also enlighten other optimization fields.

Peanuts, owing to their composition of complex carbohydrates, plant protein, unsaturated fatty acids, and essential minerals (magnesium, iron, zinc, and potassium), hold significant potential as a vital component of the human diet. Additionally, their low water requirements and nitrogen fixation capacity make them an appropriate choice for cultivation in adverse environmental conditions. The germination ability of seeds profoundly impacts the final yield of the crop, assessing seed viability of extreme importance. Conventional methods for assessing seed viability and germination are both time-consuming and costly. To address these challenges, this study investigated Visible-Near Infrared Spectroscopy (Vis/NIR) in the wavelength range of 500-1030 nm as a non-destructive and rapid method to determine the viability of two varieties of peanut seeds: North Carolina-2 (NC-2) and Spanish flower (Florispan). The study subjected the seeds to three levels of artificial aging through heat treatment, involving incubation in a controlled environment at a relative humidity of 85% and a temperature of 50°C over 24-hour intervals. The absorbance spectra noise was significantly mitigated and corrected to a large extent by combining the Savitzky-Golay (SG) and Multiplicative Scatter Correction (MSC) methods. To identify the optimal wavelengths for seed viability assessment, a range of meta-heuristic algorithms were employed, including world competitive contest (WCC), league championship algorithm (LCA), Genetics (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), imperialist competitive algorithm (ICA), learning automata (LA), heat transfer optimization (HTS), forest optimization (FOA), discrete symbiotic organisms search (DSOS), and cuckoo optimization (CUK). These algorithms offer powerful optimization capabilities for effectively extracting relevant wavelength information from spectral data. Results revealed that all the algorithms demonstrated remarkable accuracy in predicting the allometric coefficient of seeds, achieving correlation coefficients exceeding 0.985 and errors below 0.0036, respectively. In terms of execution time, the ICA (2.3635 seconds) and LCA (44.9389 seconds) algorithms exhibited the most and least efficient performance, respectively. Conversely, the FOA and the LCA algorithms excelled in identifying the least number of optimal wavelengths (10 wavelengths). Subsequently, the seeds were classified based on the wavelengths selected by the FOA (10 wavelengths) and (DSOS (16 wavelengths) methods, in conjunction with logistic regression (LR), decision tree (DT), Multilayer Perceptron (MP), support vector machine (SVM), k-nearest neighbor (K-NN), and NaiveBayes (NB) classifiers. The DSOS-DT and FOA-MP methods demonstrated the highest accuracy, yielding values of 0.993 and 0.983, respectively. Conversely, the DSOS-LR and DSOS-KNN methods obtained the lowest accuracy, with values of 0.958 and 0.961, respectively. Overall, our findings demonstrated that Vis/NIR spectroscopy, coupled with variable selection algorithms and learning methods, presents a suitable and non-destructive approach for detecting seed viability.

The issue of equipment layout in multi-floor satellites consists of two primary parts: allocating the equipment to the satellite's layers and placing the equipment in each layer individually. In reviewing the past literature in this field, firstly, the issue of assigning equipment to layers is observed in a few articles and next in the layout part, the non-overlapping constraint has always been a challenge, particularly for components that do not have a circular cross-section. In addition to presenting a heuristic method for allocating equipment to different layers of the satellite, this article presents a robust flexible programming model (RFPM) for the placement of equipment at different layers, taking into account the inherent flexibility of the equipment in placement and the subject of uncertainty. This model is based on the existing uncertainty between the distances of cuboid equipment which has not been addressed in any of the previous research, and by comparing its outputs with cases from past studies, it demonstrates a significantly higher efficiency in placing the equipment and meeting the limit of non-overlapping constraints between the equipment. Finally, it would be possible to reduce the design time in the conceptual and preparatory stages, as well as the satellite's overall size, while still satisfying other constraints like stability and thermal limitations, moments of inertia and centre of gravity.

Efficient train driving plays a vital role in reducing the overall energy consumption in the railway sector. An energy minimising control strategy can be computed using the framework given by optimal control theory, in particular the Pontryagin maximum principle. Our optimisation approach is based on an algorithm presented by Khmelnitsky that considers electric trains equipped with regenerative braking. A derivation of Khmelnitsky’s theory from a more general formulation of the maximum principle is given in this article, and a complete list of switching cases between different driving regimes has been included that is essential for practical application. A number of numerical examples are added to visualise the various switching cases. Energy consumption data from real-life operation of passenger trains are compared to the calculated energy minimum. In the presented study, the optimised strategy was able to save 37 percent of the average energy demand of the train in operation.

In this paper, chaos sequence is used to replace the traditional Spread Spectrum sequence. From the perspective of the communication partner, a new method of generating the initial value of chaotic sequence is proposed, which is more suitable for the multi-base Spread Spectrum System and easy to extract. In order to further improve the error performance of the system and ensure the integrity of the system, an improved suboptimal soft information extraction method based on log-likelihood ratio (LLR) is proposed in the channel coding module, which can further improve the error performance of the system. On this basis, we choose the synchronization mode of multiple transmission of one reference signal to solve the problem that chaotic sequence is difficult to obtain synchronization because of its aperiodic characteristics. Finally, the system is simulated in the channel with low SNR. The simulation results show that chaotic sequence as Spread Spectrum code can make the signal transmit accurately in the worse channel environment. The performance gain of applying soft information decoding decision in the M-ary Spread Spectrum System with chaotic sequence as Spread Spectrum code can reach 5.2dB compared with the traditional Direct Spread Spectrum System.

The use of smart grids has enabled a number of planning methods to be developed to optimize energy costs, Peak to Average Ratios (PARs), and consumer satisfaction for load management in industrial, commercial, and domestic sectors. From a technical point of view, achieving optimal outcomes requires Demand Side Management (DSM). In smart grids, utility companies and electric users communicate two-way using digital technology to make a sustainable and economic system. This paper proposes a novel framework within which an Energy Management Controller (EMC) keeps track of each appliance, its operational time, and the costs associated with them. Customers of smart grids are motivated to shift their Off-Peak Hours (OPH) from Peak Hours by presenting incentives in OPH. The metering devices would also save customers costs by preventing load shifting between high- and low-cost periods. In addition, the study proposes the bacterial foraging algorithm and grasshopper optimization algorithm for lessening power price and PAR without compromising user comfort (UC) through appliance planning. The simulation results on a practical test system advocate the high effectiveness and reliable performance of the proposed model.

Because of the rapid advancement in the use of photovoltaic (PV) energy systems, it has become critical to look for ways to improve the energy generated by them. The extracted power from the PV modules is proportional to the output voltage. The relationship between output power and array voltage has only one peak under uniform irradiance, whereas it has multiple peaks under partial shade circumstances (PSC). There is only one global peak (GP) and many local peaks (LPs), where the typical maximum power point trackers (MPPT) may become locked in one of the LPs, significantly reducing the PV system's generated power and efficiency. The metaheuristic optimization algorithms (MOAs) solved this problem, albeit at the expense of the convergence time, which is one of these algorithms' key shortcomings. Most MOAs attempt to lower the convergence time at the cost of the failure rate and the accuracy of the findings because these two factors are interdependent. To address these issues, this work introduces the dandelion optimization algorithm (DOA), a novel optimization algorithm. The DOA's convergence time and failure rate are compared to other modern MOAs in critical scenarios of partial shade PV systems to demonstrate the DOA's superiority. The results obtained from this study showed substantial performance improvement compared to other MOAs, where the convergence time is reduced to 0.4 s with zero failure rate compared to 0.9 s, 1.25 s, and 0.43 s for other MOAs under study. The optimal number of search agents in the swarm, optimal initialization of search agents, and optimal design of the dc-dc converter is introduced for optimal MPPT performance.

To address the problem that it is easy to form coverage blind areas when wireless sensor networks are randomly deployed, an improved coverage optimization algorithm based on improved Salpa swarm Intelligent algorithm (ATSSA) is proposed for wireless sensor networks. Firstly, the pop-ulation is initialized using tent chaotic sequence to enhance the optimization ability of the algo-rithm. Secondly, the T-distribution mutation is added to the update formula of the leaders for improving the ability to jump out of the local optimal value. Finally, an adaptive formula for updating the position of the follower is proposed, which not only guarantees the local searching ability of the algorithm in the late iteration period, but also improves the global searching ability of the algorithm in the early iteration period. The experimental results show that ATSSA algorithm can improve the coverage of the wireless sensor networks and reduce deployment costs com-pared with other algorithms, when it is used in the wireless sensor networks.

Lithium batteries are widely used due to their advantages such as high energy density, stable performance, low pollution, and long recyclable life. Accurate SOC estimation is important for the use of lithium batteries. To address the problem of low accuracy of SOC estimation by traditional methods, this paper proposes a joint method of fractional order robust unscented Kalman filter (FORUKF) and robust unscented Kalman filter (RUKF) to estimate SOC. The method is based on a fractional order model (FOM) that combines the unscented transformation (UT) technique, the H∞ observer and the joint estimator. Specifically, an adaptive genetic algorithm (AGA) was first used to identify the parameters of the FOM for lithium batteries and to verify the accuracy of the model. Estimation and updating of the ohmic resistance R0 and the capacity QN in the model in real-time by RUKF and then estimation of the SOC by FORUKF. Finally, the accuracy of FORUKF-RUKF was verified under the Federal Urban Driving Schedule (FUDS), US06 Highway Driving Schedule and Beijing Dynamic Stress Test (BJDST). According to the results, the FORUKF-RUKF estimated SOC was found to have better accuracy and robustness than the RUKF, FOUKF and EKF.

To address the problems of poor recognition, low detection accuracy, a large number of model parameters and computation, complex network structure, and unfavorable portability to embedded devices in traditional tennis ball detection algorithms, this study proposes a lightweight tennis ball detection algorithm YOLOv5s-Z based on Robomater EP. The main work is as follows: Firstly, constructing lightweight G-Backbone and G-Neck network layers to reduce the number of parameters and computation of the network structure. Secondly, the convolutional coordinate attention is incorporated in G-Backbnone to embed the location information into the channel attention, which makes the network obtain the location information in a larger area through multiple convolutions and enhances the expression ability of the mobile network learning features. In addition, the Concat module in the original feature fusion is modified into a weighted bi-directional feature pyramid W-BiFPN with settable learning weights to improve the feature fusion capability and achieve efficient weighted feature fusion and bi-directional cross-scale connectivity. The EIOU loss is introduced to split the influence factor of aspect ratio and calculate the length and width of the target frame and anchor frame respectively, combined with Focal-EIOU Loss to solve the problem of imbalance between difficult and easy samples. The activation function Meta-ACON is introduced to achieve an adaptive selection of whether to activate the neurons and improve the detection accuracy. Finally, the experimental results show that compared with the original algorithm, the YOLOv5s-Z algorithm reduces the number of parameters and computation by 42$\%$ and 44$\%$, the model size by 39$\%$, and 2$\%$ improvement in average accuracy mean value, which verifies the effectiveness of the improved algorithm and the light weight of the model to meet the deployment requirements of embedded devices, and adapts Robomaster EP for accurate detection and real-time recognition of tennis balls.

Direct imaging systems that create an image of an object directly on the sensor in a single step are prone to many constraints as a perfect image is required to be recorded within this step. In designing high resolution direct imaging systems with a diffractive lens, the outermost zone width either reaches the lithography limit or the diffraction limit itself imposing challenges in fabrication. However, if the imaging mode is switched to an indirect one consisting of multiple steps to complete imaging, then different possibilities open up. One such methods is the widely used indirect imaging method with Golay configuration telescopes. In this study, a Golay-like configuration has been adapted to realize a large area diffractive lens with three sub-aperture diffractive lenses. The sub-aperture diffractive lenses are not required to collect light and focus them to a single point as in a direct imaging system but to focus independently on different points within the sensor area. This approach of Large Area Diffractive lens with Integrated Sub-Apertures (LADISA) relaxes the fabrication constraints and allows the sub-aperture diffractive elements to have a larger outermost zone width and smaller area. The diffractive sub-apertures were manufactured using photolithography. The fabricated diffractive element has been implemented in indirect imaging mode using non-linear reconstruction and Lucy-Richardson-Rosen algorithm with synthesized point spread functions. The computational optical experiments revealed an improved optical and computational imaging resolutions compared to previous studies.

Large quantities of real-time particle data are becoming available from low-cost particle monitors. However, it is crucial to determine the quality of these measurements. The largest network of monitors in the United States is maintained by the PurpleAir company, which offers two monitors: PA-I and PA-II. PA-I monitors have a single sensor (PMS1003) and PA-II monitors employ two independent PMS5003 sensors. We determine a new calibration factor for the PA-I monitor and revise a previously published calibration algorithm for PA-II monitors (ALT-CF3). From the PurpleAir API site, we downloaded 83 million hourly average PM2.5 values in the PurpleAir database from Washington, Oregon, and California between January 1, 2017 and September 8, 2021. Daily outdoor PM2.5 means from 194 PA-II monitors were compared to daily means from 47 nearby Federal regulatory sites using gravimetric Federal Reference Methods (FRM). We find a revised calibration factor of 3.4 for the PA-II monitors. For the PA-I monitors, we determined a new calibration factor (also 3.4) by comparing 26 outdoor PA-I sites to 117 nearby outdoor PA-II sites. These results show that PurpleAir PM2.5 measurements can agree well with regulatory monitors when an optimum calibration factor is found.

Maize (Zea mays subsp. mays) is the staple food crop in the world. In this study, multi-layer perceptron (MLP), support vector machine (SVM), genetic algorithm-based multi-layer perceptron (MLP-GA), and genetic algorithm-based support vector machine (SVM-GA) hybrid artificial intelligence algorithms were used for the prediction of drought tolerance and stress tolerance indices in teosinte maize lines. Correspondingly, the gamma test technique was applied to determine efficient input and output vectors. The potential of developed models was evaluated based on statistical indices and graphical representation. Results of gamma test based on the least value of gamma and standard error indices show that day of anthesis (DOA), day of silking (DOS), yield index (YI), and gross yield per plant (GYP) information vector arrangements were determined as efficient information vector combination for drought-tolerant index (DTI) as well as the stress-tolerant index (STI). The results of MLP, SVM, MLP-GA, and SVM-GA algorithms were compared based on statistical indices and visual interpretation that have satisfactory for prediction of the drought-tolerant index and stress-tolerant index in maize crop. It has also seemed that genetic algorithm-based hybrid models (MLP-GA and SVM-GA) were found a better prediction of the drought-tolerant index and stress-tolerant index in maize crop. Similarly, the SVM-GA model has the highest potential to forecast the DTI and STI in maize crops as compared to MLP, SVM, MLP-GA models.

The global climate change mitigation efforts have increased the efforts of national government to incentivize local households in adopting individual renewable energy as a mean to help reduce the usage of electricity generated using fossil fuels and to gain independence from the grid. Since the majority of residential generation is made by PV panels that generate electricity at off-peak hours, the optimal management of such installations often considers local storage that can defer the use of locally generated electricity at later times. On the other hand, the presence of distributed generation can affect negatively the operating conditions of low-voltage distribution networks. The energy stored in batteries located in optimal places in the network can be used by the utility to improve the operation of the network. This paper proposes a metaheuristic approach based on a Genetic Algorithm that considers three different scenarios of using energy storage for reducing the losses in the network. Prosumer and network operator priorities can be considered in different scenarios inside the same algorithm, to provide a comparative study of different priorities in storage placement. A case study performed on a real distribution network provides insightful results.

Enhancing the effectiveness of search and rescue operation at sea is always a duty of utmost importance of the coastal states. The search area for distressed objects can be determined by using Monte Carlo simulation, combined with the Median-Filter. Once the search area has been identified, the success of search and rescue operations depends on the sweeping ability of search and rescue vessel at the probability area of the distress object with the minimum time. This is the important element to the success of the search and rescue operation as it minimizes the risk and cost for Search and rescue team. In this article, the authors study and propose the use of Bacterial Foraging Optimization Algorithm (BFOA) to calculate the optimal search and co-ordination route for many search and rescue vessels in Vietnam sea. The simulation results show that it is quite consistent with reality and BFOA can be effectively applied to determine a quick search.

Prediction of crop yield is essential for food security policymaking, planning, and trade. The objective of the current study is to propose novel crop yield prediction models based on hybrid machine learning methods. In this study, the performance of artificial neural networks-imperialist competitive algorithm (ANN-ICA) and artificial neural networks-gray wolf optimizer (ANN-GWO) models for the crop yield prediction is evaluated. According to the results, ANNGWO, with R of 0.48, RMSE of 3.19, and MEA of 26.65, proved a better performance in the crop yield prediction compared to the ANN-ICA model. The results can be used by either practitioners, researchers or policymakers for food security.

In the paper, an improved smart meter data-based three-stage algorithm to calculate the power/energy losses in the three-phase networks with the voltage level below 0.4 kV (low voltage - LV) is presented. In the first stage, a loading function of input data was built having as main feature the working at the same time with files from the database of smart metering system (SMS) containing the hourly electricity records, and files including the characteristic load profiles established by the Distribution Network Operator (DNO) for the consumers with standard energy meters depending the following factors: consumption class, day and season. In the second stage, a function which is based on the work with the structure vectors was implemented to identify easy the configuration of analysed networks. In the third stage, an improved version of forward/backward sweep-based algorithm was proposed to calculate fast the power/energy losses to three-phase LV distribution networks in balanced and unbalanced regime. A real LV rural distribution network from a pilot zone belonging to a Distribution Network Operator (DNO) from Romania was used to confirm the accuracy of the proposed approach. The comparison with the results obtained using the DigSilent PowerFactory Simulation Package certified the performance of the algorithm, the mean absolute percentage error (MAPE) being 0.94%.

Robotic path planning is a field of research which is gaining traction given the broad domains of interest to which path planning is an important systemic requirement; the aim being to optimise the efficacy of robotic movements in a defined operational environment. For example, robots have been employed in many domains including: cleaning robots (such as vacuum cleaners), automated paint spraying robots, window cleaning robots, forest monitoring robots, agricultural robots (often driven using satellite and geostationary positional satellite data). Additionally, mobile robotic systems have been utilised in disaster areas and locations hazardous to humans (such as war zones in mine clearance). The coverage path planning problem describes an approach which is designed to determine the path that traverses all points in a defined operational environment while avoiding static and dynamic (moving) obstacles. In this paper we present our proposed Smooth-STC model, the aim of the model being to identify an optimal path, avoid all obstacles, prevent (or at least minimise) backtracking, and maximise the coverage in any defined operational environment. The experimental results in a simulation show that, in uncertain environments, our proposed smooth STC method achieves an almost absolute coverage rate and demonstrates improvement when measured against alternative conventional algorithms.

Freeway travelling time is affected by many factors including traffic volume, adverse weather, accident, traffic control and so on. We employ the multiple source data-mining method to analyze freeway travelling time. We collected toll data, weather data, traffic accident disposal logs and other historical data of freeway G5513 in Hunan province, China. Using Support Vector Machine (SVM), we proposed the travelling time model based on these databases. The new SVM model can simulate the nonlinear relationship between travelling time and those factors. In order to improve the precision of the SVM model, we applied Artificial Fish Swarm algorithm to optimize the SVM model parameters, which include the kernel parameter σ, non-sensitive loss function parameter ε, and penalty parameter C. We compared the new optimized SVM model with Back Propagation (BP) neural network and common SVM model, using the historical data collected from freeway G5513. The results show that the accuracy of the optimized SVM model is 17.27% and 16.44% higher than those of the BP neural network model and the common SVM model respectively.

Currently, maritime traffic is increasing with economic growth in several regions worldwide. However, this growth in maritime traffic has led to increased risk of marine accidents. These accidents have a higher probability of occurring in regions where geographical features, such as islands, are present. Further, the positioning of rescue ships in a particular ocean region with a high level of maritime activity is critical for rescue operations. This paper proposes a method for determining an optimal set of locations for stationing rescue ships in an ocean region with numerous accident sites in the Wando islands of South Korea. The computational challenge in this problem is identified as the positioning of numerous islands of varying sizes located in the region. Thus, the proposed method combines a clustering-based optimization method and an image processing approach that incorporates flood filling to calculate the shortest distance between two points in the ocean that detours around the islands. Experimental results indicate that the proposed method reduces the distance from rescue ships and each accident site by 5.0 km compared to the original rescue ship locations. Thus, rescue time is reduced.