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.

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

The optimal structural design is imperative to minimize material consumption and reduce the environmental impact of construction. Given the complexity in the formulation of structural design problems, the process of optimization is commonly performed using artificial intelligence (AI) global optimization, such as Genetic Algorithm (GA). However, the integration of AI-based optimization together with visual programming (VP) in building information modeling (BIM) projects warrants further investigation. This study proposes a workflow by combining structure analysis, VP, BIM, and GA to optimize trusses. The methodology encompasses several steps including: (i) generation of parametric trusses in Dynamo VP; (ii) performing the finite element modeling (FEM) using Robot Structural Analysis (RSA); (iii) retrieving and evaluating the FEM results interchangeably between Dynamo and RSA; (iv) finding the best solution using GA; and (v) importing the optimized model into Revit, enabling the user to perform simulations and engineering analysis, such as life cycle assessment (LCA) and quantity surveying. The feasibility of the proposed workflow was tested on benchmark problems and compared with open literature. The outcomes of this study offer insight into the opportunities and limitations of combining VP, GA, FEA, and BIM for structural optimization applications, particularly to enhance structural efficiency and sustainability in construction.

The Needleman-Wunsch process is a classic tool in bioinformatics, being a dynamic programming algorithm that performs a pairwise alignment of two input biological sequences, either protein or nucleic acid. A distance matrix between the tokens used in the sequences is also required as input. The distance matrix is used to generate a positional pairwise similarity matrix between the input sequences, which is in turn used to generate a dynamic programming matrix. The best path through the dynamic programming matrix is navigated using a traceback procedure that maximises similarity, inserting gaps as necessary. Needleman-Wunsch can align both nucleic acids or proteins, which use alphabets of size 4 and 20 tokens respectively. It can also be applied to any other kind of sequence where distance matrices can be specified. Here, we apply it to chains of Pousseur’s Scambi electronic music fragments, of which there are 32, and which Pousseur categorised by their sonic properties, thus permitting the consecutive construction of distance, similarity and dynamic programming matrices. Traceback through the dynamic programming matrix thus produces contrapuntal duet compositions in which two Scambi chains are played in the maximally euphonious manner, providing also an illustration of the principles of biological sequence alignment in sound.

The advancement of autonomous capabilities in maritime navigation has gained significant attention, with a trajectory moving from decision support systems to full autonomy. This push towards autonomy has led to extensive research focusing on collision avoidance, a critical aspect of safe navigation. Among the various possible approaches, Dynamic Programming is a promising tool for optimizing collision avoidance maneuvers. This paper presents a DP formulation for collision avoidance of autonomous vessels. We set up the problem framework, formulate it as a multi-stage decision process, define cost functions and constraints focusing on the actual requirements a marine maneuver must comply with, and propose a solution algorithm leveraging parallel computing. Additionally, we present a greedy approximation to reduce algorithm complexity. Through case studies, we demonstrate the effectiveness of the proposed approach in navigating complex scenarios, contributing to the future of autonomous maritime navigation. Through case studies, we show the efficacy of our approach in navigating complex scenarios.

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 paper, we consider a class of bilevel programming problems (abbreviated as, BLPP). Exploiting the generalized approximate convexity assumptions, we investigate the relations among the solutions of approximate Minty (respectively, Stampacchia) type variational inequalities (abbreviated as, AMTVI (respectively, ASTVI)), and the local ϵ-quasi solutions of the BLPP. Moreover, by employing the generalized Knaster–Kuratowski–Mazurkiewicz (abbreviated as, KKM)-Fan’s lemma, we derive some existence results for the solutions of approximate variational inequalities (abbreviated as, AVI), namely, AMTVI and ASTVI. A non-trivial example is given to highlight the importance of the established results. To the best of our knowledge, there is no research paper available in the literature that establishes relationships between the AVI and the BLPP under the assumptions of generalized approximate convexity in terms of limiting subdifferentials.

Advancements in computing technology have resulted in significant changes in education, healthcare, and manufacturing fields. Thus, personnel training in computer-related fields is directly related to national competitiveness. Therefore, the importance of programming education has been emphasized worldwide. Programming education has been conducted since the 1980s, however beginners often find programming tedious and difficult because of the cognitive burden of using text commands. Therefore, block-based programming environments, such as Scratch and Code.org, and beginner-oriented programming environments, such as Blockly and Pencil Code, have been de-veloped. However, they have limitations when transitioning from block to text-based programming. In this study, we conducted one semester of classes for 128 middle school, high school, and uni-versity students to determine whether an environment that allows using a text-based programming language in a block-based programming environment aids beginners’ understanding of program-ming instructions, command usage confidence, and programming usefulness. The results confirm that the usability of a block-based environment positively influences programming perception. This study is significant because it verifies the necessity and effectiveness of a block-based environment that employs a text-based programming language in programming education for beginners.

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.

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.

The article presents a model for optimizing biomass supply chains using the linear programming framework integrated with a Geographic Information System. Based on the distance from a given type of biomass resource, its calorific value, price, and transportation costs, the model identifies the optimal source of biomass, allowing it to cover the demand for the required total energy value with the lowest possible costs. The case study includes the Połaniec power plant in southeastern Poland and potential sources of forest biomass and agricultural straw within 100 km of the plant. Unit costs of biomass varied depending on biomass availability and energy demands. For energy demand on the level of 1 PJ yearly, the lowest unit costs of biomass (4.08 €/MJ) were when all kinds of biomass were available, and the highest (5.47 €/MJ) was when only stacked wood was available. As energy demand increased, unit costs increased, and the ability to meet this demand with just one type of biomass decreased. The energy biomass sector can utilize the model to benefit both biomass producers and their final buyers.

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.

This report discusses the application of approximate dynamic programming (ADP) and Krylov subspace methods in solving sequential decision-making problems in machine learning. ADP is used when dealing with large state spaces or when the exact dynamics are unknown. The paper explores various ADP methods such as temporal difference learning and least-squares policy evaluation. The authors also focus on the use of Krylov subspace methods for solving the Bellman equation in ADP. The report provides insights into linear approximation, stochastic algorithms, and the Arnoldi algorithm for orthonormal basis. Overall, the paper highlights the theoretical foundation provided by ADP and its connection with Krylov subspace methods, shedding light on their application in computer science.

