Groundwater represents a pivotal asset in conserving natural water reservoirs for potable consumption, irrigation, and diverse industrial uses. Nevertheless, human activities intertwined with industry and agriculture contribute significantly to groundwater contamination, highlighting the critical necessity to appraise water quality for safe drinking and effective irrigation. This research primarily focused on employing the Water Quality Index (WQI) to gauge water's appropriateness for these purposes. However, the generation of an accurate WQI can prove time-intensive owing to potential errors in sub-index calculations. In response to this challenge, an artificial intelligence (AI) forecasting model was devised, aiming to streamline the process while mitigating errors. The study collected 422 data samples from Mirpurkash, a city nestled in the province of Sindh, for a comprehensive exploration of the region's WQI attributes. Furthermore, the study probed into unraveling the interdependencies amidst variables in the physiochemical analysis of water. Diverse machine learning classifiers were employed for WQI prediction, with findings revealing that random forest and gradient boosting eclipsed other algorithms, achieving an accuracy rate of 99%. In close pursuit were SVM and XGBoost, registering accuracy scores of approximately 95% and 93%, respectively, while KNN and Decision Trees garnered accuracy rates of 88% and 87%, respectively. In addition to WQI prediction, the study conducted an uncertainty analysis of the models using the R-factor, providing insights into the reliability and consistency of predictions. This dual approach, combining accurate WQI prediction with uncertainty assessment, contributes to a more comprehensive understanding of water quality in Mirpurkash and enhances the reliability of decision-making processes related to groundwater utilization

This paper explores the capability of various machine learning algorithms, including Random Forests and advanced gradient boosting techniques such as XGBoost, LightGBM, and CatBoost, to predict customer churn in the telecommunications sector. For this analysis, a dataset available to the public was employed. The performance of these algorithms was assessed using recognized metrics, including Accuracy, Precision, Recall, F1-score, and the Receiver Operating Characteristic Area Under Curve (ROC AUC). These metrics were evaluated at different phases: subsequent to data preprocessing and feature selection; following the application of SMOTE and ADASYN sampling methods; and after conducting hyperparameter tuning on the data that had been adjusted by SMOTE and ADASYN. The outcomes underscore the notable efficiency of upsampling techniques such as SMOTE and ADASYN in addressing the imbalance inherent in customer churn prediction. Notably, the application of random grid search for hyperparameter optimization did not significantly alter the results, which remained comparatively unchanged. The algorithms' performance post- ADASYN application marginally surpassed that observed after SMOTE application. Remarkably, LightGBM achieved an exceptional F1-score of 89% and an ROC AUC of 95% subsequent to the ADASYN sampling technique. This underlines the effectiveness of advanced boosting algorithms and upsampling methods like SMOTE and ADASYN in navigating the complexities of imbalanced datasets and intricate feature interdependencies.

Heart failure is a prevalent cardiovascular condition with significant health implications, necessitating effective diagnostic strategies for timely intervention. This study explores the potential of continuous monitoring of non-invasive signals, specifically integrating Photoplethysmogram (PPG) and Electrocardiogram (ECG), for enhancing early detection and diagnosis of heart failure. Leveraging a dataset from the MIMIC-III database, encompassing 682 heart failure patients and 954 controls. Feature selection techniques were used to systematically select key features which were identified for their clinical relevance and significance in capturing cardiovascular dynamics and to reduce computational complexity and to decrease the chance of overfitting the ML algorithms. These features are then utilized to train and evaluate machine learning algorithms, resulting in a model with an impressive accuracy of 98%, sensitivity of 97.60%, specificity of 96.90%, and precision of 97.20%. The integrated approach outperforms single-signal strategies, showcas-ng its potential for early, precise, and non-invasive heart failure diagnosis. Furthermore, the study underscores the significance of continuous monitoring through wearables, emphasizing the benefits of integrating multiple signals for a comprehensive evaluation of cardiovascular health. The proposed approach holds promise for implementation in hardware systems to enable continuous monitoring, aiding in early detection and prevention of critical health conditions.

In this project the EEG – electroencephalogram - channel(s) will be characterized to diagnose PTSD – Post-traumatic stress disorder – cases. For this aim, we applied boosting methods including a combination of K-mean and Support Vector Machine (SVM) models to find the feature weights to detect the PTSD cases. We classified 32 channels of 12 subjects including 6 PTSD and 6 healthy controls using a 6-mean classifier. The linear SVM found the weights of distinguished channels within each subject for each cluster. It was found that the significant SVM weights of F4, F8, and Pz are smaller in PTSD than in healthy subjects. This new method can be used as a tool to better understand the interaction of EEG signals and diagnosis.

There is a need for alternatives or complements to synthetic fertilizers to enhance agricultural sustainability. Applying organic amendments can play a significant role in this. Insect droppings show high potential, though studies evaluating their agronomic value have only recently begun to emerge. This study compared black soldier fly (Hermetia illucens) and mealworm (Tenebrio molitor) larvae frass with another organic amendment (Nutrimais) derived from composting forestry, agro-industrial, and domestic waste. The experiment also included ammonium nitrate at two rates [the same as the organic amendments, 50 kg ha–1 nitrogen (N) (FullR), and half that rate (HalfR)] and an unfertilized control. The study spanned two growth cycles of lettuce (Lactuca sativa L.) grown in pots, followed by unfertilized oats (Avena sativa L.) to assess the residual effects of the fertilizing treatments. Mealworm larvae frass mineralized rapidly, with an apparent N recovery of 37.4% over the two lettuce growth cycles, indicating its high availability to soil heterotrophic microorganisms. The average dry matter yield (DMY) of lettuce was the highest among all treatments (12.8 and 9.8 g plant–1 in the first and second lettuce cycles), even compared to the FullR treatment (12.2 and 7.8 g plant–1), though without significant differences. Although mealworm larvae frass exhibited a high mineralization rate, the DMY cannot be attributed solely to N supply, as plants in the FullR treatment showed better N nutritional status. Mealworm larvae frass provided strong evidence of a plant biostimulant effect, not explained by the variables measured in this study. Black soldier fly larvae frass exhibited typical behavior of a moderately reactive organic amendment, while Nutrimais showed low reactivity, with a near-neutral mineralization/immobilization balance. The results suggest mealworm larvae frass is recommended for early maturing vegetable crops, whereas Nutrimais appears more suitable for perennial crops with low short-term nutrient requirements.

Cancer risk is known to increase tremendously when the immune system is suppressed, e.g., as observed in young organ-transplant recipients and AIDS patients. Based on such data, it may be hypothesized that the main reason for the development of clinical cancer is the weakening or suppression of the immune system, and that uncontrolled multiplication of cancer cells occurs when some aspects of the immune system fall below certain critical levels. Therefore, cancer may be prevented and treated by boosting these critical aspects of the immune system so that they are maintained above the critical levels. If multiple immune system boosting interventions are utilized, more aspects of the immune system would be boosted, increasing the likelihood of enhancing the critical aspects of the immune system and generating a cancer preventive and/or therapeutic effect. Clinical trials are needed to validate this approach for cancer prevention and treatment. If validated, the proposed approach could result in a major reduction of the death and suffering caused by cancer in the world.

Mutual exclusion algorithms are at the heart of concurrent, distributed/parallel, real-time and operating systems. It is well-known that such algorithms are very difficult to analyze and in the literature different conjectures about starvation-freedom and the number of by-passes (also said the overtaking factor), which in turn affects the (hopefully) bounded waiting time that a process competing for entering the critical section has to suffer before accessing the shared resource, have been formulated for specific algorithms. This paper proposes a novel modelling approach based on Timed Automata and the Uppaal toolset, which proves effective for studying all the properties of a mutual exclusion algorithm for N≥2 processes, by exhaustive model checking. Although the approach, as already confirmed by similar experiments reported in the literature, is not scalable due to state explosion problems, and can be practically applied until N≤5, it is of great value for revealing true properties of analyzed algorithms. For dimensions N>5 the statistical model checker of Uppaal can be used which, although based on simulations, can confirm properties by estimations and probabilities. The paper describes the proposed modelling and verification method and applies it to several mutual exclusion algorithms, thus retrieving known properties but also showing new results about properties often studied only by peer-review and intuitive reasoning.

Analysis of land use/land cover (LULC) in the catchment areas is the first action toward safeguarding the freshwater resources. The LULC information in the watershed has gained popularity in the natural science field as it helps water resource managers and environmental health specialists develop natural resource conservation strategies based on available quantitative information. Thus, remote sensing is the cornerstone in addressing environmental-related issues at the catchment level. In this study, the performance of four machine learning algorithms (MLAs), such as Random Forests (RF), Support Vector Machine (SVM), Artificial Neural Networks (ANN), and Naïve Bayes (NB) was investigated to classify the catchment into nine relevant classes of the undulating watershed landscape using Landsat 8 Operational Land Imager (L8-OLI) imagery. The assessment of the MLAs were based on the visual inspection of the analyst and the commonly used assessment metrics, such as user’s accuracy (UA), producers’ accuracy (PA), overall accuracy (OA), and kappa coefficient. The MLAs produced good results, where RF (OA= 97.02%, Kappa= 0.96), SVM (OA= 89.74 %, Kappa= 0.88), ANN (OA= 87%, Kappa= 0.86), and NB (OA= 68.64 Kappa= 0.58). The results show the outstanding performance of the RF model over SVM and ANN with a small margin. While NB yielded satisfactory results, which could be primarily influenced by its sensitivity to limited training samples. In contrast, the robust performance of RF could be due to an ability to classify high-dimensional data with limited training data.

Vertical Indoor Farming (VIF) with hydroponics offers a promising perspective for sustainable food production. Intelligent control of VIF system components plays a key role in reducing operating costs and increasing crop yields. Modern machine vision (MV) systems use Deep Learning (DL) in combination with camera systems for various tasks in agriculture, such as disease and nutrient deficiency detection, and flower and fruit identification and classification for pollination and harvesting. This study presents the applicability of MV technology with DL modelling to detect the growth stages of chilli plants using YOLOv8 networks. The influence of different bird’s eye and side view datasets and different YOLOv8 architectures was analysed. To generate the image data for training and testing the YOLO models, chilli plants were grown in a hydroponic environment and imaged throughout their life cycle using four camera systems. The growth stages were divided into growing, flowering and fruiting classes. All trained YOLOv8 models showed reliable identification of growth stages with high accuracy. The results indicate that models trained with data from both views show better generalisation. YOLO’s middle architecture achieved the best performance.

Iron-based materials are widely applied in Fenton chemistry and they have promising prospects in the processing of wastewater. The composition complexity and rich chemistry of iron and/or oxides, however, hamper the precise understanding on the active sites and the working mechanism which still remain highly controversial. Herein, iron oxides of four different model systems are designed through a conventional precipitation method plus H2 reduction treatment. These systems feature Fe@Fe3O4 with abundant oxygen vacancy, Fe0 and Fe3O4 particles with interface structures, and Fe3O4-dominated nanoparticles of different sizes. These materials are applied in the decomposition of methyl orange as a model reaction to assess the Fenton chemistry. The Fe@Fe3O4 with core-shell structures exhibited significantly higher decomposition activity than the other Fe3O4-rich nanoparticles. A thin Fe3O4 layer formed by auto-oxidation of iron particles when exposing to air can boost the activity as compared with the Fe0 and Fe3O4 particles with interface structures but poor oxygen vacancy. The unique hetero-structure with the co-existence of both metallic iron and oxygen vacancy displayed excellent redox propensity which might account for the superior Fenton activity. This finding provides a new perspective to understand and design highly efficient iron-based Fenton catalysts.

