The utilization of tempered blast furnace (BF) slag through the direct fiber forming process to create high-value thermal insulation materials offers a dual benefit: it efficiently harnesses the latent heat within unused slag and substantially enhances the value of blast-furnace slag utilization. However, gauging the melting properties of iron slag under high temperatures is a challenge. In this study, we explore the melting behavior of SiO2 within a high-temperature molten pool. We employ dynamic visual data (video stream) captured via a non-contact charge coupled device (CCD) video recording system to extract SiO2 contours through image processing. The change in image centroid characteristics is used to establish a convolution function relationship, and MATLAB's traversal search algorithm determines SiO2's centroid position. Given that SiO2 is proportionate to crucible pixels, the area of SiO2 is calculated through pixel statistics within these contours. Subsequently, we propose a new indirect method to process image information, yielding SiO2 volume and mass at different time points. An exponential fitting yields the melting rate function of SiO2. Finally, we compare this indirect method with shape from shading (SFS), quantitative characterization, and dimensional analysis techniques. We also discuss the strengths and limitations of each method. Our findings reveal that the indirect solution method presented here boasts straightforward calculation steps and imposes minimal image format requirements. This research provides theoretical and technical support for blast-furnace slag's direct fiber forming process.

The world is attesting a tremendous change today which is remarkably coined as industry 4.0. Several terminologies have developed as a result of the emergency of industry 4.0, notably is cybersecurity which entails the security of communication and network operations activities either on or offline and the measures taken to achieve such security. The most common form of communication by organizations and Business today is the electronic mails (Email), although email is a valuable tool, it also creates security challenges when not properly managed. There is a growing adoption of email as official form of communication in many organizations with majority of users on mobile android devices due to the popularity of the android operating systems and the proliferation of mobile devices. Banks, health care, educational institutions and many other service providers are communicating to their clients through email where sensitive and confidential information are shared. One major threat to email communication is lack of confidentiality for emails accessed via android mobile devices due to weaknesses of android operating system (OS) platform that presents possibilities to penetrate by hackers and android email client since it accepts a onetime login and password authentication which is only required again if the email account is deleted from the android mobile device. In this study, an algorithm was designed and implemented on an android application that allows an email sender to compose an email and set the time the email will stay in the receiver inbox before it automatically wipes off. Primary data was collected from email users using tightly structured questionnaires and respondents comprised of those with email technical background and those that are typical email users inorder to get their opinion on the lack of confidentiality on the android mobile email client, while secondary data from scholarly journals and articles informed the study design. The designed algorithm was tested and evaluated through expert opinion. The result of the study indicates that the designed algorithm addresses the confidentiality issues and threats on android email clients.

Fluctuating stock prices make it difficult for investors to see investment opportunities. One tool that can help investors overcome this is forecasting techniques. Long Short-Term Memory (LSTM) is one of deep learning methods used in forecasting time series. The training and success of deep learning is strongly influenced by the selection of hyperparameters. This research uses a hybrid method between the Genetic Algorithm (GA) and LSTM to find a suitable model for predicting stock prices. GA is used in optimizing the architecture such as the number of epochs, window size, and the number of LSTM units in the hidden layer. Tuning optimizer is also carried out using several optimizers to achieve the best value. From method that has been applied, it shows that the method has a good level of accuracy with MAPE values below 10% in every optimizer used. The error rate generated is quite low, in case-1 with a minimum RMSE value of 93.03 and 94.40, & in case-2 with an RMSE value of 104.99 and 150.06 during training and testing. A fairly stable and small value is generated by setting it using the Adam Optimizer.

The Complete Coverage Path Planning (CCPP) is a key technology in the field of agricultural robot, and has great significance for improving the efficiency and quality of tillage, fertilization, harvesting and other agricultural robot operations, as well as reducing the operation energy consumption. The traditional boustrophedon or heuristic search algorithm based CCPP methods, when coping with the field with irregular boundaries, obstacles and other complex environments, still face many problems and challenges, such as large repeated work areas, multiple turns or U-turns, low operation efficiency and prone to local optimum. In order to solve the above problems, an improved-genetic-algorithm-based CCPP method was proposed in this paper, which introduces the idea of chromosome pairs and multi-points mutation to improve its global optimization ability in complex environments, reduce the repeated work areas and the number of turns and U-turns, and thereby improve the operation efficiency. The simulation and experimental results on simple regular fields showed that the proposed improved genetic algorithm-based CCPP method achieved the comparable performance with the traditional boustrophedon-based CCPP method. However, on the complex irregular fields, although the proposed CCPP method increased the number of turns by 13.76%, the area of repeated operation and the number of U-turns were decreased by 38.54% and 35.00% respectively, and saves the battery voltage by 7.82% on average compared to the boustrophedon-based CCPP method. This proved that the proposed CCPP method has strong adaptive capacity to the environment, and has practical application value in improving the efficiency and quality of agricultural machinery operations, and reducing the energy consumption.

Service pricing is a bottleneck in the development of innovation services, as it is the issue of most concern between the suppliers and demanders. In this paper, a negotiation pricing model that is based on the multiobjective genetic algorithm is developed for innovation service pricing. Regarding the service pricing process as a multiobjective problem, the objective functions, which include the service price, service efficiency, and service quality, for suppliers and demanders are constructed. As the solution of a multiobjective problem is typically a series of alternatives, another negotiation process is necessary for determining the final decision. A learning strategy is adopted during the negotiation process to simulate reality. Finally, the model is implemented for an innovation service transaction, the objective of which is to identify the optimal price plan. The results demonstrate that the model can provide quantitative decision support for the pricing of an innovation service and ultimately yield a win-win result for both the supplier and demander of the innovation service. Furthermore, the influence of the parameters during the negotiation process is analyzed in detail. The effects of the learning strategy on accelerating the negotiation process, as well as the chosen of reasonable parameters are given.

In this paper a variable’s involved in assessing the quality of a distributed generation system are reviewed, aiming to minimize the electric power losses (unused power consumption) and optimize the voltage profile. To provide this assessment, several experiments have been made to the IEEE 34-bus test case and various actual test cases with the respect of multiple DG units. The possibility and effectiveness of the proposed algorithm for optimal placement and sizing of DG in distribution systems have been verified. Finally, four algorithms were trailed: simulated annealing (SA), hybrid genetic algorithm (HGA), genetic algorithm (GA) and variable neighbourhood search. The HGA algorithm was found to produce the best solution at a cost of longer processing time.

The author previously reported an experimental result of evolutionary reinforcement learning of neural network controllers for the pendulum task. In the previous work, a conventional multilayer perceptron was employed in which connection weights were real numbers. In this study, the author experimentally applies an evolutionary algorithm to the reinforcement training of binary neural networks. In both studies, the same task and the same evolutionary algorithm are utilized, i.e. the pendulum control problem and Evolution Strategy respectively. The only differences lie in the memory size per connection weight and the model size of the neural network. The findings from this study are (1) the performance of the binary MLP with 32 hidden units was inferior to that of the real-valued MLP with 16 hidden units; however, this difference was not statistically significant (p >.05); (2) the trained binary MLP successfully swung the pendulum swiftly into an inverted position and maintained its stability after inversion, as the real-valued MLP had done; and (3) the memory size required to record the binary MLP with 32 hidden units is 3.1% or 6.2% of the memory size required to record the real-valued MLP with 16 hidden units.