Memristor has attracted a lot of interest due to its high processing speed, low power consumption and high integration ability, which is critical for electronic systems and memory-centric computing. However, the memristor programming circuit and strategy are still inflexible and complex, since the signal generator/collector and stimulate pulse must be carefully matched and designed based on memristor intrinsic characteristics without reconfigurable. Here, a simple and effective circuit only consists a parallel reference-resistor-and-NMOS is designed to program memristor with a more than 99% memristance precision. And the amplitude and width of stimulate pulse are fixed to ±4V and 5ms, respectively. In order to cope with the device variation, such as ±10% tolerance of transition voltage, an optimized programming strategy was proposed and demonstrated great robustness. Additionally, a set of reference resistors and NMOSs have been added to facilitate multi-level memristance operation without requiring any changes to the circuit structure. This program circuit was also employed to program memristor crossbar remains 99% precision. In the end, a memristor-based convolutional neural network which controlled by our optimized programming circuit was used for image recognition, and 89.36% accuracy can be achieved even under 15.8% memristance tolerance. This novel circuit demonstrates a simple and flexible strategy in memristor programming, providing a new way to control memristor crossbar for practical application.

This paper introduces the implementation of a genetic programming (GP)-based procedure to the automatic design and tuning of process controllers. The proposed approach makes a significant contribution to the field of artificial intelligence (AI) in control engineering. Unlike other controller design methods, the GP-based program handles the entire design in the time domain, including differential operations like derivatives and integrals, without the need for intermediate inverse Laplace transformation. This approach not only simplifies the design process but also ensures that all generated controllers are implementable in physical systems. Furthermore, GP’s functions set includes various mathematical operations beyond basic arithmetic operators, such as trigonometric, exponential, and logarithmic operators. The performance and validity of the resulting controllers generated by the proposed GP-based approach are evaluated by verifying whether the generator can replicate the structure and performance of those produced by traditional controller design methods and, in some cases, achieve even better results. As a result, the GP-based approach presents a promising solution for automating the controller design process and addressing control problems in various engineering applications.

Different organisms, cell types, and even similar cell lines can dramatically differ in resistance to genotoxic stress. This testifies to the wide opportunities for genetic and epigenetic regulation of stress resistance. These opportunities could be used to increas the effectiveness of cancer therapy, develop new varieties of plants and animals, and search for new pharmacological targets to enhance human radioresistance, for example, for -manned deep space expeditions. Based on the comparison of transcriptomic studies in cancer cells, in this review we propose that there is a high diversity of genetic mechanisms of development of genotoxic stress resistance. This review focused onpossibilities and limitations of the proposed regulation of the resistance of normal cells whole organisms to genotoxic and oxidative stress by overexpressing of stress-response genes. Moreover, the existing experimental data on the effect of such overexpression on the resistance of cells and organisms to various genotoxic agents has been analyzed and systematized. We suggest that the recent advances in the development of multiplex and highly customizable gene overexpression technology that utilizes the mutant Cas9 protein and the wealth of available data on gene functions and their signal networks open new opportunities for research in this field.

This paper presents a case study on using Emacs and Org-mode for literate programming in undergraduate data science courses. Over three academic terms, the author mandated these tools across courses in R, Python, C++, SQL, and more. Onboarding relied on simplified Emacs tutorials and starter configurations. Students gained proficiency after initial practice. Live coding sessions demonstrated the flexible instruction enabled by literate notebooks. Assignments and projects required documentation alongside functional code. Student feedback showed enthusiasm for learning a versatile IDE, despite some frustration with the learning curve. Skilled students highlighted efficiency gains in a unified environment. However, uneven adoption of documentation practices pointed to a need for better incorporation into grading. Additionally, some students found Emacs unintuitive, desiring more accessible options. This highlights a need to match tools to skills levels, potentially starting novices with graphical IDEs before introducing Emacs. Key takeaways include literate programming aids comprehension but requires rigorous onboarding and reinforcement; Emacs excels for advanced workflows but has a steep initial curve. With proper support, these tools show promise for data science education.

Genetic Programming (GP) is a powerful Machine Learning (ML) algorithm that can produce readable white-box models. Although successfully used for solving an array of problems in different scientific areas, GP is still not well known in Remote Sensing. The M3GP algorithm, a variant of the standard GP algorithm, performs Feature Construction by evolving hyper-features from the original ones. In this work, we use the M3GP algorithm on several sets of satellite images over different countries to create hyper-feature from satellite bands to improve the classification of land cover types. We add the evolved hyper-features to the reference datasets and observe a significant improvement of the performance of three state-of-the-art ML algorithms (Decision Trees, Random Forests and XGBoost) on multiclass classifications and no significant effect on the binary classifications. We show that adding the M3GP hyper-features to the reference datasets brings better results than adding the well-known spectral indices NDVI, NDWI and NBR. We also compare the performance of the M3GP hyper-features in the binary classification problems with those created by other Feature Construction methods like FFX and EFS.

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.

This paper is regarding design and program an Micro-controller Arduino Uno board by using Arduino software to work as a photo-sensor(Active) single axial solar tracker system(SASTS). A solar panel, two photo-resistors (LDR) in two sides (north/south) of the photo-voltaic(PV) and a servo motor are connected to the Uno board, which is running a code that prepared by Arduino software IDE in advanced then it works as a tracking system. Here, the LDRs send the signal of presence or absence of the light to the board and based on that sent signal the Uno reflects a new signal to the servo motor to rotate and finds the light source. Lastly, the photo-sensor single axis tracker is made while Continuously, the system tries to face the panel to the sun and whilst changing the irradiance intensity it starts searching to find the angle of highest irradiance. Based on results that are extracted from the data, the tracker system significantly boosts the output efficiency of the solar panel. By using the Micro-controller Uno board, LDRs, servo motor and special designed mechanical base, the tracking system is constructed, based on acquired data the influence of the STS on the increasing the solar panel efficiency is more obvious. Significantly, the tracker system rises the efficiency of the PV .

