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.

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

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

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

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.

Wind power is one of the most important sources of renewable energy available today. A large part of the wind energy cost is due to the cost of maintaining wind power equipment. When a wind turbine component fails to function, it might need to be replaced under the less than ideal circumstances. This is known as corrective maintenance. To minimize unnecessary costs, a more active maintenance policy based on the life expectancy of the key components is preferred. Optimal scheduling of preventive maintenance activities requires advanced mathematical modeling. In this paper, an optimal preventive maintenance algorithm is designed using the renewal-reward theorem. In the multi-component setting, our approach involves a new idea of virtual maintenance which allows us to treat each replacement event as a renewal event even if some components are not replaced by new ones. The proposed optimization algorithm is applied to a four-component model of a wind turbine and the optimal maintenance plans are computed for various initial conditions. The modeling results showed clearly the benefit of PM planning compared to pure CM strategy (about 30% lower maintenance cost).

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.

Pattern recognition techniques form the heart of most, if not all, incoherent linear shift-invariant systems. When an object is recorded using a camera, the object information gets sampled by the point spread function (PSF) of the system, replacing every object point with the PSF in the sensor. The PSF is a sharp Kronecker Delta-like function when the numerical aperture (NA) is large with no aberrations. When the NA is small, and the system has aberrations, the PSF appears blurred. In the above case, if the PSF is known, then the object information can be obtained by scanning the PSF over the recorded object intensity pattern and looking for pattern matching conditions through a mathematical process called correlation. In this study, a recently developed deconvolution method, the Lucy-Richardson-Rosen algorithm (LR2A), has been implemented to computationally refocus images recorded in the presence of spatio-spectral aberrations. The performance of LR2A was compared against the Lucy-Richardson algorithm and non-linear reconstruction. LR2A exhibits a superior deconvolution capability even in extreme cases of spatio-spectral aberrations and blur. Experimental results of deblurring a picture captured using high-resolution smartphone cameras are presented. LR2A was implemented to significantly improve the performances of the widely used deep convolutional neural networks for image classification.

By the study of the pattern book Ying Zao Fa Shi (building regulations of Song Dynasty, 1103 AD), while analyzing the combining and dimensioning rule of timber framework and tile work, a model self-generating program has been compiled for the first time. The operating framework has been firstly defined, while solving the issues of clustering principle, connecting method, output classification, etc. with the detailed description of algorithm theory. Taking the corner bracket set and nine-ridge roof for example, after the compilation and debug by Grasshopper, according to various input parameters, various models have been generated automatically by the plugin, proving the velocity and the veracity of the algorithm.

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

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

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

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.

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

Online reinforcement learning (RL) algorithms are increasingly used to personalize digital interventions in the fields of mobile health and online education. Common challenges in designing and testing an RL algorithm in these settings include ensuring the RL algorithm can learn and run stably under real-time constraints, and accounting for the complexity of the environment, e.g., a lack of accurate mechanistic models for the user dynamics. To guide how one can tackle these challenges, we extend the PCS (Predictability, Computability, Stability) framework, a data science framework that incorporates best practices from machine learning and statistics in supervised learning (Yu and Kumbier, 2020), to the design of RL algorithms for the digital interventions setting. Further, we provide guidelines on how to design simulation environments, a crucial tool for evaluating RL candidate algorithms using the PCS framework. We illustrate the use of the PCS framework for designing an RL algorithm for Oralytics, a mobile health study aiming to improve users' tooth-brushing behaviors through the personalized delivery of intervention messages. Oralytics will go into the field in late 2022.

Election Algorithm (EA) is a powerful metaheuristics model motivated by phenomena of the socio-political mechanism of the presidential election conducted in many countries. EA is selected as a topic of discussion due to its capability and robustness to carry out complex problems in the random-2SAT logic program. This paper utilizes a hybridized EA assimilated with the Hopfield neural network (HNN) in carrying out random logic program (HNN-R2SATEA). The efficiency of the proposed method was compared with the existing traditional exhaustive search (HNN-R2SATES) model and the recently introduced HNN-R2SATICA model. From the result obtained, clearly proven that based on our proposed hybrid model outperformed other existing model based on the Global Minima Ratio (ZM), Mean Absolute Error (MAE), Bayesian Information Criterion (BIC) and Execution Time (ET). The expected outcome portrays that the EA algorithm outperformed the other two algorithms in doing random-kSAT logic program. The results proved the robustness, effectiveness, and compatibility of the HNN-R2SATEA model.

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

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

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

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.

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.

Traveling salesman problems (TSPs) are well-known combinatorial optimization problems, and most existing algorithms are challenging for solving TSPs when its scale is large. To improve the efficiency of solving large-scale TSPs, this work presents a novel adaptive layered clustering framework with improved genetic algorithm (ALC\_IGA). The primary idea behind ALC\_IGA is to break down a large-scale problem into a series of small-scale problems. First, the $k$-means and improved genetic algorithm are used to segment the large-scale TSPs layer by layer and generate the initial solution. Then, the developed two phases simplified $2$-opt algorithm is applied to further improve the quality of the initial solution. The analysis reveals that the computational complexity of the ALC\_IGA is between $O(n\log n)$ and $O(n^2)$. The results of numerical experiments on various TSP instances indicate that, in most situations, the ALC\_IGA surpasses the state-of-the-art algorithms in convergence speed, stability, and solution quality. Specifically, the ALC\_IGA can solve instances with $2 \times 10^5$ nodes within 0.15h, $1.4 \times 10^6$ nodes within 1h, and $2 \times 10^6$ nodes in three dimensions within 1.5h.

Grape dehydration is practiced widely in the food industry with large yields of sultanas produced globally. This paper proposes an investigation into grape microstructure changes as it is dried by imaging specimens at intervals during dehydration at two temperatures using scanning electron microscopy. Detailed images of the microstructure were obtained, and a unique image processing algorithm was developed to quantitatively analyse the properties of this microstructure. Two main methods were developed to obtain the complex boundaries of cells present in the grape tissue in over 36 SEM images. Segmentation of the binary image using an adapted watershed function obtained the most consistent and accurate morphological shape. This was compared to a secondary method which used Canny’s edge detection function, morphological closing and skeletonizing to outlines the cellular microstructure. MATLAB was utilised to convert these boundaries into measurable areas so that quantitative data on average cell area, perimeter and cell axis lengths was acquired. It was found that over drying time cell area and perimeter reduced as expected. Some variability in the data was clear due to only single samples being analysed for each temperature and time combination. The development of automatic image processing techniques will enable quantitative data to be extracted from these images. Trends in cell perimeter, diameter and shape will be used to demonstrate relationships between morphological structure, drying temperature, and duration.

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.

Hand gesture recognition has many valuable applications in engineering and health care. This study proposes a novel model which can accurately distinguish hand gestures using forearm muscles' surface electromyogram (sEMG) signals. A deep learning algorithm with hyper parameters impacting the final model’s accuracy and a convolutional neural network (CNN) were employed in the recognition stage. The number of convolutional layers, kernels per layer, and neurons in the dense layer were selected for optimization, while the remaining parameters, such as the learning rate, batch size, and number of epochs, were chosen based on trial and error and prior knowledge. The optimal values for the selected hyperparameters were obtained using a genetic algorithm to achieve maximum recognition accuracy. The UC2018 Dual-Myo database was used for training and testing the model based on EMG signals characterizing the activity of eight different hand gestures. The final structure of the model consisted of two convolutional layers with 131 and 28 kernels, a dense layer with 111 neurons, and a softmax layer with eight neurons. Upon optimizing the hyperparameters using the genetic algorithm, the accuracy of the proposed model increased from 91.86% to 96.4% at best and 95.3% on average in real-time applications and 99.6% in an offline mode. Future work is warranted towards improving the architecture and the computational cost.

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.

This work describes and compares the backpropagation algorithm with the Extended Kalman filter, a second-order training method which can be applied to the problem of learning neural network parameters and is known to converge in only a few iterations. The algorithms are compared with respect to their effectiveness and speed of convergence using simulated data for both, a regression and a classification task.

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.