Stray light is a critical aspect for high performance optical instruments. When stray light control by design is insufficient to reach the performance requirement, correction by post-processing must be considered. This situation is encountered for example in the case of the Earth observation in-strument 3MI, whose stray light properties are complex due to the presence of many ghosts dis-tributed on the detector array. We implement an iterative correction method and discuss its con-vergence properties. Spatial and field binning can be employed to reduce the computation time but at the cost of a decreased performance. Interpolation of the stray light properties is required to achieve high performance correction. For that, two methods are proposed and tested. The first interpolate the stray light in the field domain while the second applies a scaling operation based on a local symmetry assumption. Ultimately, the scaling method is selected and a stray light reduction by a factor of 58 is obtained at 2σ (129 at 1σ) for an extended scene illumination.

We consider the problem of scheduling $n$ jobs with identical processing times and given release as well as delivery times on $m$ uniform machines. The goal is to minimize the makespan, i.e., the maximum full completion time of any job. This problem is well-known to have an open complexity status even if the number of jobs is fixed. We present a polynomial-time algorithm for the problem which is based on the earlier introduced algorithmic framework blesscmore (``branch less and cut more''). We extend the analysis of the so-called behavior alternatives developed earlier for the version of the problem with identical parallel machines and show how the earlier used technique for identical machines can be extended to the uniform machine environment if a special condition on the job parameters is imposed. The time complexity of the proposed algorithm is $O(\gamma m^2 n\log n)$, where $\gamma$ can be either $n$ or the maximum job delivery time $q_{\max}$. This complexity can even be reduced further by using a smaller number $\kappa<n$ in the estimation describing the number of jobs of particular types. However, this number $\kappa$ becomes only known when the algorithm has terminated.

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

Accidents at mining enterprises, including tailing dumps, pose significant threats to human lives, structures, and the environment. This study focuses on designing, constructing, and operating tailing dumps in Siberia's northern region. To ensure safety and minimize environmental impacts, comprehensive scientific monitoring and research were conducted at all stages, including design, construction, operation, and disposal. The aim was to create a uniform mass within the dam body, requiring understanding of the tailings' structure and technological characteristics during placement. Parameters like particle size, distribution, density, and moisture content were considered to assess tailings' physical and geometric properties. Estimated monitoring was introduced as a permanent model to quickly assess the stability of hydrotechnical constructions. This involved monitoring changes in exploitation properties, structure height, beach length, and water levels. A controlled inwashing technology for subsequent dam layers was developed. Complex research facilitated the formulation of an estimated monitoring methodology and an algorithm for tailing dam formation. Practical application demonstrated high reliability and confirmed load-bearing capacity, allowing for the forecast of dam stability and safe execution. Findings led to alterations in work techniques, ensuring safe and efficient operation of tailing dams.

Evaporation from surface water plays a key role in water accounting of basins, water resources management, and irrigation systems management, so simulating evaporation with high accuracy is very important. In this study, two methods for simulating pan evaporation under different climatic conditions in Iran were developed. In the first method, six experimental relationships (linear, quadratic, and cubic, with two input combinations) were determined for Iran’s six climate types, inspired by a multilayer perceptron neural network (MLP-NN) neuron and optimized with the genetic algorithm. The best relationship of the six was selected for each climate type, and the results were presented in a three-dimensional graph. In the second method, the best overall relationship obtained in the first method was used as the basic relationship, and climatic correction coefficients were determined for other climate types using the genetic algorithm optimization model. Finally, the accuracy of the two methods was validated using data from 32 synoptic weather stations throughout Iran. For the first method, error tolerance diagrams and statistical coefficients showed that a quadratic experimental relationship performed best under all climatic conditions. To simplify the method, two graphs were created based on the quadratic relationship for the different climate types, with the axes of the graphs showing relative humidity and temperature, and with pan evaporation was drawn as contours. For the second method, the quadratic relationship for semi-dry conditions was selected as the basic relationship. The estimated climatic correction coefficients for other climate types lay between 0.8 and 1 for dry, semi-dry, semi-humid, Mediterranean climates, and between 0.4 and 0.6 for humid and very humid climates, indicating that one single relationship cannot be used to simulate pan evaporation for all climatic conditions in Iran. The validation results confirmed the accuracy of the two methods in simulating pan evaporation under different climatic conditions in Iran.

One of the most important applications in the wireless sensor networks (WSN) is to classify mobile targets in the monitoring area. In this paper, a multi-DBN weighted voting classification algorithm is proposed on the basis of the Deep Belief Network (DBN) classifier and combined with the idea of voting method, which is implemented on the nodes of the WSN monitoring system by means of "upper training, lower transplantation" appraoch. The performance of the algorithm is verified by using real-world experimental data, and the results show that the proposed method has a higher accuracy in classifying the target signal features, achieving an average classification accuracy of 84.63% across four different types of moving targets. The experiment reveals that the multi-DBN weighted voting algorithm enhances the target classification accuracy by approximately 5% in comparison to the single DBN classifier, but the memory and computation time required for the algorithm to run are also increased at the same time. Compared to the FFNN classifier, which exhibited the highest classification accuracy among the four selected methods, the algorithm achieves an improvement of approximately 8.8% in classification accuracy. However, it incurs greater time overhead to run.

Waste management is an unavoidable technological operation in the process of raw material extraction. The main characteristic of this technological operation is the handling of large quantities of waste material, which can amount to several hundred million cubic metres. Working with this amount of material usually requires high-capacity systems for excavation and loading, a large fleet of trucks for haulage, construction, and maintenance of a complex roads network, use of a significant area of land in order to achieve the required capacities, etc. At the same time, this operation must comply with all administrative and environmental standards. Therefore, optimising waste rock management (particularly haulage and dumping) has the potential to significantly improve the overall value of the project. This paper presents a hybrid model for the optimisation of waste dump design and site selection. The model is based on different mathematical methods (genetic algorithm, analytic hierarchy process and heuristic methods) adapted to different aspects of the problem. The main objective of the model is to provide a solution (in analytical and graphical form) for the draft waste dump design, on the basis of which the final waste dump design can be defined.

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

Several factors impact the durability of concrete bridge decks, including traffic loads, fatigue, temperature changes, environmental stress, and maintenance activities. Detecting problems such as corrosion, delamination, or concrete degradation early on can lower maintenance costs. Nondestructive evaluation (NDE) techniques can detect these issues at early stages. Each NDE method, meanwhile, has limitations that reduce the accuracy of the assessment. In this study, multiple NDE technologies were combined with machine learning algorithms to improve the interpretation of half-cell potential (HCP) and electrical resistivity (ER) measurements. A parametric study was performed to analyze the influence of five parameters on HCP and ER measurements, such as degree of saturation, corrosion length, delamination depth, concrete cover, and moisture condition of delamination. The results were obtained through finite element simulations and used to build two machine learning algorithms, a classification algorithm and a regression algorithm, based on the Random Forest methodology. The algorithms were tested using data collected from a bridge deck in the BEAST® facility. Both machine learning algorithms were effective in improving the interpretation of ER and HCP measurements using data from multiple NDE technologies.

