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

Diabetes is a serious health problem throughout the world, including in Indonesia. The International Diabetes Federation (IDF) reports that the number of adults with diabetes is increasing every year. The Behavioral Risk Factor Surveillance System (BRFSS) is a survey conducted by the Centers for Disease Control and Prevention (CDC) in the United States. Classification methods in data mining techniques are used to classify diabetics and non-diabetics. The data mining process is carried out by preprocessing, feature selection, and dataset classification stages. In the preprocessing stage, data cleaning, data formatting, and data oversampling are carried out using the Synthetic Minority Over-sampling Technique (SMOTE). Next, the feature selection stage is carried out using the Particle Swarm Optimization (PSO) algorithm to find the best attributes. The dataset classification stage is carried out using the CART Model Decision Tree algorithm. The results of the performance evaluation of the CART algorithm are calculated using the confusion matrix and the MAE value, the results obtained for the CART algorithm without SMOTE and PSO obtained the best accuracy of 75.34% and the MAE value of 0.2466, while the CART algorithm using SMOTE and PSO can increase accuracy by 10 .94% to 86.28% and an MAE value of 0.1372.

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

Nowadays, the selection of web services with uncertain quality of service (QoS) is gaining a lot of attention in the service-oriented computing paradigm (soc). In fact, searching for a service composition that fulfills a complex user’s request is known to be NP-Complete. The search time is mainly dependent on the number of the requested tasks, the size the available services, and the size of the QoS realizations (i.e., sample size). To handle this problem, we propose a two-stage approach that reduces the search space using heuristics for ranking the tasks’ services and a bat algorithm metaheuristic for selecting the final near optimal compositions. The fitness used by the metaheuristic aims to fulfill all the global constraints of the user. The experimental study shows that the ranking heuristics, termed “fuzzy pareto dominance” and "Zero-order stochastic dominance", are highly effective than the other heuristics and most of the existing state-of-the-art methods.

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

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

FACTS devices provide significance to enhance the functioning of both static and dynamic power systems. The type, size, and location of FACTS devices determine how well they achieve the goals of enhancing voltage stability, loadability, and loss minimization simultaneously. The aim of the function in this study includes voltage stability, line loadings, and loss minimization, which are expected to obtain the most benefits from their installation and other weights allocated to them. It has been determined how installing TCSC, and SVC will improve loadability under situations of continuously increasing load. In this study, a novel optimization technique known as differential evolution invasive weed optimization (DEIWO) is utilized to locate the optimal location for FACTS devices within the IEEE 14 bus system by considering valve point effects. DEIWO was a recently developed, dominant, and simple metaheuristic algorithm for genuine parameter optimization. DEIWO was inspired by the natural process of weed colonization and dissemination, and it is highly effective at addressing broad multi-dimensional, linear and nonlinear optimization problems. The proposed method was implemented in the IEEE 14 bus testing system. Different methods from the research papers have been used to compare and analyze the results. The results demonstrate the DEIWO algorithm's capability and show how it may be used in practice to locate FACTS devices in deregulated electricity networks in the most advantageous place. A comparison of the proposed process to existing algorithms found in the literature and implemented using traditional techniques reveals that it performs better in terms of precision and convergence

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.

Finding anomalies in the real-time system is recognized as one of most challenging study in information security. It has so many applications like IoT, and Stock-Market. In any IoT system the data generated are real-time, and temporal in nature. Since due to the extreme exposure to Internet and interconnectivity of devices, the IoT systems often face issues like fraud, anomalies, intrusions etc. Discovering anomaly in such domain can be interesting. Clustering and rough set theory have been tried in many cases. Considering the time-stamp associated with IoT data, time-dependent patterns like periodic clusters can be generated which could be helpful for the efficient detection of anomalies by providing more in-depth analysis of the system. In this paper, a mixed method comprising of nano topology, a modified k-means clustering and an interval superimposition technique is used for finding fuzzy periodic clusters in the subspace generated by the nano topology. For every clusters there will be an associated sequence of time-intervals where it exists. The sequence time-intervals accompanying with each clusters may exhibit some remarkable patterns. For example, there may exist different types of periodicity namely yearly, monthly, daily, and hourly etc. For finding such fuzzy periodicity, an operation called interval-superimposition has been used. The time-intervals associated with each cluster are superimposed if they have reasonable overlapping. Each superimposed time-interval generates a fuzzy time-interval. The data instances are thought to be anomalous if they either belong to sparse clusters or don't belong to any clusters. The efficacy of the method can be assessed by means of both time-complexity analysis and comparative studies with existing clustering-based anomaly detection algorithms with a real-life and a synthetic dataset. It can been found experimentally that our method can extract anomaly with 98% of accuracy and it runs cubic time approximately.

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

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

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

