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.

This study aims to focus on using the Volterra series and machine learning for forecasting random and chaotic wind speed regimes, since the calm weather is mostly noticed at the local site, making the dataset selection difficult. A novel method is proposed to predict Volterra kernels up to the third order, using a forward-back propagation neural network with 12-month measurements at Fujairah site (UAE). Both daily and monthly wind speed data sets are investigated for forecasting. The three dominant hourly and daily kernels are extracted for each day and each month. Predicted future Volterra kernels are estimated from past values using both statistical analysis and individual neuro networks for each of the Volterra kernel coefficients. Due to the random nature of wind speed at the local site, a two-layer with 4 neurons per layer neuro network is used to locate the most variable and intense speed during 8-hours in the day. Forecasted wind speed is determined with errors arising from different sources such as the utilization of only 3rd-order Volterra kernels and the difficulty of machine training of the employed shallow network. Nevertheless, this work depicts a useful algorithm to forecast chaotic and random wind speed regimes. Computational time is a trade of the complexity of Volterra mathematical analysis.

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.

Precipitation type is a key parameter used for better retrieval of precipitation characteristics as well as to understand the cloud-convection-precipitation coupling processes. Ice crystals and water droplets inherently exhibit different characteristics in different precipitation regimes (e.g., convection, stratiform), which reflect on satellite remote sensing measurements that help us distinguish them. The Global Precipitation Measurement (GPM) Core Observatory’s Microwave Imager (GMI) and Dual-Frequency Precipitation Radar (DPR) together provide ample information on global precipitation characteristics. As an active sensor, DPR provides an accurate precipitation type assignment, while passive sensors like GMI are traditionally only used for empirical understanding of precipitation regimes. Using collocated precipitation type flags from DPR as the “truth”, this paper employs machine learning (ML) models to train and test the predictability and accuracy of using passive GMI-only observations together with ancillary information from reanalysis and GMI surface emissivity retrieval products. Out of six ML models, four simple ones (Support Vector Machine, Neural Network, Random Forest, and Gradient Boosting) and the 1-D convolutional neural network (CNN) model are identified to produce 90% - 94% prediction accuracy globally for 5 types of precipitation (convective, stratiform, mixture, no precipitation, and other precipitation), which is much more robust than previous similar effort. One novelty of this work is to introduce data augmentation (subsampling and bootstrapping) to handle extremely unbalanced samples in each category. Careful evaluation of Impact matrices demonstrate that polarization difference (PD) and surface emissivity at high-frequency channels dominate the decision process, which are consistent with the physical understanding of polarized microwave radiative transfer over different surface types, as well as in snow and liquid clouds with different microphysical properties. Furthermore, the view-angle dependency artifact that DPR precipitation flag bears with does not propagate into the conical-viewing GMI retrievals. This work provides a new and promising way for future physics-based ML retrieval algorithm development.

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.

This work is mainly focused on improving the differential evolution algorithm with the utilization of shadowed and general type 2 fuzzy systems to dynamically adapt one of the parameters of the evolutionary method. In this case, the mutation parameter is dynamically moved during the evolution process by using a shadowed and general type-2 fuzzy systems. The main idea of this work is to make a performance comparison between using shadowed and general type 2 fuzzy systems as controllers of the mutation parameter in differential evolution. The performance is compared with the problem of optimizing fuzzy controllers for a D.C. Motor. Simulation results show that general type-2 fuzzy systems are better when higher levels of noise are considered in the controller.

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.

This paper presents the automation of the thin-layer chromatography technique whose separation and identification of molecules present in a mixture are currently done manually and laboriously [1]. We have therefore found an interest in automating this technique. In this part, the method implemented comprises 2 steps. First we proceeded to the segmentation of the spots obtained on the chromatographic plate. We then developed a program to identify families of molecules such as coumarins, terpenes, tannins, flavonoids, polyphenols, etc. by calculating segmentation parameters such as standard deviation, entropy, average pixel intensity from an algorithm on the matlab software. Finally our results have been compared to the results obtained by the traditional identification technique in laboratories. Some similarity between the two results obtained shows the reliability and the robustness of our technique.

Multidisciplinary Design Optimization (MDO) is the most active field in the design of current complex system engineering, which is possessed with such two difficulties as subsystem information exchange and analytical and computational complexity of systems. Therefore, an improved collaborative optimization algorithm based on ANN (artificial neural network) response surface was proposed dependent on the consistency constraint algorithm and concurrent subspace algorithm. As an optimization method with secondary structure, it satisfied only local constraints in discipline layer, but provided a coordinated mechanism for interdisciplinary conflict in system layer. Finally, it was applied in the multidisciplinary design optimization of autonomous underwater vehicle (AUV). As shown from the result, the MDO convergence stability and reliability of low resistance, low noise and high maneuvering performance of the AUV shape can be ensured by the improved collaborative optimization algorithm, thus verifying the effectiveness of the algorithm.

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.

We present a new penalized method for estimation in sparse logistic regression models with group structure. Group sparsity suggests us to consider the Group Lasso penalty. Being different from penalized log-likelihood estimation, our method can be viewed as a penalized weighted score function method. Under some mild conditions, we provide non-asymptotic oracle inequalities promoting group sparsity of predictors. A modified block coordinate descent algorithm based on a weighted score function is also employed. The net advantage of our algorithm over the existing Group Lasso-type procedures is that the tuning parameter can be pre-specified. The simulations show that this algorithm is considerably faster and more stable than competing methods. Finally, we illustrate our methodology with two real data sets.

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.

A new layout optimization method for offshore wind farms is proposed to minimize power deficits due to wake effect. The main engine of the algorithm is a gradient-descent method, in which an analogy is established between power deficit and repulsive electrostatic potential energy. To achieve a maximum dispersion in the initial solution, throughout the optimization process, new turbines are included in the centre of the concession area, and quickly expand outward looking for areas with less potential, in turn pushing the previous ones. When the optimization process ends, to avoid local maximums, it enters into a process of suppression of the set of locations that cause the greatest potential (power deficit). Then, a potential map of the entire area is created and a greedy algorithm includes new turbines to complete the layout with the final number of turbines. To speed up the search process and the creation of the potential map, two simplifications have been validated and added: the spatial distribution of velocities has been converted into its equivalent with point symmetry; and, for turbines affected by multiple wakes, the power deficit has been calculated by using a linear aggregation of powers, instead of the usual linear (or quadratic) aggregation of speeds. Owing to this type of aggregation, the process is accelerated in a factor of 90.

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.

The literature has well established prestressing in concrete beams and its calculation procedures. However, its use in composite steel-concrete beams has increased despite main normative codes lacking a specific approach for it. Designers must, in most cases, combine the available criteria to calculate the standards of steel and reinforced concrete structures. This study aimed to formulate this optimization problem and analyze CO2 emissions for the optimal design of composite steel-concrete beams with external prestressing. The design variables for the optimization problem include cross-section of laminated or welded profiles, slab height, characteristic strength of concrete to compression, and number of tendons. We obtained a solution for the optimization problem via a genetic algorithm (GA) and a particle swarm optimization one (PSO). Comparative analysis with experimental example and with optimization problem of prestressed steel beam are performed. An parametric analysis to several spams is performed, which enabled to evaluate the factors that most impact CO2 emissions. According to results, the chosen algorithms effectively obtained solutions for the problem, and PSO usually provided better results than GA. Regarding the final solution composition, steel contributes the most to emissions, welded profiles provided better solutions than laminated ones, and laminated spans of up to 17.5m and welded ones up to 27.5m dispensed with tendons.

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.