Premature ventricular contraction (PVC) is one of the common ventricular arrhythmias, which may cause stroke or sudden cardiac death. Automatic long-term electrocardiogram (ECG) analysis algorithms could provide diagnosis suggestion even early warning for physicians, however, they are mutually-exclusive in terms of robustness, generalization and low complexity. In this study, a novel PVC recognition algorithm that combines deep learning-based heartbeat template clusterer and expert system-based heartbeat classifier is proposed. Long short-term memory-based auto-encoder (LSTM-AE) network was used to extract features from ECG heartbeats for K-means clustering. Thus, the templates were constructed and determined based on clustering results. Finally, the PVC heartbeats were recognized based on a combination of multiple rules, including template matching and rhythm characteristics. Three quantitative parameters, sensitivity (Se), positive predictive value (P+) and accuracy (ACC), were used to evaluate the performances of the proposed method on the MIT-BIH Arrhythmia database and the St. Petersburg Institute of Cardiological Technics database. Se on the two test databases was 87.51% and 87.92%, respectively; P+ was 92.47% and 93.18%, respectively; and ACC was 98.63% and 97.89%, respectively. The PVC scores on the 3rd China Physiological Signal Challenge 2020 training set and hidden test set were 36,256 and 46,706, respectively, which could rank first in the open-source codes. The results showed that the combination strategy of expert system and deep learning can provide new insights for robust and generalized PVC identification from long-term single-lead ECG recordings.

In the field of stochastic optimisation, the so-called structural bias constitutes an undesired behaviour of an algorithm that is unable to explore the search space to a uniform extent. In this paper, we investigate whether algorithms from a subclass of estimation of distribution algorithms, the compact algorithms, exhibit structural bias. Our approach, justified in our earlier publications, is based on conducting experiments on a test function whose values are uniformly distributed in its domain. For the experiment, 81 combinations of compact algorithms and strategies of dealing with infeasible solutions have been selected as test cases. We have applied two approaches for determining the presence and severity of structural bias, namely a visual and a statistical (Anderson-Darling) tests. Our results suggest that compact algorithms are more immune to structural bias than their counterparts maintaining explicit populations. Both tests indicate that strong structural bias is found only in one of the algorithms (cBFO) regardless of the choice of strategy of dealing with infeasible solutions and cPSO mirror. For other test cases, statistical and visual tests disagree on some cases classified as having mild or strong structural bias: the former one tends to make harsher decisions, thus needing further investigation.

Recently, the triple-network convergence system (TNCS) has emerged from the deep integration of the power grid, transportation network, and information network. Fault recovery research in the TNCS is important since this system's complexity and interactivity can expand the faults scale and increase faults impact. Currently, fault recovery focuses primarily on single power grids and cyber-physical systems, but there are certain shortcomings, such as ignoring uncertainties including generator start-up failures and the occurrence of new faults during recovery, energy supply-demand imbalances leading to system security issues and communication delay caused by network attacks. In this study, we propose a recovery method based on the improved TD3 algorithm, factoring in shortcomings of the existing research. Specifically, we establish a TNCS model to analyze interaction mechanisms and design a state matrix to represent the uncertainty changes in the TNCS, a negative reward to reflect the impact of unit start-up failures, a special reward to reflect the impact of communication delay and an improved Actor network update mechanism. Experimental results show that our method obtains the optimal recovery decisions, maximizes restoration benefit in power grid failure scenarios and demonstrates a strong resilience against communication delay caused by DoS attacks.

The stator winding insulation system is the most critical and weak part of the EMU's (electric multiple unit) traction motor. The effective diagnosis for stator ITSC (inter-turn short-circuit) faults can prevent the fault from expanding into phase-to-phase or ground short-circuits. The TCU(traction control unit) controls the traction inverter to output SPWM (sine pulse width modulation) excitation voltage when the traction motor is stationary. Three ITSC fault diagnostic conditions are based on different IGBTs control logic. The Goertzel algorithm is used to calculate the fundamental current amplitude difference Δi and phase angle difference Δθ of equivalent parallel windings under the three diagnostic conditions. The six parameters under the three diagnostic conditions are used as features to establish an ITSC fault diagnostic model based on random forest. The proposed method was validated using a simulation experimental platform for ITSC fault diagnosis of EMU traction motors. The experimental results indicate that the current amplitude features Δi and phase angle features Δθ change obviously with the increase of ITSC fault extent if the ITSC fault occurs at the equivalent parallel windings. The accuracy of the ITSC fault diagnosis model based on the random forest for ITSC fault detection and location both in train and test samples are 100%.

This work introduces an innovative approach that unites a PIDND2N2 controller and the balanced arithmetic optimization algorithm (b-AOA) to enhance the stability of an automatic voltage regulator (AVR) system. The PIDND2N2 controller, tailored for precision, stability, and responsiveness, mitigates the limitations of conventional methods. The b-AOA optimizer is obtained through integration of pattern search and elite opposition-based learning strategies into the arithmetic optimization algorithm. This integration optimizes the controller parameters and the AVR system's response, harmonizing exploration and exploitation. Extensive assessments, including evaluations on 23 classical benchmark functions, demonstrate the efficacy of the b-AOA. It consistently achieves accurate solutions, exhibits robustness in addressing a wide range of optimization problems, and stands out as a promising choice for various applications. In terms of AVR system, comparative analyses highlight the superiority of the proposed approach in transient response characteristics, with the shortest rise and settling times and zero overshoot. Additionally, the b-AOA approach excels in frequency response, ensuring robust stability and a broader bandwidth. Furthermore, the proposed approach is compared with various state-of-the-art control methods for the AVR system, showcasing impressive performance. These important results underscore the significance of this work, setting a new benchmark for AVR control by advancing stability, responsiveness, and reliability in power systems.

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

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

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

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

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

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

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

Driving simulators are widely used for understanding human-machine interaction, driver behavior and in driver training. The effectiveness of simulators in these process depends largely on their ability to generate realistic motion cues. Though the conventional filter-based motion cueing strategies have provided reasonable results, these methods suffer from poor workspace management. To address this issue, linear MPC-based strategies have been applied in the past. However, since the kinematics of the motion platform itself is non-linear and the required motion varies with the driving conditions, this approach tends to produce sub-optimal results. This paper presents a nonlinear MPC-based algorithm which incorporates the nonlinear kinematics of the Stewart platform within the MPC algorithm in order to increase the cueing fidelity and utilize maximum workspace. Further, adaptive weights-based tuning is used to smoothen the movement of the platform towards its physical limits. Full-track simulations were carried out and performance indicators were defined to objectively compare the response of the proposed algorithm with classical washout filter and linear MPC-based algorithms. The results indicate a better reference tracking with lower root mean square error and higher shape correlation for the proposed algorithm. Lastly, the effect of the adaptive weights-based tuning was also observed in the form of smoother actuator movements and better workspace utilization.

Variational mode decomposition (VMD) is a recently introduced adaptive signal decomposition algorithm with a solid theoretical foundation and good noise robustness compared with empirical mode decomposition (EMD). There is a lot of background noise in the vibration signal of diesel engine. To solve the problem, a denoising algorithm based on VMD and Euclidean Distance is proposed. Firstly, a multi-component, non-Gauss, and noisy simulation signal is established, and decomposed into a given number K of band-limited intrinsic mode functions by VMD. Then the Euclidean distance between the probability density function of each mode and that of the simulation signal are calculated. The signal is reconstructed using the relevant modes, which are selected on the basis of noticeable similarities between the probability density function of the simulation signal and that of each mode. Finally, the vibration signals of diesel engine connecting rod bearing faults are analyzed by the proposed method. The results show that compared with other denoising algorithms, the proposed method has better denoising effect, and the fault characteristics of vibration signals of diesel engine connecting rod bearings can be effectively enhanced.

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.

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