The corrugated board is a versatile and durable material that is widely used in the packaging industry. Its unique structure provides strength and cushioning, while its recyclability and bio-degradability make it an environmentally friendly option. The strength of corrugated board depends on many factors, including the type of individual papers on flat and corrugated layers, the geometry of the flute, temperature, humidity, etc. This paper presents a new approach to analysis geometric features of corrugated boards based on the images. It allows for precise determination of the geometry of the corrugated layer, as well as the thickness of individual papers in all cardboard layers. The experimental set used in the work and the created software are characterized by high reliability and precision of measurement thanks to the use of an identification procedure based on image analysis and evolutionary algorithms. This allows to quickly find the main geometric characteristics of the corrugated board, which in turn leads to the possibility of performing numerical analyzes taking into account the real model of the corrugated board. Calculations made on a real (correctly mapped geometrically) model allow, for example, a more reliable analysis of the composition of the cardboard, and thus also to obtain greater savings in the optimization process.

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.

Chi-squared automatic interaction detector (CHAID) algorithm is considered to be one of the mostly used supervised learning methods as it is adaptable to solving any kind of problem at hand. We have been starkly aware of CHAID maps non-linear relationships quite well, and it can empower predictive models with stability. But we don’t know how high its accuracy is precisely. To find out the perfect scope CHAID algorithm fits into, this paper presents the analysis of the accuracy of the CHAID algorithm. We introduce the causes, applicable conditions and application scope of CHAID algorithm at first, and then highlight the difference of branching principal between the CHAID algorithm and several other common decision tree algorithms, which is our first step towards basic analysis on CHAID algorithm. We next employee an actual branching case to help us understand CHAID algorithm better. Specifically, we use vehicle customer satisfaction data to compare multiple decision tree algorithms, and cite some factors that affecting the accuracy and some corresponding countermeasures which are more conducive to us to obtain accurate results. The results show that CHAID can analyze the data very well, and detect the significantly correlated factors surely. In this paper, we learn the clear information required to understand CHAID algorithm, thereby make better choices when we need to use decision tree algorithms.

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

Commercial banks usually classify customers according to their credit reports when making loans. In this study, we put our focus on classifying customers based on their credit reports from the People's Bank of China (PBC). Since there are no target labels of users in the credit report of the People's Bank of China, we put forward the fuzzy clustering method for the initial label, and then Construct ant colony search to optimize intelligent recognition. Finally, this study uses SVM, BP neural network, and random forest to classify users and compare their results. The research re-sults indicate that using ant colony clustering algorithm and random forest for classification is the most effective method with the PBC credit reports.

Since the discovery of graphene, due to its excellent optical, thermal, mechanical and electrical properties, it has a broad application prospect in energy, materials, biomedicine, electromagnetism and other fields. A great quantity of researches on the physical mechanism of graphene has been applied to engineering in electromagnetism and optics. To study the properties of graphene, different kinds of numerical methods have been developed for simulating the electromagnetic field effects of graphene, and equivalent boundary conditions have been employed to replace graphene in the computational domain. In this work, the numerical methods with equivalent boundary conditions are reviewed, and some examples are provided to illustrate their applicability.

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

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

In a complex working environment, the fault signal of the gearbox is greatly affected by the outside world, and fault feature recognition is difficult, so the fault diagnosis accuracy is difficult to meet the expected requirements. To solve this problem, this paper proposes a gearbox fault diagnosis method based on an optimized stacked denoising auto encoder (SDAE) and kernel extreme learning machine (KELM). Firstly, the Particle Swarm Optimization algorithm in Adaptive Weight (SAPSO) was adopted to optimize the SDAE network structure, and the number of hidden layer nodes, learning rate, noise addition ratio and iteration times were adaptively obtained to make SDAE obtain the best network structure. Then, the best SDAE network structure was used to extract the deep feature information of weak faults in the original signal. Finally, the extracted fault features are fed into KELM for fault classification. Experimental results show that, compared with existing commonly used methods of fault diagnosis, the fault diagnosis model proposed in this paper can reduce the influence of noise in the original signal can better learn the deep-level features in the original signal and has higher diagnosis accuracy, faster diagnosis speed and good generalization in fault diagnosis.

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

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

Distracted driving is the leading cause of accidents, the cause of these distractions may include drowsiness, using cell phone, smoking a cigarette, etc. The proposed paper aims at monitoring the attentiveness of the driver and alerting the driver when his/her alertness goes below a certain threshold. It uses image processing using OpenCV (Computer Vision) and You Look Only Once (YOLO) algorithm to detect the eyes and object respectively and sounds an alarm when the driver is either drowsy or using his cell phone or smoking a cigarette.

The high penetration of intermittence resources in the energy market accelerates significantly the decarbonization process but, on the other hand, the electrical system has to face the problem of unbalances. Renewable Energies Sources (RES) are hard to precisely forecast, and power plants are not able to predict the amount of energy that they can provide far from the real time delivery. In this frame, the intraday market gets a fundamental role allowing agents to adjust their position close to the delivery time. In this work we suggest an agent-based model of intraday market combined with genetics algorithms to understand what the best strategy could be adopted by players in order to optimize the market efficiency in terms of welfare and unsold quantity. In the first part we show the effect on the market prices of different scenarios in which players aim at maximizing their revenues and selling/buying all their volumes. In the second part we show the effect of a particular genetic algorithm on the model, focusing on how agents can adapt their strategy to enhance the market efficiency. Comparative analyses are also performed to investigate how the welfare of the system increases as well as the unsold quantity decrease when genetic algorithm is introduced

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