Numerical weather prediction is an initial-value problem, for determination of the initial conditions, there are many methods and one of the most classical methods is variational methods in three dimensions, or 3D-Var. In this approach, with a defined cost function proportional to the square of the distance between the analysis and both the background and the observations, one can obtain the analysis. In the cost function, the background and the observations are reshaped to vectors; within this step, the order of the background error covariance matrix and the observational error covariance matrix becomes huge, which is not convenient to one to obtain the analysis. In this paper, according to the matrix analysis approach, we put forward some possible improvements to the dimension-reduction algorithm of 3D-Var, so that provide some references for data assimilation.

The connected vertex cover (CVC) problem is a variant of the vertex cover problem, which has many important applications, such as wireless network design, routing and wavelength assignment problem, etc. A good algorithm for the problem can help us improve engineering efficiency, cost savings and resources in industrial applications. In this work, we present an efficient algorithm GRASP-CVC (Greedy Randomized Adaptive Search Procedure for Connected Vertex Cover) for CVC in general graphs. The algorithm has two main phases, i.e., construction phase and local search phase. To construct a high quality feasible initial solution, we design a greedy function and a restricted candidate list in the construction phase. The configuration checking strategy is adopted to decrease the cycling problem in the local search phase. The experimental results demonstrate that GRASP-CVC is competitive with the other competitive algorithm, which validate the effectivity and efficiency of our GRASP-CVC solver.

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.

Anomaly Detection in real time data is accepted as a vital research area. Clustering has effectively been tried for this purpose. As the datasets are real time, the time of generating of the data is also important. In this article, we introduce a mixture of partitioning and agglomerative hierarchical approach to detect anomalies from such datasets. It is a two-phase method which follows partitioning approach first and then agglomerative hierarchical approach. The dataset can have mixed attributes. In phase-1, a unified metric defined on mixed attributes is used. The same is also used for merging of similar clusters in phase-2. Also, we have kept the track of time attribute of each data instance which produces the clusters with their lifetimes in phase-1. Then in phase-2, we merge the similar clusters. While merging, the similar clusters, the lifetimes of the corresponding clusters with overlapping cores are to be superimposed producing fuzzy time intervals. This way, each cluster will have an associated fuzzy lifetime. The data instances either belonging sparse clusters or not belonging to any of the clusters can be treated as anomalies. The efficacy of the algorithms can be established using both complexity analysis as well as experimental studies.

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.

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

High dimensional datasets are highly likely to have redundant, irrelevant, and noisy features that negatively affect the performance of the classification algorithms. Selecting the most relevant features and reducing the dimensions of datasets by removing the undesired features is a dimensional reduction technique called Feature Selection (FS). In this paper, we propose an FS approach based on the Black Hole Algorithms (BHO) with a mutation technique called MBHO. Generally, BHO contains two major phases. At the exploitation phase, a set of stars are modified based on some rule and according to some objective function, the best star is selected as the black hole which attracts other stars. Furthermore, when a star gets closer to the event horizon, it will be swallowed and a new one will be randomly generated in the search space which thus is the exploration phase. However, randomness may cause the algorithm to fall into the trap of local optima, and to overcome such complications, inversion mutation is used. Furthermore, we modify a widely utilized objective function in most of the proposed works for wrapper feature selection by combining two new terms that are based on the correlation among the selected subset of features and the features and the classification label. We also utilize a transfer function, known as the V2 transfer function, to convert continuous values into discrete ones to enhance search. We assess our approach via extensive evaluation experiments using fourteen benchmark datasets. We benchmark the performance of a wrapper FS approach called Binary Cuckoo Search (BCS), and three filter-based FS approaches (namely Mutual Information Maximisation (MIM), Joint Mutual Information (JMI), and minimum Redundancy Maximum Relevance (mRMR)). Our evaluation has shown that the proposed model is an effective approach for FS, in selecting better features that enhance the performance metrics on the classifiers. Thus, MBHO can be utilized as one alternative to the existing state-of-art-approaches. We release the source codes of our implementation for the community to build on with new methods and datasets.

Jellyfish search (JS) algorithm impersonates the foraging behavior of jellyfish in the ocean. It is a new developed meta-heuristic algorithm that solves complex and real world optimization problems. The global explore capability and robustness of JS are strong, but JS still has great development space in solving complex optimization problems with high dimensions and multiple local optima. Therefore, an enhanced jellyfish search (EJS) algorithm is developed in this study, and three improvements are made: (i) By adding sine and cosine learning factors, the jellyfish can learn from both random individual and best individual during Type B motion in swarm to enhance the optimization capability and convergence speed; (ii) Adding local escape operator can skip local optimal trap and boost the exploitation ability of JS; (iii) Opposition-based learning operator and quasi-opposition learning operator can increase and strengthen the population distribution more diversified, and better individuals are selected from present and new opposition-solution to participates in the next iteration, which can boost the solution’s quality, meanwhile convergence speed is fasted and its precision is increased. In addition, the performance contrast of the developed EJS and some previous outstanding and advanced methods are evaluated on CEC2017, CEC2019 test suite and six real engineering example of case. It is demonstrated that EJS algorithm escaped the trap of local optimum, enhanced the solution’s quality and the calculation speed. What’s more, the practical engineering applications of EJS algorithm also verify its superiority and effectiveness in solving both constrained and unconstrained optimization problems, and it stretched one’s mind for solving such optimization problems.

(1) Background Diabetic Retinopathy (DR) is the primary cause of poor vision in young adults. Screening for DR is important but many patients do not attend; (2) Methods: We validated an algorithm for predicting DR and its progression by conducting a retrospective study of 11 children in a population of 120,389 T2DM (3) Results: By applying the algorithm to the population showed an AUC of 0.93 (95% CI, 0.92–0.94) for any-DR and 0.90 (95% CI, 0.89–0.91) for referable-DR(4) Conclusions: The algorithm is useful for predicting patients who could develop referable forms of DR and also for any-DR. This would allow a personalized screening plan to be drawn up for each patient.

One of the most important sources of energy is the sun. Taiwan is located at north 22-25° latitude. Due to its proximity to the equator, it experiences only a small angle of sunlight incidence. Its unique geographical location which can obtain sustainable and stable solar resources. This study takes research on the forecast of solar radiation to maximize the benefits of solar power generation, and develops methods that can predict the future solar radiation pattern to help reduce the costs of solar power generation. This study builds supervised machine learning models, known as deep neural network (DNN) and long short-term memory neural network (LSTM). The hybrid supervised and unsupervised model, namely cluster-based artificial neural network (k-means clustering and fuzzy C-means clustering-based models), was developed. After establishing these models, the study evaluated their prediction results. For different prediction periods, the study selected the best-performing model based on the results and proposed combining them to establish a real-time updated solar radiation forecast system capable of predicting the next 12 hours. The study area covered Kaohsiung, Hualien, and Penghu in Taiwan. Data from ground stations of the Central Weather Administration, collected between 1993 and 2021, as well as the solar angle parameters of each station, were used as input data for the model. The results of this study show that different models have their advantages and disadvantages in predicting different future times. Therefore, the hybrid prediction system can predict future solar radiation more accurately than a single model.

The COVID-19 pandemic has emphasized the crucial role of ventilation systems in mitigating cross-infections, especially in infectious disease hospitals. This study introduces a dual-design operation ventilation system that can operate under two sets of ventilation conditions for normal and epidemic times. A challenge is optimizing duct diameters for required airflow while maintaining hydraulic balance. We design a genetic algorithm with adaptive penalty factor, the velocity constraint and the improved crossover and mutation probability. The improved genetic algorithm is suitable for ventilation system networks, which can find a better air duct diameters combination to improve the hydraulic balance rate, and reduce the usage of air valves, resulting in efficient hydraulic balancing commissioning. Compared with the traditional genetic algorithm, it has a faster search speed and a better global search ability, which is effective for the optimal design of ventilation system networks.