This paper considers the application of two selected algorithms (Cuckoo Search CS, Firefly Algorithm FA) to determine and maximize the reliability of a two complex system known from the literature. This system operates with resource constraints. In addition, several classical methods for determining the reliability of systems have been applied. Although the CS algorithm is known for its effectiveness as it uses the Lévy flight, for the presented optimization tasks the FA firefly algorithm in the considered parameter range proved to be more effective. The presented results broaden the existing discussion on the application of nature-inspired algorithms for solving RRAP (Reliability Redundancy Allocation Problem) problems. From this point of view, two described test scenarios can be considered as a suitable tool for validating other algorithms in RRAP problems. Not only the values of the criterion functions can be compared, but also other introduced parameters and statistical analyse of variance (ANOVA) with post-hoc RIR Tuckey test was discussed.

This study suggests a novel cooperative multi-simplex algorithm that generalizes a local search optimizer to design a novel global search heuristic algorithm. The proposed algorithm exploits the vertex sharing strategy to enhance the search abilities of the working simplexes. The vertex sharing among the simplexes is carried out through cooperative step that is based on fitness of the underlying simplex. The proposed algorithm is applied to solve some systems of nonlinear equations by transforming them to optimization problems. Comparative analysis of results shows that the proposed method is practical and effective.

Malignant growth is the most widely recognized repulsive infections winning around the world, and the patients with disease are saved just when the malignant growth is distinguished at the beginning phase. Each kind of disease is interesting, with its own arrangement of development properties and hereditary changes. This paper presents the lung knob division and disease characterization by proposing an enhancement calculation. The general technique of the created approach includes four stages, such as pre-processing, division, highlight extraction, and the order. From the outset, the CT picture of the lung is taken care of to the division. When the division is done, the highlights are extricated through morphological and measurable and surface highlights like LOOP and LGP. At long last, the extricated highlights are given to the order step. Here, the characterization is done dependent on the Deep Belief Network (DBN) which is prepared by utilizing the proposed Chicken-Sine Cosine Algorithm (CSCA) which distinguish the lung tumor, giving two classes in particular, knob or non-knob. The presentation assessment of lung knob division and malignant growth grouping dependent on CSCA is figured utilizing three measurements to be specific, precision, affectability, and the explicitness.

Disease detection and prediction have been one of the most frequent uses of machine learning models in the last decade, and Parkinson's disease is no exception. It is common for people in their old age to have one form of disease or another depending on the circumstances in which they find themselves. This study analyzed and evaluated various supervised machine learning models to detect the presence of Parkinson's disease in elderly individuals. An extreme gradient boosting model, along with other models, such as naïve Bayes, random forest, K-nearest neighbor, and support vector machine (SVM), was implemented to determine the best outcome. The extreme gradient boosting (XGBoost) model is a powerful boosting machine learning technique, particularly in terms of speed and accuracy. The results showed that the XGBoost model, which is an optimized version of the other boosting models, is capable of projecting the presence of Parkinson's disease with very high accuracy compared to other algorithms. The implemented classification algorithm extreme gradient boosting method achieved approximately 98 % accuracy, 97.5 % precision, 100.0 % recall, and 98.7% f1-score which are high compared with the results found in the existing literature.

Modern agriculture requires technology to give precise measures about relevant parameters such as pest control. Here, we developed an algorithm model as base for bait spray intervention, by monitoring the olive fruit fly, Bactrocera oleae (Rossi), with conventional traps, in 24.3 Hectares of non-irrigated Baladi olive cultivars, in Hassbaya region. We installed 49 yellow sticky traps with ammonium bicarbonate. The adults, males and females were monitored, on weekly basis. The traps and the trees were georeferenced, and the parameters such as temperature, relative humidity, tree phenology (BBCH), and fruit load rate were compiled. The results showed that the infested fruits were correlated as much with the fruit load rate as with the number of adults captures which were correlated more to the temperature than the relative humidity. The number of the males captured was higher than the females all over the cultivation period. The first symptoms of the fruits were observed from 22 September when the BBCH was equal to 85%, with an average of adult captures lesser than 5 adults by trap by 7 days.

In this preprint, we introduce a dataset containing students enrolment applications combined with the related result of their filing procedure. The dataset contains 73 variable. Student candidates, at the time of applying for study, fill a web form for filing the procedure. A committee at Tilburg University review each single application and decide if the student is admissible or not. This dataset is suitable for algorithmic studies and has been used in a comparison between the Naïve Bayes and the C5.0 Decision Tree Algorithms. They have been used for predicting the decision of the committee in admitting candidates at various bachelor programs. Our analysis shows that, in this particular case, a combination of the approaches outperform a both of them in term of precision and recall.

The aim of this study has been to develop a novel two-level multi-objective genetic algorithm (GA) to optimize time series forecasting data for fans used in road tunnels by the Swedish Transport Administration (Trafikverket). Level 1 is for the process of forecasting time series cost data, while level 2 evaluates the forecasting. Level 1 implements either a multi-objective GA based on the ARIMA model or a multi-objective GA based on the dynamic regression model. Level 2 utilises a multi-objective GA based on different forecasting error rates to identify a proper forecasting. Our method is compared with using the ARIMA model only. The results show the drawbacks of time series forecasting using only the ARIMA model. In addition, the results of the two-level model show the drawbacks of forecasting using a multi-objective GA based on the dynamic regression model. A multi-objective GA based on the ARIMA model produces better forecasting results. In level 2, five forecasting accuracy functions help in selecting the best forecasting. Selecting a proper methodology for forecasting is based on the averages of the forecasted data, the historical data, the actual data and the polynomial trends. The forecasted data can be used for life cycle cost (LCC) analysis.

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.

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.

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

Nowadays, the wasting of resources is one of the fundamental challenges of the industrial sector. The rectangle packing problem can be very effective in this context. Practical applications of this issue in the timing and designing of the industries and businesses are very remarkable. The purpose of this issue is to arrange a set of rectangles with specific dimensions in a rectangular page with a specific width and unlimited height without overlapping. The fundamental challenge in this issue is that this is an NP-complete issue. Therefore, it is difficult to achieve the best arrangement, which has the maximum rate of resource utilization and also has a linear running time. Many algorithms have been presented to estimate a practical solution for this issue. In the past decades, the best fit method has been one of the most useful methods for this purpose. This study presents a combinatorial algorithm based on two algorithms, including the lowest front-line strategy and the best-fit algorithm. The running results indicate that the suggested algorithm performs well, despite its simplicity. The time complexity of the suggested algorithm is O(nm), in which n is the number of input rectangles and m is the number of the created front lines.

The electrical energy supply relies on the satisfactory operation of insulators. The ultrasound recorded from insulators in different conditions has a time series output, which can be used to classify faulty insulators. The random convolutional kernel transform (Rocket) algorithms use convolutional filters to extract various features from time series data. This paper proposes the combination of Rocket algorithms, machine learning classifiers, and empirical mode decomposition (EMD) methods, such as complete ensemble empirical mode decomposition with adaptive noise (CEEMDAN), empirical wavelet transform (EWT), and variational mode decomposition (VMD). The results show that the EMD methods combined with MiniRocket, significantly improve the accuracy of logistic regression in insulator fault diagnosis. The proposed strategy achieves respectively an accuracy of 0.992 using CEEMDAN, 0.995 with EWT, and 0.980 with VMD. These results highlight the potential of incorporating EMD methods in insulator failure detection models to enhance the safety and dependability of power systems.