High-strength low-alloy steels (HSLAs) are widely used in the structural body components of many domestic motor vehicles owing to their better mechanical properties and greater resistance. The real production process of HSLA steelmaking can be regarded as a model that builds on the relationship between process parameters and product quality attributes. A surrogate modeling method is used, and the resulting production process model can be applied to predict the optimal manufacturing process parameters. We used different methods in this paper to build such a surrogate model, including linear regression, random forests, support vector regression, multilayer perception, and a simplified VGG model. We then applied three bio-inspired search algorithms, namely particle swarm optimization, the artificial bee colony algorithm, and the firefly algorithm, to search for the optimal controllable manufacturing process parameters. Through experiments on 9,000 test samples used for building the surrogate model, and 299 test samples for making the optimal process parameter selection, we found that the combination of a simplified VGG model and the firefly algorithm was the most successful at reaching a success rate of 100%—in other words, when the product quality attributes of all test samples satisfy the mechanical requirements of the end products.

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%.

Adequate knowledge about the development and operation of the components of water systems is of high importance in order to optimize them. For this reason, forecasting of future events becomes greatly significant due to making the appropriate decision. Moreover, operational river management severely depends on accurate and reliable flow forecasts. In this regard, current study inspects the accuracy of support vector regression (SVR), and SVR regulated with fruit fly optimization algorithm (FOASVR) and M5 model tree (M5), in river flow forecasting. Monthly data of river flow in two stations of the Lake Urmia Basin (Vaniar and Babarud stations on the Aji Chay and the Barandouz Rivers) were utilized in the current research. Additionally, the influence of periodicity (π) on the forecasting enactment was examined. To assess the performance of mentioned models, different statistical meters were implemented, including root mean squared error (RMSE), mean absolute error (MAE), correlation coefficient (R), and Bayesian information criterion (BIC). Results showed that the FOASVR with RMSE (4.36 and 6.33 m3/s), MAE (2.40 and 3.71 m3/s) and R (0.82 and 0.81) values had the best performances in forecasting river flows in Babarud and Vaniar stations, respectively. Also, regarding BIC parameters, Q_t-1 and π were selected as parsimonious inputs for predicting river flow one month ahead. Overall findings indicated that, although both FOASVR and M5 predicted the river flows in suitable accordance with observed river flows, the performance of FOASVR was moderately better than the M5 and periodicity noticeably increased the performances of the models; consequently, FOASVR can be suggested as the accurate method for forecasting river flows.

Adequate knowledge about the development and operation of the components of water systems is of high importance in order to optimize them. For this reason, forecasting of future events becomes greatly significant due to making the appropriate decision. Moreover, operational river management severely depends on accurate and reliable flow forecasts. In this regard, current study inspects the accuracy of support vector regression (SVR), and SVR regulated with fruit fly optimization algorithm (FOASVR) and M5 model tree (M5), in river flow forecasting. Monthly data of river flow in two stations of the Lake Urmia Basin (Vaniar and Babarud stations on the Aji Chay and the Barandouz Rivers) were utilized in the current research. Additionally, the influence of periodicity (π) on the forecasting enactment was examined. To assess the performance of mentioned models, different statistical meters were implemented, including root mean squared error (RMSE), mean absolute error (MAE), correlation coefficient (R), and Bayesian information criterion (BIC). Results showed that the FOASVR with RMSE (4.36 and 6.33 m3/s), MAE (2.40 and 3.71 m3/s) and R (0.82 and 0.81) values had the best performances in forecasting river flows in Babarud and Vaniar stations, respectively. Also, regarding BIC parameters, Qt-1 and π were selected as parsimonious inputs for predicting river flow one month ahead. Overall findings indicated that, although both FOASVR and M5 predicted the river flows in suitable accordance with observed river flows, the performance of FOASVR was moderately better than the M5 and periodicity noticeably increased the performances of the models; consequently, FOASVR can be suggested as the accurate method for forecasting river flows.

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.

The current work addresses the control of two-input two-output (TITO) Wood and Berry model of a binary distillation column. The controller design problem is formulated in terms of multivariable H_∞ control synthesis. The controller structure takes the form of simplest static output feedback (SOF) control. The controller synthesis is performed using a hybrid approach of blending linear matrix inequalities (LMI) and genetic algorithm (GA). The performance of the static output feedback controller is compared with three other controllers designed for Wood and Berry model available in the literature. The first simulation study is performed for the case of tracking a unit step command in the presence of a step change in output disturbance. A second simulation study is performed for rejecting a change in sinusoidal output disturbance.

In order to improve the performance of the draft tube in hydraulic turbine, a multi–objective optimization method for the draft tube is developed by combining the design of experiment (DOE), the radial basis function (RBF) and the non–dominated sorting genetic algorithm (NSGA–II) in this paper. The geometrical design variables of the median section in the draft tube and the cross section in its exit diffuser are considered as design parameters in this optimization, which objective function is to maximize the pressure recovery factor (Cp) and minimize the energy loss coefficient (ζ). The limited numbers of design matrix required for the shape optimization of the draft tube is generated by optimal Latin hypercube (OLH) method of the DOE technique, of which performances are evaluated through computational fluid dynamic (CFD) numerical simulation. For reducing of the computational consumption, the approximate model is used based on the RBF. The Pareto optimal solutions are finally performed using the NSGA–II for obtaining the best geometrical parameters of the draft tube. The optimization result of the draft tube shows a marked performance improvement over the original, which verifies the theoretical validity and feasibility of the proposed method in this paper.

the intermittency and variability of these permeated Distributed Generators (DGs) could critically cause many security and economy risks to distribution systems. This paper applied a certain mathematical distribution to imitate the output variability and uncertainty of DGs. And then, four risk indices EENS, PLC, EFLC and SI were established to reflect the system risk level of distribution system. For the certain mathematical distribution of the DGs' output power, a developed PEM (point estimate method)-based method was proposed to calculate these four system risk indices. In this developed PEM-based method, enumeration method was used to list the states of distribution systems, an improved PEM was presented to deal with the uncertainties of DGs and the value of load curtailment in distribution systems was calculated by an optimal power flow algorithm. Finally, the effectiveness and advantages of this proposed PEM-based method for distribution system assessment were verified by the tests of a modified IEEE 30-bus system. Simulation results have shown that this proposed PEM-based method has a high computational accuracy and highly reduced computational costs compared with other risk assessment methods and is very effective for risk assessments.

In the past few years, cloud-based additive manufacturing has shown its application and potential in industries. For this reason, when the demand for cloud-based additive products increases, efficient scheduling of related tasks becomes more important to achieve optimized duration. This research proposes a Heuristic Scheduling Algorithm (HSA) for use in Cloud-Based Additive Manufacturing (CBAM) with an approach to Critical Chain Buffer Management (CC/BM). This research aims to schedule and optimize the time in cloud-based additive manufacturing, in addition to the parts production process, it also includes the steps of receiving online orders and informing the manufacturing unit and sending them to the customer. The HSA proposed in this research consists of three phases 1- Buffer sizing, 2- Additive manufacturing and logistics scheduling, and 3- Buffer controlling. To evaluate, the performance of the algorithm is simulated. The finding shows that the proposed HAS can effectively solve the CBAM scheduling problem.