Remote sensing datasets are increasingly being used to provide spatially explicit large scale evapotranspiration (ET) estimates. The focus of this study was to estimate and thematically map on a pixel-by-pixel basis, the actual evapotranspiration (ET_a) of the Wonji Shoa Sugarcane Estate using the Surface Energy Balance Algorithm for Land (SEBAL), Simplified Surface Energy Balance (SSEB) and Operational Simplified Surface Energy Balance (SSEBop) algorithms. The results obtained revealed that the ranges of the daily ETa estimated on January 25, February 26, September 06 and October 08, 2002 using SEBAL were 0.0 - 6.85, 0.0 – 9.36, 0.0 – 3.61, 0.0 – 6.83 mm/day; using SSEB 0.0 - 6.78, 0.0 – 7.81, 0.0 – 3.65, 0.0 – 6.46 mm/day, and SSEBop were 0.05 - 8.25, 0.0 – 8.82, 0.2 – 4.0, 0.0 – 7.40 mm/day, respectively. The Root Mean Square Error (RMSE) values between SSEB and SEBAL, SSEBop and SEBAL, and SSEB and SSEBop were 0.548, 0.548, and 0.99 for January 25, 2002; 0.739, 0.753, and 0.994 for February 26, 2002;0.847, 0.846, and 0.999 for September 06, 2002; 0.573, 0.573, and 1.00 for October 08, 2002, respectively. The standard deviation of ET_a over the sugarcane estate showed high spatio-temporal variability perhaps due to soil moisture variability and surface cover. The three algorithm results showed that well watered sugarcane fields in the mid-season growing stage of the crop had higher ET_a values compared with the other dry agricultural fields confirming that they consumptively use more water. Generally during the dry season, ET_a is limited to water surplus areas only and in wet season, ET_a was high throughout the entire sugarcane estate. The evaporation fraction (ETrF) results also followed the same pattern as the daily ET_a over the sugarcane estate. The total crop and irrigation water requirement and effective rainfall estimated using the Cropwat model were 2468.8, 2061.6 and 423.8 mm/yr for January 2001 planted and 2281.9, 1851.0 and 437.8 mm/yr for March 2001 planted sugarcanes, respectively. The mean annual ET_a estimated for the whole estate were 107 Mm³, 140 Mm³, and 178 Mm³ using SEBAL, SSEB, and SSEBop, respectively. Even though the algorithms should be validated through field observation, they have potential to be used for effective estimation of ET in the sugarcane estate.

Tomato quality is intricately regulated by a combination of factors, including the presence of bioactive compounds referred to as secondary metabolites and various organoleptic characteristics. These attributes are notably influenced and harmonized by the specific growing conditions, with a particular emphasis on the type of fertilization employed. Traditionally, chemical fertilizers have been favoured in crop cultivation due to their cost-effectiveness and ability to accelerate crop growth. However, in pursuit of sustainable and intelligent agricultural practices, there is a growing need for alternative fertilizers. In this context, the present study aimed to assess the impact of fertilizers derived from waste materials, specifically sulphur bentonite and orange residue (referred to as SB), on tomato quality. This assessment extended to examining qualitative and quantitative alterations in aroma-related volatile compounds and the antioxidant systems of tomatoes, in comparison to the conventional use of fertilizers such as horse manure and NPK (nitrogen, phosphorus, and potassium). The results obtained revealed distinct effects of different fertilizers on tomato quality. Notably, parameters such as TPRO (total protein), TCARB (total carbohydrate), LIC (lycopene content), TCAR (total carotenoid content), total phenols, total flavonoids, and aroma profiling exhibited significantly superior values in the group treated with SB fertilizer. These findings strongly suggest that the novel fertilizer functioned as a bio-stimulant, enhancing the nutraceutical and sensory attributes of tomatoes, with a pronounced impact on the synthesis of secondary metabolites and the aroma profile of the fruits.

Starting from a very simple economic scenario, we build on it a game and then we introduce a general strategy able to reduce a regression problem to an equivalent binary classification problem. This reduction scheme (that we call adaptive reduction or also dynamic reduction) can be also used to derive a new boosting algorithm for regression problems named bOOst^d. The bOOst^d algorithm is very simple to implement, and it can use any learning algorithm with no priori assumptions. We present a conjecture for bOOst^d performances, which ensures a little error on training set. More important we can also provide a very good theoretical upper bound for the generalization error. We give a set of preliminary experimental results that seems to confirm our conjecture for bOOst^d performances on training set and the theoretical assumptions for the generalization error. We also provide a possible justification of why boosting often does not overfit. Finally, we leave some open problems and argue that in the future an adaptive single boosting (with an unique code) algorithm for binary, multi class and regression problems can be derived.

Due to related uncertainties brought by changes in energy consumption and the integration of rooftop photovoltaic systems, the accuracy and availability of load profiling data are difficult to achieve. However, project managers and planners use a precise load profile as a crucial tool when determining whether the feeder must be updated or de-loaded. The paper aims to create a non-intrusive monitoring system that predicts the synthetic load profiles behavior of energy consumption using a Light Gradient Boosted and Support Vector Machine (SVM) machine learning technique. The most effective ML algorithm is chosen, and it has the potential to be assessed and verified using validation curves, residuals model generation, and prediction error metrics based on the following key statistical indicators: Mean Absolute Error, Mean Square Error, Root Mean Square Error, R-Square, Root Mean Squared Logarithmic Error, and Mean Absolute Percentage Error. The most effective ML has the potential to be assessed and verified using validation curves, residual model generation, and prediction error metrics based on the following key statistical indicators. The result shows that the estimation of the Irms avg -based on LightGBM is more accurate than the SVM because of its quick, economical, and difficult to overfit, particularly with high-dimensional data, speed, and efficiency of the MAE (3.0698), MSE (15.2757), RMSE (3.9020), RMSLE (0.1433), and MAPE (0.0049) respectively. Additionally, the machine learning model shows that, when compared to the SVM, the LightGBM model had the highest accurate prediction, with R-Square values of 89.8%, 90.3%, and 88.5% for Irms_A_avg, Irms_B_avg, and Irms_C_avg, respectively for Brakfontein Substation supply region, and best represents a diverse customer base.

The current global pandemic of coronavirus disease 2019 (COVID-19) caused by the coronavirus SARS-CoV-2 has already had a major adverse impact on the world due to the exponentially increasing deaths due to the disease and the extreme actions taken by the world community to prevent its spread. It is important to explore novel methods of reducing the illnesses and fatality rates of the coronavirus-infected patients. Since the weakness of the immune system is one of the major contributing factors for the illnesses caused by such viruses, and since inflammation is a major contributing factor for the mortality of COVID-19 patients, interventions that boost the immune system and/or are anti-inflammatory may reduce the COVID-19 incidence and the mortality due to the disease. A large variety of interventions are known to improve the immune response and/or reduce inflammation. However, all the interventions would not be applicable or acceptable to everyone and so the interventions would need to be individualized based on individual circumstances and preferences. This approach, known as “Individualized Interventions to Improve the Immune Response”, or the I⁴R approach, should be studied in pilot clinical trials urgently, in order to potentially reduce the harm caused by the current coronavirus pandemic.

Due to slow progression and susceptibility to radical forms of treatment low-grade PC is associ-ated with high overall survival (OS). With the clinical progression of PC the therapy is getting more complex. The immunosuppressive tumor microenvironment (TME) makes PC a difficult target for most immunotherapeutics. Its general immune resistance is established by i.e. immune evasion through Treg cells, synthesis of immunosuppressive mediators, and defective expression of surface neoantigens. The success of sipuleucel-T in clinical trials initiated several other clinical studies that specifically target the immune escape of the tumor and eliminate the immunosuppres-sive properties of TME. In the settings of PC treatment, this can be commonly achieved with radi-ation therapy (RT). Also, focal therapies usually applied for localized PC, such as high-intensity focused ultrasound (HIFU) therapy, cryotherapy, photodynamic therapy (PDT), or irreversible electroporation (IRE) were shown to boost anti-cancer response. Nevertheless, the present guide-lines restrict their application to localized and low-grade PC. This review explains how RT and focal therapies enhance the immune response. We also provide data supporting the combination of RT and focal treatments with immune therapies.

The World Health Organization (WHO) has released reports indicating that heart disorders hold the unfortunate distinction of being the primary cause of death worldwide. Shockingly, an astonishing estimated 17.9 million lives are claimed by heart diseases annually, accounting for an alarming 31% of all global deaths. With all the flaws in the clinical situation, it is frequently challenging to assess the severity of cardiac disease and forecast its course of progression due to heterogeneity and complex interplay of factors. Therefore, early heart disease detection is essential for effective therapy. To address these challenges, Machine Learning (ML) boosting algorithms play a pivotal role as the main components of predictive analytics required to do this. The main objective of this study is to develop a comprehensive comparative framework to predict heart diseases using state-of-the-art machine learning with boosting techniques such as Decision Tree, Random Forest, Gradient Boosting, Catboost, XGboost, Light GBM, and Adaboost. To evaluate the performance of the models, a large heart disorders dataset is used from the UCI machine learning repository, comprised of 26 feature-based numerical and categorical attributes with 8763 samples from all over the globe. The Experimental results reveal that AdaBoost attained the highest accuracy of 95% and outperforms other algorithms concerning various performance measures like precision= 0.98, recall= 0.95, specificity= 0.95, f1-score=0.01, Negative predicted value= 0.83, False positive rate= 0.04, False negative rate= 0.04 and False Development rate= 0.01.

Alcoholism is a condition associated with psychiatric and psychiatric problems, where the respiratory system is damaged through the mucociliary ladder mechanism and alveolar macrophage dysfunction. In the time COVID-19 has been observed a dramatic increase in alcohol consumption mediated by levels of anxiety and situations of confinement. In this work we analyze the relationship between alcoholism and SARS, especially with SARS-CoV-2, explained by a degradation of the host defenses of the respiratory epithelium by changing the barrier function, the discharge of cytokines and the functions of the cilia. All of them involved in the defense mechanism. of the lungs. This leads to a worse prognosis for patients precisely because of alcohol consumption. Based on this approach, alcoholism will exacerbate the consequences of COVID-19.

In my paper, a divisibility rule named the Queen function is de- scribed, which has been generalized for every integer and encompasses all pre- viously established divisibility rules. Subsequently, the paper discusses other areas where this function is instrumental. These include simplifying ratios, generating prime numbers, and more. Towards the end of the paper, a set of hypotheses is also presented. Among these, the most significant is the novel approach involving the application of the Queen function for prime number generation.

Antimicrobial resistance (AMR) is a growing public health concern worldwide, and it poses a significant threat to human, animal, and environmental health. The overuse and misuse of antibiotics have contributed significantly to the emergence and spread of antimicrobial resistance, which may lead to significant economic consequences like reduced productivity and increased healthcare costs. Nanotechnology offers a promising platform for addressing this challenge. Nanoparticles have unique properties that make them highly effective in combating bacterial infections by inhibiting the growth and survival of multidrug-resistant bacteria in three areas of health: human, animal, and environmental. To conduct an economic evaluation of surveillance in this context, it is crucial to have a comprehension of the connections to be addressed by several nations by implementing national action policies based on the One Health strategy. This review provides an overview of the progress made thus far and presents potential future directions to optimize the impact of nanobiotics on AMR.

Accurate and efficient traffic incident detection methods can effectively alleviate traffic congestion caused by traffic incidents, prevent secondary accidents and improve the safety of urban road traffic.Aiming at the problems that the traditional machine learning event detection method cannot fully extract the parameter characteristics of traffic flow and is not suitable formulti-dimensional and non-linear massive data, we propose a new traffic event detection method(CNN-XGBoost).This method combines the respective advantages of Convolution Neural Network(CNN) and Extreme Gradation Boosting (XGBoost). Firstly, we preprocessed the original freeway traffic incident detection data set by constructing initial variable set, data normalization, data balance processing and dimension reorganization. Secondly,we use CNN network to automatically extract the deep features of event detection data, and use XGBoost as a classifier to classify the extracted features for expressway traffic event detection.Finally, we use the data set of Hangzhou expressway microwave detector in China to carry out simulation experiments on CNN-XGBoost. The experimental results show that compared with XGBoost, CNN, Support Vector Machine (SVM) and Gradient Boosting Decision Tree (GBDT) and other methods, CNN-XGBoost method can effectively improve the accuracy of expressway traffic event detection and has better generalization ability.

The Ca Mau Peninsula situated in the Mekong Delta of Vietnam, features a low-lying terrain. Over recent years, the region has encountered the adverse impacts of climate change, leading to both land subsidence and rising sea levels. In this study, we assessed the land subsidence susceptibility in the Ca Mau peninsula utilizing three Boosting machine learning models: AdaBoost, Gradient Boosting, and Extremely Gradient Boosting (XGB). Eight key factors were identified as the most influential in land subsidence within Ca Mau: land cover (LULC), Groundwater levels, distance to roads, Digital Terrain Model (DTM), normalized vegetation index (NDVI), geology, soil composition, and proximity to rivers and streams. A dataset comprising 1950 subsidence sample points was employed for the model, with 1910 points obtained from the PSInSAR Radar method, and the remaining points derived from leveling measurements. The sample points were split, with 70% allocated to the training set and 30% to the testing set. Following computation and execution, the three models underwent evaluation for accuracy using statistical metrics such as the ROC curve, Area under the curve (AUC), Specificity, Sensitivity, and Overall Accuracy. The research findings revealed that the XGB model exhibited the highest accuracy, achieving an AUC above 0.9 for both the training and test sets. Consequently, XGB was chosen to construct a land subsidence susceptibility map for the Ca Mau peninsula.