Chlorophyll a concentration (Chl) is a key variable to estimate primary production (PP) through ocean color remote sensing (OCRS). Accurate Chl estimate is crucial for better understanding of spatio-temporal trends of PP over recent decades as a consequence of climate change. However, a number of studies have reported that currently operational chlorophyll a algorithms perform poorly in the Arctic Ocean (AO), which is mainly caused by the interference of colored and detrital material (CDM) with the phytoplankton signal in the visible part of the spectrum. To determine how and to what extent that CDM would bias the estimation of Chl, we evaluated the performances of 8 currently available ocean color algorithms: OC4v6, OC3Mv6, OC3V, OC4L, OC4P, AO.emp, GSM01 and AO.GSM. Our results suggest that the empirical AO.emp algorithm performs the best overall, but for waters with high CDM (acdm(443) &gt; 0.067 m-1), which is of much interest in the Arctic, it is the two semi-analytical GSM models that show better performance. Besides, sensitivity analyses using an Arctic spectrally- and vertically-resolved primary production model further show that errors in Chl mostly propagate proportionally to PP estimates with 7% amplification at maximum. We aslo demonstrate that the higher level of CDM relative to Chl in the water column, the larger the bias would occur in both Chl and PP estimates. Although the AO.GSM overall best performs among algorithms tested in the present study, it tends to fail for a significant number of pixels (16.2% observed in the present study) particularly for waters with high CDM. Our results suggest that an algorithm that provides reasonable Chl estimates for a wide range of optically-complex Arctic waters is still required.

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

Bending waveguide is one of the building blocks of on-chip photonic integrated circuits (PICs). Previous bending waveguides (BWs) usually suffer from larger footprint size in the bending region, which is are not conducive to develop large-scale and high-density PICs. To this end, we propose and numerically investigate an ultra-compact silicon-on-insulator 180-degree waveguide bend with a bending radius of 2 µm. Being different from the previous BWs, the design is based on topologically optimized digital metamaterials, which is implemented by using intelligent genetic algorithms. Simulated results show that the proposed structure has a -1.36 dB bend efficiency per 180-degree at a wavelength of 1.55 µm and occupies a footprint of only 4 × 4 µm2. Moreover, the crosstalk is <−20 dB and the loss is <2.6 dB over a >100 nm operating bandwidth (1.6-1.7 µm) for TE0 modes. With the wide operating bandwidth and ultra-compact footprint, the proposed silicon-based 180-degree waveguide bend shows a potential application as the fundamental component for optical communication interconnect in the ultra-highly integrated photonic circuit.

This paper presents a theorem in factorial functions with the sum of any two nonnegative integers that is equal to multiple of the product of factorial of the same two nonnegative integers.

Due to advancement in hacking/reverse engineering tools, threat against transfer of sensitive data or highly classified information is always at risk of being intercepted by an attacker. Covert communication outwit this malicious breach of privacy act better than cryptography as it camouflage secret information inside another innocent looking information, while cryptography shows scrambled information that might arouse attention of an attacker. However, the challenges in Steganography are the modification of carrier that causes some abnormalities, which is detectable and often the methods are not optimize. This paper presents an approach in Covert communication Chanel, which utilizes mathematical concept of combination to optimize time of transmission using sets of multiple transmitter’s, and receiver’s addresses where each abstractly represents a set of bits or characters combination without modifying the address. To minimize the number of physical address to be use, a combinatorial and permutation concept of virtual address generation from physical address is introduce. The paper in addition presents some technique like relationship and their application in both re-enforcing resistivity against Steganalysis and generating combinations. Furthermore, a concept of dynamical clockwise and anti-clockwise rotation of combination over addresses after every transmission is introduce to further improve on resistivity against Steganalysis. A simple test was performed for demonstrating relay address, combination and permutation concepts. Based on test results and analysis, the method is effective as expected and it is quite easy to use as it can be implemented in different platform without much difficulties.

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

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

With the development of higher voltage power grid, the high and low voltage parallel loops are emerging, which lead to energy losses, even threaten the security and stability of power system. The multi-infeed HVDC configurations widely appearing in AC/DC interconnected power system make this situation even worse. Aimed at energy saving and system security, a decision optimization method for power grid operating condition with high and low voltage parallel loops is proposed in this paper. Firstly, considering hub substation distribution and power grid structure, parallel loop opening schemes are generated with GN algorithm. Then, candidate opening schemes are preliminarily selected from all these generated schemes based on a filtering index. Finally, with the influence on power system security, stability and operation economy in consideration, an evaluation model for candidate opening schemes is founded based on analytic hierarchy process (AHP). And a fuzzy evaluation algorithm is used to find the optimal scheme. Simulation results of New England 39-bus system and an actual power system validate the effectiveness and superiority of this proposed method.

The fast and reliable processing of medical images is of paramount importance to adequately generate data to feed machine learning algorithms that can prevent and diagnose health issues. Here we benchmark different compressed sensing techniques applied to magnetic resonance imaging as a means to reduce the acquisition time spent in the collection of data and signals that form the image. We show that by using these techniques, it is possible to reduce the number of signals needed and, therefore, substantially decrease the time to acquire the measurements. To this end, we have considered and compared different algorithms: the Iterative Re-Weighted Least Squares, the Iterative Soft Thresholding Algorithm, the Iterative Hard Thresholding Algorithm, the Primal Dual Algorithm and the Log-Barrier Algorithm. We have implemented such algorithms in different analysis programs that have been used to perform the reconstruction of the images and found that the Iterative Soft Thresholding Algorithm gives the optimal results. We found that the images obtained with this algorithm have less quality than the original ones, but the quality is good enough to distinguish each body structure and detect any health problems.

In Tropical Monsoon climates, precipitation exceeds evapotranspiration, leading to increased surface runoff, especially in floodplain regions. The Bhagirathi-Hooghly River in India is the focus of the study, which analyses hydrology, sediment yield, and water balance in this floodplain area. This investigation employs the Soil and Water Assessment Tool (SWAT) model within the ArcGIS environment, using remote sensing data. The study area is divided into 4 sub-basins and 40 Hydrological Response Units (HRUs), with a focus on Land Use/Land Cover (LULC) parameters, soil attributes, and slope characteristics. Calibration (1998-2010) and validation (2011-2018) of river discharge and sediment yield are performed using the SUFI-2 algorithm within SWAT-CUP. The calibration process shows a strong correlation between observed and simulated data points, indicating the model's accuracy. The study reveals a pattern of early-year evapotranspiration followed by increasing rainfall during the monsoon season, leading to heightened surface runoff and sediment yield. Excessive rainfall, therefore, emerges as a pivotal driver of flood incidences within the floodplain. The insights derived from the SWAT model's floodplain data have the potential to inform flood control and sedimentation mitigation strategies. The assimilation of this data can empower local stakeholders and contribute to sustainable livelihoods and improved living conditions, offering guidance for future governmental policies.

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

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.

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.

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.