This article presents a method that uses a semi-automatic algorithm for the detection and analysis of microcracks in steel test specimens using binarized image analysis. It obtains the length along the crack path in contrast to previous methods that have obtained linear length, thereby achieving a closer approximation to its actual value. Additionally, this method automatically calculates the COD and COA parameters with measurement deviations in micrometres, thus providing greater precision than previous methods proposed to date.

This study is focused on an optimal sizing method based on genetic algorithms (GA) in order to design a high-performance photovoltaic system that would be installed in the Alioune Diop University of Bambey, Senegal. The multi-objective optimization allowed us to find a better trade- off between the Total Life Cycle cost (TLCC) and the Loss of Power Supply Probability (LPSP). The goal is to minimize the TLCC while maintaining a good satisfactory of the system with a desired LPSP, under certain constraints. The expressions of the TLCC and the LPSP are established according to the total photovoltaic energy and the battery capacity. The toolbox of Matlab software is used to implement the optimization problem with twelve blocks of the site and its different corresponding loads. The obtained results have led to a several combinations of the photovoltaic and battery capacities of which the best one is selected based on the lowest LPSP, that guaranteed a better load coverage during the night. The results of this proposed method are compared with intuitive method that has been firstly applied. For the block with the lowest load demand, the proposed optimization model leads to a reduction a reduction of 70% and 48% in the storage capacity and the TLCC respectively for a LPSP of 0.007 %.

Consensus algorithms are the core technology of blockchain and a focus in the current distributed system research. The consensus algorithms are widely used in distributed systems, it has solved the decentralization problem. The traditional consensus algorithm needs the process of node legitimacy checking, identity authentication, and primary node view change, so the time cost of reaching an agreement between nodes is still exponential. In response to the problem, a lightweight consensus algorithm based on graph (LCAG) is proposed for the Internet of Things (IoT) in this paper, which is proposes an access control table, and reaches an agreement among nodes by calculating the probability of nodes in the control table, and reduces the time overhead of the reaching an agreement in distributed systems. We have carried out simulation experiments for the new algorithm, and the experiments show that: the new algorithm needs less time overhead than the classical Byzantine algorithm need, as well as Byzantine Generals problem (BGP), practical Byzantine fault-tolerant algorithm (PBFT) and directed acyclic graph (DAG) algorithm, and so on. The new algorithm can be applied to the devices of IoT, which have limited computing power.

The volume of vehicular traffic in large cities has increased in recent years, the devices that collect vehicular GPS data such as cameras, GPS receivers and others generate millions of records at every instant of time generating problems in processing and storage of these data which becomes important for researchers. Intelligent Transportation Systems perform vehicle monitoring and control by collecting GPS trajectories, this large volume of information is necessary to have an optimal storage process. Its processing by means of compression techniques and simplification algorithms allow to reduce the necessary storage space. This paper presents a GPS trajectory simplification algorithm that considers noise reduction, point simplification and analysis of road network information. The results obtained on two data sets from the cities of California and Beijing are satisfactory, achieving a higher compression ratio without affecting data quality

The aim of this review was to summarize the available literature regarding resident and medical student education utilizing the spaced repetition program Anki. This review enables current residents and medical students to recognize and utilize evidence-proven study techniques to increase learning efficacy. A systemic review of papers across all medical journals available on Pubmed was conducted to identify studies published without time constraints. The search was for (Anki) and (spaced repetition residency). Available outcome data was collected and discussed independently for students and residents. Many studies showed a statistically significant increase in exam performance associated with Anki use and high levels of satisfaction among residents and medical students. Further research is warranted to provide high-quality evidence of Anki’s applications and there is a need for exploration in additional residency specialties. Anki use has steadily increased with both medical students and residents. The application demonstrated consistent improvement on exam-based performance and was regarded highly by users. As burnout and time constrictions threaten educational workflow, Anki may serve as a powerful tool to improve the quality of learning. Further data needs to be collected and analyzed in specialties where Anki use may already exist.

The deployment of a Static Synchronous Compensator within a microgrid can facilitate voltage and reactive power regulation, leading to enhanced stability and reliability. Within a microgrid setting, a STATCOM can effectively balance power supply and demand, and mitigate voltage fluctuations caused by the intermittent nature of renewable energy sources. To ensure the successful integration of a STATCOM within a microgrid, coordinating the control system with other Distributed Energy Resources, especially when multiple control strategies are employed, can be a challenging task. Therefore, a meticulously designed control system is indispensable to guarantee the microgrid’s efficient and effective operation. The use of GA in LSTM tuning can accelerate the process of finding optimal hyperparameters for a specific task, obviating the necessity for time-consuming and computationally expensive grid search or manual tuning. This method can be particularly advantageous when handling large data sets and complex models. In this paper, an attempt has been made to model the STATCOM to communicate with the microgrid tuned using LSTM-GA for effective calculation of real and reactive power support during grid disturbances.

In this study, Acısu Basin, which is upper side of one of the most important basins (Gediz) in Türkiye, was modelled using three types of hydrological models and three different calibration algorithms. Lumped (GR4J), semi-distributed (SWAT+), and fully distributed (mHM) hydrological models were built and integrated with Parameter Estimation Tool (PEST) which is a model independent calibration tool including various algorithms. Levenberg Marquardt (L-M), Shuffled Complex Evolution (SCE), and Covariance Matrix Adoption Evolution Strategy (CMA-ES) were selected as calibration algorithms. Calibration period was 1991-2000, and validation results were obtained for 2002-2005. The effect of model structure and calibration algorithm selection on discharge simulation was evaluated via comparison of 9 different model-algorithm combinations. Results have shown that mHM and CMA-ES combination showed the best discharge simulation performance according to NSE values (calibration: 0.67, validation: 0.60). Although statistically the model results were classified as acceptable, the pattern comparison of discharge value shows that all of the models miss the peak values in significant amounts. This problem may be related to the interventions made in 2000-2001 years interval and possible to overcome by changing the calibration and validation periods, increasing the number of iterations or using the naturalized gauge data.

Water distribution networks are vital infrastructure, needed for providing consumers with sufficient water of appropriate quality. The cost of construction, operation, and maintenance of such networks is extremely large. The problem of optimization of a water distribution network is governed by the type of water distribution network and the size of pipelines placed in the distribution network. This problem of the optimal diameter allocation of pipes in a distribution network has been heavily researched over the past few decades. This study describes the development of a computer program, ‘Smart Optimization Program for Water Distribution Networks’ (SOP–WDN), which applies Genetic Algorithm to the problem of the least-cost design of water distribution networks. SOP–WDN demonstrates the application of an evolutionary optimization technique, Genetic Algorithm, linked with a hydraulic simulation solver EPANET, for the optimal design of water distribution networks. The developed program was applied to three benchmark water distribution network optimization problems and produced consistently good results. SOP–WDN can be utilized as a tool for guiding engineers during the design and rehabilitation of water distribution pipelines.

This paper describes a polynomial time algorithm for solving graph isomorphism and automorphism. We introduce a new tree data structure called Walk Length Tree. We show that such tree can be both constructed and compared with another in polynomial time. We prove that graph isomorphism and automorphism can be solved in polynomial time using Walk Length Trees.

Understanding the function of a locus is a challenge in molecular biology. Although numerous molecular data have been generated in the last decades, it remains difficult to grasp, how these data are related at a locus? In this study, we describe an analytical workflow that can solve this problem using the knowledge available at single-nucleotide polymorphisms (SNPs) level. The underlying algorithm uses SNPs as connectors to link omics data and identify correlation between them through a joint bioinformatical/statistical approach. We describe its application in finding the mechanism whereby a mutation causes a phenotype and in revealing the path whereby a gene is being regulated and impacts the phenotypes. We translated our workflow into freely available shell scripts that carry out the analyses. Our approach provides a basic framework to solve the information overload problem in biology.