Algorithms, indispensable to understand Artificial Intelligence (AI), are omnipresent in social media but users’ understanding of these computational processes and the way they impact their consumption of information is often limited. There is a need for Media and Information Literacy (MIL) research investigating a) how MIL can support Algorithm Literacy (AL) as a subset of competences, and with what working definition, b) what competences users need in order to evaluate algorithms critically and interact with them effectively, and c) how to design learner-centred interventions that foster increased user understanding of algorithms and better response to disinformation spread by such processes. Based on Crossover project research, this paper looks at four scenarios of use by journalists, developers and MIL experts that mirror users’ daily interactions with social media. The results suggest several steps towards integrating AL within MIL goals, while providing a concrete definition of Algorithm-literacy that is experience-based. The competences and design considerations are organised in a conceptual framework thematically derived from the experimentation. This contribution can support AI developers and MIL educators in their co-design of algorithm-literacy interventions and guide future research on AL as part of a set of nested AI literacies within MIL.

Input noise causes inescapable bias to the weight vectors of the adaptive filters during the adaptation processes. Moreover, the impulse noise at the output of the unknown systems can prevent bias compensation from converging. This paper presents a robust bias compensation method for a sparse normalized quasi-Newton least-mean (BC-SNQNLM) adaptive filtering algorithm to address this issue. We have mathematically derived the biased-compensation terms in an impulse noisy environment. Inspired by the convex combination of adaptive filters' step sizes, we propose a novel variable-mixing-norm method to accelerate the convergence for our BC-SNQNLM algorithm, which is referred to as BC-SNQNLM-VMN. Simulation results confirm that the proposed method significantly outperforms other comparative works regarding normalized mean-squared deviation (NMSD) in the steady state.

Abstract In order to solve the problem that it is difficult to obtain the accurate trigger signal moment when using the time difference of UAV flight acoustic signals collected by acoustic sensors arranged in advance to locate the position of UAVs when they cannot be tracked by radar and are difficult to be observed by the human eye, an acoustic source localisation method with improved empirical modal decomposition (REMD) under an adaptive frequency window is proposed. Firstly, the collected UAV flight signals are smoothed and filtered, then the robust empirical modal decomposition (REMD) is used for IMF modal decomposition and spectral analysis of the collected signals, and a panning frequency window with variable bandwidth is introduced for corresponding frequency locking and extracting the IMFs; the GWO optimisation is used and the sliding metrics are set to determine the position of the panning frequency window automatically; finally, the extracted Finally, the extracted IMF components are reconstructed according to the criterion, and the trigger signal moments in the reconstructed IMF components are resolved and recorded, and the algorithm is used to calculate the difference between the reception moments of different sensors; for the traditional sound source localisation algorithms with a small detection range, which are prone to fall into the no-solution or false-solution, i.e., unable to achieve the localisation, a weighted least-squares-based Chan-Taylor algorithm is proposed for the localisation computation, and a weighted least-squares algorithm is proposed for the localisation computation, through the Inputting the sensor delay parameter and solving the linear equation system to get the target position information; finally, this paper verifies the robustness and performance of the design method with simulated and actual signals. The results show that the maximum positioning error is no more than 5% in an area with a side length of 15m in the measurement area. With the improved accuracy of time delay estimation, the positioning simulation results meet the positioning requirements even though the positioning error is further expanded when the measurement area is further expanded.

Aiming at the problems of high labor intensity and high cost of manual picking, high loss rate of mechanical picking seeds, low mechanization level and difficult to guarantee the quality of picking plates in the process of picking plates of edible sunflower. Based on the principle of manual plate taking, a plate taking control system for sunflower harvesting table was designed. Through the research and analysis of the principle of taking the plate of the edible sunflower harvesting table. According to the actual operation requirements, the overall scheme of the sunflower plate control system is determined, and the control strategy of imitating artificial low loss harvesting is designed. To reduce the grain loss in the process of taking the plate and improve the control accuracy of the system on the movement speed and displacement of the key components in the process of taking the plate, a trapezoidal acceleration and deceleration control algorithm is designed as the control algorithm of taking the plate. To verify the working performance of the plate control system, with the absolute error, relative error and total loss rate of the harvest as objectives. The bench and field verification experiments were both carried out. The bench experiment showed that the speed error of the plate parts was not more than 0.028 m/s. In the bench experiments of the device, the maximum positioning error was 1.25 mm, the average relative error is only 0.94 %, and the grain loss rate was not more than 2.26 %. It result showed that the system algorithm was reliable, the positioning accuracy was high, and the taking plate operation can be completed well. The field verification experiment showed that the forward speed of the unit was in the range of 0.4~0.8 m/s, and the total loss rate of harvest was less than 5 %. When the forward speed is 0.6 m/s, the minimum harvest loss rate is 2.32 %, and which indicated the control system meets the requirements of sunflower harvesting operation.

A model of a single-server queuing-inventory system (QIS) with catastrophes and a finite waiting room for consumer customers (c-customers) has been developed. When a catastrophe occurs, all inventory in the system's warehouse is destroyed, but c-customers in the system are still waiting for restocking. In addition to c-customers, negative customers (n-customers) are also taken into account, which displaces one c-customers (if any). The policy (?, ?) is used to replenish stocks. If upon arrival of the c-customer the inventory level is zero, then according to Bernoulli’s scheme this c-customer is either lost or joining the queue. The mathematical model of the studied QIS is constructed in the form of a two-dimensional continuous-time Markov chain (2D CTMC). Exact and approximate methods for calculating the steady-state probabilities of constructed 2D CTMCs are developed and closed-form expressions are derived for calculating the performance measures. The results of numerical experiments are presented, demonstrating the high accuracy of the developed approximate formulas, as well as the behavior of performance indicators depending on the reorder point. In addition, an optimization problem is solved to obtain the optimal reorder point to minimize the expected total cost.

Amid the swift progression of the global automobile industry, the aspiration for lightweight vehicle design has surfaced as a crucial approach to boost fuel efficiency and curtail environmental impact. The objective of this study revolves around achieving holistic optimization of vehicle structure via detailed scrutiny of vehicle process characteristics, amalgamated with a Back Propagation neural network (BPNN) optimized by a genetic algorithm (GA) and a topology optimization (TO) method.The process initiates with an examination of the vehicle's technical characteristics, succeeded by an optimization protocol that couples GA with BPNN. This exhaustive optimization procedure derives the best-fit values of design parameters and identifies the globally optimal lightweight design approach. Subsequently, a comprehensive structural optimization is actualized by modifying the topological distribution of the structure.A simulation experiment of the conceptual car body beam skeleton is conducted as a conclusive step, and the anti-collision capacity of the car body beam skeleton is assessed by measuring deformation intrusion. The findings reveal that in the vehicle topology optimization, a comparative analysis of pre and post-optimization results indicates an improved topological density across diverse sections. The topological density of the vehicle's frontal structure escalates from 0.75 to 0.8. Following optimization, the stiffness assessment records a marginal increase (within the range of 0.02–0.05), implying that the lightweight design does not compromise the general rigidity of the structure.The optimized body structure manifests superior crashworthiness in the crash test: the deformation intrusion diminishes by 27% in front-end collisions. In side impacts, the deformation and intrusion at critical points are reduced by 13.15% to 10% respectively. The comprehensive method proposed herein proves to be an efficient strategy to actualize the lightweight design of vehicles.