Vulnerability is the big issue of the small inland urban centers exposed to the risk of depopulation. In the climate and in the context of an increasing seismic risk in the center-northern part of Italy, seismic vulnerability can become the determinant cause of the final abandonment of a small town. In some Italian regions, as well as Emilia Romagna, municipalities are implementing seismic vulnerability reduction policies based on the Emergency Limit Condition that has become a basic reference for ordinary land planning. This study proposes a valuation planning approach to the seismic vulnerability reduction carried out within the general planning framework concerning the Faentina Union, a group of five small towns located in the south-western part of the Province of Ravenna, Italy. The approach consists of three main stages: knowledge – the typological, constructive and technological description of the buildings specifically concerning their vulnerability degree; interpretation – the analyses aimed to outline a range of hypotheses about the damages in case of seism; planning – identifying the works intended to definitely reduce the vulnerability of the buildings. This stage includes a cost modelling tools aimed at outlining the trade-off between the extension and the intensity of the vulnerability reduction works, given the budget.

Students in their first year of computer science (CS1) at universities typically struggle to grasp programming concepts. This paper covers research using a Java programming language-guided visual execution environment (VEE) to teach CS1 students about programming concepts. The topics covered include input and output, conditionals, loops, functions, arrays, recursion, and files, all of which are covered in an introductory programming course. The VEE walks beginner programmers through the fundamentals of programming, utilizing visual metaphors to explain and direct interactive Java tasks. The primary goal of this study is to determine whether a cohort of 105 CS1 students from four different groups who are enrolled in two universities—one in Madrid, Spain, and the other in Galway, Ireland—can advance their programming abilities under the guidance of the VEE. Second, does the improvement vary depending on the programming concept? The findings demonstrate that students' programming knowledge has greatly increased. This improvement is significant for all programming concepts, while it is more pronounced for some topics than others, such as operators, conditionals, and loops. Additionally, it demonstrates that students had little prior understanding of files and recursion. The most well-known concept to them was the sequence concept.

The focus of this paper is on analyzing the role and the choice of parameters in sociophysics diffusion models, by leveraging the potentialities of sociophysics from a mathematical programming perspective. We first present a generalised version of Galam’s opinion diffusion model (see, e.g. , ). For a given selection of the coefficients in our model, this proposal yields the original Galam’s model. The generalised model suggests guidelines for possible alternative selection of its parameters that allow to foster diffusion. Examples of the parameters selection process as steered by numerical optimisation, taking into account various objectives, are provided.

Harnessing Quantum Energy States for Unprecedented Computing Capabilities In this proposal, we advocate for the use of energy states as fundamental units of quantum computer programming. Each unit of programming is conceptualized as an energy state, manifested as an essence-unit. An essence-unit, defined as the minimal form encapsulating complete uniqueness or specificity, serves as the cornerstone of this paradigm. This approach enables the recording of various forms of matter on quantum computers in essence-units, portraying their energy states. The recording of energy states is achieved through the creation of four distinct coherent potentials, facilitated by quantum dots or crystals. Crucially, these energy states embodied in essence-units resist subdivision. The study explores the intricate relationship among similarity, fractals, and uniqueness in quantum dot operations, revealing their profound implications for information transfer efficiency. Normalized entropy characterizes charge localized in quantum dot impurities in systems that have distortions. Through the utilization of N-level recording and entropy-fractal dimension equivalence, the paper elucidates the potential of quantum dots in reducing transmission time and modeling complex systems. The proposed methodology signifies a paradigm shift in quantum computing, presenting unparalleled possibilities for tackling hitherto insurmountable challenges.

This research work focused on the risks we are faced with on our day to day activities, either directly or indirectly, which can gradually accumulates and results to communal crisis, religious crisis, socio-economic agitations and tribal crises. Nasarawa Eggon Local Government Area of Nasarawa State was used as case study and a well structure close–ended questionnaire was used for data collection as it relates to Controlled Self Risk Assessment (CSRA) and linear programming technique was used to analyze. The results proved that many of this processes were neglected in these communities, making them to be prone to incessant communal crisis. The study recommend that Government should strongly, as a matter of urgency address the unemployment rate, distribution of political position, schools, primary health care and equip security personnel with the modern technology facilities, which happen to record the highest risk level.

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

Obesity is a complex chronic disease characterized by excess of body fat. It represents a significant public health problem due to the health-related risk factors. There are growing evidences showing that maternal obesity can program the offspring, which influence neonatal phenotype and predispose offspring to a higher prevalence of metabolic disorders such as obesity. This increased risk may also be epigenetically transmitted across generations. Thus, there is an urgent need to find effective reprogramming approaches in order to resume normal fetal development. Polyphenols are bioactive compounds found in fruits and vegetables that exert their anti-obesity effect through its powerful anti-oxidant and anti-inflammatory activities. Polyphenols supplementation has been proven to counteract the deleterious effects of maternal obesity programming on offspring. Indeed, some polyphenols can cross the placenta and protect the fetal predisposition against obesity. The present review summarizes the effects of dietary polyphenols on obesity-induced maternal reprogramming as an offspring anti-obesity approach.

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.

In the paper is described the control electronics for an industrial pneumatic – hydraulic system based on a low-cost PLC. The developed system is a hydraulic pulse system and it generates series of high pressure hydraulic pulses (max. 200 bar). We describe requirements, an overall concept of the embedded control system, user interface, security features and network connectivity. In the description of the software solution we describe implementation of hierarchical ordered program threads (multithreaded program) and main control state machine. At the conclusion, we describe the calibration method of the system and calibration curves and we present the schematic diagram and a photo of a functional prototype of the system.

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.