Optimization using Genetic Algorithms (GA) is a well-known strategy in several scientific disciplines. The crossover is an essential operator of the Genetic Algorithm. It has been an active area of research to develop sustainable forms for this operand. In this work, a new crossover operand is proposed. This operand depends on giving an elicited description for the chromosome with a new structure for alleles of the parents. It is suggested that each allele has two attitudes, one attitude differs contrastingly with the other, and both of them complement the allele. Thus, in case of one attitude is good, the other should be bad. This is suitable for many systems which contain admired parameters and unadmired parameters. The proposed crossover would improve the desired attitudes and damp the undesired attitudes. The proposed crossover can be achieved in two stages: the first stage is a mating method for both attitudes in one parent to improving one attitude at the expense of the other. The second stage comes after the first improvement stage for mating between different parents. Hence, two concurrent steps for improvement would be applied. Simulation experiments for the system shows improvement in the fitness function. The proposed crossover could be helpful in different fields, especially to optimize routing algorithms and network protocols, an application that has been tested as a case study in this work.

Continuous water resources monitoring is needed for sustainable urban water supply. Remote sensing techniques have proven useful for monitoring some water qualitative parameters with optical characteristics. The study area was the Marateca reservoir in central inland Portugal. The aims were the following: (1) to explore the water quality parameters at the monitoring points of the Marateca reservoir that may explain the event; (2) to validate optical water quality parameters with the monitoring points data; and (3) to model the reservoir water characteristics regarding its deepness, trophic state, and turbidity. The parameters total phosphorus, total nitrogen, and chlorophyll-a were used to compute a trophic level index. The Sentinel-2 imagery was used to compute spectral indices and bands image ratio; to obtain spectral signatures for the monitoring points, and to model water characteristics. The water parameters were above the recommended values at the reservoir entry point from the Ocreza River. The reservoir trophic level was Hypereutrophic and Eutrophic. The spectral signatures confirmed a Hypereutrophic pattern in the entry point. The Marateca reservoir’s water characteristics modeling forecasted problematic zones by contamination. The methodological approach developed can be easily applied to other reservoirs and is a key support tool for decision-makers.

Obstructive Sleep Apnea (OSA) is nowadays one of the respiratory pathologies with a higher in-cidence globally in developed countries. This situation led to an increase in the demand for medical appointments and diagnostic studies related to that condition, especially those based on poly-somnographies and cardiorespiratory polygraphies. These studies are limited in resources, causing long waiting lists with the subsequent impact on the patients’ health. Furthermore, it is necessary to mention that OSA’s symptomatology is not very specific, and it is typically present in the general population (excessive sleepiness, snore, etc.). In this regard, this paper proposes a novel intelligent clinical decision support system for the diagnosis of OSA which could be used to help medical teams, both in primary care settings and in units specialized in respiratory pathologies. The aim of the proposed system is to help discriminate the patients suspected of suffering from the pathology from those who are not. To this end, two types of information sets of heterogeneous nature are consid-ered. The first one encompasses objective data, related to the patient's health profile with infor-mation usually available in electronic health records. The second type comprises subjective data, referred to the symptomatology reported by the patient in a previous interview. To process the first group of information, a Machine Learning classification algorithm is used, Bagged Trees in this case. For processing the second information set, related with the symptomatology of the patient, a col-lection of expert systems based on fuzzy inferential systems arranged in cascade are employed. As a result, the system is able to determine two risk indicators related to the patient's risk of suffering from OSA: the Statistical Risk and the Symbolic Risk respectively. Subsequently, by interpreting both risk indicators mentioned it will be possible to determine the severity of the patients’ health, proposing a preliminary evaluation on their condition. For the initial tests of the system, a software artifact has been built using a dataset with 4,978 selected patients, suspected of suffering from OSA, from the Álvaro Cunqueiro Hospital in Vigo. The results obtained are promising, demonstrating the potential usefulness of this type of tools in medical diagnosis. Once the system has been validated with new data from clinical environments, it is considered as possible to obtain a relevant improvement in the quality of the healthcare services, and a reduction in the associated costs.

The article presents a new scalable iterative method for linear programming called the “apex method”. The key feature of this method is constructing a path close to optimal on the surface of the feasible region from a certain starting point to the exact solution of linear programming problem. The optimal path refers to a path of minimum length according to the Euclidean metric. The apex method is based on the predictor-corrector framework and proceeds in two stages: quest (predictor) and target (corrector). The quest stage calculates a rough initial approximation of linear programming problem. The target stage refines the initial approximation with a given precision. The main operation used in the apex method is an operation that calculates the pseudoprojection, which is a generalization of the metric projection to a convex closed set. This operation is used both in the quest stage and in the target stage. A parallel algorithm using a Fejér mapping to compute the pseudoprojection is presented. An analytical estimation of the parallelism degree of this algorithm is obtained. Also, an algorithm implementing the target stage is given. The convergence of this algorithm is proven. An experimental study of the scalability of the apex method on a cluster computing system is described. The results of applying the apex method to solve problems from the Netlib-LP repository are presented.