Due to the nonlinear stiffness and fractional-order damping characteristics of some real suspension systems, coupled with the presence of viscoelastic materials, fractional-order nonlinear suspension system modeling has become a focus of research in recent years. In this study, an electric oil and gas actuator based on fractional-order PID position feedback control is proposed, through which the damping coefficient of the suspension system is adjusted to realize the active control of the suspension. A fractional order PID algorithm is used to control the motor's rotational angle to realize the damping adjustment of the suspension system. In this process, the road roughness is collected by the sensors as the criterion of damping adjustment, and the particle swarm algorithm is utilized to find the optimal objective function under different road surface slopes, to obtain the optimal cornering value. According to the mathematical and physical model of the suspension system, the simulation model and the corresponding test platform of this type of suspension system are built. The simulation and experimental results show that the simulation results of the fractional-order nonlinear suspension model are closer to the actual experimental values than those of the traditional linear suspension model, and the accuracy of each performance index is improved by more than 18.5%. The designed active suspension system optimizes the body acceleration, suspension dynamic deflection, and tire dynamic load to 89.8%, 56.7%, and 73.4% of the passive suspension, respectively. Notably, the designed fractional order PID control circuit for the motor shows better control results compared to the conventional PID control circuit. This study provides an effective theoretical and empirical basis for the control and optimization of fractional-order nonlinear suspension systems.

This study considers the values of the credit payments that are made at random values for both payment size and number. The simultaneous existence of the two random variables increases the total value of the volatility of the payment process. The dependence for the simultaneous influence of the two random variables is derived by applying conditional probabilistic formulations. Formal relations apply to animal husbandry credit payments. The credit policy was analyzed for the cases of regular payments and with a stochastic number of payments. A recommendation for the upper level of credit payments is proposed based on a model predictive approach using historical payment data. A credit management algorithm is derived, in which decision-making for credit payments is formally derived and numerically discussed. The application of derived quantitative relations is empirically applied to real data on animal husbandry. The recommendations from the dependencies obtained allow a reduction in the mean values of credit payments, which correspond to a reduction in the credits used for business management, without a change in business policy.

Bandung and Lembang are the cities that are chosen by many tourists (local and foreign) as their destinations. Geographically, these cities are placed side-by-side and each city has its own characteristics. As in Bandung, there are many hotels and culinary spots, meanwhile, in Lembang, there are many scenery tourism spots. Tourists usually have limited time to visit all the destinations on holiday, which makes them choose several tourist destinations to visit. In this paper, the tourism itinerary recommendation system is proposed by calculating the most optimal route between destinations and approaching the Vehicle Routing Problem with Time Windows. The optimal route is defined by using Dijkstra the shortest path algorithm by using the collaboration between the road information (road length, traffic condition, travel time, and weather condition) and criteria weight that is determined using the Analytics Hierarchy Process as the graph weights. According to the simulation results, the criteria weights are 6.9%, 62.7%, 18.6%, and 11.9% for Route Length, Traffic Condition, Travel Time, and Weather Condition respectively. Moreover, the optimal number of tourism itinerary plans for the tourist in this research is 4 destinations. As the usage of computational resources, it takes 31.8% of CPU and 61.9% of Memory usage. For the time processing, it increases exponentially as the increment of number of requested stops. The output of this research is expected to be a solution to the tourist itinerary plan, especially in Bandung and Lembang.

In order to solve the problem of many constraints and complex navigation environment in the path planning of unmanned surface vehicle(USV), an improved Sparrow search algorithm com-bining Cubic chaotic map and Gaussian random walk strategy was proposed to plan it. Firstly, in the population initialization stage, Cubic chaotic map was used to replace the random generation method of the traditional sparrow search algorithm to optimize the uneven initial distribution of the population and improve the global search ability of the population. Secondly, in the late it-eration of the algorithm, the standard deviation of fitness is introduced to determine whether the population is trapped in the local optimum. If true, the Gaussian random walk strategy is used to perturb the optimal individual and assist the algorithm to escape the local optimum. Thirdly, the chosen water environment is modeled, and the navigation information of the original inland electronic navigation chart(ENC) is preprocessed, gridized, and the obstacle swelling is processed. Finally, the path planning experiments of USV are carried out in inland ENC grid environment. The experimental results show that, compared with the traditional sparrow search algorithm, the average fitness value of the path planned by improved sparrow search algorithm is reduced by 14.8%, and the variance is reduced by 49.9%. The path planned by the algorithm is of good quality and high stability, and combined with ENC, it can provide a reliable path for USV.

Coded aperture 3D imaging techniques have been rapidly evolving in the recent years. The two main directions of evolution are in aperture engineering to generate the optimal optical field and in development of computational reconstruction to reconstruct the object’s image from the intensity distribution with a minimal noise. The goal is to find the ideal aperture-reconstruction method pair and if not, to optimize one to match the other for designing an imaging system with required 3D imaging characteristics. Lucy-Richardson-Rosen algorithm (LR²A), a recently developed computational reconstruction method was found to perform better than its predecessors such as matched filter, Weiner filter, phase-only filter, Lucy-Richardson algorithm and non-linear reconstruction (NLR) for certain apertures when the point spread function (PSF) is a real and symmetric function. For other cases of PSF, NLR performed better than the rest of the methods. In this tutorial, LR²A has been presented as a generalized approach for any optical field along with MATLAB codes for reconstruction of any image when the PSF is known. The common problems and pitfalls in using LR²A has been discussed. Simulation and experimental studies for common optical fields such as spherical, Bessel, vortex beams and exotic optical fields such as Airy, scattered and self-rotating beams have been presented. From this study, it can be seen that it is possible to transfer the 3D imaging characteristics from non-imaging type exotic fields to indirect imaging systems faithfully using LR²A. The application of LR²A to medical images such as colonoscopy images and cone beam computed tomography images with synthetic PSF has been demonstrated. We believe that the tutorial will provide a deeper understanding of computational reconstruction using LR²A.

To predict the remaining useful life (RUL) of proton exchange membrane fuel cell (PEMFC) in advance, a prediction method based on the voltage recovery model and Bayesian optimization of a multi-kernel relevance vector machine (MK-RVM) is proposed in this paper. First, the empirical mode decomposition (EMD) method was used to preprocess the data, and then the MK-RVM was used to train the model. Then, the Bayesian optimization algorithm was used to optimize the weight coefficient of the kernel function to complete the parameter update of the prediction model, and the voltage recovery model was added to the prediction model to realize the rapid and accurate prediction of the RUL of PEMFC. Finally, the method proposed in this paper was applied to the open data set of PEMFC provided by FCLAB, and the prediction accuracy of the RUL of PEMFC was obtained by 95.35%, which showed that the method had good gen-eralization ability and verified the accuracy of the prediction for the RUL of PEMFC.