Today, computer programming is an essential pillar in the education of individuals. Even though technological evolution has eased the massive need for computer programming, a systematic lit-erature review shows some problems remain with teaching computer programing. To address such issues, in this paper we propose an adapted theory, a method, and a model for teaching some knowledge objects associated with the concepts of variables, expressions, comparisons, loops, and functions in programming fundamentals in computer sciences. The main contribution of this study comprises the extension of the concept of didactic transposition to improve teaching in context; in this paper, the idea is called didactic transposition in extensa sensu. The proposal involves the development of a linguistic corpus based on syllabi, textbooks, reference manuals, and a survey applied to experts in teaching programming fundamentals based on seventy-eight universities worldwide. An adapted theory, a method, and a model for teaching programming fundamentals using computational linguistics are produced. In addition, a template is created for designing teaching practices in this regard. The proposal generates an important alternative for the devel-opment of teaching strategies where the conditions of the context are addressed as a priority; ad-ditionally, several aspects are considered for elaborating teaching strategies using computational linguistic techniques from written documents.

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

In this work, an algorithm for the scheduling of household appliances to reduce the energy cost and the peak-power consumption is proposed. The system architecture of a home energy management system (HEMS) is presented to operate the appliances. The dynamics of thermal and non-thermal appliances is represented into state-space model to formulate the scheduling task into a mixed-integer-linear-programming (MILP) optimization problem. Model predictive control (MPC) strategy is used to operate the appliances in real-time. The HEMS schedules the appliances in a dynamic manner without any a priori knowledge of the load-consumption pattern. At the same time, HEMS responds to the real-time electricity market and the external environmental conditions (solar radiation, ambient temperature etc). Simulation results exhibit the benefits of proposed HEMS by showing the reduction of up to 47% in electricity cost and up to 48% in peak power consumption.

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 look at quantum speedup ratios of HHL Algorithm for different scenarios of linear programming. In a first scenario we look quantum speedup ratio (S(N)) as a function of phase transition and the ratio (κ) between the greatest and smallest eigenvalues of the matrix in linear equation system. As a second scenario, we investigate the changes in S(N) as a function of κ and s, which is the coefficient for defining the matrix as s-sparse.

This study presents review of 7580 papers in 13 academic journals, published from January 2015 to January 2020. After a detailed analysis of all papers, 46 papers were further selected showing research on a student population aged between 6 and 15 years old. In order for the paper to be included in the research, the condition was that the paper deals with teaching at least one of the following content areas: programming languages, game design, computer thinking (CT), algorithmic thinking and robotics programming. This study shows the representation of the listed content area in reviewed papers for the specified time period as well as a detailed analysis of the selected papers. Available data about study, participants and education level, country (first author), learning domain, teaching tools, research questions, hypothesis, pre/post-test results, interviews, control groups, course duration, research design, previous experience, project or grant and re-search purpose in detected papers were analysed. In addition, impact of studying some of the listed content areas on student learning performance, motivation, attitude and perception were investigated.

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.

Photogrammetry involves aerial photography of the earth’s surface and subsequently processing the images to provide a more accurate depiction of the area (Orthophotography). It’s used by the Spanish Instituto Geográfico Nacional to update road cartography but requires a significant amount of manual labor due to the need to perform visual inspection of all tiled images. Deep Learning techniques (artificial neural networks with more than one hidden layer) can perform road detection but it is still unclear how to find the optimal network architecture. Our system applies grammar guided genetic programming to the search of deep neural network architectures. In this kind of evolutive algorithm all the population individuals (here candidate network architectures) are constrained to rules specified by a grammar that defines valid and useful structural patterns to guide the search process. Grammar used includes well-known complex structures (e.g. Inception-like modules) combined with a custom designed mutation operator (dynamically links the mutation probability to structural diversity). Pilot results show that the system is able to design models for road detection that obtain test accuracies similar to that reached by state of the art models when evaluated over a dataset from the Spanish National Aerial Orthophotography Plan.

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.

As the demands in reliability and high-degree of automation in industrial applications are increasing exponentially, the current Industry 4.0 trend lies in migrating towards smarter technologies that increase flexibility and provide autonomous operation. To tackle this, manufacturers shifted towards Real-Time Ethernet communication which supports autonomous operation, faster sensor/actuator configuration and high degree of determinism. Nevertheless, the uninterrupted operating principle of legacy industrial systems as well as the system complexity and heterogeneity constitutes the transition to Real-Time Ethernet very challenging. This article proposes a novel method allowing to automate the generation of executable code for Real-Time Ethernet architectures based on high-level programming models. The method is based on a programming model and modular code artifacts for the hardware architecture, employing Real-Time Ethernet communication. Through an tool-supported algorithm the high-level model is linked to the architecture's communication primitives and interfaces. The tool-support reduces significantly the development and debugging effort for Real-Time Ethernet applications and increases the application reliability, since the generated code is based on verified programming models. Additionally, the tool creates dedicated files, which allow automated industrial network configuration without any human intervention. Finally, by embedding firewall policies into the code generation process, the method guarantees cyber-resilience for the Real-Time Ethernet architecture. We demonstrate the proposed method in Programmable Logic Controllers (PLCs) of a Public Power Corporation's Hydroelectric Power Plant, which control the temperature and rotor speed of a power generator. The results demonstrate the method's ability to generate rapidly trustworthy and fault-tolerant code for the autonomous plant operation. The hurdles in time and effort for developing, configuring and debugging Real-Time Ethernet applications can be minimized through a high-level programming model that allows automated generation of executable code that is reusable for similar applications. Such time and effort reduction may pave the way towards the Industry 4.0 area.

Studies have shown that in many practical applications, data interpolation by splines leads to better approximation and higher computational efficiency as compared to data interpolation by a single polynomial. Data interpolation by splines can be significantly improved if knots are allowed to be free rather than at a priori fixed locations such as data points. In practical applications, the smallest possible curvature is often desired. Therefore, optimal splines are determined by minimizing a derivative of continuously differentiable functions comprising the spline of the required order. The problem of obtaining an optimal spline is tantamount to minimizing derivatives of a nonlinear differentiable function over a Banach space on a compact set. While the problem of data interpolation by quadratic splines has been accomplished analytically, interpolation by splines of higher orders or in higher dimensions is challenging. In this paper, to overcome difficulties associated with the complexity of the interpolation problem, the interval over which data points are defined, is discretized and continuous derivatives are substituted by their discrete counterparts. It is shown that as the mesh of the discretization approaches zero, a resulting near-optimal spline approaches an optimal spline. Splines with the desired accuracy can be obtained by choosing an appropriate mesh of the discretization. By using cubic splines as an example, numerical results demonstrate that the linear programming (LP) formulation, resulting from the discretization of the interpolation problem, can be solved by linear solvers with high computational efficiency and resulting splines provide a good approximation to the optimal splines.