Machine learning (ML) is widely used in the field of crop-growing information identification based on high-resolution remote sensing images. With Baoying County in Jiangsu Province, China, as the study area, this paper used Sentinel-2 images during the winter wheat growth period to construct its spectral, textural, and topographic features during its growth period and proposes a winter wheat-growing area extraction method based on the extreme gradient boosting (XGBoost) algorithm, which was compared with traditional ML algorithms such as the support vector machine (SVM), classification and regression tree (CART), and random forest (RF) algorithms. The results indicated that (1) a winter wheat-growing area identification model based on the XGBoost algorithm was successfully constructed based on Sentinel-2 images, considering 27 spectral, textural, and topographic features; (2) the constructed model could effectively extract winter wheat in the study area with an overall accuracy of 93.43% and only a small error compared with the actual winter wheat-growing area in Baoying County, meeting the accuracy requirement for crop identification in the study area; and (3) the deep learning algorithm XGBoost outperformed the three traditional ML algorithms, among which the RF algorithm was better than the SVM and CART algorithms, both of which had poor identification performance and a large error compared with the actual growing area. This paper provides a scientific basis for the accurate extraction of winter wheat-growing areas and further research on winter wheat growth monitoring and yield estimation.

Cyber-physical security is vital for protecting key computing infrastructure against cyber attacks. Individuals, corporations, and society can all suffer considerable digital asset losses due to cyber attacks, including Data loss, theft, financial loss, reputation harm, company interruption, infrastructure damage, ransomware attacks, and espionage. A cyber-physical attack harms both digital and physical assets. Cyber-physical system security is more challenging than software-level cyber security because it requires physical inspection and monitoring. This paper proposes an innovative and effective algorithm to strengthen Cyber-Physical Security (CPS) with minimal human intervention. It is a Human Activity Recognition (HAR)-based approach where a GoogleNet-BiLSTM network hybridization has been used to recognize suspicious activities in cyber-physical infrastructure perimeter. The proposed HAR-CPS algorithm classifies suspicious activities from real-time video surveillance with an average accuracy of 73.15%. It incorporates Machine Vision at the IoT Edge (Mez) technology to make the system latency tolerant. Dual-layer security has been ensured by operating the proposed algorithm and GoogleNet-BiLSTM hybrid network from a cloud server, which ensures the security of the proposed security system. The innovative optimization scheme makes it possible to strengthen cyber-physical security with $4.29 per month only.

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

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

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.

In recent decades, the Variational AutoEncoder (VAE) model has shown good potential and capabilities in image generation and dimensionality reduction. The combination of VAE and various machine learning frameworks has also worked effectively in different daily life applications, however its possibility and effectiveness in modern game design has seldom been explored nor assessed. The use of its feature extractor for data clustering was minimally discussed in literature neither. This paper first attempts to explore different mathematical properties of the VAE model, in particular, the theoretical framework of the encoding and decoding processes, the possible achievable lower bound and loss functions of different applications; then applies the established VAE model into generating new game levels within two well-known game settings; as well as validating the effectiveness of its data clustering mechanism with the aid of the Modified National Institute of Standards and Technology (MNIST) database. Respective statistical metrics and assessments were also utilized for evaluating the performance of the proposed VAE model in aforementioned case studies. Based on the statistical and spatial results, several potential drawbacks and future enhancement of the established model were outlined, with the aim of maximizing the strengths and advantages of VAE for future game design tasks and relevant industrial missions.

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

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.

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.

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.

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

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.

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.

Recently, a layer-stacked ESN model named deep echo state Network (DeepESN) has been established. As an interactional model of recurrent neural network and deep neural network, investigations of DeepESN are of significant importance in both areas. Optimizing the structure of neural networks remains a common task in artificial neural networks, and the question of how many neurons should be used in each layer of DeepESN must be stressed. In this paper, our aim is to solve the problem of choosing the optimized size of DeepESN. Inspired by the sensitive iterative pruning algorithm, a neuronal similarity-based iterative pruning merging algorithm (NS-IPMA) is proposed to iteratively prune or merge the most similar neurons in DeepESN. Two chaotic time series prediction tasks are applied to demonstrate the effectiveness of NS-IPMA. The results show that the DeepESN pruned by NS-IPMA outperforms unpruned DeepESN with the same network size, and NS-IPMA is a feasible and superior approach to improving the generalization performance of DeepESN.

In the era of big data with increasingly complex data structures and ever-larger data scales, matrix-type data are becoming highly valued and their applications in the fields of medicine, industry, education, geography, and astronomy are growing in extent. In recent years, significant progress has been made in the practical use of matrix variable t-distribution finite mixture models for handling data in order to address the issues of multi-subgroup structures and long data tails. In this paper, the expectation-maximization (EM) algorithm with penalized maximum likelihood is proposed to resolve the problem of the unbounded nature of the likelihood function applied to the model by considering the degeneracy of the variance-covariance matrix of this model. Our data were analyzed through simulations and real data, and the results demonstrate that our model is effective in both preventing the likelihood function from being unbounded and in ensuring the accuracy of the estimated parameters of the EM algorithm.

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.

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.

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.