In response to reducing the energy cost of unmanned surface vehicles (USVs) while overcoming the low accuracy problem in surface target detection, a lightweight detection algorithm with multi-scale feature fusion is proposed. Based on the popular one-stage lightweight Yolov7-tiny target detection model, a lightweight extraction module is designed first by introducing the multiscale residual module to reduce the number of parameters and computational complexity while improving accuracy. The Mish and SiLU activation functions are used to enhance network feature extraction. Second, the path aggregation network employs coordinate convolution to strengthen spatial information perception. Finally, the dynamic head, which is based on the at-tention mechanism, improves the representation ability of object detection heads without any computational overhead. According to the experimental findings, the proposed model has 22.1% fewer parameters than the original model, 15% fewer GFLOPs, a 6.2% improvement in mAP@0.5, a 4.3% rise in mAP@0.5:0.95, and it satisfies the real-time criteria. According to the research, the suggested lightweight water surface detection approach includes a lighter model, a simpler computational architecture, more accuracy, and a wide range of generalizability. It performs bet-ter in a variety of difficult water surface circumstances.

For order-of-addition experiments, the response is affected by the addition order of the experimental materials. Consequently, the main interest focuses on creating a predictive model and an optimal design for optimizing the response. Van Nostrand (1995) proposed the pairwise-order (PWO) model for detecting PWO effects. Under the PWO model, the full PWO design is optimal under various criteria but is often unaffordable because of the large run size. In this paper, we consider the D-, A- and M.S.-optimal fractional PWO designs. We first present some results on information matrices. Then, a flexible and efficient algorithm is given for generating these optimal PWO designs. Numerical simulation shows that the generated design has an appealing efficiency in comparison with the full PWO design, though with only a small fraction of runs. Several comparisons with existing designs illustrate that the generated designs achieve better efficiencies, and the best PWO designs and some selected 100% efficient PWO designs generated by the new algorithm are reported.

Virgin coconut oil (VCO) is a functional food with important health benefits. Its economic interest encourages fraudsters to deliberately adulterate VCO with cheap and low-quality vegetable oils for financial gain, causing health and safety problems for consumers. In this context, there is an urgent need for rapid, accurate and precise analytical techniques to detect VCO adulteration. In this study, the use of Fourier Transform Infrared (FTIR) spectroscopy combined with Multivariate Curve Resolution - Alternating Least Squares (MCR-ALS) methodology was evaluated to verify purity or adulteration of VCO with reference to several low-cost commercial oils such as sun-flower, maize and peanut oils. Control charts were developed to assess the purity of oil samples using MCR-ALS scores values calculated from a data set of pure and adulterated oils. In addition, quantification models were developed using MCR-ALS with correlation constraint for adulterated coconut oil to assess the blend composition. Different data pre-treatment strategies were tested in order to best extract the information contained in the sample fingerprints, and the calibration models were optimised using a genetic algorithm (GA) to select the most important variables. The models gave satisfactory results in external validation procedure, with absolute errors of less than 4.6 % for samples adulterated with sunflower, maize and peanut oils.

The purpose of this work was to evaluate a novel methodology developed by Digital Blood Corporation (DBC) to calculate critical blood values using four non-invasive measured values as input. The values obtained using a point-of-care testing (POCT) device were utilized for comparison and reference. Radial arterial blood was collected for the POCT comparator analysis using the Abbott i-STAT^® device. The non-invasive methodology from DBC requires four parameters to be directly measured: temperature, hemoglobin, pO2, and pCO2. Subsequently, sodium, potassium, chloride, ionized calcium, total carbon dioxide, pH, bicarbonate, and oxygen saturation are calculated using an algorithm. The agreement between the POCT and DBC’s methodology was analyzed using Bland-Altman difference plots. For a second data set, pO2 and pCO2 values collected with the POCT were used as input for DBC’s algorithm to test its robustness. Data from 37 healthy ambulatory individuals, mean age: 42.4 + 13 years; range: 18-64 years, were included in the primary analysis. In the case of the non-invasive gained four input values the greatest variation between POCT and DBC’s approach was observed for pO2 and consequently for algorithm values that depend upon pO2 precision. Replacing transcutaneous pO2 and pCO2 with POCT values demonstrates the principal ability of DBC’s algorithm to predict the additional 8 blood values in sufficient agreement with a standard POCT device in healthy patients. The algorithm developed by DBC appears to be robust in the case of healthy patients but does need the four measured input values with preciseness comparable to a POCT device to give reliable and clinically relevant results. The present study thus serves as a proof of concept to facilitate future study and further development of this methodology into a non-invasive device.

The continuously developing project aims to build an informatics system enabling analysis of spatial and temporal parameters of movement activities occurring in the sport of speed climbing. The monitoring system (climbing information speed system – CISS) is to be used for conducting comprehensive scientific research in the field of speed climbing. The system enables the evaluation of the training process of climbers at various levels of competition. The study analysis was based on video. The video recording with a camera positioned at a short distance (10 m) from the wall. The marker was positioned closest to the centre of mass (gravity) BMC. Results: development of a system for data collection and analysis of the climbing run based on video recording (application of the Kanade-Lucas-Tomasi (KLT) algorithm). Our results showed that used devices can measure a wide range of specific internal and external variables during speed climbing. Some of the analyzed parameters were significantly correlated with speed climbing time. These results could be a theoretical basis for future research and for training program’s preparation.

This study develops a predictor-corrector algorithm for the numerical simulation of IVPs involving singular generalized fractional derivatives with Mittag-Leffler kernels. The proposed algorithm converts the considered IVP into a Volterra-type integral equation and then uses Trapezoidal rule to obtain approximate solutions. Numerical approximate solutions of some singular generalized fractional derivative with Mittag-Leffler kernels models have been presented to demonstrate the efficiency and accuracy of the proposed algorithm. The algorithm describes the influence of the fractional derivative parameters on the dynamics of the studied models. The suggested method is expected to be effectively employed in the field of simulating generalized fractional derivative models

The Vehicle Routing Problem (VRP) and its variants are found in many fields, especially logistics. In this study, we introduced an adaptive method to a complex VRP. It combines multi-objective optimization and several forms of VRPs with practical requirements for an urban shipment system. The optimizer needs to consider terrain and traffic conditions. The proposed model also considers customers' expectations, shipper considerations as goals, and the common goal like transportation cost. We offered compromise programming to approach the multi-objective problem by decomposing the original multi-objective problem into a minimized distance-based problem. We designed a hybrid version of the Genetic algorithm with the Local Search algorithm to solve the proposed problem. We evaluate the effectiveness of the proposed algorithm with the Tabu Search algorithm, the original Genetic algorithm on the tested dataset. The results show that our method is an effective decision-making tool for the multi-objective VRP and an effective solver for the new variation of VRP.

：An effective technology for predicting the end-point phosphorous content of basic oxygen furnace (BOF) can provide theoretical instruction to improve the quality of steel via controlling the hardness and toughness. Given the slightly inadequate prediction accuracy in the existing prediction model, a novel hybrid method was suggested to more accurately predict the end-point phosphorus content by integrating an enhanced sparrow search algorithm (ESSA) and a multi-strategy with a deep extreme learning machine (DELM) as ESSA-DELM in this study. To begin with, the input weights and hidden biases of DELM were randomly selected, resulting in that DELM inevitably had a set of non-optimal or unnecessary weights and biases. Therefore, the ESSA was used to optimize the DELM in this work. For the ESSA, the Trigonometric substitution mechanism and Cauchy mutation were introduced to avoid trapping in local optima and improve the global exploration capacity in SSA. Finally, to evaluate the prediction efficiency of ESSSA-DELM, the proposed model was tested on process data of the converter from the Baogang steel plant. The efficacy of ESSA-DELM was more superior to that of other DELM-based hybrid prediction models and conventional models. The result demonstrated that the hit rate of end-point phosphorus content within ±0.003%, ±0.002%, and ±0.001% was 91.67%, 83.33%, and 63.55%, respectively. The proposed ESSA-DELM model could possess better prediction accuracy compared with other models, which could guide field operations.