This paper proposes a model based on gene expression programming for predicting discharge coefficient of triangular labyrinth weirs. The parameters influencing discharge coefficient prediction were first examined and presented as crest height ratio to the head over the crest of the weir (p/y), crest length of water to channel width (L/W), crest length of water to the head over the crest of the weir (L/y), Froude number (F=V/√(gy)) and vertex angle () dimensionless parameters. Different models were then presented using sensitivity analysis in order to examine each of the dimensionless parameters presented in this study. In addition, an equation was presented through the use of nonlinear regression (NLR) for the purpose of comparison with GEP. The results of the studies conducted by using different statistical indexes indicated that GEP is more capable than NLR. This is to the extent that GEP predicts the discharge coefficient with an average relative error of approximately 2.5% in such a manner that the predicted values have less than 5% relative error in the worst model.

This paper introduces an application of R programming language for geostatistical data processing with a case study of the Mariana Trench, Pacific Ocean. The formation of the Mariana Trench, the deepest among all hadal oceanic depth trenches, is caused by complex and diverse geomorphic factors affecting its development. Mariana Trench crosses four tectonic plates: Mariana, Caroline, Pacific and Philippine. The impact of the geographic location and geological factors on its geomorphology has been studied by methods of statistical analysis and data visualization using R libraries. The methodology includes following steps. Firstly, vector thematic data were processed in QGIS: tectonics, bathymetry, geomorphology and geology. Secondly, 25 cross-section profiles were drawn across the trench. The length of each profile is 1000-km. The attribute information has been derived from each profile and stored in a table containing coordinates, depths and thematic information. Finally, this table was processed by methods of the statistical analysis on R. The programming codes and graphical results are presented. The results include geospatial comparative analysis and estimated effects of the data distribution by tectonic plates: slope angle, igneous volcanic areas and depths. The innovativeness of this paper consists in a cross-disciplinary approach combining GIS, statistical analysis and R programming.

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.

The feasibility of recovering bioactive antioxidants from Phyllantus emblica leaves using ethanol -water mixture (0 – 100%) and heat-assisted extraction technology (HAE-T) was investigated in this present study. To this effect, the process parameter of operating temperature (OT: 30 -50 oC), solid -to-liquid ratio (S:L: 1:20 - 1:60 g/mL) and extraction time (ET: 45 - 180 min) were investigated on the extract total phenolic content (TPC, mg GAE/g d.w), yield (EY, %) and antioxidant activity (μM AAE/g d.w) by employing the Box-Behnken experimental design (BBD) available in response surface methodology (RSM). Multi-objective process optimization using the desirability function algorithm to determine set of process variables that simultaneously optimize process responses of TPC, EY and AA was also investigated. The recovery process was thereafter modeled with BBD-RSM and multi gene genetic programming (MGGP) algorithm and model reliability assessment via Monte Carlo simulation were conducted for the best performing set of models for predicting TPC, EY and AA values. The HPLC characterization of the recovered extract was carried out to ascertain the phenolic compound constituents of the Phyllantus emblica leaf extract. The 50% ethanol solution was found to be the best for the optimal extraction of antioxidants from Phyllantus emblica leaves. The HAE-T was suitable for recovering bioactive extract from Phyllantus emblica leaves and investigated process parameters have impacts on the recovery process. The process parameters that simultaneously gave the optimum EY of 21.6565%, TPC of 67.116 mg GAE/g and AA of 3.68583 µM AAE/g were OT of 41.61 oC, S:L of 1:60 g/mL and ET of 180 min. The HPLC extract profiling revealed that the bioactive constituents present in the recovered extract were betulinic acid, gallic acid, chlorogenic acid, caffeic acid, ellagic acid, and ferulic acid. Both the developed BBD-RSM and evolved MGGP-based models predicted the observed process response of TPC, EY and AA satisfactorily with BBD-RSM models marginally better in their predictions. The reliability results showed that the BBD-RSM models predicted TPC, EY and AA values with high certainty of 99.985%, 97.569% and 98.661%, respectively.

The connectivity level of last-generation vehicles is constantly on the rise. The combined use of Vehicle-To-Everything (V2X) connectivity and autonomous driving can provide remarkable benefits through the optimization of the route and speed trajectory. In this framework, this paper focuses on vehicle eco-driving optimization in a connected environment. The virtual test rig of a premium segment passenger car was used for generating the simulation scenarios. The benefits, in terms of energy and time savings, that the introduction of V2X communication, integrated with cloud computing, can have in a real-world scenario were assessed. The Reference Scenario is a pre-defined Real Driving Emissions (RDE) compliant route, while the simulation scenarios were generated by assuming two different penetration levels of V2X technologies. The associated energy minimization problem is formulated and solved by means of a global optimization algorithm, i.e., Dynamic Programming (DP). The optimization framework includes information coming from the surrounding environment, e.g., traffic lights state, speed limits, distance to travel, etc. The simulations show that introducing a smart infrastructure along with optimizing the vehicle speed in a real-world route can potentially reduce the required energy by 54% while shortening the travel time by 38%. Finally, a sensitivity analysis is performed on the bi-objective optimization cost function to find a set of Pareto optimal solutions, between energy and travel time minimization.

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.

In this paper, we propose a method to find all efficient solutions of an interval multiple objective linear programming (IMOLP) problem with interval coefficients in the objective functions, the constraint matrix and the right-hand side vector. The set of all efficient solutions of an IMOLP problem can completely supply information to the decision makers in finding their most preferred solutions but, up to now, not all efficient solutions of an IMOLP problem can be found by known methods. A numerical example is given to illustrate the working of the proposed method.