Following ischemic stroke, the degradation of myelin and other cellular membranes surpasses the lipid-processing capabilities of resident microglia and infiltrating macrophages. This imbalance leads to foam cell formation in the infarct and areas of secondary neurodegeneration, instigating sustained inflammation and furthering neurological damage. Given that mitochondria are the primary sites of fatty acid metabolism, augmenting mitochondrial biogenesis (MB) may enhance lipid processing, curtailing foam cell formation and post-stroke chronic inflammation. Previous studies have shown that the pharmacological activation of the β2-adrenergic receptor (β2-AR) stimulates MB. Consequently, our study sought to discern the effects of intensified β2-AR signal-ing on MB, the processing of brain lipid debris, and neurological outcome using a mouse stroke model. To achieve this goal, aged mice were treated with formoterol, a long-acting β2-AR ago-nist, daily for two and eight weeks following stroke. Formoterol increased MB in the infarct re-gion, modified fatty acid metabolism, and reduced foam cell formation. However, it did not re-duce markers of post-stroke neurodegeneration or improve recovery. Our findings suggest that boosting MB in myeloid cells is one component of a therapeutic avenue for improving brain lipid debris processing after stroke.

In this study, we demonstrate how the incorporation of appropriate feature engineering together with the selection of a Machine Learning (ML) algorithm that best suits the available dataset, leads to the development of a predictive model for transformation temperatures that can be applied to a wide range of shape memory alloys. We develop a gradient boosting ML surrogate model capable of predicting Martensite Start, Martensite Finish, Austenite Start, and Austenite Finish transformation temperatures with an average accuracy of more than 95% by explicitly taking care of potential distribution changes when modeling different alloy systems. We included heat treatment, rolling, extrusion processing parameters, and alloy system categorical features in the model input features to achieve more accurate and realistic results. In addition, using Shapley values, which are calculated based on the average marginal contribution of features to all possible coalitions, this study was able to gain insights into the governing features and their effect on predicted transformation temperatures, providing a unique opportunity to examine the critical parameters and features in martensite transformation temperatures.

Using the 2011-2020 digital inclusive finance data released by Peking University and the index system constructed by the Blue Book of China Rural Revitalization and Development Index (2018), this paper analyzes the dynamic evolution of the digital inclusive finance and the rural revitaliza-tion from time and space dimensions with the help of kernel density estimation, Markov chain and Moran index. Using The Gini coefficient decomposition method to analyze the source of differ-ences in digital inclusive finance, and then using the spatial autoregressive (SAR) model and ge-ographically weighted regression (GWR) model to study the boosting effect of digital inclusive finance on rural revitalization from the perspective of spatial aggregation and spatial differentia-tion, respectively. The results show that: (1) The growth rate of China's digital inclusive finance slows down year by year, and the inter-provincial differences increase year by year and show gradient characteristics, indicating that there may be a trend of multipolar differentiation. The overall level of Rural Revitalization shows an increasing trend, and the gap between provinces is still apparent. (2) The evolution of digital inclusive finance and rural revitalization is a slow ad-justment process, and there has been no cross-level jump in the past ten years. In digital inclusive finance, the liquidity from the highest and lowest levels to the medium level is high. However, the liquidity in the states of rural revitalization development level is not high. (3) Rural revitalization has a positive spatial spillover effect. The level of rural revitalization in the western area is signif-icantly lower than in the eastern area. At the same time, there is no significant difference between the east and central areas. The depth of the use of digital inclusive finance has a significant positive impact on the revitalization and development of rural areas, indicating that the further promotion of digital inclusive finance business in rural areas can substantially boost the revitalization of rural areas. (4) The boosting effect of digital inclusive finance on rural revitalization shows prominent spatial differentiation characteristics. The depth of use and the degree of digitization generally show a positive impact. The central and eastern coastal cities have the highest impact, decreasing toward the southwest and northeast. The areas with the lowest usage depth impact are clustered in the northeast, and the areas with the lowest digitization impact are clustered in the southwest.

Fast Field-Cycling (FFC) Nuclear Magnetic Resonance (NMR) relaxometry is a powerful non-destructive magnetic resonance technique that enables, among other things, the investigation of slow molecular dynamics at low magnetic field intensities. FFC-NMR relaxometry measurements provide insight into molecular motion across various timescales within a single experiment. This study focuses on a \textit{model-free} approach, representing the NMRD profile $R_1$ as a linear combination of Lorentzian functions, thereby addressing the challenges of fitting data within an ill-conditioned linear least-squares framework. Tackling this problem, we present a comprehensive review and experimental validation of three regularization approaches to implement the model-free approach to analysing NMRD profiles. These include: (1) \nameUpe, utilizing locally adapted $L_2$ regularization; (2) \nameL, based on $L_1$ penalties; and (3) a hybrid approach combining locally adapted $L_2$ and global $L_1$ penalties. Each method's regularization parameters are determined automatically, according to the Balancing and Uniform Penalty principles. % Our contributions include the implementation and experimental validation of the \nameUpe{} and \nameUp{} algorithms, and the development of a "dispersion analysis" technique to assess the existence range of the estimated parameters. The objective of this work is to delineate the variance in fit quality and correlation time distribution yielded by each algorithm, thus broadening the set of software tools for the analysis of sample structures in FFC-NMR studies. The findings underline the efficacy and applicability of these algorithms in the analysis of NMRD profiles from samples representing different potential scenarios. 1

Factorization reduces computational complexity and is therefore an important tool in statistical machine learning of high dimensional systems. Conventional molecular modeling, including molecular dynamics and Monte Carlo simulations of molecular systems, is a large research field based on approximate factorization of molecular interactions. Recently, the local distribution theory was proposed to factorize global joint distribution of a given molecular system into trainable local distributions. Belief propagation algorithms are a family of exact factorization algorithms for trees and are extended to approximate loopy belief propagation algorithms for graphs with loops. Despite the fact that factorization of probability distribution is their common foundation, computational research in molecular systems and machine learning studies utilizing belief propagation algorithms have been carried out independently with respective track of algorithm development. The connection and differences among these factorization algorithms are briefly presented in this perspective, with the hope to intrigue further development in factorization algorithms for physical modeling of complex molecular systems.

The properties of iterative splitting methods with serial versions have been analyzed since recent years, see [1] and [3]. We extend the iterative splitting methods to a class of parallel versions, which allow to reduce the computational time and keep the bene t of the higher accuracy with each iterative step. Parallel splitting methods are nowadays important to solve large problems, which can be splitted in subproblems and computed independently with the dierent processors. We present a novel parallel iterative splitting method, which is based on the multi-splitting methods, see [2], [10] and [15]. Such a exibilisation with multisplitting methods allow to decompose large iterative splitting methods and recover the bene t of their underlying waveform-relaxation (WR) methods. We discuss the convergence results of the parallel iterative splitting methods, while we could reformulate such an error to a summation of the individual WR methods. We discuss the numerical convergence of the serial and parallel iterative splitting methods and present dierent numerical applications to validate the bene t of the parallel versions.

Plants are exposed to a variety of abiotic and biotic stresses leading to increased formation of reactive oxygen species (ROS) in plant cells. ROS are capable of oxidizing proteins, pigments, lipids, nucleic acids, and other cell molecules, disrupting their functional activity. During the process of evolution, numerous antioxidant systems were formed in plants, including antioxidant enzymes and low-molecular-weight non-enzymatic antioxidants. Antioxidant systems perform neutralization of ROS and therefore prevent oxidative damage of cell components. In the present review, we focus on the biosynthesis of non-enzymatic antioxidants in higher plant cells such as ascorbic acid (vitamin C), glutathione, flavonoids, isoprenoids, including carotenoids, tocopherol (vitamin E), ubiquinone and plastoquinone. Their functioning and their reactivity with respect to individual ROS are described. The review is also devoted to the modern genetic engineering methods, which are widely used to change the quantitative and qualitative content of the non-enzymatic antioxidants in cultivated plants. These methods allow to obtain various plant lines with given properties in a rather short time. The most successful approaches for plant transgenesis and plant genome editing for the enhancement of the biosynthesis and the content of these antioxidants are discussed.

Deep learning (DL) algorithms used for DOTATATE PET lesion detection typically require large, well-annotated training datasets. These are difficult to obtain due to low incidence of gastroenteopancreatic neuroendocrine tumors (GEP-NETs), and the high cost of manual annotation. Furthermore, networks trained and tested with data acquired from site specific PET/CT instrumentation, acquisition and processing protocols have reduced performance when tested with offsite data. This lack of generalizability requires even larger, more diverse training datasets. The objective of this study is to investigate the feasibility of improving DL algorithm performance by better matching the background noise in training datasets to higher noise, out-of-domain testing datasets. 68Ga-DOTATATE PET/CT datasets were obtained from two scanners: Scanner1, a state-of-the-art digital PET/CT (GE DMI PET/CT; n=83 subjects), and Scanner2, an older-generation analog PET/CT (GE STE; n=123 subjects). Set1, the data set from Scanner1 was reconstructed with standard clinical parameters (5 minutes; Q.Clear) and list-mode reconstructions (VPFXS 2, 3, 4, and 5-minutes). Set2, data from Scanner2, representing out-of-domain clinical scans, used standard iterative reconstruction (5 minutes; OSEM). Reconstructed datasets were divided into training, validation, and testing datasets in a 60%, 20%, 20% proportion, and a deep neural network was trained with each: Network1 for Scanner1 and Network2 for Scanner2. DL performance (Network1) was tested with out-of-domain test data (Set2). To evaluate the effect of training sample size, we tested DL model performance using a fraction (25%, 50%, and 75%) of Set1 for training. Scanner1, list-mode 2-minute reconstructed data demonstrated the most similar noise level compared that of Set2, resulting in the best performance (F1=0.713). This was not significantly different compared to the highest performance, upper-bound limit using in-domain training for Network2 (F1=0.755; p-value=0.103). Regarding sample size, the F1 score significantly increased from 25% training data (F1=0.478) to 100% training data (F1=0.713; p<0.001). List-mode data from modern PET scanners can be reconstructed to better match the noise properties of older scanners. Using existing data and their associated annotations dramatically reduces the cost and effort in generating these datasets, and significantly improves the performance of existing DL algorithms. List-mode reconstructions can provide an efficient, low-cost method to improve DL algorithm generalizability.

Based on the theory of behavioral economics, this study deeply analyzes the principles of behavioral economics involved in the development of mass sports, including psychological expectation, selection deviation and incentive mechanism, rationalize the current situation of group sports development, discusses how to effectively promote the development of mass sports, and puts forward a series of concrete countermeasures. In view of the problem of behavioral expectations, it is suggested to establish a comprehensive publicity and education system to improve the public's awareness and understanding of sports, and to stimulate individuals' active participation through self-setting goals and planning methods. In view of the selection bias, it is suggested that the government and relevant institutions provide diversified and attractive sports activity options, and make full use of technological means to increase the visibility and participation of activities.In addition, in view of the incentive mechanism problem, it is advocated to adopt differentiated incentive measures to meet the needs of different groups. The government can provide some preferential policies and establish incentive mechanisms to provide support for the organization of mass sports activities. It is expected that this research can stimulate the enthusiasm of the masses to participate in sports and promote the healthy development of mass sports.

Zero-dimensional (0D) tin halide perovskites feature extraordinary properties, such as broadband emission, high photoluminescence quantum yield, and self-absorption-free characteristics. The innovation of synthesis approaches for high-quality 0D tin halide perovskites has facilitated the flourishing development of perovskite-based optoelectronic devices in recent years. However, discovering an effective strategy to further enhance their emission efficiency remains a considerable challenge. Herein, we report a unique strategy employing rapid heat treatment to attain efficient self-trapped exciton (STE) emission in Cs4SnBr6 zero-dimensional perovskite. Compared to the pristine Cs4SnBr6, rapid thermal treatment (RTT) at 200°C for a duration of 120 seconds results in an augmented STE emission with photoluminescence (PL) quantum yield rising from an initial 50.1% to a substantial 64.7%. Temperature-dependent PL spectra analysis, Raman spectra, and PL decay traces reveal that the PL improvement is attributed to the appropriate electron-phonon coupling as well as the increased binding energies of STEs induced by the RTT. Our findings open up a new avenue for efficient luminescent 0D tin-halide perovskites toward the development of efficient optoelectronic devices based on 0D perovskites.