Histamine intolerance is defined as disequilibrium of accumulated histamine and the capacity for histamine degradation. This clinical term addresses a non-immunologically mediated pathology when histamine ingested with food is not particularly high, but its degradation is decreased. Clinical picture of histamine intolerance in children is similar to that observed in adults apart from male predominance found in paediatric patients. Both in children and adults, histamine-free diet seems to be the treatment of choice. Diamine oxidase supplementation offers another treatment option. There is no symptom and\or test pathognomonic for histamine intolerance. Nevertheless, manifestations of chronic gastrointestinal symptoms, measurement of diamine oxidase deficits, positive results of histamine provocation tests and improvement of symptoms with histamine-free diet greatly increase the probability of histamine intolerance diagnosis. These factors have been included in the proposed in this paper diagnostic algorithm for histamine intolerance. In children histamine intolerance probably co-occur with allergies and bowel diseases, which creates an additional diagnostic challenge. As the evidence for children is weak, further research is needed the establish epidemiology, validate diagnostic algorithms and establish possible treatment options regarding histamine intolerance.

Multi-objective optimization (MOO) is the subset of optimization which deals with minimization of several objective functions more than the conventional one objective optimization. These have useful application in decision making. Many of the current methodologies addresses challenges and solutions to multi-objective optimization problem which attempt to simultaneously solve several objectives with multiple constraints subjoined to each objective. Such as evolutionary algorithm, genetic algorithm, flower pollination algorithm, and many more. However, most challenges in MOO are generally subjected to linear inequality constraints that prevent all objectives from being optimized at once. This paper discusses some approaches presented by scholars in MOO and then presents some new concepts by introducing methods in solving problem in MOO which comes due to periodical objectives that do not stay for the entire duration of process life time unlike permanent objectives which are optimized once for the entire process life time. A methodology based on partial optimization which optimizes each objective iteratively and weight convergence method which optimizes sub-group of objectives is given. Furthermore, another methods is introduced which involve objective classification ranking, estimation and prediction where objectives are classified base on their properties, and rank using a given criteria and in addition estimated for its optimal weight point if it certifies a coveted optimal weight point. Then finally predicted to find how much it deviates from the estimated point.

Drying food involves complex physical atmospheric mechanisms with non-linear relations from the air-food interactions and those relations are strongly dependent on the moisture contents and the type of food. Such dependence makes it complex to design suitable dryers dedicated to a single drying process. To streamline the design of a novel compact food-drying machine, a heat pump dryer component design optimization algorithm was developed as a subprogram of a Computer Aided Engineering tool. The algorithm requires inputting food and air properties, the volume of the drying container and the technical specifications of the heat-pump off-the shelf components. The heat required to dehumidify the food supplied by the heat exchange process from condenser to evaporator, and the compressor’s requirements (refrigerant mass flow rate and operating pressures) are then calculated. Compressors can then be selected based in the volume and type of food to be dried. The algorithm is shown via a flow chart to guide the user through 3 different stages: Changes in drying air properties, Heat flow within dryer and Product moisture content. Example results of how different compressors are selected for different type of produces and quantities (Agaricus Blazei mushroom with 3 different moisture contents or fish from Thunnini tribe) conclude this article.

A finite-difference approach with non-uniform meshes was presented for simulating magnetotelluric responses in 2D structures. We presented the formulation of this scheme and gave some sights into its successful implementation, and compared finite-difference solution with known numerical results and simple analytical solutions. First, a homogeneous half-space model was tested and the finite-difference approach can provide very good accuracy for 2D magnetotelluric modeling. Then we compared to the analytical solutions for the two-layered model, the relative errors of the apparent resistivity and the impedance phase were both increased when the frequency was increased. In the end, we compare our finite-difference simulation results with COMMEMI 2D-0 model with the finite-element solutions. Both results are in close agreement to each other. These comparisons confirm the validity and reliability of our finite-difference algorithm.

Low-Level Virtual Machine (LLVM) compiler infrastructure is a useful tool for building Just-in-time (JIT) compilers, besides its reliable front-end represented by clang compiler and its elaborated middle-end containing different optimizations that improve the runtime performance. This paper addresses specifically the part of building a JIT compiler using LLVM with the scope of getting the hardware architecture details of the underlying machine such as the number of cores and the number of logical cores per processing unit and providing them to NUMA-BTLP static thread classification algorithm and to NUMA-BTDM static thread mapping algorithm. Afterwards, the hardware-aware algorithms are run by the JIT compiler within an optimization pass. JIT compiler in this paper is designed to run on a parallel C/C++ application (which creates threads using Pthreads), before the first time the application is executed on a machine. To do that, the JIT compiler takes the native code of the application, gets the corresponding LLVM IR (Intermediate Representation) for the native code and executes the hardware-aware thread classification and the thread mapping algorithms on the IR. The NUMA-Balanced Task and Loop Parallelism (NUMA-BTLP) and NUMA-Balanced Thread and Data Mapping (NUMA-BTDM) are expected to optimize the energy consumption up to 15%, on NUMA systems.

The service conditions of underground coal mine equipment are poor, and it is difficult to accurately extract the fault characteristics of rolling bearings. In order to better improve the accuracy of fault identification of rolling bearings, a fault detection method based on multiscale permutation entropy and SOA-SVM is proposed. First, the whale optimization algorithm is used to select the modal analysis number K and the penalty factor α of the variational mode decomposition algorithm. Then, the vibration signal of rolling bearings is dissolved according to the optimized variational mode decomposition algorithm, and the multi-scale permutation entropy of the main intrinsic mode function is calculated. Finally, the feature values of the matrix are entered into the SVM algorithm optimized by the seagull optimization algorithm to obtain the classification result. The experimental results based on the published rolling bearing datasets of Western Reserve University show that the identification success rate of the proposed method can reach 98.75%. The fault detection of the rolling bearings can be completed accurately and efficiently.

The greenhouse gases and air pollution generated by extensive energy use have exacerbated climate change. An electric-bus (e-bus) transportation system favors reducing pollution and carbon emissions. This study analyzed the minimization of construction costs for an all battery-swapping public e-bus transportation system. A simulation was conducted according to existing timetables and routes. Daytime charging was incorporated during the hours of operation; the two parameters of the daytime charging scheme were the residual battery capacity and battery-charging energy during various intervals of daytime peak electricity hours. The parameters were optimized using three algorithms: particle swarm optimization (PSO), a genetic algorithm (GA), and a PSO–GA. This study observed the effects of optimization on cost changes (e.g., number of e-buses, on-board battery capacity, number of extra batteries, charging facilities, and energy consumption) and compared the plug-in and battery-swapping e-bus systems. The results revealed that daytime charging can reduce the construction costs of both systems. In contrast to the other two algorithms, the PSO–GA yielded the most favorable optimization results for the charging scheme. Finally, according to the cases investigated and the parameters of this study, the construction cost of the plug-in e-bus system was lower than that of the battery-swapping e-bus system.

A novel metaheuristic optimization method is proposed based on an earthquake that is a geology phenomenon. The novel Earthquake Algorithm (EA) proposed, adapts the principle of propagation of geology waves P and S through the earth material composed by random density to ensure the dynamic balance between exploration and exploitation, in order to reach the best solution to optimization complex problems by searching for the optimum into the search space. The performance and validation of the EA are compared against the Bat Algorithm (BA) and the Particle Swarm Optimization (PSO) by using 10 diverse benchmark functions. In addition, an experimental engineering application is implemented to evaluate the proposed algorithm. Early results show a feasibility of the proposed method with a clearly constancy and stability. It is important highlight the fact that the main purpose of this paper is to present a new line of research, which is opened from the novel EA.

The aviation industry has proposed multiple solutions to reduce fuel consumption, air pollution and noise at airports, one of which involves deploying electric trucks for aircraft towing between the stand and the runway. However, the introduction of tow trucks results in increased surface traffic, posing challenges from the perspective of Air Traffic Controller's (ATCO). Various solutions involving automated planning and execution have been proposed, but many are constrained by their inability to manage multiple active runways simultaneously, and their failure to account for tow truck battery state-of-charge during assignments. This paper presents a novel system for taxi operations that employs autonomous tow trucks to enhance ground operations and address deficiencies in existing approaches. The system focuses on identifying conflict-free solutions that minimize taxi-related delays and route length while maximising the efficient use of the tow trucks. The algorithm operates at a strategic level and uses a centralised approach. It has the capacity to cater for multiple active runways and considers factors such as tow truck battery state-of-charge and availability of charging stations. Furthermore, the proposed algorithm is capable of scheduling and routing tow trucks for aircraft taxiing without generating traffic conflicts.