Feature selection is predominantly used in machine learning tasks, such as classification and regression. It selects a subset of features (relevant attributes of data points) from a larger set that contributes as optimally as possible to the informativeness of the model. There are exponentially many subsets of a given set, and thus, the exhaustive search is only practical for problems with at most a few dozen features. In the past, there have been attempts to reduce the search space using dynamic programming. However, models that consider similarity in pairs of features besides the quality of individual features do not provide the required optimal substructure. As a result, algorithms, which we will call suboptimal dynamic programming algorithms, find a solution that may deviate significantly from the optimal one. In this paper, we propose a dynamic programming algorithm with an iterative upgrade where the order of feature processing is inverted in each iteration. Such an alternating approach allows for improving the optimization function by using the score from the previous iteration to estimate the contribution of unprocessed features. The iterative process is proven to converge and terminate when the solution does not change in three successive iterations or when the number of iterations reaches the threshold. Results in more than 90 % of tests align with those of the exhaustive search, being competitive and often superior to the reference greedy approach. The validation was done by comparing the scores of output feature subsets and examining the accuracy of different classifiers learned on these features. In the context of feature selection, the proposed algorithm can be characterized as a filter method. However, we expect that the idea of alternating suboptimal optimization will soon be generalized to tasks beyond feature selection.

The study sought to investigate the effect of Multi-choice Goal programming in project Portfolio Analysis, using Lagos State Project Portfolio from between 2017-2021 as a study case. Specifically, the objectives examined the effectiveness of multi-choice goal programming in analyzing the project Portfolio of Lagos State Government and investigated the possible lapses in the use of Multi-choice Goal programming in analyzing the project Portfolio of Lagos State Government. Data were gathered from the State financial Statements and analyzed using Lingo-17 Software. Based on the analysis, the study discovered that the goals formulated can be optimally and minimally attained as the positive deviational and negative deviational variables depict zero. This indicates that the cost incurred on the project portfolio was absolutely minimized during the period and at the same time; Lagos State Government derived the most preferred benefits from it. The study therefore concluded that the State minimized the project costs and at the same time maximized benefits while meeting its overall objectives.

We study the efficient computation of power indices for weighted voting games with precoalitions amongst subsets of players (reflecting, e.g., ideological proximity) using the paradigm of dynamic programming. Starting from the state-of-the-art algorithms for computing the Banzhaf and Shapley-Shubik indices for weighted voting games we present a framework for fast algorithms for the three most common power indices with precoalitions, i.e. the Owen index, the Banzhaf-Owen index and the Symmetric Coalitional Banzhaf index, and point out why our new algorithms are applicable for large numbers of players. We discuss implementations of our algorithms for the three power indices with precoalitions in C++ and review computing times as well as storage requirements.

Appropriate estimation of soil settlement is of significant importance since it directly influences the performance of building and infrastructures that are built on soil. In particular, the settlement of fine-grained soils is critical because of low permeability and continuous settlement with time. Coefficient of consolidation (Cc) is a key parameter to estimate settlement of fine-grained soil layers. However, estimation of this parameter is time consuming, needs skilled technicians, and specific equipment. In this study, Cc was estimated using several soil parameters such as liquid limit (LL), plastic limit (PL), and initial void ratio (e0). Estimating such parameters in laboratory is straight forward and needs substantially less time and cost compared to conventional tests to estimate Cc such as Oedometer test. This study presents a novel prediction model for Cc of fine-grained soils using gene-expression programming (GEP). GEP is a biologically inspired technique capable of offering closed-form solution for the optimal solution. A database consisted of 108 different data points was used to develop the model. A closed-form equation solution was derived to estimate Cc based on LL, PL, and e0. The performance of developed GEP-based model was evaluated through coefficient of determination (R2), root mean squared error (RMSE), and mean average error (MAE). High R2 and low error values indicated the descent performance of the model. Furthermore, the model was evaluated using the additional performance measures and met all the suggested criteria. Furthermore, the model had a better performance in terms of R2, RMSE, and MAE compared to most of existing models. It is expected that the developed model will decrease the time and cost associate with determining Cc of fine-grained soils.

Dislocation is one of the major challenges in unmanned aerial vehicle (UAV) image stitching. In this paper, we propose a new dynamic programming for seamlessly stitching UAV images using optical flow. Our solution consists of two steps: Firstly, an image-matching algorithm is used to correct the images so that they are in the same coordinate system. Secondly, a new dynamic programming algorithm is develop based on the concept of a stereo dual-channel energy accumulation using optical flow. A new energy aggregation and traversal strategy is adopted in our solution, which can find a more optimal seam line for adjacent image stitching. Our algorithm overcomes the theoretical limitation of the classical Duplaquet algorithm. Experiments show that the algorithm can effectively solve the dislocation problem in UAV image stitching. Beyond that, our solution is also direction-independent, which has more adaptability and robustness for UAV images.

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.

Experimental and epidemiological evidence has shown that modifications of the intrauterine environment can have deleterious consequences for individuals, expressed as an increased risk of suffering non-communicable pathologies in adult life, which is known as the hypothesis of the early origin of diseases or programming fetal. On the other hand, changes in gene expression patterns through epigenetic modifications can be the basis for long-term maintenance of the effects of fetal programming. In this sense, epigenetics comprises the study of intrauterine disturbances, which develop diseases in the adult, including Celiac Disease (CD). In addition, early feeding practices could influence the risk of CD development, such as breastfeeding timing and duration and age at gluten introduction in the diet. Gluten acts as a trigger for CD in genetically predisposed subjects, although approximately 30% of the world population has HLA DQ2 or DQ8, the prevalence of the disease is only 1-3%. It is not known what factors act to modify the risk of disease in genetically at risk subjects. Taking into account all these considerations, the aim of the current review is to elucidate the role of early programming and the effect of early nutrition on the development and progression of CD.