The impact of nutrition on immunity is an intense area of research. Malnutrition is linked to a higher risk of microbial infections, while severe infections usually lead to a nutritional imbalance in affected patients. The nutritional status has an impact on the severity of the ongoing SARS-CoV-2 infection. Studies conducted on small numbers of patients have shown the benefits of maintaining optimal vitamin (B12 and D) and mineral (zinc and magnesium) balance in reducing the intensity of COVID-19. Although consuming a balanced diet with a healthy lifestyle is always desirable, the importance of such practice is even more meaningful during the COVID-19 pandemic. Keeping an optimal balance of vitamins and minerals through healthy dietary habits helps to maintain a robust immune system that is essential to combat invading microbial pathogens, including SARS-CoV-2.

ABSTRACT Underwater mines may destroy friendly submarines and marine habitats, compromising nonmilitary security. Finding credible information is vital to avoiding scams and spotting hazards. This article employs Supervised Machine literacy models to appropriately categorize subsea items like mines or gems based on Sonar sounds. Python constructs three double classifier models using Gorman and Sejnowski (1988) training data. Through the extraction of key aspects from the Sonar signals, such as spectral components and intensity, the models are able to match newly obtained data with the gemstone order or mine. Delicacy decreases the chance of misidentifications in nonmilitary activities. Machine literacy offers full validation that accommodates real-world Sonar data noise and unpredictability. Based on test results, the highest performing algorithm will deliver the required ratio of accuracy to perceptivity for the bracket task. Central keywords: vaticination model, bracket algorithms, supervised machine literacy, SONAR, and aquatic mining emphasize particular foundations. Improved sophistication in spotting undersea Mines let nonmilitary defence systems respond to proven threats only, preventing friendly submarines or sea life from unnecessary damage owing to false duplicity. This work is a promising start to real-world mine detection devices. Further developments may incorporate greater training data sets, real-time testing on subsea platforms equipped with integrated sonar, and optimization for the discovery of new mine-types. Overall, machine learning and Sonar vision decrease signal fluctuation and noise, making it easier to determine accurate boundaries for non-military applications and environmental protection. The recommended automated discovery technique must balance computational efficiency, generalizability, and delicacy. Prior a real crime, new quality control and verification procedures could boost trust even further.

Data Extraction is a technique is called as clustering which is used to retrieve data either from the files or data bases or both. This paper focuses on the performance evaluation parameters of the clustering algorithms based on different parameters or conditions or constraints and parameters which are used to perform the clustering process to get the clusters on the data sets. Therefore best clusters are retrieved when best parameters or conditions or constraints or preferences which are applied on the data sources for the clustering process. These parameters or conditions or constraints are opted by the user called as user preferences.

There is increasing interest in automating train operations of mainline services, e.g. to increase network capacity. Automatic train operation (ATO) is already achieved by several pilot projects, but not implemented on a large scale. Before the general introduction of new or adapted technologies can have a transformative effect on the operation of such a complex system as train operation on mainlines, they have to pass functional, interoperability and performance tests. A virtual preliminary analysis is one way to ensure a smooth as well as safe introduction and implementation. This paper aims to present an approach that applies to the performance testing of ATO systems. Therefore, methods and test standards for technologies enabling automatic operation in other transport sectors are reviewed. The main findings have been adapted, transformed and combined to be used as a general strategy for virtual performance testing in the railway sector. Specifically, universal performance indicators, namely punctuality, accuracy, energy consumption, safety and comfort, are presented. A layer model for scenario description is adapted from the automotive sector, as well as the definition of different scenario types. Lastly, factors that can influence the performance of an ATO algorithm are identified. To demonstrate the developed approach, a straightforward investigation of a case study is conducted using a microscopic train simulator in combination with an ATO algorithm.

Clustering, or otherwise known as cluster analysis, is a learning problem that takes place without any human supervision. This technique has often been utilized, much efficiently, in data analysis, and serves for observing and identifying interesting, useful, or desired patterns in the said data. The clustering technique functions by performing a structured division of the data involved, in similar objects based on the characteristics that it identifies. This process results in the formation of groups, and each group that is formed, is called a cluster. A single said cluster consists of objects from the data, that have similarities among other objects found in the same cluster, and resemble differences when compared to objects identified from the data that now exist in other clusters. The process of clustering is very significant in various aspects of data analysis, as it determines and presents the intrinsic grouping of objects present in the data, based on their attributes, in a batch of unlabeled raw data. A textbook or otherwise said, good criteria, does not exist in this method of cluster analysis. That is because this process is so different and so customizable for every user, that needs it in his/her various and different needs. There is no outright best clustering algorithm, as it massively depends on the user’s scenario and needs. This paper is intended to compare and study two different clustering algorithms. The algorithms under investigation are k-mean and mean shift. These algorithms are compared according to the following factors: time complexity, training, prediction performance and accuracy of the clustering algorithms.

In the current age of the Fourth Industrial Revolution ($4IR$ or Industry $4.0$), the digital world has a wealth of data, such as Internet of Things (IoT) data, cybersecurity data, mobile data, business data, social media data, health data, etc. To intelligently analyze these data and develop the corresponding real-world applications, the knowledge of artificial intelligence (AI), particularly, machine learning (ML) is the key. Various types of machine learning algorithms such as supervised, unsupervised, semi-supervised, and reinforcement learning exist in the area. Besides, the deep learning, which is part of a broader family of machine learning methods, can intelligently analyze the data on a large scale. In this paper, we present a comprehensive view on these machine learning algorithms that can be applied to enhance the intelligence and the capabilities of an application. Thus, this study's key contribution is explaining the principles of different machine learning techniques and their applicability in various real-world applications areas, such as cybersecurity, smart cities, healthcare, business, agriculture, and many more. We also highlight the challenges and potential research directions based on our study. Overall, this paper aims to serve as a reference point for not only the application developers but also the decision-makers and researchers in various real-world application areas, particularly from the technical point of view.

This work proposes a metaheuristic-based approach for hyperparameter selection in a multilayer perceptron to classify electromyographic signals. The main goal of the study is to improve the performance of the model by optimizing four important hyperparameters: the number of neurons, the learning rate, the epochs, and the training batches. The approach proposed in this work shows that hyperparameter optimization using particle swarm optimization and gray wolf optimizer significantly improves the performance of a multilayer perceptron for classifying EMG motion signals. The final model achieved an average classification rate of 93% for the validation phases. The results obtained are promising and suggest that the proposed approach may be helpful for the optimization of deep learning models in other signal processing applications.

Traditional lithium-ion batteries cannot meet the high flexibility and bendability requirements of modern flexible electronic devices due to the limitations of their electrode materials. Therefore, the development of high-performance flexible energy storage devices is of great significance for promoting flexible electronics. In recent years, one-dimensional flexible fiber lithium-ion batteries have been rapidly developed due to the advantages of high flexibility and bendability. However, it is still a big challenge to realize 1D flexible fiber lithium-ion batteries with excellent electro-chemical properties and good mechanical performance. In this work, a reduced graphene ox-ide-based printing ink is proposed to fabricate flexible Li4Ti5O12/graphene fiber electrodes through a 3D printing assembly strategy. It is noteworthy that the green reducing agent vitamin C was used to reduce graphene oxide in one step, which improved the conductivity of the fiber elec-trode. Furthermore, a 3D conductive network is constructed inside the fiber electrodes due to the high specific surface area of reduced graphene oxide, which enhances the electronic conductivity and ion mobility. The fiber electrode not only has good mechanical performance, but also has ex-cellent electrochemical properties. Equally important, the method is simple and efficient, and the working environment is flexible. It can precisely control the shape, size and structure of the one-dimensional fiber flexible electrode, which is of great significance for the development of fu-ture flexible electronic devices.

Machine learning applications often need large amounts of training data to perform well. Whereas unlabeled data can be easily gathered, the labeling process is difficult, time-consuming, or expensive in most applications. Active learning can help solve this problem by querying labels for those data points that will improve the performance the most. Thereby, the goal is that the learning algorithm performs sufficiently well with fewer labels. We provide a library called scikit-activeml that covers the most relevant query strategies and implements tools to work with partially labeled data. It is programmed in Python and builds on top of scikit-learn.

The Stochastic Optimisation Software (SOS) is a Java platform facilitating the algorithmic design process and the evaluation of metaheuristic optimisation algorithms. It reduces the burden of coding miscellaneous methods for dealing with several bothersome and time-demanding tasks such as parameter tuning, implementation of comparison algorithms and testbed problems, collecting and processing data to display results, measuring algorithmic overhead, etc. SOS provides numerous off-the-shelf methods including 1) customised implementations of statistical tests, such as the Wilcoxon Rank-Sum test and the Holm-Bonferroni procedure, for comparing performances of optimisation algorithms and automatically generate result tables in PDF and LaTeX formats; 2) the implementation of an original advanced statistical routine for accurately comparing couples of stochastic optimisation algorithms; 3) the implementation of a novel testbed suite for continuous optimisation, derived from the IEEE CEC 2014 benchmark, allowing for controlled activation of the rotation operator. each testbed function. Moreover, this article comments on the current state of the literature in stochastic optimisation and highlights similarities shared by modern metaheuristics inspired by nature. It is argued that the vast majority of these algorithms are simply a reformulation of the same methods and that metaheuristics for optimisation should be simply treated as stochastic processes with less emphasis on the inspiring metaphor behind them.

Oxygen evolution reaction (OER) is a key half-reaction in electrocatalytic water splitting. Large-scale water electrolysis is hampered by the commercial precious metal-based OER electrocatalysts owing to their high cost and slow kinetics. To address these issues, we present a facile one-pot room-temperature coprecipitation method to quickly synthesize carbon nanotubes-interconnected amorphous NiFe-layered double hydroxides (NiFe-LDH@CNT) as low-cost, efficient and stable OER electrocatalyst. NiFe-LDH@CNT hybrid catalyst delivers outstanding OER performance with a low onset overpotential of 255 mV and a small Tafel slope of 51.2 mV dec-1, as well as outstanding long-term stability. The terrific catalytic capability of NiFe-LDH@CNT can be associated with the synergistic effects of its room-temperature synthesized amorphous structure, bi-metallic modulation, and conductive CNT skeleton. The room-temperature synthesis can not only offer economic feasibility, but also obtain amorphous NiFe-LDH without crystalline boundaries, facilitating long-term stability during OER process. The bi-metallic nature of NiFe-LDH guarantees a modified electronic structure, providing additional catalytic sites. Simultaneously, the highly conductive CNT network fosters a nanoporous structure, facilitating electron transfer, O2 release and enriching catalytic sites. This study presents a strategy to purposefully design nanoarchitecture and facilely synthesize amorphous transition metal-based OER catalysts, ensuring the cost effectiveness, production efficiency, and long-term stability.

Cellular Technology came into existence in Japan in 1979. From that time, we have seen many advances in technology. Currently, most of the person uses either 4G or 5G, among which 5G is a newer technology. 4G network was the first network to use LTE. LTE stands for Long Term Evaluation. Most people get confused between 4G and LTE, they assume both to be the same. In reality, LTE has evolved on the 4G technology. It was first introduced in 2008 to provide higher efficiency and data rates to the cellular network. It was designed to evolve the performance of the networks which includes the evolution of hardware components, optimization of software, power and cost efficiency. This work presents a study on LTE, LTE-A and VoLTE technology. We also discussed about the several packet scheduling algorithms that are being used for transmission of packets. It brings out new opportunities for the researchers to work on increasing the efficiency of those algorithms by modifications.

Convolutional neural networks (CNNs) have proven to be a very efficient class of machine learning (ML) architectures for handling multidimensional data by maintaining data locality, especially in the field of computer vision. Data pooling, a major component of CNNs, plays a crucial role for extracting important features of the input data and downsampling its dimensionality. Multidimensional pooling, however, is not efficiently implemented in existing ML algorithms. In particular, quantum machine learning (QML) algorithms have a tendency to ignore data locality for higher dimensions by representing/flattening multidimensional data as simple one-dimensional data. In this work, we propose using the quantum Haar transform (QHT) and quantum partial measurement for performing generalized pooling operations on multidimensional data. We present the corresponding decoherence-optimized quantum circuits for the proposed techniques along with their theoretical circuit depth analysis. Our experimental work was conducted using multidimensional data, ranging from 1-D audio data, to 2-D image data, to 3-D hyperspectral data, to demonstrate the scalability of the proposed methods. In our experiments, we utilized both noisy and noise-free quantum simulations on a state-of-the-art quantum simulator from IBM Quantum. We also show the efficiency of our proposed techniques for multidimensional data by reporting the fidelity of results.