Researchers are always looking to find ways to use energy more efficiently while keeping people comfortable at home. They've tried different methods like fuzzy logic and genetic algorithms to do this. In this paper, we introduce a novel model that combines different techniques like data smoothing, optimization, machine learning, and control algorithms to reach this goal in smart homes. The proposed model is made up of three main parts: smoothing, optimization, and control. The smoothing part uses the Kalman filter to get rid of any unnecessary noise and make sure the data used to predict energy use is clean and smooth. The optimization part uses both genetic with firefly algorithms and artificial neural networks to minimize the gap between the actual environmental conditions and the conditions users find comfortable. It adjusts the comfort settings in real-time using machine learning. The control part uses Mamdani fuzzy logic to make sure energy is delivered in the best way possible to the systems that control temperature, lighting, etc., making the home comfortable and saving energy at the same time. Comparative analyses demonstrate the superiority of the proposed model over existing algorithms, including the Particle Swarm Optimization (PSO) algorithm. Additionally, the paper discusses the importance of adaptive controllers in addressing issues associated with incorrect PID controller selection and highlights the benefits of using the FA-GA in energy optimization and comfort improvement. Overall, the proposed model offers an effective solution for efficient energy consumption optimization and enhanced user comfort in diverse settings through the integration of advanced algorithms and optimization modules.

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

With the engineering system becoming more and more complex, the uncertainty factors have a more and more profound influence on the reliability and security of the engineering system. In recent years, Reliability-Based Design Optimization (RBDO) has been studied extensively in complex engineering system design. The research on reliability optimization design considering stochastic uncertainty has been comprehensive and widely used. However, the reliability optimization design considering mixed uncertainty has the disadvantages of large computation and imprecise convergence. This study proposes an RBDO method based on Particle Swarm Optimization (PSO) and Simulated Annealing (SA) to overcome this challenge. In the method, PSO is used to solve the most probable point, while SA has excellent global optimization capability to acquire the global optimal solution. Finally, three examples are given to illustrate the advantages of the proposed method.

In this study, a design of Morlet wavelet neural networks (MWNNs) is presented to solve the prediction differential model (PDM) using the global approximation capability of genetic algorithm (GA) and local quick interior-point algorithm scheme (IPAS), i.e., MWNN-GAIPAS. The famous PDM is known as a variant of functional differential system that works as an opposite of the historical delay differential models. A fitness function is optimized using the mean square error by applying the GA-IPAS for solving the PDM. Three PDM examples have been presented numerically to check the authenticity of the MWNN-GAIPAS. For the perfection of the designed MWNN-GAIPAS, the comparability of the obtained results and exact results is performed. Moreover, the neuron analysis is performed by taking the 3, 10 and 20 number of neurons. The statistical observations have been performed to authenticate the reliability of the MWNN-GAIPAS for solving the PDM.

When implementing SVMs, two major problems are encountered: (a) the number of local minima increases exponentially with the number of samples and (b) the quantity of required computer storage, required for a regular quadratic programming solver, increases by an exponential mag-nitude as the problem size expands. The Kernel-Adatron family of algorithms gaining attention lately which has allowed it to handle very large classification and regression problems. Howev-er, these methods treat different types of samples (Noise, border, and core) in the same manner, which causes searches in unpromising areas and increases the number of iterations. In this work, we introduce a hybrid method to overcome these shortcomings, namely Optimal Recurrent Neu-ral Network Density Based Support Vector Machine (Opt-RNN-DBSVM). This method consists of four steps: (a) characterization of different samples, (b) elimination of samples with a low probability of being a support vector, (c) construction of an appropriate recurrent neural network based on an original energy function, and (d) solution of the system of differential equations, managing the dynamics of the RNN, using the Euler-Cauchy method involving an optimal time step. The RNN remembers the regions explored during the search process thanks to its recurrent architecture. We demonstrated that RNN-SVM converges to feasible support vectors and Opt-RNN-DBSVM has a very low time complexity compared to RNN-SVM with constant time step, and KAs-SVM. Several experiments were performed on academic data sets. We used several classification performances measures to compare Opt-RNN-DBSVM to different classification methods and the results obtained show the good performance of the proposed method.

The agricultural sector in Palestine has a significant role in its economy. However, the production of this sector is affected by different kinds of plant diseases, specifically leaf diseases. Automatic agricultural leaf disease detection is essential for the early diagnosis and controls the overall health of fields. Image segmentation techniques, clustering, and deep learning are often used to detect diseased leaves. This study proposes a novel hybrid approach based on image classification. The hybrid approach combines the k-means clustering algorithm with Convolutional Neural Network (CNN), where k-means is used to detect the leaf’s infected area, then CNN is used for specifying the disease. We used the PlantVillage dataset for experimental verification as it contains several crops with different kinds of challenging diseases. We also examined the selection of optimal k-value using the Silhouette coefficient, Elbow method, and Kneedle Algorithm. The Silhouette technique was analyzed using three distance metrics; Euclidean, Manhattan, and Cosine. Its scores for the three-distance metrics were low, near-zero, and failed to produce the optimum k value. Besides, the Elbow method was complicated to use in image segmentation in terms of executing and visualizing the k value in its graph plot. Based on verification results, the Kneedle Algorithm produced better results in the consistency of choosing the optimal k value and showed superiority over other approaches. Therefore, the processed images were segmented with the k-means clustering algorithm with a Kneedle algorithm-based k value. Finally, a Convolutional Neural Network (CNN) is trained to classify the type of disease based on analyzing and testing leaf images. The hybrid model achieved high accuracy of 93.79% in disease identification, confirming the proposed model’s robustness.

In this study, the resource blocks (RB) are allocated to user equipment (UE) according to the evolutional algorithms for long term evolution (LTE) systems. Particle Swarm Optimization (PSO) algorithm is one of the evolutionary algorithms, based on the imitation of a flock of birds foraging behavior through learning and grouping the best experience. In previous work, the Simple Particle Swarm Optimization (SPSO) algorithm was proposed for RB allocation to enhance the throughput of Device-to-Device (D2D) communications and improve the system capacity performance. In simulation results, with less population size of M = 10, the SPSO can perform quickly convergence to sub-optimal solution in the 100^th generation and obtained sub-optimum performance with more 2 UEs than the Rand method. Genetic algorithm (GA) is one of the evolutionary algorithms, based on Darwinian models of natural selection and evolution. Therefore, we further proposed a Refined PSO (RPSO) and a novel GA to enhance the throughput of UEs and to improve the system capacity performance. Simulation results show that the proposed GA with 100 populations, in 200 generations can converge to suboptimal solutions. Therefore, with comparing with the SPSO algorithm the proposed GA and RPSO can improve system capacity performance with 1.8 and 0.4 UEs, respectively.

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

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

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 work addresses the energy-based source localization problem in wireless sensors networks. Instead of circumventing the maximum likelihood (ML) problem by applying convex relaxations and approximations (like all existing approaches do), we here tackle it directly by the use of metaheuristics. To the best of our knowledge, this is the first time that metaheuristics is applied to this type of problems. More specifically an elephant herding optimization (EHO) algorithm is applied. Through extensive simulations, the key parameters of the EHO algorithm are optimized such that they match the energy decay model between two sensor nodes. A detailed analysis of the computational complexity is presented, as well as performance comparison between the proposed algorithm and existing non-metaheuristic ones. Simulation results show that the new approach significantly outperforms the existing solutions in noisy environments, encouraging further improvement and testing of metaheuristic methods.

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.

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.

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

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

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 increase in life expectancy, according to the World Health Organization, is a fact, and with it rises the incidence of age-related neurodegenerative diseases. The most recurrent symptoms are those associated with tremors resulting from Parkinson's Disease (PD) or Essential Tremors (ET). The main alternatives for the treatment of these patients are medication and surgical intervention, which sometimes have restrictions and side effects. Through computer simulations in Matlab software, this work investigates the performance of adaptive algorithms based on least mean squares (LMS) to suppress tremors in upper limbs, especially in the hands. The signals resulting from pathological hand tremors, related to PD, present components at frequencies that vary between 3~Hz and 6~Hz, with the more significant energy present in the fundamental and second harmonics, while physiological hand tremors, referred to as ET, vary between 4~Hz and 12~Hz. We simulated and used these signals as reference signals in adaptive algorithms, Filtered-x Least Mean Square (Fx-LMS), Filtered-x Normalized Least Mean Square (Fx-NLMS), and a hybrid Fx-LMS\&NLMS purpose. Our results showed that the vibration control provided by the Fx-LMS\&LMS algorithm is the most suitable for physiological tremors. For pathological tremors, we have used a proposed algorithm with a filtered sinusoidal input signal, Fsinx-LMS, which presented the best results in this specific case.