Properties of spatially explicit data are often ignored or inadequately handled in machine learning for spatial domains of application. At the same time, resources that would identify these properties and investigate their influence and methods to handle them in machine learning applications are lagging behind. In this survey of the literature, we seek to identify and discuss spatial properties of data that influence the performance of machine learning. We review some of the best practices in handling such properties in spatial domains and discuss their advantages and disadvantages. We recognize two broad strands in this literature. In the first, the properties of spatial data are developed in the spatial observation matrix without amending the substance of the learning algorithm; in the other, spatial data properties are handled in the learning algorithm itself. While the latter have been far less explored, we argue they offer the most promising prospects for the future of spatial machine learning.

Sea surface partial pressure of CO2 (pCO2) is a critical parameter in the quantification of air-sea CO2 flux, which plays an important role in calculating the global carbon budget and ocean acidification. In this study, we use chlorophyll-a concentration (Chla), sea surface temperature (SST), absorption due to dissolved and particulate detrital matter (Adg), diffuse attenuation coefficient of downwelling irradiance at 490nm (Kd) and mixed layer depth (MLD) as input data for retrieving the sea surface pCO2 in the North Atlantic based on a remote sensing empirical approach with the Categorical Boosting (CatBoost) algorithm. The results show that the root mean square error (RMSE) is 8.25μatm, the mean bias error (MAE) is 4.92μatm and the coefficient of determination (R2) can reach 0.946 in the validation set, which mean that the CatBoost model makes an improvement compared to other models in the published studies. In the further analysis of the spatial and temporal distribution of the sea surface pCO2 in the North Atlantic, it can be found that the North Atlantic sea surface pCO2 has a clear trend with latitude variations and have strong seasonal changes. Furthermore, the sea surface pCO2 in this area is mainly affected by sea temperature and salinity, and influenced by biological activities in some sub-regions.

Increasing demand for food production with limited available water resources pose the threat to agricultural activities. The conjunctive allocation of water resources maximizes the net benefit of farmers efficiently. In this study, a novel hybrid optimization model was developed based on a genetic algorithm (GA), bacterial foraging optimization (BFO) and ant colony optimization (ACO) to maximize the net benefit of water deficit Sathanur reservoir command. The GA-based opti-mization model considered crop-related physical and economical parameters to derive optimal cropping patterns for three different conjunctive use policies and further allocation of surface and groundwater for different crops are enhanced with the BFO. The allocation of surface and groundwater for the head, middle and tail reach obtained from BFO is considered as input to ACO as a guiding mechanism to attain an optimal cropping pattern. Comparing the average produc-tivity values Policy 3 (3.665 Rs/m3) has better values relating to Policy 1 (3.662 Rs/m3) and Policy 2 (3.440 Rs/m3). Thus, the developed novel hybrid optimization model (GA-BFO-ACO) is very promising to enhance the farmer's net income as well as for the command area water conservation and can be replicated in other irrigated regions of the globe to overcome chronic land and water problems.

Early detection of cancer increases the probability of recovery. This paper presents an intelligent decision support system (IDSS) for the early diagnosis of cancer based on gene expression profiles collected using DNA microarrays. Such datasets pose a challenge because of the small number of samples (no more than a few hundred) relative to the large number of genes (on the order of thousands). Therefore, a method of reducing the number of features (genes) that are not relevant to the disease of interest is necessary to avoid overfitting. The proposed methodology uses the information gain (IG) to select the most important features from the input patterns. Then, the selected features (genes) are reduced by applying the grey wolf optimization (GWO) algorithm. Finally, the methodology employs a support vector machine (SVM) classifier for cancer type classification. The proposed methodology was applied to two datasets (Breast and Colon) and was evaluated based on its classification accuracy, which is the most important performance measure in disease diagnosis. The experimental results indicate that the proposed methodology is able to enhance the stability of the classification accuracy as well as the feature selection

Densimetric Froude (Fr) is the minimum velocity required to prevent sediment deposition in pipes. Prediction of Fr is of utmost importance in numerous applications in civil engineering. In this paper through using a new hybrid method. Genetic Algorithm (GA) is used for optimum selection of membership functions of Adaptive Neuro-Fuzzy Inference System (ANFIS), and Singular Value Decomposition (SVD) method is used to compute the linear parameters of ANFIS’s results section (ANFIS-GA/SVD). Also, two different target functions are known as training error (TE) and prediction error (PE) by Pareto curve, the trade-off between these functions is selected as the optimal modeling point. First, different models will be presented using the parameters affecting Fr prediction, classifying them in different groups; then the Fr parameter will be predicted for all the different models through utilizing three different sets of data and the ANFIS-GA/SVD technique. The results of the models indicate that the best Fr prediction is obtained when independent parameters such as volumetric sediment concentration (CV), ratio of median diameter of particle size to pipe diameter (d/D), ratio of median diameter of particle size to hydraulic radius (d/R) and overall friction factor of sediment (λs) use as input variables in prediction of Fr. A sensitivity analysis is also conducted for the purpose of examining the effect of each of the dimensionless parameters on Fr prediction accuracy. Comparing the results of the suggested models with the existing regression-based equations shows that ANFIS-GA/SVD (R²=0.986, MAPE=4.397, RMSE=0.206, SI=0.053, ρ=0.026, BIAS=-0.025) is more accurate than the rest of the models.

Single nucleotide polymorphisms (SNP) are associated with diseases and drug response variabilities in humans. Elucidating the damaging and disease-associated SNPs using wet-laboratory approaches can be challenging and resource-demanding due to the large number of SNPs in the human genome. Due to the growth in the field of computational biology and bioinformatics, algorithms have been developed to help screen and filter out the most deleterious SNPs that are worth considering for wet-laboratory studies. Here we review the existing in-silico based methods used to predict and characterize the effects of SNPs on protein structure and function. This cutting-edge approach will facilitate the search for novel therapeutics, help understand the etiology of diseases and fast-track the personalized medicine agenda.

Background: Accurate prediction of patients’ response to therapy is clinically indispensable, howbeit challenging. With increased understanding of the human genome and malignancies, there is the renaissance of in silico pharmacogenomics with renewed interest in drug response predictability based on gene-drug interaction. Objective: Evidence-based transcript-proteome profiling is essential for synthesizing clinically applicable algorithms for predicting response to anticancer therapy, including immune checkpoint blockade (ICBT); thus, saving physicians’ time, reducing polypharmacy, and curtailing unnecessary treatment expense. In this study, we tested and validated the hypothesis that a selected proteomic signature in ICBT-naïve patients is sufficient for the prediction of response to ICBT. Methods: Using a multimodal approach consisting of computational pharmacogenomics, transcript-proteome analytics, mathematical modeling, and machine learning systems; we delineated therapy-sensitivity and stratified patients into graduated response groups based on their proteomic profile. Protein expression levels in our cohort tissue specimens were evaluated based on T cell- and non-T cell- inflamed phenotypes by immunohistochemistry. Results: We established β-catenin, PDL1, CD3 and CD8 expression-based ICBT response model. Statistical regression models validated the predictive association between our predefined algorithms and therapeutic outcome. Interestingly, our 4-gene prediction classifier was constitutively independent of tumor tissue origin, correctly stratified patients into high-, low-, and non- responders pre-treatment, with high prediction accuracy, and exhibited good association with patients’ performance status and prognosis (p < 0.01). Conclusion: Our findings demonstrate the possibility of accurate proteomics based ICBT response prediction and provide a putative basis for drug response prediction based on selective proteome profile in untreated cancer patients.