Moving object detection plays a crucial role in various applications, particularly in traffic surveillance and collision warning systems. However, the high cost of training and slow detection pose significant challenges to the practicality and real-time performance of existing methods. These challenges hinder the practicality and real-time performance of existing methods. The need for a reliable and efficient moving object detection system prompts the search for cost-effective strategies. Enhancing detection speed without sacrificing accuracy is crucial for real-time applications. Overcoming these challenges is essential to advance the field of moving object detection and improve its applicability in various domains. This paper presents a comprehensive review of the literature on moving object detection, proposes novel strategies to overcome the challenges of high training costs and slow detection. The study emphasizes the importance of reliable speed monitoring systems and advancements in control systems to enhance driver assistance on urban highways. Each frame in the dataset undergoes YOLOv6 processing to detect and classify objects, generating bounding box predictions and class probabilities. Optical flow, specifically the Lucas-Kanade method, is then utilized to compute motion vectors between consecutive frames. These motion vectors facilitate object tracking across frames, enabling refined bounding box positions and improving overall object tracking accuracy. The results demonstrate the effectiveness of the proposed technique in reducing training costs, improving detection speed, and maintaining a high level of accuracy when compared to existing methods. The paper concludes by summarizing the findings and highlighting the potential of the proposed strategy for precise and reliable moving object recognition in real-world traffic scenarios

This research investigates the potential benefits of integrating machine learning algorithms and IoT sensors in modern agriculture. The focus is on optimizing crop production and reducing waste through informed decisions about planting, watering, and harvesting crops. The paper discusses the current state of machine learning and IoT in agriculture, highlighting key challenges and opportunities. It also presents experimental results that demonstrate the impact of changing labels on the accuracy of data analysis algorithms. The findings recommend that by analyzing wide-ranging data collected from farms, including real-time data from IoT sensors, farmers can make more informed verdicts about factors that affect crop growth. Eventually, the integration of these technologies can transform modern agriculture by increasing crop yields while minimizing waste. In our studies, we achieve a classification accuracy of 99.59% using the Bayes Net algorithm and 99. 46% using Naïve Bayes Classifier, and Hoeffding Tree algorithms. Our results indicate that we achieved high accuracy results in our experiments in order to increase crop growth.

Weather forecast has a big impact on the global economy, accurate and timely weather forecast is required by all, it affects many aspects of human livelihood and lifestyle, it also plays a critical role in decision making for severe weather management and for primary and secondary sectors like agriculture, transportation, tourism, and industry as they rely on good weather conditions for production and operations. The erratic and uncertain complex nature of the weather makes traditional weather forecasting tedious and a challenging task, traditional weather forecast involves applying technology and scientific knowledge on numerical weather prediction (NWP), and weather radar to solve complex mathematical equations to obtain forecasts based on current weather conditions. These traditional processes utilize expensive, complex physical and computational power to produce forecasts, which can be inaccurate and have various catastrophic impacts on society. In this research, a machine learning-based weather forecasting model was proposed, the model was implemented using 4 classifier algorithms which include Random Forest classifier, Decision Tree Algorithm, Gaussian Naïve Bayes model, and Gradient Boosting Classifier, these algorithms were trained using a publicly available dataset from Kaggle for the city of Seattle for the period 2012 to 2015. The model’s performance was evaluated; the Gaussian Naive Bayes algorithm proved to be the best performing algorithm with a predictive accuracy of 84.153 %.

Hyperspectral image (HSI) classification is a mechanism of analyzing differentiated land cover in remotely sensed hyperspectral images. In the last two decades, a number of different types of classification algorithms have been proposed for classifying hyperspectral data. These algorithms include supervised as well as unsupervised methods. Each of these algorithms has its own limitations. In this research, three different types of unsupervised classification methods are used to classify different datasets i-e Pavia Center, Pavia University, Cuprite, Moffett Field. The main objective is to assess the performance of all three classifiers K-Means, Spectral Matching, and Abundance Mapping, and observing their applicability on different datasets. This research also includes spectral feature extraction for hyperspectral datasets.

As the embedded device and internet of things (IoTs) concept prevalent in today's world, there is an increasing demand for the security and performance requirements on deploying these devices to private and public sectors. The crucial part of it is to protect privacy, confidentiality and integrity, meanwhile, maintain an adequate level of performance during transmission, storage and access of critical information. While the conventional cryptography methods, such as the Advanced Encryption Standard (AES), SHA$-$2 hashing method and RSA and Diffie Hellman for message authentication and identification, work well on systems which have reasonable processing power and memory capabilities. These do not scale well into a world with embedded systems and sensor networks, in conjunction with their nature of smaller size and lower cost. Thus, in the context of resource constrained device, lightweight cryptography methods are proposed to overcome many of the problems of conventional cryptography possessed. This includes constraints related to physical size, processing requirement, memory limitation, energy drain and production cost. This paper provides a survey of the architectures that are defined as replacements for conventional ciphers within an IoTs space and discuss some trends in the design of future lightweight algorithms. The performance metrics are carefully chosen to reflect and assess the suitability for embedded devices. The aim of this research is to identify the various performance metrics applied on different types of symmetric block ciphers especially lightweight ciphers and compare the results on versatile platforms with stream ciphers and public key methods. The comparative analysis on efficient LW cipher will be tested against other similar block ciphers on both MacBook Pro with Intel core and resource constrained device Raspberry Pi with ARM processor.

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

Quantum computers are machines that are designed to use quantum mechanics in order to improve upon classical computers by running quantum algorithms. One of the main applications of quantum computing is solving optimization problems. For addressing optimization problems we can use linear programming. Linear programming is a method to obtain the best possible outcome in a special case of mathematical programming. Application areas of this problem consist of resource allocation, production scheduling, parameter estimation, etc. In our study, we looked at the duality of resource allocation problems. First, we chose a real world optimization problem and looked at its solution with linear programming. Then, we restudied this problem with a quantum algorithm in order to understand whether if there is a speedup of the solution. The improvement in computation is analysed and some interesting results are reported.

Soil texture is key information in agriculture for improving soil knowledge and crop performance, so the accurate mapping of this crucial feature is imperative for rationally planning cultivations and for targeting interventions. We studied the relationship between radioelements and soil texture in the Mezzano Lowland (Italy), a 189 km² agricultural plain investigated through a dedicated airborne gamma-ray spectroscopy survey. The K and Th abundances were used to retrieve the clay and sand content by means of a multi-approach method. Linear (simple and multiple) and non-linear (machine learning algorithms with deep neural networks) predictive models were trained and tested adopting a 1:50,000 scale soil texture map. The comparison of these approaches highlighted that the non-linear model introduces significant improvements in the prediction of soil texture fractions. The predicted maps of the clay and of the sand content were compared with the regional soil maps. Although the macro-structures were equally present, the airborne gamma-ray data permits us shedding light on finer features. Map areas with higher clay content were coincident with paleo-channels crossing the Mezzano Lowland in Etruscan and Roman periods, confirmed by the hydrographic setting of historical maps and by the geo-morphological features of the study area.

Abstract: In network science and big data, the concept of finding meaningful infrastructures in networks has emerged as a method of finding groups of entities with similar properties within very complex systems. The whole concept is generally based on finding subnetworks which have more properties (links) amongst nodes belonging to the same cluster than nodes in other groups (A concept presented by Girvan and Newman, 2002). Today meaningful infrastructure identification is applied in all types of networks from computer networks, to social networks to biological networks. In this article we will look at how meaningful infrastructure identification is applied in biological networks. This concept is important in biological networks as it helps scientist discover patterns in proteins or drugs which helps in solving many medical mysteries. This article will encompass the different algorithms that are used for meaningful infrastructure identification in biological networks. These include Genetic Algorithm, Differential Evolution, Water Cycle Algorithm (WCA), Walktrap Algorithm, Connect Intensity Iteration Algorithm (CIIA), Firefly algorithms and Overlapping Multiple Label Propagation Algorithm. These al-gorithms are compared with using performance measurement parameters such as the Mod-ularity, Normalized Mutual Information, Functional Enrichment, Recall and Precision, Re-dundancy, Purity and Surprise, which we will also discuss here.

The requirements for efficient replacement of fossil fuel, combined with the growing energy crisis, put hydrogen production into focus. Efficient and cost-effective electrocatalysts are needed for H2 production, and novel strategies for their discovery must be developed. Here we utilized Kinetic Monte Carlo (KMC) simulations to demonstrate that hydrogen evolution reaction (HER) can be boosted via hydrogen spillover to the support when the catalyst surface is largely covered by adsorbed hydrogen under operating conditions. Based on the insights from KMC, we synthesized a series of reduced graphene oxide-supported catalysts and compared their activities towards HER in alkaline media with that of corresponding pure metals. For Ag, Au, and Zn, the support effect is negative, but for Pt, Pd, Fe, Co, and Ni, the presence of the support enhances HER activity. The HER volcano, constructed using calculated hydrogen binding energies and measured HER activities, shows a positive shift of the strong binding branch. This work demonstrates the possibilities of metal|support interface engineering for producing effective HER catalysts and provides general guidelines for choosing novel catalyst-support combinations for electrocatalytic hydrogen production.

Automatic recognition methods for non-stationary EEG data collected from EEG sensors play an essential role in neurological detection. The integrative approaches proposed in this study consists of Symlet wavelet processing, a gradient boosting machine, and a grid search optimizer for a three-level classification scheme for normal subjects, intermittent epilepsy, and continuous epilepsy. Fourth-order Symlet wavelets were adopted to decompose the EEG data into five time-frequency sub-bands, whose statistical features were computed and used as classification features. The grid search optimizer was used to automatically find the optimal parameters for training the classifier. The classification accuracy of the gradient boosting machine was compared with that of a support vector machine and a random forest classifier constructed according to previous descriptions. Multiple-index were used to evaluate the Symlet wavelet transform-gradient boosting machine-grid search optimizer classification scheme, which provided better classification accuracy and detection effectiveness than has recently reported in other work on three-level classification of EEG data.

In the radar system, detection represents a basic and important stage in the receiver side. The detection process is based on the thresholding criteria; two philosophies of this criteria, constant and adaptive threshold. The constant threshold is simple in design, but it has a mis-detection and does not control the false alarm rate. As for the adaptive threshold, it is powerful in target detection, and better control of the false alarm rate, where it is called Constant False Alarm Rate (CFAR). Lots of research in the CFAR design, but the gap in the previous works is that there is no CFAR algorithm can be working with all or most environmental fields and all or most target situations.In this paper, The CFAR, which can work with the most environment and most of the target situations, has been presented. The producing the design and implementation of the new practical CFAR processor is presented. Where, the new CFAR is a combination of the properties of three different CFAR algorithm (CA, OSGO, and OSSO), and from two different families; averaging and statistical. Where it has overperformed of it's is 97.25% for simulation and 96.25% for the implementable version for different target situations. The simulation analysis is made by using Matlab 2015, while the implementation is done by using Xilinx Spartan 700 3a.

The development of reliable predictive algorithm for house price as the housing market is a stand-out among the most involved regarding valuing the price and continues to fluctuate, is constantly a need for socio-economic advancement and welfare of citizen. In this paper, we develop machine learning algorithms for forecasting UK housing Price, and find an optimal algorithm that forecasts housing price accurately on the premises of the presence of many features or covariates. After applying correlation analysis to remove correlated variables in order to avoid multicollinearity, thereby increasing the statistical power, a novel method of using regression analysis to first of all understand and select statistically significant features for the various regions in England based on North South divide is adopted. These features are then used in the machine learning algorithm to further increase the statistical power of the algorithm, increase the level of accuracy for each of them and ultimately increase the predictive values for the algorithms. The model construction involves 3 stages: 1- correlation analysis to identify and remove correlated variables thereby avoiding multicollinearity and increasing the statistical power of the linear regression, 2 - using linear regression to determine variables that are statistically significant and 3 - building the machine learning algorithms based on the variables that are statistically significant from the linear regression. A comprehensive dataset of UK Paid housing Price from 2010 to 2019 was linked to a number of other datasets to generate a total 21 variables or features used for the models. Catboost, Gradient Boosting, Bagging, Random Forest, Extra Tree all achieved the excellent models performance result in all the regions considered. The comparison of the seven models showed that Extra Tree algorithm consistently achieved the best performance in term of level of accuracy in all the regions. K-Nearest Neighbours (KNN) is the only algorithm with less than 50% level of accuracy. Noticeably, the regions considered had varying or differing insignificant variables, implying that although many variables are common (statistically significant) to all the regions, there are regional differences and impact when modelling or predicting housing prices. This study validates the practicability of developing a machine learning methodology for the prediction of housing price. This research offers a reference for future house price prediction based on machine learning.