The fast pace development of the Internet and the Coronavirus Disease (COVID-19) pandemic have impacted considerably on the educative sector; encouraging the constant transformation of the teaching-learning strategies and more in technological areas as Educational Software Engineering. Web programming, a fundamental topic in Software Engineering and Cloud-based applications, deals with various critical challenges in education, such as learning continuous emerging technological tools, plagiarism detection, generating innovative learning environments, among others. Continual change and more with the current digitization becomes a challenge for teachers and students who cannot depend on traditional educational methods. The article presents a sustainable teaching-learning methodology for web programming courses in Engineering Education using a project-based integrated approach adaptable to the continuous web technological advances. The methodology has been developed and improved for 9 years, 15 groups, and 3 different universities. Our results demonstrate that the methodology is 100% adaptable with new technologies that might arise; it also presents the advantages of avoiding plagiarism in the best case and a personalized induction for every specific student in the learning process.

In this paper we deal with the resolution of a fuzzy multiobjective programming problem using the level sets optimization. We compare it to other optimization strategies studied until now and we propose an algorithm to identify possible Pareto efficient optimal solutions.

Efficient alternatives in energy production and consumption are constantly investigated by increasingly strict policies. In this way, the pollutant emissions that contribute to the greenhouse effect reduce and sustainability of the electricity sector increase. With more than a third of the world's energy consumption, buildings have great potential to contribute these sustainability goals. Additionally, with growing incentives in the Distributed Generation (DG) and Electric Vehicle (EV) industry, it is believed that Smart Buildings (SBs) can be a key in the field of residential energy sustainability in the future. In this work, an energy management system in SBs are developed to reduce the power demanded of a residential building. In order to balance the demand and power provided by the grid, microgrids such as Battery Energy Storage System (BESS), EVs and Photovoltaic Generation panels (PV) are used. Here, a Mixed Binary Linear Programming formulation (MBLP) is proposed to optimize the charge and discharge scheduling of EVs and also BESS. In order to show the efficiency of the model, a case study involving three scenarios and an economic analysis is considered. The results point a 65% reduction in peak load consumption supplied by grid and a 28.4% reduction in electricity consumption costs.

Appropriate estimation of soil settlement is of significant importance since it directly influences the performance of building and infrastructures that are built on soil. In particular, the settlement of fine-grained soils is critical because of low permeability and continuous settlement with time. Coefficient of consolidation (C_c) is a key parameter to estimate settlement of fine-grained soil layers. However, estimation of this parameter is time consuming, needs skilled technicians, and specific equipment. In this study, C_c was estimated using several soil parameters such as liquid limit (LL), plastic limit (PL), and initial void ratio (e₀). Estimating such parameters in laboratory is straight forward and needs substantially less time and cost compared to conventional tests to estimate C_c such as oedometer test. This study presents a novel prediction model for C_c of fine-grained soils using gene-expression programming (GEP). GEP is a biologically inspired technique capable of offering closed-form solution for the optimal solution. A database consisted of 108 different data points was used to develop the model. A closed-form equation solution was derived to estimate C_c based on LL, PL, and e₀. The performance of developed GEP-based model was evaluated through coefficient of determination (R²), root mean squared error (RMSE), and mean average error (MAE). High R² and low error values indicated the descent performance of the model. Furthermore, the model was evaluated using the additional performance measures and met all the suggested criteria. Furthermore, the model had a better performance in terms of R², RMSE, and MAE compared to most of existing models. It is expected that the developed model will decrease the time and cost associate with determining C_c of fine-grained soils.Keywords: evolutionary model, gene-expression programming (GEP), prediction, soil compression index, estimation, soil engineering, soil informatics, civil engineering, machine learning, data science, big data, soft computing, deep learning, forecasting, subject classification codes, construction informatics, computational intelligence (CI), artificial intelligence (AI), estimation

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.

Electric vehicles can effectively make use of the time-of-use electricity price to reduce the charging cost, meanwhile using the grid power to preheat the battery before departure is particularly important for improving the vehicle mileage and reducing the use cost.In this paper, a dynamic programming algorithm is used to optimize the battery AC charging-preheating strategy to minimize the total cost of battery charging and preheating, with the charging current and battery preheating power consumption as the control variables. The cost difference between the optimized control strategy and the conventional preheating strategy was analyzed under different ambient temperatures (-20℃~ 0℃) and different target travel time (7:00 ~ 12:00). The simulation results show that the optimized control strategy makes the battery SOC and temperature reach the set value at the user's target departure time, and the total cost of the grid is the lowest. Compared with the conventional preheating strategy, the optimized control strategy can utilize the power grid energy in the valley price area, reduce the opening time of water heating PTC in the flat and the peak price zones, and the cost utilization rate can reach 18.41% ~ 73.96%, and the cost-saving effect is significant.

There is great potential for reducing greenhouse gas emissions (GHGE) from public sector meals. This paper aimed to develop a strategy for reducing GHGE in the Swedish school food supply without compromising nutritional adequacy, affordability, and cultural acceptability. Amounts, prices and GHGE-values for all foods and drinks supplied to three schools over one year were gathered. The amounts were optimized by linear programming. Four nutritionally adequate models were developed: Model 1 minimized GHGE while constraining relative deviation (RD) from observed food supply; Model 2 minimized total RD while imposing stepwise GHGE reductions; Model 3 additionally constrained RD for individual foods to an upper and lower limit; and Model 4 further controlled how ratios between food groups could deviate. Models 1 and 2 reduced GHGE by up to 95% but omitted entire food categories or increased the supply of some individual foods by more than 800% and were deemed unfeasible. Model 3 reduced GHGE by up to 60%, excluded no foods, avoided high RDs of individual foods, but resulted in large changes in food group ratios. Model 4 limited changes in food group ratios but resulted in a higher number of foods deviating from the observed supply and limited the potential of reducing GHGE. Cost was reduced in almost all solutions. An omnivorous, nutritionally adequate, and affordable school food supply, with considerably lower GHGE is achievable with moderate changes to the observed food supply. Trade-offs will always have to be made between achieving GHGE reductions and preserving similarity to the current supply.

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.

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