The prediction of capacity degradation, and more generally of the behaviors related to battery aging, is useful in the design and use phases of a battery to help improve the efficiency and reliability of energy systems. In this paper, a stochastic model for the prediction of battery cell degradation is presented. The proposed model takes its cue from an approach based on Markov chains, although it is not comparable to a Markov process, as the transition probabilities vary as the number of cycles that the cell has performed varies. The proposed model can reproduce the abrupt decrease in the capacity that occurs near the end of life condition (80% of the nominal value of the capacity) for the cells analyzed. Furthermore, we illustrate the ability of this model to predict the capacity trend for a lithium-ion cell with nickel-manganese-cobalt (NMC) at the cathode and graphite at the anode subjected to a life cycle in which there are different aging factors, using the results obtained for cells subjected to single aging factors.

The paper proves that an odd composite integer $N$ can be factorized in at most $O( 0.125u(log_2N)^2)$ searching steps if $N$ has a divisor of the form $2^a{u} +1$ or $2^a{u}-1$ with $a > 1$ being a positive integer and $u > 1$ being an odd integer. Theorems and corollaries are proved with detail mathematical reasoning. Algorithms to factorize the kind of odd composite integers are designed and tested by factoring certain Fermat numbers. The results in the paper are helpful to factorize the related kind of odd integers as well as some big Fermat numbers

Directional Modulation (DM) technique, as an emerging promising approach to secure wireless communications, has been attracting increasing attention for its unique characteristic in the past decade. The baseband signal is synthesized at the antenna level for maintaining the standard constellation format along the prescribed direction(s) while simultaneously distorting the signal constellations in other undesired directions. In this paper, we present a novel DM signal synthesis method based on phased array using a hybrid genetic algorithm (GA) and particle swarm optimization (PSO) algorithm, which takes advantages of both GA and PSO algorithm. Then, the bit error rate of the proposed method is analyzed and simulated. Simulation results are presented to verify that the proposed DM signal have a narrower information beam-width. Therefore, it can offer a better physical layer security (PLS) performance compared with the conventional directional modulation signal.

AIUS (Atmospheric Infrared Ultraspectral Sounder) is an infrared occultation spectrometer onboard the Chinese GaoFen-5 satellite, which covers a spectral range of 2.4--13.3 μm (750--4100 cm-1) with a spectral resolution of about 0.02 cm-1. AIUS was designed to measure and to study chemical processes of ozone (O3) and other trace gases in the upper troposphere and stratosphere over Antarctic. In this study, the corresponding retrieval methodology is described. The comparison between AIUS measurements and simulated spectra illustrates that AIUS measurements agree well to the simulated spectra. To first evaluate the reliability of our retrieval algorithm, three retrieval O3 experiments are performed based on ACE-FTS observation spectra. A comparison between our retrieved profiles and the ACE-FTS official products shows that the relative difference of these three retrieval experiments is mostly within 10% between 20 km and 70 km. These retrieval experiments demonstrate that the retrieval algorithm described in this study work fine and reliable. Furthermore, O3, H2O and HCl profiles are retrieved from eight orbits of AIUS measurements and compared with the official AURA/MLS level-2 v4.2 profiles. Comparison experiments show that the relative difference is mostly within 10% (about 0.02 - 0.4 ppm) between 18 and 58 km for O3 retrieval, within 10% (0-0.5 ppm) between 15 and 80 km for H2O retrieval, and within 10% (about 0.1 ppb) between 30 and 60 km for HCl retrieval. There is a good agreement in the retrieved trace gas profiles obtained from AIUS and from coincident profiles from MLS.

AIUS (Atmospheric Infrared Ultraspectral Sounder) is an infrared occultation spectrometer onboard the Chinese GaoFen-5 satellite, which covers a spectral range of 2.4–13.3 μm (750–4100 cm⁻¹) with a spectral resolution of about 0.02 cm⁻¹. AIUS is designed to measure and study chemical processes of ozone (O₃) and other trace gases in the upper troposphere and stratosphere around Antarctic. In this study, the corresponding retrieval methodology is described. The retrieval simulations based on the simulated spectra of AIUS have been carried out, with a focus on O₃. The relative difference between the retrieved and the true O₃ profiles is within 5% from the 15 km to 70 km and about 10% below 15 km. The corresponding averaging kernels illustrate that the overall retrieval information mainly come from the spectra, not the a priori. The retrieval experiments also demonstrate that the shape of the retrieved profiles resembles the shape of the true profile even if the shape of the a priori profile is different from that of the true profile. Further, we perform the O₃ retrieval from the real ACE-FTS (Atmospheric Chemistry Experiment-Fourier Transform Spectrometer) measurements and compare the results with the official ACE-FTS Level-2 products. Overall, both profiles agree well in the stratosphere where the retrieval sensitivity is high. The relative difference between both profiles is about 15% below 70 km, which may due to the measurement errors and different forward model parameters.

In this brief paper a quantum algorithm to calculate the Hamming distance of two binary strings of equal length (or messages in theory information) is presented. The algorithm calculates the Hamming weight of two binary strings in one query of an oracle. To calculate the hamming distance of these two strings we only have to calculate the Hamming weight of the xor operation of both strings. To test the algorithms the quantum computer prototype that IBM has given open access to on the cloud has been used to test the results.

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.

In the research we consider a structure-fluid interaction of oscillating piezodevice and acoustic liquid. Such problem requires finding resonance or anti-resonance frequencies of the solid structure to use them in the latter frequency-response analyses step. After finite element discretization of the issue, we need to solve a generalized eigenvalue problem (GEP). The most efficient numerical method for solving the partial GEP is the shift-and-invert Lanczos method. Each step of this algorithm requires solving a large scale system of linear algebraic equations (SLAEs) with special properties. Various ways of ordering grid nodes lead to coefficient matrices with different structure. Several methods are compared in terms of efficiency. The results of the numerical experiments are presented.

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