This work proposes a physics-based identification technique based on genetic algorithms. The main objective is to obtain a parametric matrix A that describes the time-invariant linear model of the longitudinal dynamics of an aircraft. This is achieved by proposing a fitness function based on the properties of the transition matrix and taking advantage of some of the capabilities of the genetic algorithm, mainly those of restricting the search ranges of the unknowns. In this case, such unknowns are related to the type of aircraft and flight conditions that are considered during the identification process. The proposed identification method is validated with a reliable nonlinear model that can be found in the literature, as well as with the calculation of the trim condition and linearization generally used in aircraft dynamics. In summary, this study suggests the genetic algorithm provided with the adequate fitness function, could be an appealing alternative for aircraft model identification, even when only a limited amount of data is available. Furthermore, in some cases, linearization using genetic algorithm can be more efficient than classical methods.

This study addressed algorithmic bias in predictive policing, focusing on the Chicago Police Department's Strategic Subject List (SSL) dataset. We specifically focused on identifying and mitigating age-related biases, a notably underexplored area in prior research. Our research introduced Conditional Score Recalibration as a bias mitigation strategy alongside the well-established Class Balancing technique. Conditional Score Recalibration involved reassessing and adjusting risk scores for individuals initially assigned moderately high-risk scores in the dataset. This recalibration marked such individuals as low risk if they met three conditions, namely: no prior arrests for violent offenses, no previous arrests for narcotic offenses, and having never been involved in shooting incidents. These fairness strategies were implemented on the Random Forest model, and the fairness metrics employed included Equality of Opportunity Difference, Average Odds Difference, and Demographic Parity. The results showed a significant improvement in model fairness, particularly for age biases, without compromising the model's accuracy. These findings challenged the often-assumed trade-off between fairness and accuracy, underscoring the feasibility of achieving fairness without compromising accuracy.

This Article demonstrates how an eigendecomposition problem is inputted into a quantum circuit, how gates are applied in the quantum circuit, and how the output measurements are the correct eigenvalues. This process is known as quantum phase estimation (QPE). A quantum harmonic oscillator example, a foundational quantum physical chemistry problem, is demonstrated within the context of QPE. A particle in a box example, another quantum physical chemistry problem, may be solved by QPE with a caveat. These examples are of the limiting cases of diagonal matrices. Future advances in taking matrix inverses for solving linear sets of equations or finding ground state energies in the Schrödinger equation will use the principles implemented in this Article.

Creating self-learning algorithms, developing deep neural networks and improving other methods that "learn" for various areas of human activity is the main goal of the theory of machine learning. It helps to replace the human with a machine, aiming to increase the quality of production. The theory of artificial neural networks, which already have replaced the humans in problems of detection of moving objects, recognition of images or sounds, time series prediction, big data analysis and numerical methods remains the most dispersed branch of the theory of machine learning. Certainly, for each area of human activity it is necessary to select appropriate neural network architectures, methods of data processing and some novel tools from applied mathematics. But the universal problem for all these neural networks with specific data is the achieving the highest accuracy in short time. Such problem can be resolved by increasing sizes of architectures and improving data preprocessing, where the accuracy rises with the training time. But there is a possibility to increase the accuracy without time growing, applying optimization methods. In this survey we demonstrate existing optimization algorithms of all types, which can be used in neural networks. There are presented modifications of basic optimization algorithms, such as stochastic gradient descent, adaptive moment estimation, Newton and quasi-Newton optimization methods. But the most recent optimization algorithms are related to information geometry, for Fisher-Rao and Bregman metrics. This approach in optimization extended the theory of classic neural networks to quantum and complex-valued neural networks, due to geometric and probabilistic tools. There are provided applications of all introduced optimization algorithms, what delighted many kinds of neural networks, which can be improved by including any advanced approaches in minimization of the loss function. Afterwards, we demonstrated ways of developing optimization algorithms in further researches, engaging neural networks with progressive architectures. Classical gradient based optimizers can be replaced by fractional order, bilevel and, even, gradient free optimization methods. There is a possibility to add such analogues in graph, spiking, complex-valued, quantum and wavelet neural networks. Besides the usual problems of image recognition, time series prediction, object detection, there are many are other tasks for modern theory of machine learning, such as solving problem of quantum computations, partial differential and integro-differential equations, stochastic processes and Brownian motion, making decisions and computer algebra.

Renewable Energy Communities (RECs) are emerging as an effective concept and model to empower the active participation of citizens on the energy transition, not only as energy consumers, but also as promoters of environmentally friendly energy generation solutions. This paper aims to contribute to the management and optimization of individual and community Distributed Energy Resources (DER). The solution follows a price and source-based REC management program, in which consumers day-ahead flexible loads (Flex Offers) are shifted according to electricity generation availability, prices and personal preferences, to balance the grid and incentivize user participation. The heuristic approach used in the proposed algorithms allows the optimization of energy resources in a distributed edge and fog approach with a low computational overhead. The simulations performed using real world energy consumption and flexibility data of a REC with 50 dwellings show an average cost reduction of 10.6% and an average increase of 11.4% in individual self-consumption. Additionally, the case-study demonstrates promising results regarding grid load balancing and the introduction of intra-community energy trading.

Metabolic pathways provide key information to achieve a better understanding of life and all its processes; this is useful information for the improvement of medicine, agronomy, pharmacy, and other similar areas. The main analysis tool used to study these pathways is based on the idea of pathway comparison, using graph data structures. Metabolic pathway comparison has been defined as a computationally complex task \cite{ay2011submap,abaka2013campways}. In previous work from 2017, two different approaches that simplify the problem of comparing pathways represented as graphs were introduced. The first algorithm consists of the transformation of a two-dimensional graph structure, representing a metabolic pathway, to a one-dimensional structure and thus aligning the corresponding data using a reduced 1 dimension string. The second algorithm consists of performing a paired analysis between reactions in pathways and thus eliminating all similarities, finally, showing these differences to the user. The suggestion is to use the information provided by these algorithms as a previous analysis to a deeper, more expensive, comparison tool use. Here we provide an extension of this work with more data and deeper analysis. These methods have shown to be an effective way to treat the problem of metabolic pathway comparison as listed in the discussion and results section. Our results show evidence of a quick, simple and effective way to resolve the described problem.

The main purpose of this paper is to propose a novel optimization model with a new machine learning approach in the first section to achieve the best results in financial institutions in the second section. Since the constancy of efficacy derived from parametric and non-parametric is not significant, this paper provides a scientific assessment at the optimization section and proposes a novel combined parametric and non-parametric model which will be a new experiment in literature perception. A scientific assessment of banks based on a combination of the efficiency measurement method of CCR(Charnes, Cooper and Rhodes model) or CRS(Constant Return to Scale) BCC(Banker, Charnes, and Cooper model) or VRS (Variable Return to Scale) in Data Envelopment Analysis (DEA), as well as Stochastic Frontier Approach (SFA) for 65 banks during Feb to July 2020, are introduced. For analyzing the performance of the parametric and non-parametric approaches we have considered the linear regression and Unreplicated Linear Functional Relationship (ULFR). At the machine learning section, a novel four-layers data mining filtering pre-processes for selected supervised classification as well as unsupervised clustering algorithms to increase the accuracy and to remove unrelated attributes and data are applied. For the four kinds of preprocessing approaches of unsupervised attributes, supervised attributes, supervised instances, and unsupervised instances, we have chosen discretization, attribute selection, stratified remove folds, and resample filters respectively. Based on the nature of the suggested financial institution's dataset and attributes, the most appropriate preprocessing filter in each layer to achieve the highest performance is suggested. Finally, the superior bank, best performance model, and the most accurate algorithm are introduced. The results indicate that the bank number 56 is the superior bank. Among the proposed techniques, the novel recommended CVS compared with CCR-BCC and SFA models, has a more positive correlation with profit risk, and show a higher coefficient of determination values. Sequential Minimal Optimization(SMO) algorithm receives the highest accuracy in all four suggested filtering layers.

Typical modern information systems are required to process copious data. Conventional manual approaches can no longer effectively analyze such massive amounts of data, and thus humans resort to smart techniques and tools to complement human effort. Currently, network security events occur frequently, and generate abundant log and alert files. Processing such vast quantities of data particularly requires smart techniques. This study reviewed several crucial developments of existent data mining algorithms, including those that compile alerts generated by heterogeneous IDSs into scenarios and employ various HMMs to detect complex network attacks. Moreover, sequential pattern mining algorithms were examined to develop multi-step intrusion detection. These studies can focus on applying these algorithms in practical settings to effectively reduce the occurrence of false alerts. This article researched the application of data mining algorithms in network security. The academic community has recently generated numerous studies on this topic.

Music acoustics is an interdisciplinary field and mathematics is the basis in the music art form. Music and mathematics correlation exist since the inception of music. Various philosophers, scientists, mathematicians and musicians have expressed their views about this relationship. This paper attempts to explore this association with focus on melodic pattern identification. Mathematics in Indian Classical music with raga as the basis and just intonation tuning system is discussed. Indian vocal music clips are used for different pitch estimation algorithms in the experimentation. Harmonic product spectrum and auto-correlation algorithms are tested for accurate pitch estimation. Enhanced auto-correlation function using audio segmentation is compared with other approaches for effective pitch extraction. Results indicate pitch extraction with enhanced auto-correlation function provides accurate results as compared with other approaches tested.

In this paper we develop a forecasting algorithm for recurrent patterns in consumer demand. We study this problem in two different settings: pull and push models. We discuss several features of the algorithm concerning sampling, periodic approximation, denoising and forecasting.

Intelligent Transportation Systems (ITS) encompasses technologies, services, and applications facilitating communication between vehicles (V2V) and between vehicles and fixed infrastructure (V2I and I2V). This mutual interaction constitutes a Vehicular Ad-Hoc Network (VANET) which supports a plethora of applications targeting critical transportation aspects, such as safety, mo-bility, and environmental considerations. Dedicated Short Range Communications (DSRC), op-erating on the 5.9 GHz band, is pivotal for such exchanges. We introduced an innovative algorithm designed to identify jamming attacks and transition the Safety Application to a secure fail-safe mode. This algorithm leverages a dual-metric strategy, incorporating both distance and PDR measurements. Field tests confirm that our algorithm adeptly recognizes the activities of deceptive jammers, ensuring a prompt shift of the safety application into its fail-safe state. This paper delves into these countermeasures, evaluating their efficiency via mathematical modelling, simulations, and on-ground testing. Findings acknowledge that these strategies bolster the reliability of safety applications in jamming scenarios. Furthermore, the approaches propounded align with ongoing standardization endeavours by relevant authorities, ensuring communication mediums remain unhindered.

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

Machine learning plays a key role in present day crime detection, analysis and prediction. The goal of this work is to propose methods for predicting crimes classified into different categories of severity. We implemented visualization and analysis of crime data statistics in recent years in the city of Boston. We then carried out a comparative study between two supervised learning algorithms, which are decision tree and random forest based on the accuracy and processing time of the models to make predictions using geographical and temporal information provided by splitting the data into training and test sets. The result shows that random forest as expected gives a better result by 1.54% more accuracy in comparison to decision tree, although this comes at a cost of at least 4.37 times the time consumed in processing. The study opens doors to application of similar supervised methods in crime data analytics and other fields of data science