Financial statements depict the condition of a company and need to be analyzed and evaluated to assess its performance. This research aims to analyze financial statements to describe the financial condition, measure business development over time, and evaluate the achievement of the com-pany's objectives. An optimization analysis of financial ratios is performed using the Weighted Goal Programming (WGP) model, which addresses multiple objectives by applying weights based on their priorities. The Analytical Hierarchy Process was used to determine the priority weights of deviation variables from each financial ratio target. Financial ratios were selected based on their impact on profit using factor analysis. The constructed WGP model aims to minimize deviations in Return on Assets, Operating Ratios, Operating Income Ratio, Total Assets Turnover, and Current Ratio. Computational calculations to solve the WGP model are per-formed using Python, with pseudocode provided. A case study on a company in the garment and textile sector was conducted and found that the Operating Ratio, Return on Assets, Operating Income Ratio, and Current Ratio still need improvement by developing strategies to achieve the targets. Sensitivity analysis was also employed to assess the resilience of the model in response to alterations in data.

This paper offers an integrated approach for correlated storage assignment strategy (CSAS) to optimize travel distance by considering item correlation, picking frequency, zoning, and slot constraints to improve operational efficiency in distribution centers. We simplify the mixed integer non-linear programming (MINLP) model and incorporate integrated heuristic procedures for faster convergence. We introduce positive and negative centroid deviations as techniques to guide the model convergence and explore different scenarios. In the second stage of item assignment, we prioritize items within zones using a ranking formula that is optimal for both single-item and multiple-item orders. By analyzing the distribution of correlated item across zones and the impact of their picking frequency on optimizing travel distance, we propose an improved CSAS that minimize travel distance by strategically placing items based on their proximity to the depot. Our model reduces trips in distant zones by prioritizing larger average order sizes, while maximizing trips for frequently ordered smaller lists in closer zones. This method significantly reduces travel distance by minimizing the need for pickers in distant zones to frequently travel to the depot. Simulation results show reductions of up to 36.75% for fitted data and 33.59% for recent data.

In real-life scenario, there are many mathematical tools to handle the incomplete and imprecise data. One of them is the fuzzy approach. This article aims to contribute to the literature of fuzzy multi-objective dynamic programming issues involving the fuzzy objective functions. The piecewise quadratic fuzzy numbers characterize these fuzzy parameters. Some basic notions in the problem under the α-pareto optimal solution concept is redefined and analyzed to study the stability of the problem. Furthermore, a technique, named as enhancing decomposition approach, is presented for achieving a subset for the parametric space that contains the sameα-pareto optimal solution. For a better understanding and comprehension of the suggested concept, a numerical example is provided.

Accumulating evidences demonstrate that the host genome's epigenetic modificationsare essential for living organisms to adapt extreme conditions.DNA methylation, covalent modifications of histone, andinter-association of non-coding RNAs facilitate the cellular manifestation ofepigenetic changes in the genome. Out of various factors involved in the epigenetic programming of the host, miRNA (microRNA) and LncRNA (Long non-coding RNA) are new generationnon-coding molecules that influence a variety of cellular processes like immunity, cellular differentiation, and tumor development. During tumor development, temporal changes in miRNA/LncRNA rheostat influence sterile inflammatory responses accompanied by the changes in the carcinogenic signalling in the host. At the cellular level, this is manifested by the up-regulation of Inflammasome and inflammatory pathways, which promotes cancer-related inflammation. In view of this, we discuss the potential of lncRNA and miRNA directed interventions in regulating inflammation and tumor development in the host.

The paper proposes TOPSIS method for solving multi-objective multi-level programming problem (MO-MLPP) with fuzzy parameters via fuzzy goal programming (FGP). At first, - cut method is used to transform the fuzzily described MO-MLPP into deterministic MO-MLPP. Then, for specific , we construct the membership functions of distance functions from positive ideal solution (PIS) and negative ideal solution (NIS) of all level decision makers (DMs). Thereafter, FGP based multi-objective decision model is established for each level DM for obtaining individual optimal solution. A possible relaxation on decisions for all DMs is taken into account for satisfactory solution. Subsequently, two FGP models are developed and compromise optimal solutions are found by minimizing the sum of negative deviational variables. To recognize the better compromise optimal solution, the concept of distance functions is utilized. Finally, a novel algorithm for MO-MLPP involving fuzzy parameters is provided and an illustrative example is solved to verify the proposed procedure.

Learning programming is a complex and challenging task for many students. It in-volves both understanding theoretical concepts and acquiring practical skills. Hence, analyzing learners’ data from online learning environments alone fails to capture the full breadth of stu-dents’ actions if part of their learning process takes place elsewhere. Moreover, existing studies on learning analytics applied to programming education have mainly relied on frequency analysis to classify students according to their approach to programming or to predict academic achieve-ment. However, frequency analysis provides limited insights into the individual time-related characteristics of the learning process. The current study examines students’ strategies when learning programming, combining data from the learning management system and from an au-tomated assessment tool. To gain an in-depth understanding of students’ learning process as well as of the types of learners, we used learning analytics methods that account for the temporal order of learning actions. Our results show that students have special preferences for specific learning resources when learning programming, namely slides that support search, and copy and paste. We also found that videos are relatively less consumed by students, especially while working on programming assignments. Lastly, students resort to course forums to seek help only when they struggle.

The complexity of Mixed-Integer Linear Programs (MILPs) increases with the number of nodes in energy system models. An increasing complexity constitutes a high computational load that can limit the scale of the energy system model. Especially in microgrid optimisation problems with multiple buildings and energy systems with a number of rival supply, distribution and storage technologies, methods are sought to reduce this complexity. In this paper, we present a new 2-Level Approach to MILP energy system models that determine the system design through a combination of continuous and discrete decisions. On the first level, data reduction methods are used to determine the discrete design decisions in a simplified solution space. Those decisions are then fixed, and on the second level the full dataset is used to extract the exact scaling of the chosen technologies. The performance of the new 2-Level Approach is evaluated for a case study of an urban energy system with six buildings and an island system based on a high share of renewable energy technologies. The results of the studies show a high accuracy with respect to the total annual costs, chosen system structure, installed capacities and peak load with the 2-Level Approach compared to the results of a single level optimization. The computational load is thereby reduced by more than one order of magnitude, while a significantly higher accuracy is reached in comparison to the common time series aggregation approach.