The environmental disaster in Kamchatka in the autumn of 2020 was caused by an extensive bloom of harmful microalgae of the genus Karenia. A spectral shape algorithm was used to detect algae. The algorithm calibration of in situ species composition data made it possible to identify areas where harmful algae dominated in biomass. Satellite images of chlorophyll-a concentra-tion, turbidity, specific fluorescence, and spectral shape parameter were computed. The images were used to recognize the stages of algal bloom: intensive growth, blooming, and change in the dominant algal species. Cases of an increase in the concentration of harmful substances in the coastal zone due to wind impact were analyzed. The following explanation of events has been offered. After the stage of intensive growth of microalgae, nutrient deficiency stimulated the production of metabolites that have a harmful effect on the environment. The change of the dominant alga species in the second half of September and the past storm contributed to a sharp increase in the concentration of metabolites and dead organic matter in the coastal zone, which caused an ecological disaster. The subsequent mass bloom of alga species of the same genus, and the regular wind impact leading to the concentration of harmful substances in the coastal zone, contributed to the development of this catastrophic phenomena.

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

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

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

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.

This article investigated the Automatic Generation Control(AGC) of multi-area multi-source interconnected systems with hydropower plants, thermal power plants, and wind energy. Adaptive Neuro-fuzzy controller integrated with the cascaded proportional-integral-derivative with filter (PIDF-PIDF) is a new cascaded controller (ANF-PIDF-PIDF) that has been presented as a secondary controller for applied hybrid power systems. The recent Skill Optimization Algorithm (SOA) is employed to optimize PIDF- PIDF controller parameter gains and the Adaptive Neuro-Fuzzy controller's inputs and output scaling factors. SOA is used to update the controller parameters with integral square error (ISE) employed as the objective function. A 1% step load disturbance was considered simultaneously in all three areas. The controller's performance is evaluated and compared with and without considering the effects of wind energy sources and non-linearity for ANF-PIDF-PIDF, PIDF-PIDF, and PIDF and it was determined that the ANF-PIDF-PIDF was the most efficient. The dynamic system performance is also compared with parallel high voltage direct current (HVDC) tie-lines. The investigation clearly shows that incorporating HVDC tie-line with multi-area, multi-source provides better dynamic performance in maximum amplitude, oscillation, and settling time. Additionally, sensitivity analysis is done and the optimum controller gains does not need to be reset to uncertain values in system loading conditions. All simulation results were evaluated using MATLAB 2016b.

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

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

At present, diversified and highly concurrent businesses in the Internet industry often require heterogeneous databases formed by multiple databases to meet the needs. This report introduces database kernel SG-ColBase we developed. After achieving read and write concurrency control, data rollback, atomic log writing, and downtime data redo to ensure complete transaction support. The parallelism of database kernel execution is extended through field level locks and snapshot reads. Use the Bloom filter, resource cache pool, memory pool, skip list, non blocking log cache, and asynchronous data writing mechanism to improve the overall execution efficiency of the system. In terms of data storage, column storage, logical key and LSM-tree are introduced. While improving the data compression ratio and reducing data gaps, all disk data operations are written in incremental order. With the characteristics of asynchronous batch operation, the data writing speed is greatly improved. Thanks to the continuous feature of vertical data brought by column storage, the disk scanning brought by vertical traversal is reduced, which is a qualitative leap in efficiency compared with traditional relational databases in the big data analysis scenario. SG-ColBase can reduce the use of heterogeneous databases in business and improve R&D efficiency.

: Seasonal influenza (a.k.a flu) is responsible for considerable morbidity and mortality across the globe. The three recognized pathogens that cause epidemics during the winter season are influenza A, B and C. The influenza virus is particularly dangerous due to its mutability. Vaccines are an effective tool in preventing seasonal influenza, and their formulas are updated yearly according to WHO recommendations. However, in order to facilitate decision-making in the planning of the intervention, policymakers need information on the projected costs and quantities related to introducing the influenza vaccine, in order to help governments obtain an optimal allocation of the vaccine each year. In this paper, an approach based on a Controlled Elitism Non-Dominated Sorting Genetic Algorithm (CENSGA) model is introduced to optimize the allocation of influenza vaccination. A bi-objective model is formulated to control the infection volume, and reduce the unit cost of the vaccination campaign. An SIR (Susceptible–Infected–Recovered) model is employed for representing a potential epidemic. The model constraints are based on the epidemiological model, time management, and vaccine quantity. A two-phase optimization process is proposed: guardian control followed by contingent controls. The proposed approach is an evolutionary metaheuristic multi-objective optimization algorithm with a local search procedure based on a hash table. Moreover, in order to optimize the scheduling of a set of policies over a predetermined time to form a complete campaign, an extended CENSGA is introduced with a variable-length chromosome (VLC) along with mutation and crossover operations. To validate the applicability of the proposed CENSGA, it is compared with the classical Non-Dominated Sorting Genetic Algorithm (NSGA-II). The results are analyzed using graphical and statistical comparisons in terms of cardinality, convergence, distribution and spread quality metrics, illustrating that the proposed CENSGA is effective and useful for determining the optimal vaccination allocation campaigns.