The need to increase the energy efficiency of buildings as well as the use of local renewable heat sources has caused that heat meters are used not only to calculate the consumed energy but also for the active management of central heating systems. Increasing the reading frequency and the use of measurement data to control the heating system expands the requirements for the reliability of heat meters. The aim of the research is to analyse a large set of meters in the real network and predict their faults to avoid inaccurate readings, incorrect billing, heating system disruption and unnecessary maintenance. The reliability analysis of heat metres, based on historical data collected over several years, shows some regularities which cannot be easily described by physics-based models. The failure rate is almost constant and does depend on the past but is a non-linear combination of state variables. To predict meters' failures in the next settlement period, three independent machine learning models are implemented and compared with selected metrics because even the high performance of a single model (87\% True Positive for Neural Network) may be insufficient to make a maintenance decision. Additionally, performing hyperparameters optimisation boosts models' performance by a few percent. Finally, three improved models are used to build an ensemble classifier which outperforms the individual models. The proposed procedure ensures the high efficiency of fault detection (>95\%), while maintaining overfitting at the minimum level. The methodology is universal and can be utilised to study the reliability and predict faults of other types of meters and different objects with the constant failure rate.

This paper addresses the parameter identification of a one-link flexible manipulator based on the experimental measurement of the inputs/outputs, the finite element model, and the application of evolutionary algorithms. A novel approach is proposed to find the values of inertia, stiffness, and damping parameters by minimizing the difference between the numerical model’s outputs and the testbed’s outputs, considering the joint position and acceleration of the link’s tip. The dynamic model is initially obtained using the finite element method and the Lagrange principle. A prototype of a single one-link flexible manipulator is used in the experimental application wherein the servomotor applies the input torque, and the outputs are the joint angle and the link’s tip acceleration. Then, an optimization problem minimizes the difference between numerical and experimental outputs to determine the set of parameters using evolutionary algorithms. A comparative analysis to obtain the identified parameters is established using genetic algorithms, particle swarm optimization, and differential evolution. The proposed identification approach permitted the determination of the dynamic parameters based on the complete dynamic model of the flexible-link manipulator, which is different from the approaches reported in the literature that identify a simplified model. This information is essential for the design of the motion and vibration control laws.

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.

Digital Elevation Model (DEM) is a representation of elevation data that represent terrain with or without overlaying objects of the Earth. It is the ideal and most widely used method for determining topography. DEMs are generated from various techniques such as traditional Surveying, Photogrammetry, InSAR, LiDAR, Clinometry and radargrammetry. It has been observed that mostly LiDAR-generated DEMs provide the best accuracy. The unavailability of LiDAR data in most of the region restricts global researchers from high-resolution and accurate DEMs. The recent launch of ICESat-2 with a 13m beam footprint and 0.7m pulse interval, promises elevations at high orbital precision. Its accuracy is of the order of few centimeters in complex topography, because of this ICESat-2 proves to be a good source to generate high-accuracy DEMs. ICESat-2 provides discrete photon data with elevations of points on the Earth’s surface. Traditional interpolation techniques tend to over-smooth the estimated space and still are unable to justify the complicated continuity in the topographical data. Machine learning algorithms are widely being used to extract patterns and spatial extent in geographic data. To estimate a DEM from ICESat-2 LiDAR point data, machine learning regression algorithms are implemented in this study. The present study has been performed for a plain region of Ghaziabad, Uttar Pradesh, India. Studies have shown that Cartosat-1 DEM V3 R1 product provides an accuracy of the order of 2m in predominantly plain regions, hence taken for this region. Current work focuses on comparing various regression-based machine-learning techniques to interpolate DEM from ICESat-2 data The RMSE of the interpolated DEM resulted from the Gradient Boosting Regressor, Random Forest Regressor, Decision Tree Regressor, and Multi-Layer Perceptron Regressor was 7.13m, 7.01m, 7.15m, and 3.76m, respectively when evaluated against the TANDEM-X DEM of the same region. The MLP Regressor is found to perform the best among the four algorithms tested.

Machine learning research has been able to solve problems in multiple aspects. An open area of research is machine learning for solving optimisation problems. An optimisation problem can be solved using a metaheuristic algorithm, which is able to find a solution in a reasonable amount of time. However, there is a problem, the time required to find an appropriate metaheuristic algorithm, that would have the convenient configurations to solve a set of optimisation problems properly. A solution approach is shown here, using a proposal that automatically creates metaheuristic algorithms aided by a reinforced learning approach. Based on the experiments performed, the approach succeeded in creating a metaheuristic algorithm that managed to solve a large number of different continuous domain optimisation problems. This work's implications are immediate because they describe a basis for the generation of metaheuristic algorithms in real-time.

The fossil record is notorious for being incomplete and distorted, frequently conditioning the type of knowledge that can be extracted from it. In many cases, this often leads to issues when performing complex statistical analyses, such as classification tasks, predictive modelling, and variance analyses, such as those used in Geometric Morphometrics. Here different Generative Adversarial Network architectures are experimented with, testing the effects of sample size and domain dimensionality on model performance. For model evaluation, robust statistical methods were used. Each of the algorithms were observed to produce realistic data. Generative Adversarial Networks using different loss functions produced multidimensional synthetic data significantly equivalent to the original training data. Conditional Generative Adversarial Networks were not as successful. The methods proposed are likely to reduce the impact of sample size and bias on a number of statistical learning applications. While Generative Adversarial Networks are not the solution to all sample-size related issues, combined with other pre-processing steps these limitations may be overcome. This presents a valuable means of augmenting geometric morphometric datasets for greater predictive visualization.

In daily travel and activities, pathfinding is a significant process. They are often used in transportation routes calculation. They have now evolved to be able to solve most situations of the pathfinding and its related problems. This review describes previous and recent studies on the pathfinding algorithms. It reviews the development of pathfinding algorithms in a classification base on their usage. The aim is to summarize the application of the pathfinding algorithms for the readers interested in the subject that can be used as a supplement.

A growing area in neurosciences is focused on the modeling and analysis the complex system of connections in neural systems, i.e. the connectome. Here we focus on the representation of connectomes by using graph theory formalisms. The human brain connectomes are usually derived from neuroimages; the analyzed brains are co-registered in the image domain and brought to a common anatomical space. An atlas is then applied in order to define anatomically meaningful regions that will serve as the nodes of the network - this process is referred to as parcellation. Recently, it has been proposed to perform atlas-free random brain parcellation into nodes and align brains in the network space instead of the anatomical image space to define network nodes of individual brain networks. In the network domain, the question of comparison of the structure of networks arises. Such question is tackled by modeling the comparison of brain network as a network alignment (NA) problem. In this paper, we first defined the NA problem formally, then we applied three existing state of the art of multiple alignment algorithms (MNA) on diffusion MRI-derived brain networks and we compared the performances. The results confirm that MNA algorithms may be applied in cases of atlas-free parcellation for a fully network-driven comparison of connectomes.

Human Pose Estimation (HPE) is a technique in computer vision and AI for detecting and tracking human body parts and poses from images or videos. Widely used in augmented reality, animation, fitness applications, and surveillance, HPE methods using monocular cameras are highly versatile due to their applicability in standard video and CCTV footage. These methods have evolved from 2D to 3D pose estimation. However, current 3D HPE methods trained on laboratory-based motion capture data encounter challenges such as limited training data, depth perception ambiguity, left/right switching, and issues with occlusions when applied in real-world environments. This study compares two representative 3D HPE methods by assessing their strengths and weaknesses with real-world videos. Then, we propose data processing techniques to eliminate and correct anomalies like left/right inversion and false detections of joint positions in daily life motions. Finally, we obtain joint angle trajectories using an optimization method based on a 3D humanoid simulator, taking as input the joint coordinate data corrected by applying the proposed human joint data processing technique. The efficacy of the proposed 3D HPE method is verified by applying it to three-dimensional freehand gymnastics exercises and comparing the joint angle trajectories during the motion.

This paper deals with a method of calculating the self and mutual inductances of various air coils located arbitrarily in space. Known elementary solutions (the Biot-Savart formulas) were used to determine the magnetic field of infinitely thin current loops and infinitely thin wires of finite length linking magnetically other coils. Unlike commonly used algorithms, these elementary solutions were not extensively transformed analytically but were used to perform calculations by direct numerical integration. This enabled very quick and accurate obtaining of the self-inductance values as well as determining the dependence of mutual inductances on the position of both coils. This method allows analysis of different coil configurations (misaligned coils, inclined to each other, etc.) that other methods do not cover. It also enables the determination of the forces acting on the coils, as well as the calculation of the magnetic field distribution from any coil configuration. The obtained results were compared with those presented by other authors.

Predicting nurse turnover is a growing challenge within the healthcare sector, profoundly impacting healthcare quality and the nursing profession. This study employs the Synthetic Minority Over-sampling Technique (SMOTE) to address class imbalance issues in the 2018 National Sample Survey of Registered Nurses (NSSRN) dataset and predict nurse turnover using machine learning (ML) algorithms. Four ML algorithms, namely logistic regression (LR), random forests (RF), decision tree (DT), and extreme gradient boosting (XGBoost), are applied to the SMOTE-enhanced dataset. The data is randomly split into an 80% training set and a 20% validation set. Eighteen carefully selected variables from the NSSRN database serve as predictive features, and the machine learning model identifies feature importance concerning nurse turnover. The study includes a performance comparison based on metrics such as Accuracy, Precision, Recall (Sensitivity), F1-score, and AUC. In summary, the results demonstrate that SMOTE-enhanced random forests (SMOTE_RT) exhibit the most robust predictive power, both in the classical approach (with all 18 predictive variables) and an optimized approach (utilizing eight key predictive variables). XGBoost, decision tree, and logistic regression follow in performance. Notably, age emerges as the most influential factor in nurse turnover, with working hours, EHR/EMR usability, individual income, and region also playing significant roles. This research offers valuable insights for healthcare researchers and stakeholders, aiding in selecting suitable ML algorithms for nurse turnover prediction.

Probabilistic latent semantic analysis is a statistical technique developed for information retrieval and spanned many fields. It yields intuitive and solid results. However, the rigidity of the assumptions and the iterative nature derived from the Expectation-maximization algorithm generate several problems, dividing detractors and enthusiasts. In this manuscript, we first describe the Probabilistic latent semantic analysis. After, we discuss reformulations that attempt to solve these problems. We pay special attention to the works relating Probabilistic latent semantic analysis and the Singular value decomposition Theorem. Also, Probabilistic latent semantic analysis can be the basis for other techniques, such as kernelization or probabilistic transfer learning, and those that extend the descriptive character of the Principal component analysis to an inferential tool and open a window of opportunities.

Blockchain technology has gotten much interest recently from academics, industry, and governments worldwide. It is regarded as a technical innovation that can disrupt various application fields affecting many aspects of our lives. Cryptocurrencies are a public blockchain application's success story that sparked extensive research and development. Scalability, energy consumption, and security, on the other hand, remain significant challenges. With low throughput, high transaction delay, and high energy consumption, most cryptocurrencies are experiencing low-efficiency difficulties. The scalability issue with public Blockchains is preventing organizations and sectors from receiving effective solutions. As a result, it is critical to bridge the gap and develop new frameworks that connect Blockchain with those goals. This paper examines the evolution of blockchain architecture and consensus protocols, provides a retrospective analysis, discusses the rationale for the various architectures and protocols' change, and captures the assumptions supporting their development and contributions to collaborative application development. However, existing research on consensus algorithms is insufficient. The features of the algorithms are discussed insufficiently in those papers, and some prominent blockchain consensus methods are not examined in terms of their scopes. The study’s findings are delivered in tabular formats, allowing for a clear representation of these algorithms. We discovered in our investigation that scalability is a result of many parameters such; transaction throughput, number of nodes, storage, block size, high communication, latency, cost. Furthermore, Due to its off-chain data storage and smaller block size, PoF is much more scalable than PoS and PoW, and Because PoA is a hybrid of PoW and PoC, it does not necessitate a large number of computational resources. As a result, it has a higher throughput than PoW. PoPF entails ranking all participating nodes and appointing n accountants to compete for adding new blocks. This article addresses the need by analyzing a wide range of consensus algorithms using a complete taxonomy of attributes and delving into the consequences of several still-present flaws in consensus algorithms.

Advancing models for accurate estimation of food production is essential for policymaking and managing national plans of action for food security. This research proposes two machine learning models for the prediction of food production. The adaptive network-based fuzzy inference system (ANFIS) and multilayer perceptron (MLP) methods are used to advance the prediction models. In the present study, two variables of livestock production and agricultural production were considered as the source of food production. Three variables were used to evaluate livestock production, namely livestock yield, live animals, and animal slaughtered, and two variables were used to assess agricultural production, namely agricultural production yields and losses. Iran was selected as the case study of the current study. Therefore, time-series data related to livestock and agricultural productions in Iran from 1961 to 2017 have been collected from the FAOSTAT database. First, 70% of this data was used to train ANFIS and MLP, and the remaining 30% of the data was used to test the models. The results disclosed that the ANFIS model with Generalized bell-shaped (Gbell) built-in membership functions has the lowest error level in predicting food production. The findings of this study provide a suitable tool for policymakers who can use this model and predict the future of food production to provide a proper plan for the future of food security and food supply for the next generations.