The key objective of the present paper is to propose a numerical scheme based on the homotopy analysis transform technique to analyze the time-fractional nonlinear predator-prey population model. The population model is coupled fractional order nonlinear partial differential equations often employed to narrate the dynamics of biological systems in which two species interact, first is a predator and the second is a prey. The proposed scheme provides the series solution with great freedom and flexibility by choosing appropriate parameters. The convergence of results is free from small or large parameters. Three examples are discussed to demonstrate the correctness and efficiency of the used computational approach.

A radial basis function network (RBFN) method is proposed to reconstruct daily Sea surface temperatures (SSTs) with limited SST samples. For the purpose of evaluating the SSTs using this method, non-biased SST samples in the Pacific Ocean (10°N–30°N, 115°E–135°E) are selected when the tropical storm Hagibis arrived in June 2014, and these SST samples are obtained from the OISST products according to the distribution of AVHRR L2p SST and in-situ SST data. Furthermore, an improved nearest neighbor cluster (INNC) algorithm is designed to search the optimal hidden knots for RBFNs from both the SST samples and the background fields. Then the reconstructed SSTs from the RBFN method are compared with the results from the optimum interpolation (OI) method. The statistical results show that the RBFN method has a better performance of reconstructing SST than the OI method in the study, and the average RMSE is 0.48°C for the RBFN method, which is quite smaller than the value of 0.69°C for the OI method. Additionally, the RBFN methods with different basis functions and clustering algorithms are tested, and we discover that the INNC algorithm with multi-quadric function is quite suitable for the RBFN method to reconstruct SSTs when the SST samples are sparsely distributed.

In this paper, we first discuss the research status and application progress of the finite element method and the smoothed particle method. By analyzing the advantages of the smoothed particle method and the finite element method, a new coupling algorithm, namely FEM-SPH algorithm, is proposed. By the method of comparison, it shows that finite element method and SPH method in the simulation of large deformation problems each have advantages and disadvantages, the finite element method smoothed particle coupling algorithm is effective to achieve the performance of high computational efficiency and can naturally simulate large deformation problems across. In the process of calculation, the large deformation unit can be freely into an algorithm to facilitate the calculation accuracy and efficiency of three methods of numerical simulation. Through the study found, FEM-SPH algorithm not only overcome the defect of smooth particle tensile instability, but also overcomes the problem of low efficiency of finite element computation. To further test the FEM-SPH algorithm has advantages in the practical engineering, we have carried out the actual test to the example of the super high speed collision, concluded that, since the target of most of the computational domain is always finite element, smoothed particle focused only in contact with the projectile and target of local area, particle number is not much, the whole calculation process just ten minutes, computational efficiency has been greatly improved, at the same time in the simulation of large deformation, the advantage is very obvious .This provides a criterion for the actual project, depending on the specific material deformation mode and choose a more appropriate conversion algorithm.

Robotic odor source localization (OSL) is a technology that enables mobile robots or autonomous vehicles to find an odor source in unknown environments. An effective navigation algorithm that guides the robot to approach the odor source is the key to successfully locating the odor source. While traditional OSL approaches primarily utilize an Olfaction-only strategy, guiding robots to find the odor source by tracing emitted odor plumes, our work introduces a fusion navigation algorithm that combines both vision and olfaction-based techniques. This hybrid approach addresses challenges such as turbulent airflow, which disrupts olfaction sensing, and physical obstacles inside the search area, which may impede vision detection. In this work, we propose a hierarchical control mechanism that dynamically shifts the robot’s search behavior among four strategies: crosswind maneuver, Obstacle-avoid Navigation, Vision-based Navigation, and Olfaction-based Navigation. Our methodology includes a custom-trained deep-learning model for visual target detection and a moth-inspired algorithm for Olfaction-based navigation. To assess the effectiveness of our approach, we implemented the proposed algorithm on a mobile robot in a search environment with obstacles. Experimental results demonstrate that our Vision and Olfaction Fusion algorithm significantly outperforms Vision-only and Olfaction-only methods, reducing average search time by 54% and 30%, respectively.

In this paper, we use a machine learning method, known as Nonnegative Matrix Factorization, to extract from a given image some new information obtained from a number of color space representations. Such kind of information, termed ``metacolor'', can be considered as a particular color space representation of the image, which can be used to obtain a binary segmentation of the investigated image by distinguishing foreground and background pixels. Some numerical experiments prove that the proposed method shows improved results when compared with common simpler thresholding algorithms.

To address the large hysteresis and susceptibility to instability in high-speed deposition fusion moulding (FDM) 3D printing’s temperature control, this paper proposes an improved ant-lion optimization algorithm (OCALO) to optimize the PID parameters.The improvement aims to solve the problem that the traditional ant-lion optimization algorithm (ALO) reduces the population diversity and tends to fall into the local optimal solution when it is close to the global optimal solution.The generation of the initial solution is enhanced by the introduction of a new Tent-Logistic-Cotangent composite chaotic mapping. This integration into Elite Opposition-Based Learning aids in optimizing population diversity. Concurrently, the incorporation of cosine factors of a specified parameter into the elitist formula of the traditional ALO algorithm is aimed at reducing the tendency of ants to randomly gravitate towards ant-lions with lower fitness values. This adjustment helps in balancing the exploration-exploitation trade-off in the algorithmic process. Compared with two existing classical algorithms and three improved ALO algorithms, the algorithm improves the convergence speed, global search ability and the ability to jump out of the local optimal solution. The improved algorithm was combined with PID control to design an OCALO-PID temperature controller and simulated on a high-speed 3D printing temperature model identified by modelling. The results show that the method improves the transient and steady-state performance of reactor temperature control with good control accuracy and robustness. Finally, the proposed algorithm is applied to a physical experimental platform to verify the feasibility of the algorithm.

Interior permanent magnets motors are widely used in applications requiring high power den-sity and high efficiency due to their high torque generating capabilities. Recently, given the re-cent price fluctuations and unstable supply of rare-earth permanent magnets, alternative config-urations with reduced use of permanent magnets are being sought. Among the various candi-dates related to this, the consequent-pole type rotor structure can halve the number of perma-nent magnets used compared with conventional structures. However, in the no-load analysis, the waveform of the back electromotive force becomes asymmetric, generating a harmonic component. As a result, there is a disadvantage that the torque ripple increases. To overcome these shortcomings, we propose a novel rotor structure that applies a consequent-pole structure to an embedded permanent-magnet motor structure, wherein a number of permanent magnets are arranged in a flared structure to constitute a single polarity. In the proposed flared-structured magnet arrangement, it is possible to adjust the angle of the permanent magnet and the polar angle to mitigate the asymmetry of the back EMF waveform. The proposed struc-ture was optimized with a genetic algorithm and a prototype of the optimal model was con-structed and experimentally evaluated to verify its validity. Finally, the performance improve-ment and validity of the proposed structure were verified by comparing the analysis results of the optimal model with the experimental results.