The deformation monitoring information of concrete dams contains some high-frequency com-ponents, and the high-frequency components are strongly nonlinear, which reduces the accuracy of dam deformation prediction. In order to solve such problems, this paper proposes a concrete dam deformation monitoring model based on empirical mode decomposition (EMD) combined with wavelet threshold noise reduction and sparrow search algorithm (SSA) optimization of long short-term memory network (LSTM). The model uses EMD combined with wavelet threshold to decompose and denoise the measured deformation data. On this basis, the LSTM model based on SSA optimization is used to mine the nonlinear function relationship between the reconstructed monitoring data and various influencing factors. The example analysis shows that the model has good calculation speed, fitting and prediction accuracy and it can effectively mine the date char-acteristics inherent in the measured deformation, and reduce the influence of noise components on the modeling accuracy.

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

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

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

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

A refractive lens is one of the simplest, cost-effective and easily available imaging elements. With a spatially incoherent illumination, a refractive lens can faithfully map every object point to an image point in the sensor plane, when the object and image distances satisfy the imaging conditions. However, static imaging is limited to the depth of focus, beyond which the point-to-point mapping can be only obtained by changing either the location of the lens or the imaging sensor. In this study, the depth of focus of a refractive lens in static mode has been expanded using a recently developed computational reconstruction method, Lucy-Richardson-Rosen algorithm (LRRA). The technique consists of three steps. In this first step, the point spread functions (PSFs) were recorded along different depths and stored in the computer as PSF library. In the next step, the object intensity distribution was recorded. The LRRA was then applied to deconvolve the object information from the recorded intensity distributions in the final step. The results of LRRA were compared against two well-known reconstruction methods namely Lucy-Richardson algorithm and non-linear reconstruction.

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

Abstract Background and Objective: Medical Microwave Radiometry (MWR) is used to capture the thermal properties of internal tissues and has usages in breast cancer detection. Our goal in this paper is to improve classification performance and investigate automated neural architecture search methods. Methods: We investigate optimizing the weights of a weight agnostic neural network using bi-population covariance matrix adaptation evolution strategy (BIPOP-CMA-ES) once the topology is found. We compare it against a weight agnostic and cascade correlation neural network. Results: The experiments are conducted on a breast cancer dataset of 4912 patients. Our proposed weight agnostic BIPOP-CMA-ES model achieved the best performance. It obtained an F1-score of 0.9225, accuracy of 0.9219, precision of 0.9228, recall of 0.9217 and topology of 153 connections. Conclusions: The results are an indication of the potential of MWR utilizing a neural network-based diagnostic tool for cancer detection. By separating the tasks of topology search and weight training, we are able to improve the overall performance.

Enhancing underwater images in epicontinental sea is a challenging problem owing to the influence of ocean currents, the refraction, absorption and scattering of light by suspended particles, and the weak illumination intensity. Recently, different methods have relied on the underwater image formation model and deep learning techniques to restore the underwater image, but they tend to degrade underwater image, interference of background clutter and miss boundary details of blue regions. Improved image fusion and enhancement algorithm based on a priori dark channel is proposed in this paper. Image edge features sharpening and dark detail enhancement by homomorphism filtering in CIELab color space is realized. In RGB color space, the multi-scale retinal with color restoration (MSRCR) algorithm is used to improve color deviation and enhance color saturation, and the contrast-limited adaptive histogram equalization (CLAHE) algorithm is used to de fog and enhance image contrast. Finally, according to the dark channel images of the three processing results, the final enhanced image is obtained by linear fusion of multiple images and multiple channels. Experimental results demonstrate the effectiveness and practicality of the proposed method on various datasets.

Among the various complex systems that we experience each day, there is the physical phenomenon of infiltration. Infiltration is considered as the dynamics of water flow in the subsurface soil that in this work is framed for the context of civil construction. This issue is approached with the use of mathematical models and stochastic techniques, however, there are hardships in collecting the samples in the field, the adoption of a scale type, the influence in soil layers interfaces, the effects of soil anisotropic characteristics and so on. In this study, methodology is proposed to deal with the soil sampling input such as the retro model, constitutive model and optimization algorithms. Additionally, an automatic calibration is set forth to fix parameters from the mathematical model submitted. Especially among the existing Optimization Algorithms there are Genetic Algorithms and the Generalized Simulated Annealing Algorithm (GSA). This work presents an overview of these optimization methods and a proposal for a more efficient and faster algorithm called GSA-HYBRID based on convergence gradient technique. The applied strategy depends on the type of case study considering its physical properties and constraints. In this sense, it is found that while Genetic Algorithms are able to replicate the optimization surface, Generalized Simulated Annealing is much more adequate in characterizing the system at an extremely low computational cost. Nevertheless, the hybrid technique GSA-HYBRID performed the fastest. Further research is necessary to implement the novel GSA-HYBRID algorithm due to its flexibility and higher speed, also, studying its application at different case studies.

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

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.