The last-mile logistics in cities have become an indispensable part of the urban logistics system. This study aims to explore the effective selection of last-mile logistics nodes to enhance the efficiency of logistics distribution, strengthen the corporate distribution image, and further reduce corporate operating costs and alleviate urban traffic congestion. This paper proposes a clustering-based approach to identify urban logistics nodes from the perspective of geographic information fusion. This method comprehensively considers several key indicators, including the coverage, balance, and urban traffic conditions of logistics distribution. Additionally, we employed a greedy algorithm to identify secondary nodes around primary nodes, thus constructing an effective nodal network. To verify the practicality of this model, we conducted an empirical simulation study using the logistics demand and traffic conditions in the Xianlin District of Nanjing. This research not only identified the locations of primary and secondary logistics nodes but also provided a new perspective for constructing the urban last-mile logistics system, enriching the academic research related to logistics node construction. The results of this study are of significant theoretical and practical importance for optimizing urban logistics networks, enhancing logistics efficiency, and promoting the improvement of urban traffic conditions.

In the moist environment of soil-water-air, there is a problem of low accuracy in monitoring Volatile Organic Compounds (VOCs) using a Photoionization Detector (PID). This paper analyzes the reasons for the low accuracy of the traditional Support Vector Machine (SVM) regression method. To address the issue, the PID signal is subjected to feature extraction and Principal Component Analysis (PCA) to reduce the data dimensionality. Moreover, the optimal SVM parameters are selected using a Genetic Algorithm (GA), and a combined approach of SVM regression with PCA and GA is utilized for PID signal regression analysis. And the effectiveness of the method is validated through extensive experiments and simulations. Furthermore, the influence of the sample quantity on the regression accuracy is analyzed, enabling accurate monitoring of VOCs concentration in a moist environment.

The algorithmic complexity vulnerability (ACV) that may lead to denial of service attacks greatly disrupts the security and availability of applications, and due to the widespread use of third-party libraries, its impact may be amplified through the software supply chain. The existing work in the field is dedicated to abstract loop or iterative patterns and fuzzing the entire application to discover algorithm complexity vulnerabilities, but they still face efficiency and effectiveness issues. Our research focuses on: (1) Proposing a representation and extraction method for code features related to algorithmic complexity vulnerabilities, helping analysts quickly understand program logic; (2) Providing a new ACV detecting model, focusing on the spatial complexity anomalies caused by deep recursion structures, and proposing a new filtering method; (3) Aiming at the difficulty of efficiently generating complex-data-type-related payloads using existing symbol execution techniques, a call-chain-guided payload construction method is proposed. We tested third-party components in the open-source Java Maven Repository, identified many unexposed vulnerabilities and 8 of them received CVE (Common Vulnerabilities &amp; Exposures) identifiers, and demonstrated that our method can discover more algorithmic complexity vulnerabilities compared to existing tools with better performance.

An addition sequence is an important operation in many applications of computer science, such as multi-modular exponentiation and outsourcing protocols. Finding an addition sequence for a set of positive integers with the shortest length is challenging due to the high computational time required to find the solution. In this paper, a new metaheuristic algorithm is designed based on the simulated annealing strategy to generate a short addition sequence. The efficiency of the proposed algorithm was proved experimentally by comparing it with the previous exact and heuristic algorithms in terms of running time and the length of the addition sequence.

Predicting and evaluating the vitality level of public spaces of urban design is crucial before new construction and renewal, especially for developing countries, to avoid failures like "ghost neighborhood" and reduce resource waste. However, existing assessment methods for the urban vitality are either static and ignore changes in the time dimension, or rely on historical big data and are unable to predict unbuilt projects. This study combines previous methods and crowds’ characteristics observation in public space, puts forward the crowd-frequency hypothesis and constructs an algorithm, and establishes a time-dimensional urban vitality dynamic prediction model. Taking the Rundle Mall neighborhood in Adelaide, Australia, as an example, the effec-tiveness of the prediction model was proved through on-site observation sampling comparative verification method. In addition, the decision tree model was used to conduct machine learning on the case data, and a set of algorithm programs were obtained that can directly input some basic information to obtain the urban vitality level (high-medium-low) in a certain period. It can be used as a tool to support the design and decision-making processes of urban planners and government officials, providing a low-cost way to achieve sustainable urban vitality construction of late-developing cities directly.

This paper details a design optimization on a hardware accelerator for an on-board real-time SAR imaging system using the Backprojection algorithm, focusing on algorithm-specific approximations intended to reduce the overhead introduced by intensive functions such as the square root, sine, and cosine functions. The main novelty of this work is that new approximations were investigated so that the final image retains high quality regardless of the error in the approximation function. This paper revisits existing approximation methods, such as linear interpolation, polynomial approximation using the Vandermonde matrix, and Chebyshev polynomials, and compares their performance on the algorithm. Results demonstrate that it is possible to maintain the image quality with an SSIM above 0.99 with less 93% LUTs for the square root and less 88% LUTs for the sine and cosine functions using polynomial approximation with the Vandermonde matrix when compared to the HLS baseline functions.

In recent years, ozone (O3) pollution has been rapidly spreading, restricting further improvement of air quality in China. Investigating the interaction of O3 concentration and identifying their driven cities are important for the prevention and control of O3 pollution in China. However, the complex interaction between O3 pollution between the cities and their driven cities has not yet been revealed. In this study, we address this gap based on complex network methods. Specifically, an ozone relational network is constructed using an association calculation method. The driven nodes and spatial clusters were analyzed based on the maximum matching algorithm and the Louvain algorithm. The findings of the study reveal an aggregation phenomenon in the ozone network concerning distance. Furthermore, as the threshold Tc varies, the proportion of driven nodes exhibits a positive correlation. Moreover, a closer threshold value corresponds to a higher coincidence ratio of the driven nodes. The results provide scientific guidance for national O3 pollution prevention and regional synergy formatting. Furthermore, the introduced network-based approaches offer a mythological framework for the study of air pollution in key cities and clusters.

Software-Defined Networking (SDN) is a network implementation paradigm of great importance, as it has a profound impact on the pace of technological progress. While SDN doesn’t directly address the technical complexities of routing, congestion control, traffic engineering, security, mobility, reliability, or real-time communication, it paves the way for innovative solutions to emerge for these and similar challenges. Security is of utmost importance in SDN with Distributed Denial of Service (DDoS) being an attack which creates large scale problems. DDoS creates malicious traffic that resembles normal traffic in order to create service problems. As such, mechanisms that distinguish between benign and malicious traffic is essential, since this is the first step to mitigate the problem of DDoS. In this paper, we take a dataset onboard which exhibits benign and malicious traffic in SDN. There are 23 features that are used for classification purposes. Here we utilise classification procedure based on three methods based Grammatical Evolution applied on the aforementioned data. We provide results that show the efficiency of our approach and show that all three methods exhibits satisfactory results.

Camera malfunctions or loss of storage elements in imaging devices may lead to loss of important image information or random impulse noise interference. Low rank is one of the important prior information in image optimization processing. This paper uses different low-rank constraint models of the image matrices to recover the impulse interference satellite images. Firstly, an overview of image inpainting models based on nuclear norm, truncated nuclear norm, weighted nuclear norm, and matrix-factorization-based F-norm is presented, and corresponding optimiza-tion iterative algorithms are provided. Then, we conducted experiments under three types of pulse interference and provided visual and numerical results. Finally, it is concluded that the WSVT_ADMM method based on the weighted nuclear norm can obtain the best image inpainting results; The UV_ADMM method based on F norm of matrix factorization has the least computa-tion time and can be used for large-scale low-rank matrix computation; The WSVT_ADMM method based on weighted nuclear norm and the TSVT_ ADMM method based on truncated nuclear norms can significantly improve the repair effect compared to the nuclear norm-based methods such as SVT, SVP, and n_ADMM.