This research emphasizes a meta-heuristic Modified Ant Lion Optimizer (MALO) optimization approach for simultaneous utilization of DSTATCOM devices and distributed Photovoltaic (PV) sources with network reconfiguration in a radial power distribution scheme. In a radial power distribution network with network reconfiguration majority of the research is based on Constant Power model analysis. However, it is noticed that load models have a substantial impact on the distributed PV sources and the D-STATCOM device's optimal size and position. The effect of the Constant Power (CP) and Polynomial (ZIP) with load growth load models for the simultaneous insertion of distributed PV sources and DSTATCOM devices with network reconfiguration examined in this research work for power system planning. The penetration levels of distributed PV sources considered for the investigation are 25%, 50%, 75%, and 100%. The principal objective of this research is to reduce network total power losses, enhance the voltage magnitude profile at all buses, and reduce the overall operating cost while adhering to equality and inequality constraints. The proposed algorithm verified on 118-node test systems. The investigation is carried out for planning network upgradation to a High Voltage Distribution System(HVDS) on 317 nodes in the rural Bangalore Electricity Supply Company Limited(BESCOM) radial distribution scheme. Simulated results obtained by this method are validated with the BAT algorithm and available techniques in the literature.

Background: ChatGPT is becoming a new reality. Where do we go from here? Objective: to show how we can distinguish ChatGPT-generated publications from counterparts produced by scientist. Methods:By means of a new algorithm, called xFakeBibs, we show the significant difference between ChatGPT-generated fake publications and real publications. Specifically, we triggered ChatGPT to generate 100 publications that were related to Alzheimer’s disease and comorbidity. Using TF-IDF, using the real publications, we constructed a training network of bigrams comprised of 100 publications. Using 10-folds of 100 publications each, we also 10 calibrating networks to derive lower/upper bounds for classifying articles as real or fake. The final step was to test xFakeBibs against each of the ChatGPT-generated articles and predict its class. The algorithm successfully assigned the POSITIVE label for real ones and NEGATIVE for fake ones. Results: When comparing the bigrams of the training set against all the other 10 calibrating folds, we found that the similarities fluctuated between (19%-21%). On the other hand, the mere bigram similarity from the ChatGPT was only (8%). Additionally, when testing how the various bigrams generated from the calibrating 10-folds against ChatGPT we found that all 10 calibrating folds contributed (51%-70%) of new bigrams, while ChatGPT contributed only 23%, which is less than 50% of any of the other 10 calibrating folds. The final classification results using the xFakeBibs set a lower/upper bound of (21.96-24.93) number of new edges to the training mode without contributing new nodes. Using this calibration range, the algorithm predicted 98 of the 100 publications as fake, while 2 articles failed the test and were classified as real publications. Conclusions: This work provided clear evidence of how to distinguish, in bulk ChatGPT-generated fake publications from real publications. Also, we also introduced an algorithmic approach that detected fake articles with a high degree of accuracy. However, it remains challenging to detect all fake records. ChatGPT may seem to be a useful tool, but it certainly presents a threat to our authentic knowledge and real science. This work is indeed a step in the right direction to counter fake science and misinformation.

There are two reasons to have an efficient algorithm for identifying all maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all maximal Lyndon substrings of the input string, and secondly, Franek et al. showed in 2017 a linear equivalence of sorting suffixes and sorting maximal Lyndon substrings of a string, inspired by a novel suffix sorting algorithm of Baier. In 2016, Franek et al. presented a brief overview of algorithms for computing the Lyndon array that encodes the knowledge of maximal Lyndon substrings of the input string. Among the presented were two well-known algorithms for computing the Lyndon array: a quadratic in-place algorithm based on iterated Duval's algorithm for Lyndon factorization, and a linear algorithmic scheme based on linear suffix sorting, computing inverse suffix array, and applying to it the Next Smaller Value algorithm. Duval's algorithm works for strings over any ordered alphabet, while for linear suffix sorting, a constant or an integer alphabet is required. The authors at that time were not aware of Baier's algorithm. In 2017, our research group proposed a novel algorithm for the Lyndon array. Though the proposed algorithm is linear in the average case and has O(n log(n)) worst-case complexity, it is interesting as it emulates the fast Fourier algorithm's recursive approach and introduces tau-reduction that might be of independent interest. In 2018, we presented a linear algorithm to compute the Lyndon array of a string inspired by Phase I of Baier's algorithm for suffix sorting. This paper presents theoretical analysis of these two algorithms and provides empirical comparisons of both their C++ implementations with respect to iterated Duval's algorithm.

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.

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.

Expectation maximization (EM) algorithm is a powerful mathematical tool for estimating statistical parameter when data sample contains hidden part and observed part. EM is applied to learn finite mixture model in which the whole distribution of observed variable is average sum of partial distributions. Coverage ratio of every partial distribution is specified by the probability of hidden variable. An application of mixture model is soft clustering in which cluster is modeled by hidden variable whereas each data point can be assigned to more than one cluster and degree of such assignment is represented by the probability of hidden variable. However, such probability in traditional mixture model is simplified as a parameter, which can cause loss of valuable information. Therefore, in this research I propose a so-called conditional mixture model (CMM) in which the probability of hidden variable is modeled as a full probabilistic density function (PDF) that owns individual parameter. CMM aims to extend mixture model. I also propose an application of CMM which is called adaptive regressive model (ARM). Traditional regression model is effective when data sample is scattered equally. If data points are grouped into clusters, regression model tries to learn a unified regression function which goes through all data points. Obviously, such unified function is not effective to evaluate response variable based on grouped data points. The concept “adaptive” of ARM means that ARM solves the ineffectiveness problem by selecting the best cluster of data points firstly and then evaluating response variable within such best cluster. In order words, ARM reduces estimation space of regression model so as to gain high accuracy in calculation.

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

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.

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.

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.

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.

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.

In order to conduct an accurate classification of the heterogeneous landscape in Jiului Valley, Romania mining basing, four machine learning algorithms (SVMs) and two common algorithms (MLC and MD) have been compared, using a temporal series of Landsat satellite images from the period 1988-2017. By using independent validation, an accuracy assessment was established together with the analysis of the differences between the classification algorithms used. Although all six algorithms used have shown a high overall accuracy (ranging from 80.29% to 93.14%) and Kappa values (from 0.77 to 0.92), SVM-RBF appears to have a higher overall applicability in describing the spatial distribution and the cover density of each land cover category. Results have indicated a large difference in classification accuracy between the SVM-RBF algorithm and commonly used algorithms, the SVM-RBF algorithms have slightly outperformed the MLC with an overall accuracy of 7.14–8.86% and by 0.0833–0.1033 kappa coefficient. On the other hand, the same algorithm have outperformed the MD by and overall accuracy of 9.71–10.86% and by 0.1133–0.1267 kappa coefficient. By using SVM-RBF, certain classified maps have been developed and used for assessing changes by post classification comparison. The results have shown an average growth of 6.5% in mined areas over the studied period.

The article presents a hybrid method for calculating the chemical composition of steel with the required hardness after cooling from the austenitizing temperature. Artificial neural networks and genetic algorithms were used to develop the model. Based on 550 diagrams of continuous cooling transformation (CCT) of structural steels available in the literature, a dataset of experimental data was created. Artificial neural networks were used to develop a hardness model describing the relationship between the chemical composition of the steel, the austenitizing temperature, and the hardness of the steel after cooling. A genetic algorithm was used to identify the chemical composition of the steel with the required hardness. The value of the objective function was calculated using the neural network model. The developed method for identifying the chemical composition was implemented in a computer application. Examples of calculations of mass concentrations of steel elements with the required hardness after cooling from the austenitizing temperature are presented. The model proposed in this study can be a valuable tool to support chemical composition design by reducing the number of experiments and minimizing research costs.

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.

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.