The rate of technical innovation, system interconnection, and advanced communications undoubtedly boost distributed energy networks' efficiency. However, when an additional attack surface is made available, the possibility of an increase in attacks is an unavoidable result. The energy ecosystem's significant variety draws attackers with various goals, making any critical infrastructure a threat, regardless of scale. Outdated technology and other antiquated countermeasures that worked years ago cannot address the complexity of current threats. As a result, robust artificial intelligence cyber-defense solutions are more important than ever. Based on the above challenge, this paper proposes an ensemble transfer learning spiking immune system for adaptive smart grid protection. It is an innovative Artificial Immune System (AIS) that uses a swarm of Evolving Izhikevich Neural Networks (EINN) in an Ensemble architecture, which optimally integrates Transfer Learning methodologies. The effectiveness of the proposed innovative system is demonstrated experimentally in multiple complex scenarios that optimally simulate the modern energy environment. In this way, the proposed system fully automates the strategic security planning of energy networks with computational intelligence methods. It allows the complete control of the digital strategies of the potential infrastructure that frames it, thus contributing to the timely and valid decision-making during cyber-attacks.

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.

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.

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

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

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.

We present a novel method for interpolating univariate time series data. The proposed method combines multi-point fractional Brownian bridges, a genetic algorithm, and Takens’ theorem for reconstructing a phase space from univariate time series data. The basic idea is to first generate a population of different stochastically interpolated time series data, and secondly, to use a genetic algorithm to find the pieces in the population which generate the smoothest reconstructed phase space trajectory. A smooth trajectory curve is hereby found to have a low variance of second derivatives along the curve. For simplicity, we refer to the developed method as PhaSpaSto-interpolation, which is an abbreviation for phase-space-trajectory-smoothing stochastic interpolation. The proposed approach is tested and validated with a univariate time series of the Lorenz system, five non-model data sets and tested against a cubic spline interpolation and a linear linear interpolation. We find that the criterion for smoothness guarantees low errors on known model and non-model data. Finally, we interpolate the discussed non-model data sets, and show the corresponding improved phase space portraits. The proposed method is useful for interpolating low-sampled time series data sets for, e.g., machine learning, regression analysis, or time series prediction approaches.

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

Cracking in a wide array of industrial components and structures pose a significant threat to their integrity. Detecting cracks using ultrasonic inspection techniques is a widespread activity for economic reasons but there are limitations to the techniques due to the morphology of cracks, such as fatigue cracks. In addition to detection there is a need to measure the size of the cracks which are often within the volume of the material. Ultrasonic techniques are well-suited to look inside the volume of the material but achieving sufficient sensitivity to the tip of the cracks in particular is practically difficult. Without an accurate knowledge of where the tip of the crack lies there can be significant uncertainty in sizing measurements. Machine Learning (ML) techniques are being developed to aid in the inspection and monitoring tasks but presenting the ultrasonic data in a suitable way for ML is very important. Following on from recent work presenting the development of the snooker algorithm to create images termed parameter-spaces, this paper presents how these images can be input into neural network based ML systems to automatically size these critical cracks.

The relationship between the host and the microbiome, or the assemblage of microorganisms (including bacteria, archaea, fungi, and viruses), has been proven crucial for its health and disease development. The high dimensionality of microbiome datasets has often been addressed as a major difficulty for data analysis, such as the use of Machine Learning (ML) and Deep Learning (DL) models. Here we present BiGAMi, a bi-objective genetic algorithm fitness function for feature selection in microbial datasets to train high-performing phenotype classifiers. The proposed fitness function allowed us to build classifiers that outperformed the baseline performance estimated by the original studies by using as few as 0.04% to 2.32% features of the original dataset. In 19 out of 21 classification exercises, BiGAMi achieved its results by selecting 6-68% fewer features than the highest performance of a Sequential Forward Feature Selection algorithm. This study showed that the application of a bi-objective GA fitness function against microbiome datasets succeeded in selecting small subsets of bacteria whose contribution to understood diseases and the host state was already experimentally proven. Applying this feature selection approach to novel diseases is expected to quickly reveal the microbes most relevant to a specific condition.

The widespread adoption of electromobility constitutes one of the measures designed to reduce air pollution caused by traditional fossil fuels. However, several factors are currently impending this process, ranging from insufficient charging infrastructure, battery capacity, long queueing and charging time, to psychological factors. On top of range anxiety, the frustration of the EV drivers is further fueled by the lack the uncertainty of finding an available charging point on their route. To address this issue, we propose a solution that comes to bypass the limitations of the Reserve now function of the OCPP standard, enabling drivers to make charging reservations for the upcoming days, especially when planning a longer trip. We created an algorithm that generates reservation intervals based on the charging station's reservation and transaction history. Subsequently, we ran a series of test cases that yielded promising results, with no overlapping reservations.