Nowadays, many political campaigns are using social influence (SI) in order to convince voters to support/oppose a specific candidate/party. In election control via SI problem, an attacker tries to find a set of limited influencers to start disseminating a political message in a social network of voters. A voter will change his opinion when he receives and accepts the message. In constructive case, the goal is to maximize the number of votes/winners of a target candidate/party, while in destructive case, the attacker tries to minimize them. Recent works considered the problem in different models and presented some hardness and approximation results. In this work, we consider multi-winner election control through SI on different graph structures and diffusion models, and our goal is to maximize/minimize the number of winners in our target party. We show that the problem is hard to approximate when voters' connections form a graph, and the diffusion model is the linear threshold model. We also prove the same result considering an arborescence under independent cascade model. Moreover, we present a dynamic programming algorithm for the cases that the voting system is a variation of straight-party voting, and voters form a tree.

Non-linear loads in circuits cause the appearance of harmonic disturbances both in voltage and current. In order to minimize the effects of these disturbances and, therefore, to control over the flow of electricity between the source and the load, they are often used passive or active filters. Nevertheless, determining the type of filter and the characteristics of their elements is not a trivial task. In fact, the development of algorithms for calculating the parameters of filters is still an open question. This paper analyzes the use of genetic algorithms to maximize the power factor compensation in non-sinusoidal circuits using passive filters, while concepts of geometric algebra theory are used to represent the flow of power in the circuits. According to the results obtained in different case studies, it can be concluded that the genetic algorithm obtain high quality solutions that could be generalized to similar problems of any dimension.

Soybean with insignificant differences in appearance have large differences in their internal physical and chemical components, therefore follow-up storage, transportation and processing require targeted differential treatment. A fast and effective machine learning method based on hyperspectral data of soybean for pattern recognition of categories is designed as a non-destructive testing method in this paper. A hyperspectral-image dataset with 2299 soybean seeds in 4 categories is collected; Ten features is selected by extreme gradient boosting algorithm from 203 hyperspectral bands in range 400 to 1000 nm; A Gaussian radial basis kernel function support vector machine with optimization by the Tree-structured Parzen Estimator algorithm is built as TPE-RBF-SVM model for pattern recognition of soybean categories. The metrics of TPE-RBF-SVM are significantly improved compared with other machine learning algorithms. The accuracy is 0.9165 in the independent test dataset which is 9.786% higher for vanilla RBF-SVM model and 10.02% higher than the extreme gradient boosting model.

Chronic Kidney Disease is a medical condition that causes the decrease in the kidney function and can eventually derive in a total cessation of the work of the organ. It currently affects >10% of the global population, and the number is expected to grow within the next few years, since the correlated diabetes condition is escalating too. Diagnosing the disease on its early stages is crucial to improve life quality, and to increase the chances of survival. The traditional diagnostic methods, which include a biopsy, are invasive, expensive and dangerous. With the use of machine learning algorithms like neural networks, random forest and genetic algorithms, this paper seeks to discover an algorithm with high accuracy, whose selected attributes will be the most optimal combination aiming to reduce the cost, level of invasiveness, and easiness to obtain.

The algorithm now known as Kadane’s algorithm for the maximum subarray problem uses many of the ideas that Kadane proposed, but it is not the algorithm that Kadane intended. This paper compares the two algorithms in question. They are both linear in time, employ just a few words of memory, and use a dynamic programming structure. The upshot is two light-weight algorithms for the maximum subarray problem.

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.

Ankylosing spondylitis (AS) is a chronic inflammatory disorder with unknown etiology and hard to early diagnose. It’s imperative to investigate the changes in AS patients’ peripheral blood, which may contribute to the diagnosis and further understanding of AS. Common differential expressed genes between normal and AS patients in GSE73754 and GSE25101 were screened by machine learning algorithms. IL2RB and ZDHHC18 were hubgenes screened and a diagnostic model was established. C-indexes and calibration analyses suggested high prediction accuracy of the model in training and validation cohorts. The AUC values of the model in GSE73754, GSE25101, GSE18781 and GSE11886 were 0.86, 0.84, 0.85 and 0.89 respectively. Decision curve analyses suggested high net benefit by the model. Functional analysis of the differential expressed genes indicated that they were mainly clustered in processes related to immune response. Immune microenvironment analysis revealed that neutrophils were expanded and activated in AS, while some T cells were decreased. IL2RB and ZDHHC18 were potential blood biomarkers for AS and might be used for early diagnosis and a supplementary diagnostic tool to the existing methods. Our study deepened the insight into the pathogenesis of AS.

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.

Identifying or authenticating a computer user are necessary steps to keep systems secure on the network and to prevent fraudulent users from accessing accounts. Keystroke dynamics authentication can be used as an additional authentication method. Keystroke dynamics involves in-depth analysis of how you type on the keyboard, analysis of how long a key is pressed or the time between two consecutive keys. This field has seen a continuous growth in scientific research. In the last five years alone, about 10,000 scientific researches in this field have been published. One of the main problems facing researchers is the small number of public data sets that include how users type on the keyboard. This paper aims to provide researchers with a data set that includes how to type free text on the keyboard by 80 users. The data were collected in a single session via a web platform. The dataset contains 410,633 key-events collected in a total time interval of almost 24 hours. In similar research, most datasets are with texts written by users in English. The language in which the users wrote for this research is Romanian. This paper also provides an extensive analysis of the data set collected and presents relevant information for the analysis of the data set in future research.

This paper presents a novel micro-segmented genetic algorithm (μsGA) to identify the best solution for the locomotion of a quadruped robot designed on a rectangular ABS plastic platform. We compare our algorithm with three similar algorithms found in the specialized literature: a standard genetic algorithm (GA), a micro-genetic algorithm (μGA), and a micro artificial immune system (μAIS). The quadruped robot prototype guarantees the same conditions for each test. The platform was developed using 3D printing for the structure and can accommodate the mechanisms, sensors, servomechanisms as actuators. It also has an internal battery and a multicore embedded system (mES) to process and control the robot locomotion. This research proposes a μsGA that segments the individual into specific bytes. μGA techniques are applied to each segment to reduce the processing time; the same benefits as the GA are obtained, while the use of a computer and the high computational resources characteristic of the GA are avoided. This is the reason why some research in robot locomotion is limited to simulation. The results show that the performance of μsGA is better than the three other algorithms (GA, μGA and AIS). The processing time was reduced using a mES architecture that enables parallel processing, meaning that the requirements for resources and memory were reduced. This research solves the problem of continuous locomotion of a quadruped robot, and gives a feasible solution with real performance parameters using a μsGA bio-micro algorithm and a mES architecture.

In this paper, we provide a study on the effects of applying classical clustering algorithms, such as k-Means to free text recommender systems. A typical recommender system may face problems when the number of items from a database goes from a few items to hundreds of items. Currently, one of the most prominent techniques to scale the database is applying clustering, however clustering may have a negative impact on the accuracy of the system when applied without taking into consideration the underlying items. In this work, we build a conceptual text recommender system and use k-Means to partition its search space into different groups. We study how the variation of the number of clusters affects its performance in the light of two performance measurements: recommendation time and precision. We also analyze if this clustering is affected by the representation of text we use. All the techniques used in this study uses word-embeddings to represent the document. One of the main findings of this work is that using clustering we can improve the recommendation time in up to almost 30 times without affecting much off its initial accuracy. Another interesting finding is that the increment of the number of clusters is not directly translated into linear performance.

In this paper, we propose a simple tool to help the energy management of a large buildings stock defining clusters of buildings with the same function, setting alert thresholds for each cluster, and easily recognizing outliers. The objective is to enable a building management system to be used for detection of abnormal energy use. First, we framed the issue of energy performance indicators, and how they feed into data visualization (Data Viz) tools for a large building stock, especially for university campuses. Both for Data Viz and clustering algorithm processes, we discussed two possible approaches to choose the right number of clusters and the identification of alert thresholds and outliers, after a brief presentation of the University of Turin's building stock case study. Different Data Viz tools have been studied to apply a specific clustering algorithm, the k-means one. An explorative analysis based on the general Multidimensional detective approach by Inselberg has been performed. Two multidimensional analysis tools, the Scatter Plot Matrix and the Parallel coordinates method have been used. Secondly, the k-means clustering algorithm has been applied on the same dataset in order to test the hypothesis made during the explorative analysis. Data Viz techniques developed in this study revealed to be very useful to explore quickly and simply a large buildings' stock, identifying the worst efficient buildings and clustering them according to their distinct functions.

Currently, foam mixers are predominantly categorized into two types: low-pressure and high-pressure. Low-pressure mixers primarily use agitator rotation to mix materials. However, they face challenges such as difficulty in cleaning and complex structures. High-pressure mixers, widely adopted for their structural simplicity and lack of need for cleaning devices, effectively mitigate issues associated with low-pressure mixers. Nonetheless, they encounter problems with uneven mixing when processing high-viscosity materials. Historically, the primary solution to this issue was increasing the working pressure. However, the capacity to increase pressure is finite, and higher pressure demands higher quality materials for the mixers. To address the issues high-pressure mixers face when dealing with high-viscosity materials, this study focuses on the polyimide high-pressure mixer. After reviewing previous studies, four design variables were selected: the mixer's impingement angle, inlet diameter, outlet diameter, and impingement pressure. Using a Full Factorial Design of Experiments (DOE), the significance of the impact exerted by these four variables on Mixing Unevenness was analyzed, determining the extent of their influence. Optimal Latin Hypercube Sampling generated several random sample points, followed by the establishment of both a Back Propagation (BP) Neural Network approximation model and a Kriging approximation model. A Genetic Algorithm was then applied to optimize these two approximation models, resulting in the optimal combination of design variables. The research findings indicate that the BP Neural Network exhibits higher predictive accuracy compared to the Kriging prediction model. The optimal combination of parameters, optimized through the Genetic Algorithm (GA), reduced the Mixing Unevenness by 69.1%, effectively decreasing the Mixing Unevenness of the mixer head.

Finding the roots of an equation is a fundamental problem in diverse fields. Optimization problem leads to non-linear equations for calculating the roots of the equation efficiently. Numerical iterative techniques are frequently applied when analytic solution is not available. Hybrid techniques to find roots of an equation is new to this fundamental problem. Recently, some attempts emerged to design hybrid algorithms for efficient solutions. A new heuristic algorithm is designed which is an intuitive approach to hybridization. In this paper, we implement two new algorithms: (1) a new BTsection algorithm blending the Bisection and Trisection algorithm, (2) a hybrid algorithm, that promises to be more efficient than the existing hybrid algorithms. The new hybrid algorithm is a blend of BTsection algorithm and Regula Falsi algorithm. The implementation results validate that the new algorithm, Hybrid4, surpasses the efficiency of existing hybrid algorithms Hybrid1, Hybrid2, and Hybrid3 algorithms. This paper contributes an essential hybrid algorithm to the repertoire of hybrid root finding algorithms.

Recently, Artificial Intelligence (AI)-based algorithms have revolutionized the medical image segmentation processes. Thus, the precise segmentation of organs and their lesions may contribute to an efficient diagnostics process and a more effective selection of targeted therapies as well as increasing the effectiveness of the training process. Thus, AI may contribute to the automatization of the image scan segmentation process and increase the quality of the resulting 3D objects, which may lead to the generation of more realistic virtual objects. In this paper, we focus on the AI-based solutions applied in the medical image scan segmentation, and intelligent visual-content generation, i.e. computer-generated three-dimensional (3D) images in the context of Extended Reality (XR). We consider different types of neural networks used with a special emphasis on the learning rules applied, taking into account algorithm accuracy and performance, as well as open data availability. This paper also attempts to summarize the current development of AI-based segmentation methods in medical imaging and intelligent visual content generation that are applied in XR. Finally, this paper concludes with possible developments and open challenges in AI application in Extended Reality-based solutions. Finally, the future lines of research and development directions of Artificial Intelligence applications both in medical image segmentation and Extended reality-based medical solutions are discussed.