Premature ventricular complexes (PVCs) are frequently encountered in clinical practice. The association of PVCs with adverse cardiovascular outcomes in the context of structural heart disease is well established, yet the association between PVCs and cardiovascular outcomes in the absence of structural heart disease is not fully elucidated. Cardiac magnetic resonance (CMR) seems to contribute prognostically in the latter subgroup. PVC- induced myocardial dysfunction refers to the impairment of ventricular function due to the PVCs and is mainly associated with a PVC burden greater than 10%. The surface 12- lead ECG is used to localize the anatomic site of origin and multiple algorithms have been developed to differentiate right ventricular and left ventricular outflow tract (RVOT and LVOT, respectively) origin. Novel algorithms include alternative ECG configurations and lately, sophisticated artificial intelligence methods have been utilized to distinguish the origins of outflow tract arrhythmias. The decision to therapeutically address PVCs should be taken upon the presence of symptoms or the development of PVC- induced myocardial dysfunction. The therapeutic modalities include pharmacological therapy, namely I-C antiarrhythmic drugs and beta blockers, as well as catheter ablation, which demonstrates superior efficacy and safety.

Accurate and reliable measurement of real-world walking activity is clinically relevant, particularly for people with mobility difficulties. Insights on walking can help understand mobility function, disease progression, and fall risks. People living in long-term residential care environments have heterogeneous and often pathological walking patterns, making it difficult for conventional algorithms paired with wearable sensors to detect their walking activity. We designed two walking bout detection algorithms for people living in long-term residential care. Both algorithms used thresholds on the magnitude of acceleration from a 3-axis accelerometer on the lower back to classify data as “walking” or “non-walking”. One algorithm had generic thresholds, while the other used personalized thresholds. To validate and evaluate the algorithms, we compared the classifications of walking/non-walking from our algorithms to the real-time research assistant annotated labels and the classification from an algorithm validated on a healthy population. Both the generic and personalized algorithms had acceptable accuracy (0.83 and 0.82 respectively). The personalized algorithm showed the highest specificity (0.84) of all tested algorithms, meaning it was the best suited to determine input data for gait characteristic extraction. The developed algorithms were almost 60% quicker than the previously developed algorithms, suggesting they are adaptable for real-time processing.

Although ChatGPT promises wide-ranging applications, there is a concern that it is politically biased; in particular, it has a left-libertarian orientation. Nevertheless, in light of recent trends in attempts to reduce such biases, this study re-evaluated the political biases of ChatGPT using political orientation tests and the application programming interface. Moreover, the effects of the languages used in the system as well as gender and race settings were evaluated. The results indicated that ChatGPT had less political bias than previously thought; however, they did not entirely discount the political bias. The languages used in the system and the gender and race settings may induce political biases. These findings enhance our understanding of the political biases of ChatGPT and may be useful for bias evaluation and designing ChatGPT’s operational strategy.

This paper outlines the detection procedure of intrusion as provided by Tripwire tool along-with the enhancement to be made in design and implementation to achieve the optimum performance level of Tripwire. It operates on effective and swift performance mechanism in order to report the system admin about the possible intrusion detected in the system with security assurance in cutting edge computer structures, which is very important in order to provide the integrity and reliability of information. In order to deal with this emerging issue in the historical research, the basic level of security is provided in the system by making enhancement in the existing tripwire tool for UNIX file system. The proposed methodological working of tripwire makes it more effective by adopting reliable and instantaneous mechanism to deal with specifically anomalies and unwanted access in the UNIX file system.

In this work we derive a generalized series expansion of the acrtangent function by using the enhanced midpoint integration (EMI). Algorithmic implementation of the generalized series expansion utilizes a simple two-step iteration. This approach significantly improves the convergence and requires no surd numbers in computation of the arctangent function.

The development of quantum computers seeks software developers' attention regarding security in the era of Information Technology, software security is the primary goal for our quantitative assessment of software security in the development cycle of software. Security assessment of software is identifying the key security factors of the software. A security elective provides ex-tensive strategies and calculations to ensure product safety. The security assessment is the key factor in surveying, administering, and controlling security to further enhance the nature of safety. It should be acknowledged that assessing security early on in the development process is beneficial in identifying worms, hazards, flaws, and threats. The definition and portrayal of Quantum Computing (QC) in software security will be discussed in this study. Researchers use cryptography calculations to secure our financial institutions, medical devices, military weaponry, planes, ships, vehicles, and pilots. Here authors of this study use the Fuzzy Technique for Order Preference by Similarity to Ideal Situation (FTOPSIS) to quantitatively assess the weight/rank of the quantum enable security alternatives like (Diffie-Hellman key-exchange algorithm, Quantum key distribution algorithm, Deutsch-Jozsa Algorithm, Special Deutsch-Jozsa Algorithm, Grover’s Algorithm and Quantum key distribution algorithm in GHZ state) with security factors like (Confidentiality, Integrity, Authenti-cation, Privacy, Reliability, Maintainability, Authorization, Integrity, Possessions, and Availability). Additionally, they critically analyze and select the six alternatives of quantum-based security algorithms. The nature of safety infers the ability to execute a thing on time in this exploration study, specifically 'software security'.

Stop words are very important for information retrieval and text analysis investigation. This study aimed to automatically analyze and detect stop words in texts in the Uzbek language. Because of the limited availability of methods for automatic search of stop words of texts in Uzbek we analyzed a newly prepared corpus. The Uzbek language belongs to the family of agglutinative languages. As with all agglutinative languages, we can explain that the detection of stop words in Uzbek texts is a more complex process than in inflected languages: In inflected languages, words such as auxiliary words, articles, prepositions can be included in the stop words group. In agglutinative languages, the meanings of such words are hidden in the text. Therefore, it is not appropriate to apply all known methods of stop words detection in inflected languages directly to agglutinative languages. In this work, the “School corpus” which contains 731156 Uzbek words has been investigated. The bigram method of analysis was applied to the corpus. We proposed the collocation method of detecting stop words of the corpus. We proposed the method of automatically detecting stop words of texts in Uzbek. It is shown that the collocation method is 6 times better than the bigram method.

In industrial environments, nesting consists in cutting or extracting pieces from a material sheet, with the purpose of minimizing the surface of the sheet used. This problem is present in different types of industries, such as shipping, aeronautics, woodworking, footwear, and so on. In this work, the aim is to find an acceptable solution to solve complex nesting problems. The research developed is oriented to sacrifice accuracy for speed so as to obtain robust solutions in less computational time. To achieve this, a greedy method and a genetic algorithm have been implemented, being the latter responsible for generating a sequence for the placement of the pieces, where each piece is placed in its current optimal position with the help of a representation system for both the pieces and the material sheet.

A graph based path planning method consisting of off-line part and on-line part for multi-UAV system in windy condition is proposed. In the off-line part, the task area is divided into grids. When two nodes is close enough, they are connected and weighted by the cost, obtained by solving an optimization problem based on difference method, between them. In order to ensure the accuracy of the difference method, the adjacent radius is set to be small enough. In order to ensure the generated paths close to analytical solution, the grid size is set to be much smaller than the adjacent radius. The shortest path algorithm is used to update the adjacent matrix and path matrix. In the on-line part, the target position assignment and optimal velocity can be obtained by accessing the adjacent matrix and path matrix. At the end of this paper, some numerical examples are taken to illustrate the validity of our method and the influence of the parameters.

model checking techniques are often used for the verification of software systems. Such techniques are accompanied with several advantages. However, state space explosion is one of the drawbacks to model checking. During recent years, several methods have been proposed based on evolutionary and meta-heuristic algorithms to solve this problem. In this paper, a hybrid approach is presented to cope with the SSE problem in model checking of systems modeled by GTS with an ample state space. Most of existence proposed methods that aim to verify systems are applied to detect deadlocks by graph transformations. The proposed approach is based on the fuzzy genetic algorithm and is designed to decline the safety property by verifying the reachability property and detecting deadlocks. In this solution, the state space of the system is searched by a fuzzy genetic algorithm to find the state in which the specified property is refuted/verified. To implement and evaluate the suggested approach, GROOVE is used as a powerful designing and model checking toolset in GTS. The experimental results indicate that the presented hybrid fuzzy method improves speed and performance by comparing other techniques