Abstract: As the policies and regulations currently in place concentrate on environmental protection and greenhouse gas reduction, we are steadily witnessing a shift in the transportation industry towards electromobility. There are, though, several issues that need to be addressed to encourage the adoption of EVs at a larger scale. To this end, we propose a solution capable of addressing multiple EV charging scheduling issues, such as congestion management, scheduling a charging station in advance, and allowing EV drivers to plan optimized long trips using their EVs. The smart charging scheduling system we propose considers a variety of factors such as battery charge level, trip distance, nearby charging stations, other appointments, and average speed. Given the scarcity of data sets required to train the Reinforcement Learning algorithms, the novelty of the recommended solution lies in the scenario simulator, which generates the labelled datasets needed to train the algorithm. Based on the generated scenarios, we created and trained a neural network that uses a history of previous situations to identify the optimal charging station and time interval for recharging. The results are promising and for future work we are planning to train the DQN model using real-world data.

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

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

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

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

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.

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.

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

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

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

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

This paper proposes a radiation pattern synthesis of the almost periodic antenna arrays including mutual coupling effects (that extracted by the Floquet analysis according to our previous work), which principally has a high directivity and large bandwidth. For modeling the given structures, the moment method combined with the Generalized Equivalent Circuit (MoM-GEC) is proposed. The artificial neural network (ANN) as a powerful computational model has been successfully applied to the antenna array pattern synthesis. The results showed that the multilayer feedforward neural networks are rugged and can successfully and efficiently resolve various distinctive complex almost periodic antenna patterns (with different source amplitudes) (in particular, both periodic and randomly aperiodic structures are taken into account). However, the artificial neural network (ANN) is capable of quickly producing the synthesis results using generalization with the early stopping (ES) method. A significant time gain and memory consumption are achieved by using this given method to improve the generalization (called early stopping). To justify this work, several examples are developed and discussed.

Ultrasound based haptic feedback is a potential technology for human-computer interaction (HCI) with the advantages of low cost, low power consumption and controlled force. In this paper, the phase optimization for multipoint haptic feedback based on ultrasound array is investigated and the corresponding experimental verification is provided. A mathematical model of acoustic pressure is established for the ultrasound array and then a phase optimization model for an ultrasound transducer is constructed. We propose a pseudo-inverse (PINV) algorithm to accurately determine the phase contribution of each transducer in the ultrasound array. By controlling the phase difference of the ultrasound array, the multipoint focusing forces are formed leading to various shapes such as geometries and letters that can be visualized. Because the unconstrained PINV solution results in unequal amplitudes for each transducer, a weighted amplitude iterative optimization is deployed to further optimize the phase solution, by which the uniform amplitude distributions of each transducer are obtained. For the purpose of experimental verifications, a platform of ultrasound haptic feedback consisting of a Field Programmable Gate Array (FPGA), an electrical circuit and an ultrasound transducer array is prototyped. The haptic performances of single point, multiple points and dynamic trajectory were verified by controlling the ultrasound force exerted on the liquid surface. The experimental results demonstrate that the proposed phase optimization model and theoretical results are effective and feasible, and the acoustic pressure distribution is consistent with the simulation results.

The shortage of quantum computers, and their current state of development, constraints research in many fields that could benefit from quantum computing. Although the work of a quantum computer can be simulated with classical computing, personal computers take so long to run quantum experiments that they are not very useful for the progress of research. This manuscript presents an open quantum computing simulation platform that enables quantum computing researchers to have access to high performance simulations. This platform, called QUTE, relies on a supercomputer powerful enough to simulate general purpose quantum circuits of up to 38 qubits, and even more under particular simulations. This manuscript describes in-depth the characteristics of the QUTE platform and the results achieved in certain classical experiments in this field, which would give readers an accurate idea of the system capabilities.

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

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

This work presents a control scheme to control the grid-connected single-phase photovoltaic (PV) system. The considered system has four 250W solar panels, a non-inverting buck-boost DC-DC converter, and DC-AC inverter with LCL filter. The control system aims to track and operate at the maximum power point (MPP) of PV panels, regulate the voltage of DC link, and supply the grid with a unity power factor. To well achieve these goals, the proposed control system consists of three parts, that are MPP tracking controller module with a fuzzy-based modified incremental conductance (INC) algorithm, a DC-link voltage regulator with a hybrid fuzzy proportional-integral (PI) controller, and a Current Controller module using the linear quadratic regulator (LQR) for grid-connected power. Based on fuzzy control and LQR, this work introduces a full control solution for grid-connected single-phase PV systems. The key novelty of this research is to analyze and prove that the newly proposed method is more successful in numerous aspects by comparing and evaluating the previous and present control methods. The designed control system settles quickly, which is critical for output stability. In addition, as compared to backstepping approach used in our past study, the LQR technique is more resistant to sudden changes and disturbances. Furthermore, backstepping method produces the larger overshoot, which has a detrimental impact on efficiency. Simulation findings under various weather conditions were compared to theoretical ones to indicate that the system can deal with variations in weather parameters.

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

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