Gesture recognition technology has been quickly developed in the field of human-computer interaction. The multiple-input multiple-output (MIMO) radar has been widely adopted in gesture recognition because of its notable spatial resolution. In this work, a highly accurate MIMO radar-based hand gesture recognition algorithm with very low complexity is proposed. To make the proposed system applicable in the industry and work well even when the size of the training data is limited, we applied several low-complexity adaptive signal processing methods to extract features and reduce the noise effect. First, spectrum analysis is applied to range-Doppler maps (RDMs) and a cell-averaging constant false alarm rate (CA-CFAR) with mirror filters is applied to improve the robustness to noise. Afterward, the features related to the distance, speed, direction, and the elevation angle of the moving object are determined by the proposed adaptive signal analysis techniques and the random forest is applied for classification. The proposed system has the capability to precisely distinguish and identify eight motions, including waving, moving to the left or right, patting, pushing, pulling, and rotating clockwise or anticlockwise, with an accuracy of 95%. Experiments demonstrate the capability of the proposed hand gesture recognition system to classify different movements precisely.

Underwater wireless sensor networks (UWSNs) represent a specialized category of WSNs with versatile applications including acoustic monitoring, oil and gas exploration, and military surveillance. UWSNs face formidable challenges such as limited energy resources, extended propagation delays, and harsh conditions. Existing clustering and multi-hop routing protocols often unevenly distribute nodes geographically, causing network fragmentation and disproportionately draining the battery life of nodes near the sink due to higher data transmission demands. In this paper, we introduce an Energy-efficient Artificial Fish Swarm-based Clustering Protocol (EAFSCP), inspired by the collective behavior of fish swarms. EAFSCP is a decentralized clustering algorithm designed for acoustic monitoring in UWSNs. Its decentralized nature makes it particularly well-suited for large-scale UWSNs, where centralized algorithms may not be feasible. Through comprehensive comparisons with existing cluster-based routing protocols, our findings indicate that EAFSCP consistently outperforms them across multiple key performance metrics, including network lifetime, energy consumption, packet delivery ratio, packet loss rate, and throughput. According to the results, EAFSCP represents an effective clustering algorithm that enhances network performance, prolongs network lifespan by reducing energy consumption, promotes scalability, and provides valuable guidance for emergency response efforts.

In this paper, stochastic multi-objective intelligent framework (MOIF) is performed for distribution network reconfiguration to minimize power losses, the number of voltage sags, the system's average RMS fluctuation, the average system interruption frequency (ASIFI), the momentary average interruption frequency (MAIFI), and the system average interruption frequency (SAIFI) considering the network uncertainty. The unscented transformation (UT) approach is applied to model the demand uncertainty due to simplicity to implement and no presumptions to simplify. A human-inspired intelligent method named improved mountaineering team-based optimization (IMTBO) is applied to determine the decision variables defined as the network's optimal configuration. The conventional MTBO is improved using a quasi-opposition-based learning strategy to overcome premature convergence and achieve the optimal solution. The simulation results showed that in single- and double-objective optimization, some objectives are weakened compared to their base value, while the results of the MOIF indicated a fair compromise between different objectives, and all objectives are improved. The results of MOIF based on the IMTBO cleared that the losses are reduced by 30.94%, the voltage sag numbers and average RMS fluctuation are reduced by 33.68% and 33.65%, and also ASIFI, MAIFI, and SAIFI are improved by 6.80%, 44.61%, and 0.73%, respectively. Also, the superior capability of the MOIF based on the IMTBO is proved compared to the conventional MTBO, particle swarm optimization, and artificial electric field algorithm. Moreover, the results of the stochastic MOIF based on the UT showed the power loss increased by 7.62%, voltage sag, and SARFI increased by 5.39% and 5.31%, and ASIFI, MAIFI, and SAIFI weakened by 2.28%, 6.61%, and 1.48%, respectively compared to the deterministic MOIF model.

The economical load dispatch problem is a critical concern in thermal power systems to ensure cost-effective operation. This paper conducts a comparative analysis between the Social Spider Algorithm (SSA) and Particle Swarm Optimization (PSO) for economical load dispatch in a 6-unit thermal power system with the integration of 11,000 plug-in electric vehicles (PEVs). Both SSA and PSO are population-based optimization techniques designed to minimize the overall fuel cost while satisfying the load demand by determining the optimal power output of each unit. SSA emulates the social behavior of spiders, while PSO simulates the collective intelligence of a swarm of particles. Performance evaluation of the algorithms considers power system data, such as unit fuel costs, minimum and maximum loads, and total load demand. The objective is to minimize fuel cost while meeting the load demand. Comparative analysis of SSA and PSO includes convergence speed, solution quality, and computational efficiency. Experimental results indicate that SSA outperforms PSO in achieving a more optimal and economical load dispatch solution for the 6-unit thermal power system. SSA demonstrates faster convergence and provides superior-quality solutions compared to PSO. This paper contributes to the field by highlighting SSA's effectiveness in achieving cost-efficient operation of thermal power systems. The findings suggest that SSA holds promise as an optimization technique for similar power system optimization problems, enhancing overall operational efficiency and reducing costs for thermal power plants.

Coal is an important resource that is closely related to people’s lives and has an irreplaceable role. However, coal mine safety accidents occur from time to time in the process of working underground. To this end, this paper proposes a coal mine environmental safety early warning model to detect abnormalities and ensure worker safety in a timely manner by assessing the underground climate environment. In this paper, the support vector machine (SVM) parameters are optimized using an improved artificial hummingbird algorithm (IAHA), and its safety level is classified by combining various environmental parameters. To address the problems of insufficient global exploration capability and slow convergence of the artificial hummingbird algorithm during iterations, a strategy incorporating Tent chaos mapping and backward learning is used to initialize the population, a Levy flight strategy is introduced to improve the search capability during the guided foraging phase, and then the simplex method is introduced to replace the worst value before the end of each iteration of the algorithm. The IAHA-SVM safety warning model was established using the improved algorithm to classify and predict the safety of the coal mine environment into four classes. Finally, the performance of the IAHA algorithm and the IAHA-SVM model are simulated separately. The simulation results show that the convergence speed and the search accuracy of the IAHA algorithm are improved, and the performance of the IAHA-SVM model has a significant improvement.

Centrifugal pumps are widely employed in the oil refinery industry due to their efficiency and effectiveness in fluid transfer applications. The reliability of pumps plays a pivotal role in ensuring uninterrupted plant productivity and safe operations. Analysis of failure history data shows that bearings have been identified as critical components in oil refinery pump groups. However, traditional reliability estimation theories may not apply when data is limited or subject to right censoring. This paper addresses the complexity of estimating the Weibull distribution parameters using the maximum-likelihood method under the abovementioned conditions. The likelihood equation lacks an explicit analytical solution, necessitating the use of numerical methods for resolution. The proposed approach presented in this article leverages the Expectation-Maximization (EM) algorithm for estimating the Weibull distribution parameters. This method provides more accurate estimates of failure rates and probabilities by accounting for limited and censored data. The findings are demonstrated through a case study, showcasing the practical application of the proposed approach.