The reinforcement learning problem of complex action control in the Multi-player wargame is a hot research topic in recent years. In this paper , a game system based on turn-based confrontation is designed and implemented with the state-of-the-art deep reinforcement learning models. Specifically, we first design a Q-learning algorithm to achieve intelligent decision-making, which is based the DQN(Deep Q Network) to model the complex game behaviors. Then, a priori- knowledge based algorithm PK-DQN(Prior Knowledge- Deep Q Network) is introduced to improve the DQN algorithm, which accelerates the convergence speed and stability of the algorithm. The experiments demonstrate, the correctness of the PK-DQN algorithm is validated and its performance surpass the conventional DQN algorithm. Furthermore, the PK-DQN algorithm shows effectiveness in defeating the high level of rule-based opponents, which provides promising results for the exploration of the field of smart chess and intelligent game deduction.

Nowadays genetic algorithm (GA) is greatly used in engineering pedagogy as an adaptive technique to learn and solve complex problems and issues. It is a meta-heuristic approach that is used to solve hybrid computation challenges. GA utilizes selection, crossover, and mutation operators to effectively manage the searching system strategy. This algorithm is derived from natural selection and genetics concepts. GA is an intelligent use of random search supported with historical data to contribute the search in an area of the improved outcome within a coverage framework. Such algorithms are widely used for maintaining high-quality reactions to optimize issues and problems investigation. These techniques are recognized to be somewhat of a statistical investigation process to search for a suitable solution or prevent an accurate strategy for challenges in optimization or searches. These techniques have been produced from natural selection or genetics principles. For random testing, historical information is provided with intelligent enslavement to continue moving the search out from the area of improved features for processing of the outcomes. It is a category of heuristics of evolutionary history using behavioral science-influenced methods like an annuity, gene, preference, or combination (sometimes refers to as hybridization). This method seemed to be a valuable tool to find solutions for problems optimization. In this paper, the author has explored the GAs, its role in engineering pedagogies, and the emerging areas where it is using, and its implementation.

For a positive integer k, a radio k-coloring of a simple connected graph G = (V (G), E(G)) is a mapping | f(u) - f(v)| ≥ k +1-d (u , v ) such that f :V (G)→{0,1, 2,...} for each pair of distinct vertices u and v of G, where d(u, v) is the distance between u and v in G. The span of a radio k-coloring f, rck(f), is the maximum integer it assigns to some vertex of G. The radio k-chromatic number, rck(G) of G is min{rck(f)}, where the minimum is taken over all radio k-colorings f of G. If k is the diameter of G, then rck(G) is known as the radio number of G. In this work, we propose four algorithms (two serial algorithms and their parallel versions) which related to the radio k-coloring problem. One of them is an approximate algorithm that determines an upper bound of the radio number of a given graph. The other is an exact algorithm which finds the radio number of a graph G. The approximate algorithm is a polynomial time algorithm while the exact algorithm is an exponential time algorithm. The parallel algorithms are parallelized using the Message Passing Interface (MPI) standard. The experimental results prove the ability of the proposed algorithms to achieve a speedup 7 for 8 processors.

In this paper, we proposed a high accurate and stable Legendre transform algorithm which can reduce the potential instability for very high order at a very small increase in the computational time. The error analysis of interpolative decomposition for Legendre transform is presented. By employing block partitioning of Legendre-Vandermonde matrix and butterfly algorithm, a new Legendre transform algorithm with computational complexity O(N(logN)^2/loglogN) in theory and less than O(N(logN)^4) in practical application is obtained. Numerical results are provided to demonstrate the efficiency and numerical stability of the new algorithm.

Lightning discharges in electric power networks generate voltage and current surges that are propagated through the electrical network causing damage and shutdowns in the electrical system. To protect the system against these phenomena, surge arresters are very effective and widely used by electrical utilities in their electric grids. This paper presents a methodology for optimized surge arrester allocation based on genetic algorithm (GA), creating a simulation environment in the software ATP (Alternative Transients Program) to implement the proposed methodology. The optimized allocation procedure is based on a fitness function that minimizes the cost of surge arresters and maximizes the number of protected equipment. To carry out this optimized arrester allocation procedure using ATP may demand too much processing time when running large distribution grids. To overcome this difficulty a procedure is proposed to obtain an overvoltage severity description of the grid and select the most critical electric nodes for the incidence of lightning discharges, in the GA allocation procedure. The case study is applied to the IEEE 123-bus electrical feeder to demonstrate the effectiveness of the proposed methodology.

In this paper, a thermodynamic investigation is done on a Kalina-flash cycle. This work is initially validated with the Kalina cycle power plant, Wich is commissioned in Husavic. Low-temperature Kalina-flash is considered for this study. This cycle is working with the ammonia-water mixture. The Kalina-flash cycle was optimized in the view of exergy and thermal efficiency. A multi-objective genetic algorithm is used to accomplish optimization. The optimum values of the objective functions are observed to be 40.20 and 11.70% respectively. At last, The influence of the separator inlet dryness fraction, basic ammonia mass fraction, temperature and flash pressure ratio on the first and second law efficiencies are analysed.

Despite the number of studies on bankruptcy prediction using financial ratios, very little is known about how external audit information can contribute to anticipating financial distress. A handful of papers show that a combination of ratios and audit data can provide significant predictive purposes, but a recent paper by Muñoz-Izquierdo et al. (2018) provided an 80% predictive accuracy solely by using the disclosures of audit reports. We complement this study. Applying an artificial intelligence method (the PART algorithm), we examine the predictive ability of more easily extracted information from the report and suggest a practical implication for each user. Simply by (1) finding the audit opinion, (2) identifying if a matter section exist, (3) and the number of comments disclosed, then any user may predict a bankruptcy situation with the same accuracy as if they had scrutinised the whole report. In addition, we also provide an extended literature review about previous studies on the interaction between bankruptcy prediction and the external audit information.

Nipah virus (NiV) is responsible to cause various outbreaks in Asian countries, with latest from Kerala state of India. Till date there is no drug available despite its urgent requirement. In the current study, we have provided a computational one-stop solution for NiV inhibitors. We have developed “anti-Nipah” web resource, which comprised of a data repository, prediction method, and data visualization modules. The database comprised of 313 (181 unique) inhibitors from different strains and outbreaks of NiV extracted from research articles and patents. However, the quantitative structure–activity relationship (QSAR) based predictors were accomplished using classification approach employing 10-fold cross validation through support vector machine with 120 (68p + 52n) inhibitors. The overall predictor showed the accuracy and Matthew’s correlation coefficient of 88.89% and 0.77 on training/testing dataset respectively. The independent validation dataset also performed equally well. The data visualization modules from chemical clustering and principal component analyses displayed the diversity in the NiV inhibitors. Therefore, our web platform would be of immense help to the researchers working in developing effective inhibitors against NiV. The user-friendly webserver is freely available on URL: http://bioinfo.imtech.res.in/manojk/antinipah/

The resource allocation for tasks in heterogeneous distributed system is a well known NP-hard problem. For the sake of making the makespan is minimized, it is hard to distribute the tasks to proper processors. The problem is even more complex and challenging when the processors have unavailable time and the tasks type are various. This paper investigates a resource allocation problem for hybrid tasks comprising both divisible and bag-of-tasks(BoT) in heterogeneous distributed system when the processors has unavailable time. First, the mathematical model, which minimizes the makespan of the hybrid tasks when the processors have unavailable time, is established. Second, we propose a scheduling algorithm referred to as bag-of-tasks allocate-pull and divisible task allocation (BoTAPDTA) algorithm for handling hybrid tasks on heterogeneous distributed systems. In addition, to solving the optimization model efficiently, a generic algorithm(GA) is proposed. For the sake of reducing the search space and solving the optimization model effectively, a two step scheduling algorithm(TSGA), which first allocate bag-of-tasks(BoT) using generic algorithm and then assign divisible task to processors like BoTAPDTA, is designed. Finally, numerical simulation experiments are conducted, and experimental results indicate the effectiveness of the proposed model and algorithm.

PEM fuel cell is a technology successfully used in the production of energy from hydrogen, allowing the use of hydrogen as an energy vector. It is scalable for stationary and mobile applications. However, the technology demands more research. An important research topic is fault diagnosis and condition monitoring to improve the life and the efficiency and to reduce the operation costs of PEMFC devices. Consequently, there is a need of physical models that let deep analysis. These models must be accurate enough to represent the PEMFC behavior and to allow the identification of different internal signals of a PEM fuel cell. This work presents a PEM fuel cell model that uses the output temperature in a closed loop, so it can represent the thermal and the electrical behavior. The model is used to represent a NEXA Ballard 1.2 kW; therefore it is necessary to fit the coefficients to represent the real behavior. Five optimization algorithms were tested to fit the model, three of them were taken from literature and two were proposed. Finally, the model with the parameters identified was validated with real.

Reservoirs are recognized as one of the most efficient infrastructure components in integrated water resources management and development. At present, with the ongoing advancement of social economy and requirement of water, the water resources shortage problem has worsened, and the operation of reservoirs, in terms of consumption of flood water, has become significantly important. Reservoirs perform both regulation of flood and integrated water resources management, in which the flood limited water level is considered as the most important parameter for trade-off between regulation of flood and conservation. To achieve optimal operating policies for reservoirs, large numbers of simulation and optimization models have been developed in the course of recent decades, which vary notably in their applications and working. Since each model has their own limitations, the determination of fitting model for derivation of reservoir operating policies is challenging and most often there is always a scope for further improvement as the selection of model depends on availability of data. Subsequently, assessment and evaluation associated with the operation of reservoir stays conventional. In the present study, the Soil and Water Assessment Tool (SWAT) models and a Genetic Algorithm model has been developed and applied to two reservoirs in Ganga River basin, India to derive the optimal operational policies. The objective function is set to minimize the annual sum of squared deviation form desired irrigation release and desired storage volume. The decision variables are release for irrigation and other demands (industrial and municipal demands), from the reservoir. As a result, a simulation-based optimization model was recommended for optimal reservoir operation, such as allocation of water, flood regulation, hydropower generation, irrigation demands and navigation and e-flows using a definite combination of decision variables. Since the rule curves are derived through random search it is found that the releases are same as that of demand requirements. Hence based on simulated result, in the present case study it is concluded that GA-derived policies are promising and competitive and can be effectively used operation of the reservoir.

The traditional sequent peak algorithm (SPA) was used to assess the reservoir volume (VR) for comparison with deficit volume, DT, (subscript T representing the return period) obtained from the drought magnitude (DM) based method with draft level set at the mean annual flow on 15 rivers across Canada. At an annual scale, the SPA based estimates were found to be larger with an average of nearly 70% compared to DM based estimates. To ramp up DM based estimates to be in parity with SPA based values, the analysis was carried out through the counting and the analytical procedures involving only the annual SHI (standardized hydrological index, i.e. standardized values of annual flows) sequences. It was found that MA2 or MA3 (moving average of 2 or 3 consecutive values) of SHI sequences were required to match the counted values of DT to VR. Further, the inclusion of mean, as well as the variance of the drought intensity in the analytical procedure, with aforesaid smoothing led DT comparable to VR. The distinctive point in the DM based method is that no assumption is necessary such as the reservoir being full at the beginning of the analysis - as is the case with SPA.

Clock Network Design (CDN) is a critical step while designing any Integrated-Circuits (ICs). It holds vital importance in the performance of entire circuit. Due to continuous scaling, 3D ICs stacked with TSV are gaining importance, with an objective to continue with the Moore's law. Through-Silicon-Via (TSV) provides the vertical interconnection between two die, which allows the electrical signal to flow through it. 3D ICs has many advantages over conventional 2D planar ICs like reduced power, area, cost, wire-length etc. The proposed work is mainly focused on power reduction and obstacle avoidance for 3D ICs. Various techniques have already been introduced for minimizing clock power within specified clock constraints of the 3D CND network. Proposed 3D Clock Tree Synthesis (CTS) is a combination of various algorithms with an objective to meet reduction in power as well as avoidance of obstacle or blockages while routing the clock signal from one sink to other sink. These blockages like RAM, ROM, PLL etc. are fixed during the placement process. The work is carried out mainly in three steps- first is Generation of 3D Clock tree avoiding the blockages, then Buffering and Embedding and finally validating the results by SPICE simulation. The experimental result shows that our CTS approach results in significant 9% reduction in power as compare to the existing work.

Opportunistic networks, an evolution of mobile Ad Hoc networks (MANETs), offer decentralized communication without relying on preinstalled infrastructure, enabling nodes to route packets through different mobile nodes dynamically. However, due to the absence of complete paths and rapidly changing connectivity, routing in opportunistic networks presents unique challenges. This paper proposes a novel probabilistic routing model for opportunistic networks, leveraging nodes' meeting probabilities to route packets towards their destinations. The model dynamically builds routes based on the likelihood of encountering the destination node, considering factors such as last meeting time and acknowledgment tables to manage network overload. Additionally, an efficient message detection scheme is introduced to alleviate high overhead by selectively deleting messages from buffers during congestion. Furthermore, the proposed model incorporates cross-layer optimization techniques, integrating optimization strategies across multiple protocol layers to maximize energy efficiency, adaptability, and message delivery reliability. Through extensive simulations, the effectiveness of the proposed model is demonstrated, showing improved message delivery probability while maintaining reasonable overhead and latency. This research contributes to the advancement of opportunistic networks, particularly in enhancing connectivity and efficiency for Internet of Things (IoT) applications deployed in challenging environments.

Preventive Maintenance (PM) is a periodic maintenance strategy, which has great results for devices in extending their life, increasing productivity, and most importantly, help avoid unexpected breakdowns and their costly consequence. A preventive maintenance scheduling (PMS) is determining the time for carrying out PM, and it represents a sensitive issue in terms of impact on production if the time for the PM process is not optimally distributed. In this study, hybrid heuristic methods were used to solve the PMS problem, as genetic algorithm and Tabu research were adopted. The optimal solution was reached in a short time compared to previous studies in which optimal methods were used, integer programming and nonlinear integer programming. Also, sensitivity analysis was applied to measure the robustness and strength of the method used, where an optimal solution was obtained for all experiments and in record time. This method can be used for power plants in privet or public sectors, to generate an optimal PMS, to save money, and to avoid water or electricity cuts.

The construction industry has a notable negative impact on the environment; thus, the promotion of the use of timber structures is an alternative to mitigate its effects. The research develops an artificial intelligence-based decision approach in the calculation of timber structures focused on the enhancement of the sustainability of roof structures. Based on the optimization carried out through genetic algorithms and the framework established in Eurocode 5, a general set of equations has been proposed for a laminated timber roof structure. The tool, which determines the most suitable roof structure for each strength class of laminated timber, allows for the determination of the dimensions of beams and purlins and their respective separations in order to minimize wood consumption. The ultimate goal is to offer multiple solutions regarding strength classes and structural designs in order to foster informed sustainable choices that promote efficient use of resources in construction.

Developing effective trend estimators is a main method to solve the online portfolio selection problem. Although the existing portfolio strategies have demonstrated good performance through the development of various trend estimators, it is still challenging to determine in advance which estimator will yield the maximum final cumulative wealth in online portfolio selection tasks. This paper studies an online ensemble approach for online portfolio selection by leveraging the strengths of multiple trend estimators. Specifically, a return-based loss function and a cross-entropy-based loss function are first designed to evaluate the adaptiveness of different trend estimators in a financial environment. On this basis, a passive aggressive ensemble model is proposed to weigh these trend estimators within a unit simplex according to their adaptiveness. Extensive experiments are conducted on benchmark datasets from various real-world stock markets to evaluate the performance. The results show that the proposed strategy achieves the state-of-the-art performance including efficiency and cumulative return.