As the COVID-19 pandemic has caused enormous damage to society, economy and public health security, it is crucial to combat the epidemic and allocate social and health resources effectively. Global optimization algorithms are extensively used in many domains to find optimal solutions to complex problems. Thus, a survey of three typical global optimizations applied on the COVID-19 pandemic is timely. This article is structured into three typical global optimization algorithms - Genetic Algorithm, Particle Swarm Optimization, and Cat Swarm Optimization - and summarizes the framework models and practical applications, as well as other optimization methods that may be applied to COVID-19. Finally, current unresolved challenges and future research opportunities to be explored are summarized.

The aim of this paper is to optimize thickness variation function of simply supported and cantilever beams, in terms of maximizing gaps between chosen neighboring frequencies and analyze obtained results. The optimization results are examined in terms of achieving the objective function (related to eigenproblem), but also in terms of their dynamics stiffness (forced vibrations excited by point harmonic load). In the optimization process, a Genetic Algorithm was used. Problems related to structural dynamics were solved by FEM implementation into the algorithm. Sample results were presented, and the developed algorithm was analyzed in terms of result convergence by examining several variable parameters. The authors demonstrated the validity of applying the described optimization tool to the presented problems. Conclusions were drawn regarding the correlation between stiffness and mass distribution in the optimized beams and the natural frequency modes in terms of which they were optimized.

The abundance of information in academic articles, reports, and studies can make it challenging for researchers to gain insights from the existing literature. To address this issue, there is a growing demand for tools that can help researchers effectively parse and analyze large volumes of data. One such tool is DataDiscoveryLab, a software system that utilizes computer vision algorithms and NLP techniques to parse academic articles into text and figures, creating three separate databases. These databases allow researchers to quickly identify articles that may be relevant to their research questions, gain a deeper understanding of the research presented, and analyze visual data. The integration of article mining and computer vision in the DataDiscoveryLab software system provides researchers with a powerful tool for navigating the vast amount of scientific literature available today. Yet, as we will discuss in the latter papers these databases’ purpose is to create a bridge between researchers’ data and practically unlimited scientific publications. Yet, in this article, we will discuss how we plan to do that, and our efforts on integrating deep learning modes. After all, unlike already existing AI models, DataDiscoveryLab can be their combination and the first Generative AI in academia that can encompass every part of the natural sciences.

Definition: Most multicellular animals have a nervous system that is based on the following three components: 1) Sensory cells gather information and send it to processing units; 2) the processing units use the information to decide on what action to take; and 3) effector neurons activate the appropriate muscles. Due to the importance of making the right decisions, evolution made profound advances in the processing units. I shall review present knowledge regarding the evolution of neurological tools for making decisions, here referred to as strategies or algorithms. Consciousness can be understood as a particularly sophisticated strategy. It may have evolved to allow for the use of feelings as a ‘common currency’ to evaluate behavioral options. The advanced cognitive capacity of species such as humans further improved the usefulness of consciousness, yet in biological terms it does not seem to be an optimal, fitness-enhancing strategy. A model for the gradual evolution of consciousness is presented. There is a somewhat arbitrary cutoff as to which animals have consciousness but based on current information it seems reasonable to restrict the term to amniotes.

This article presents an estimation of the hypertension risk based on a dataset on 1007 individuals. The application of a Tobit Model shows that “Hypertension” is positively associated to “Age”, “BMI-Body Mass Index”, and “Heart Rate”. The data show that the element that has the greatest impact in determining inflation risk is “BMI-Body Mass Index”. An analysis was then carried out using the fuzzy c-Means algorithm optimized with the use of the Silhouette coefficient. The result shows that the optimal number of clusters is 9. A comparison was then made between eight different machine-learning algorithms for predicting the value of the Hypertension Risk. The best performing algorithm is the Gradient Boosted Trees Regression according to the analyzed dataset. The results show that there are 37 individuals who have a predicted hypertension value greater than 0.75, 35 individuals who have a predicted hypertension value between 0.5 and 0.75, while 227 individuals have a hypertension value between 0.0 and 0.5 units.

In this paper we formally define the hierarchical clustering network problem (HCNP) as the problem to find a good hierarchical partition of a network. This new problem focuses on the dynamic process of the clustering rather than on the final picture of the clustering process. To address it, we introduce a new hierarchical clustering algorithm in networks, based on a new shortest path betweenness measure. To calculate it, the communication between each pair of nodes is weighed by the importance of the nodes that establish this communication. The weights or importance associated to each pair of nodes are calculated as the Shapley value of a game, named as the linear modularity game. This new measure, (the node-game shortest path betweenness measure), is used to obtain a hierarchical partition of the network by eliminating the link with the highest value. To evaluate the performance of our algorithm, we introduce several criteria that allow us to compare different dendrograms of a network from two point of view: modularity and homogeneity. Finally, we propose a faster algorithm based on a simplification of the node-game shortest path betweenness measure, whose order is quadratic on sparse networks. This fast version is competitive from a computational point of view with other hierarchical fast algorithms, and, in general, it provides better results.

This overview study set out to compare and synthesise the findings of review studies conducted on predicting student academic performance (SAP) in higher education using educational data mining (EDM) methods, EDM algorithms and EDM tools from 2013 to June 2020. It conducted multiple searches for suitable and relevant peer-reviewed articles on two online search engines, on nine online databases, and on two online academic social networks. It, then, selected 26 eligible articles from 2,050 articles. Some of the findings of this overview study are worth mentioning. First, only 2 studies explicitly stated their precise sample sizes with maths and science as the two most mentioned subject areas. Second, 16 review studies had purposes related to either EDM techniques, EDM methods, EDM models, or EDM algorithms employed to predict SAP and student success in the higher education sector. Third, there are six commonly used typologies of input variables reported by 26 review studies, of which student demographics was the most commonly utilised variable for predicting SAP. Fourth and last, seven common EDM algorithms employed for predicting SAP were identified, of which Decision Tree emerged both as the most used algorithm and as the algorithm with the highest prediction accuracy rate for predicting SAP.

This paper is devoted to the foundational problems of dendrogramic holographic theory (DH-theory). We use the ontic-epistemic (implicate-explicate order) methodology. The epistemic counterpart is based on representation of data by dendrograms constructed with hierarchic clustering algorithms. The ontic Universe is described as the p-adic tree; it is zero dimensional, totally disconnected, disordered, and bounded (in p-adic ultrametric). Interrelation classical-quantum loses its sharpness; generally simple dendrograms are ``more quantum’’ than complex one. We use the CHSH-inequality as a measure of quantum(-likeness). We demonstrate that it can be violated by classical experimental data represented by dendrograms. The seed of this violation is neither nonlocality nor rejection of realism. This is nonergodicity of dendrogramic time series. Generally, violation of ergodicity is one of the basic features of DH-theory. We also consider DH-theory for Minkovski geometry and monitor the dependence of CHSH-violation and nonergodicity on geometry as well as a Lorentz transformation of data.

In this paper, a multi-operator differential evolution algorithm (MODE) is proposed to solve the Optimal Power Flow (OPF) problem and is called MODE-OPF. The MODE-OPF utilizes the strengths of more than one differential evolution (DE) operator in a single algorithmic framework. Additionally, an adaptive method (AM) is proposed to update the number of solutions evolved by each DE operator based on both the diversity of population and quality of solutions. This adaptive method has the ability to maintain diversity at the early stages of the optimization process and boost convergence at the later ones. The performance of the proposed MODE-OPF is tested by solving OPF problems for both small and large IEEE bus systems (i.e., IEEE-30 and IEEE-118) while considering the intermittent solar and wind power generation. To prove the suitability of this proposed algorithm, its performance has been compared against several state-of-the-art optimization algorithms, where MODE-OPF outperforms other algorithms in all experimental results and thereby improving a network's performance with lower cost. MODE-OPF decreases the total generation cost up to 24.08%, the real power loss up to 6.80% and the total generation cost with emission up to 8.56%.

Reliable prediction of sustainable energy consumption is the key to designing environmental friend buildings. In this study, two novel hybrid intelligent methods, namely grasshopper optimization algorithm (GOA), wind-driven optimization (WDO), and biogeography-based optimization (BBO) is employed to optimize the multitarget prediction of heating loads (HLs) and cooling loads (CLs) in heating ventilation and air conditioning (HVAC) systems. Concerning the optimization of applied hybrid algorithms, a series of swarm-based iteration is performed, and the best structure for the abovementioned methods are proposed. Besides, through sensitivity analyzing the relationship between the HLs and CLs and influential factors are highlighted. In other words, the GOA, WDO, and BBO algorithm are mixed with a class of feedforward artificial neural networks (ANN), which called MLP (multi-layer perceptron) to predict the HLs and CLs. According to the provided sensitivity analysis, the WDO with swarm size = 500 proposes the most proper-fitted terms after it has been combined with optimized MLP. The proposed WDO-MLP (training (R2 correlation=0.977 and RMSE error=0.183) and testing (R2 correlation=0.973 and RMSE error=0.190)) provided accurate prediction in the heating load and (training (R2 correlation=0.99 and RMSE error=0.147) and testing (R2 correlation=0.99 and RMSE error=0.148)) presents the most-fit prediction in the cooling load.

Surface urban heat island (SUHI) depicts the deteriorating thermal environment in high-density cities and local climate zone (LCZ) classification provides a universal protocol for SUHI identification. In this study, taking the central urbanized area of Guangzhou in the humid subtropical region of China as the study area, the maps or images of LCZ, land surface temperature (LST), SUHI and urban design factors were achieved by using Landsat satellite data, GIS database and a series of retrieval and classification algorithms, and the urban design factors influencing SUHI were investigated based on 625 samples of LCZs. The results show that in the summer daytime under the clear sky condition, the LST varied greatly from 26 °C to 40 °C and the SUHI changed in a wide range of -6 °C to 8 °C in the LCZs of the study area. Seven and five urban design factors influencing the summer daytime SUHI were identified for the two dominant LCZ of LCZs 1-5 (LCZ 1 to LCZ 5) and the mixed LCZ (containing at least three types of LCZs), respectively. The summer daytime SUHI prediction models were obtained by using the step-wise multiple linear regression, with the performance of R2 of 0.697, RMSE of 1.21 °C, and the d value of 0.81 for the model of LCZs 1-5, and the values of 0.666, 1.66 °C, and 0.76 for the model of the mixed LCZ, indicating that the models can predict the changes of SUHI with LCZs to a large and satisfactory extent. This study presents a methodology to efficiently achieve a large sample of SUHI and urban design factors of LCZs in the largely urbanized cities, and provides information beneficial to the urban designs and regenerations in the humid subtropical region.

Efficiently solving the problem of computing, in a distributed fashion, the shortest paths of a graph whose topology dynamically changes over time is a core functionality of many today’s digital infrastructures, probably the most prominent example being communication networks. Many solutions have been proposed over the years for this problem that can be broadly classified into two categories, namely Distance-Vector and Link-State algorithms. Distance-Vector algorithms are widely adopted solutions when scalability and reliability are key issues or when nodes have either limited hardware resources, as they result in being very competitive approaches in terms of both the memory and the computational point of view. In this paper, we first survey some of the most established solutions of the Distance-Vector category. Then, we discuss some recent algorithmic developments in this area. Finally, we propose a new experimental study, conducted on a prominent category of network instances, namely generalized linear preference (GLP) power-law networks, to rank the performance of such solutions.

This paper aims to develop a low-cost, high-performance and high-reliability computing system to process large-scale data using common data mining algorithms in the Internet of Things computing. Considering the characteristics of IoT data processing, similar to mainstream high performance computing, we use a GPU cluster to achieve better IoT services. Firstly, we present an energy consumption calculation method (ECCM) based on WSN. Then, using the CUDA Programming model, we propose a Two-level Parallel Optimization Model (TLPOM) which exploits reasonable resource planning and common compiler optimization techniques to obtain the best blocks and threads configuration considering the resource constraints of each node. The key to this part is dynamic coupling Thread-Level Parallelism (TLP) and Instruction-Level Parallelism (ILP) to improve the performance of the algorithms without additional energy consumption. Finally, combining the ECCM and the TLPOM, we use the Reliable GPU Cluster Architecture (RGCA) to obtain a high-reliability computing system considering the nodes’ diversity, algorithm characteristics, etc. The results show that the performance of the algorithms significantly increased by 34.1%, 33.96% and 24.07% for Fermi, Kepler and Maxwell on average with TLPOM and the RGCA ensures that our IoT computing system provides low-cost and high-reliability services.

Our paper deals with an advanced statistical tool for the volatility prediction problem in financial (crypto) markets. Firstly, we consider the conventional GARCH involved volatility models. We next extend the corresponding GARCH based forecasting and calculate a specific probability associated with the predicted volatility levels. Since the probability evaluation is based on a stochastic model, we next develop an additional data-driven estimation of this probability. The proposed advanced statistical estimation uses real (historical) market data. The obtained theoretic results for the statistical probability of levels are also discussed in the framework of the integrated volatility concept. A possible application of the established probability estimation to the volatility clustering problem is also mentioned. Our paper includes a concrete practical implementation of the resulting (combined) volatility prediction tool and considers a novel module for trading and volatility estimation in crypto markets recently developed by 1ex Trading Board group in collaboration with the GoldenGate Venture. Moreover, we discuss shortly a possible using of the proposed model based and data-driven volatility prediction methodology in the financial risk management.

Key performance indicators are essential for any company to enhance its competitiveness. How-ever, a common issue is the manual collection of production data using record sheets, which are later digitized on desktop computers and processed in Excel sheets. Shockingly, 41% of companies in Mexico have no plans for digitalization. This work aims to develop a Real-time Productivity Indicator Monitoring System using Industry 4.0 technologies for a medium-sized manufacturing firm specializing in die-cutting automotive parts. The Advanced Quality Planning methodology was applied to develop the Conceptual, Product, and Process Engineering and its validation. The experimental tests demonstrated a reliability level of 99.98%, which exceeded initial expectations. The primary contributions presented in this work are related to the development of algorithms, communication protocols, data analysis, and general optimization of the calculation process. The study's only limitation was the short experimentation time.

Autonomous Underwater Vehicles (AUVs) are emerging as pivotal tools in underwater applications such as seafloor exploration and the inspection of pipelines or cables. Traditional land-based avoidance methods prove insufficient when applied to the complex underwater environment, largely due to the unique constraints presented by marine environments and the specific dynamics of AUVs. In this study, we introduce an improved stream function-based obstacle avoidance algorithm specifically tailored for autonomous underwater vehicles. The proposed algorithm is based on a stream function that is derived from the stream function. The stream function is characterized by a radial histogram for the cost function. In addition, constraints related to the maximum path curvature are discussed to optimize the utility of the path. Our exhaustive simulation cases validate the robustness and adaptability of the proposed algorithm, demonstrating its ability to produce feasible and optimized avoidance paths in a variety of scenarios.

Reducing the construction time for large logistics buildings can result in reduced construction management costs and economic gains from early operation. A large logistic building with a heavy load and long spans was constructed as a precast concrete (PC) structure, which requires the use of a sizable crane to lift heavy PC members. A basic analytical approach is employed to resolve potential errors in the planning of PC member erection and to build a systematic erection plan. Calculation techniques for the trajectory distance, which use the crane location, are applied to select an erection plan that minimizes crane work. A crane trajectory distance calculation algorithm for sustainable PC member erection in large logistic buildings with heavy loads and long spans has been developed. The developed model aids in creating simulation and optimization models to ensure minimal usage of cranes in the future and determining cost, construction time, CO2 emissions, and energy use for each erection plan.

Machine Learning (ML) has brought about a transformative era in reactor operations, reshaping monitoring, control, and optimization strategies. This survey comprehensively explores the diverse spectrum of ML applications in industrial reactors. From real-time sensor analysis ensuring reactor functionality to adaptive control algorithms ensuring stability, ML's impact is profound and multifaceted. The benefits of ML are equally evident in optimization, encompassing performance trend prediction, proactive maintenance, and fine-tuning of operations for enhanced efficiency. This review identifies dominant ML techniques, operations stages receptive to ML integration, core data sources, and critical input-output parameters. Aimed at both academics and practitioners, this exploration enriches reactor technologies, unlocking their full potential through insights driven by ML.

: The effects of the main parameters on the air entrainment rate, Qa, were investigated experimentally in a confined plunging liquid jet reactor CPLJR. Various downcomer diameters (Dc), jet lengths (Lj), liquid volumetric flow rates (Qj), nozzle diameters (dn), and jet velocity (Vj) were used to measure air entrainment, Qa. The non-linear relationship between the air entrainment ratio and confined plunging jet reactor parameters suggests that applying unconventional regression algorithms to predict the air entrainment ratio is appropriate. This study applied machine learning algorithms to the confined plunging jet reactor parameters to predict Qa. The obtained results showed that K-Nearest Neighbour (KNN) gave the best prediction abilities, R2 = 0.900, RMSE = 0.069, and MAE = 0.052. The sensitivity analysis was applied to determine the most effective predictor. The liquid volumetric flow rate (Qj) and jet velocity (Vj) were the most influential among all the input variables. Our findings support using machine learning algorithms to accurately forecast the CPLJR system’s experimental results.

Currently, software development is more associated with families of configurable software rather than the single implementation of a product. Due to the numerous possible combinations in a software product line, testing these families of software product lines (SPLs) is a difficult undertaking (SPL). Moreover, the presence of optional features makes the testing of SPLs impractical. Several features are presented in SPLs, but due to the environment's time and financial constraints, these features are rendered unfeasible. Testing subsets of configured products is thus one approach to solving this issue. In order to reduce testing effort and get better results, alternative methods of testing SPLs are required, such as the combinatorial interaction testing (CIT) technique. Unfortunately CIT method produces unscalable solutions for large size SPLs with excessive constraints. The CIT method costs more because of feature combinations. The optimization of the various conflicting testing objectives, such as reducing the cost and configuration number, have also been considered. In this article, we have proposed a search-based software engineering solution using multi-objective optimization algorithms (MOEAs). In particular, the research is applied to different types of MOEA methods; Indicator-Based Evolutionary Algorithm (IBEA), Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D), Non-Dominated Sorting Genetic Algorithm II (NSGAII), NSGAIII, and Strength Pareto Evolutionary Algorithm 2 (SPEA2). The results of the algorithms are examined in the context of distinct objectives and two quality indicators. The results revealed how feature model attributes, implementation context and the number of objectives affect the performance of the algorithms.

Recently, the Hypervolume Newton method (HVN) has been proposed as fast and precise indicator-based method for solving unconstrained bi-objective optimization problems with objective functions that are at least twice continuously differentiable. The HVN is defined on the space of (vectorized) fixed cardinality sets of decision space vectors for a given multi-objective optimization problem (MOP) and seeks to maximize the hypervolume indicator adopting the Newton-Raphson method for deterministic numerical optimization. To extend its scope to non-convex optimization problems the HVN method was hybridized with a multi-objective evolutionary algorithm (MOEA), which resulted in a competitive solver for continuous unconstrained bi-objective optimization problems. In this paper, we extend the HVN to constrained MOPs with in principle any number of objectives. We demonstrate the applicability of the extended HVN on a set of challenging benchmark problems and show that the new method can be readily be applied to solve equality constraints with a high precision problems, and to some extend also inequalities. We finally use HVN as local search engine within a MOEA and show the benefit of this hybrid method on several benchmark problems.

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

Real-world optimization problems are often governed by one or more constraints. Over the last few decades, extensive research has been performed in Constrained Optimization Problems (COPs) fueled by advances in computational intelligence. In particular, Evolutionary Algorithms (EAs) are a preferred tool for practitioners for solving these COPs within practicable time limits. We propose an ensemble of multi- method hybrid EA framework with four mutation operators, two crossover operators, multi-search [Differential Evolution (DE) & Gaining Sharing Knowledge (GSK)] optimization algorithm, and ensemble of constraint handling techniques to solve global real- world constrained optimization problem. The proposed frame- work FEPEA has an ascendancy of multiple adaptation strategies concerning the control parameters, search mechanisms, two sub-populations as well as uses knowledge sharing mechanism between junior and senior phases. The algorithm also combines the power of four popular constraint handling techniques (CHT) and uses a voting mechanism to select any particular CHT. On top of that, this algorithm also uses both linear and non- linear population size reduction in every step of the evolutionary process. We test our method on 57 real-world problems provided as part of the CEC 2020 special session & competition on real- world constrained optimization benchmark suite. Experimental results indicate that FEPEA is able to achieve state-of-the- art performance on real-world constrained global optimization when compared against other well-known real-world constrained optimizers.

This paper is focused on two topics very relevant in water distribution networks (WDNs): vulnerability assessment and the optimal placement of water quality sensors. The main novelty element of this paper is to represent the data of the problem, in this case all objects in a graph underlying a water distribution network, as discrete probability distributions. For vulnerability (and the related issue of re-silience) the metrics from network theory, widely studied and largely adopted in the water research community, reflect connectivity expressed as closeness centrality or, betweenness centrality based on the average values of shortest paths between all pairs of nodes. Also network efficiency and the related vulnerability measures are related to average of inverse distances. In this paper we propose a different approach based on the discrete probability distribution, for each node, of the node-to-node distances. For the optimal sensor placement, the elements to be represented as dis-crete probability distributions are sub-graphs given by the locations of water quality sensors. The objective functions, detection time and its variance as a proxy of risk, are accordingly represented as a discrete e probability distribution over contamination events. This problem is usually dealt with by EA algorithm. We’ll show that a probabilistic distance, specifically the Wasserstein (WST) distance, can naturally allow an effective formulation of genetic operators. Usually, each node is associated to a scalar real number, in the optimal sensor placement considered in the literature, average detection time, but in many applications, node labels are more naturally expressed as histograms or probability distributions: the water demand at each node is naturally seen as a histogram over the 24 hours cycle. The main aim of this paper is twofold: first to show how different problems in WDNs can take advantage of the representational flexibility inherent in WST spaces. Second how this flexibility translates into computational procedures.

General Variable Neighborhood Search (GVNS) is a well known and widely used metaheuristic for efficiently solving many NP-hard combinatorial optimization problems. Quantum General Variable Neighborhood Search (qGVNS) is a novel, quantum inspired extension of the conventional GVNS. Its quantum nature derives from the fact that it takes advantage and incorporates tools and techniques from the field of quantum computation. Travelling Salesman Problem (TSP) is a well known NP-Hard problem which has broadly been used for modelling many real life routing cases. As a consequence, TSP can be used as a basis for modelling and finding routes for Geographical Systems (GPS). In this paper, we examine the potential use of this method for the GPS system of garbage trucks. Specifically, we provide a thorough presentation of our method accompanied with extensive computational results. The experimental data accumulated on a plethora of symmetric TSP instances (symmetric in order to faithfully simulate GPS problems), which are shown in a series of figures and tables, allow us to conclude that the novel qGVNS algorithm can provide an efficient solution for this type of geographical problems.

To protect power lines, distance relays are used which can rely on a modified distance resistance. But usually the operating range of these relays changes as the network conditions change (network topology, load value, output value, etc.) and leads to false trips, By using methods that can process information and recognize patterns, for example, the use of micro and intelligent processor algorithms can use the new relays with high precision and thus provide adequate protection. In this study, a distance relay was modeled using a neural network, and it was observed that the neural relay had higher accuracy than the conventional relay. In addition to detecting the fault and its location, type and phase of the fault, three-stage simultaneous protection can be performed. As a result, the number of linear relays can be reduced by using relays based on neural technologies. An MLP (multilayer perceptron) neural network is used to model a sequence of distances.

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.

Image synthesis poses a challenging problem that researchers in computer vision and machine learning have been grappling with for several decades. Numerous machine learning techniques have emerged and proven effective in generating high-fidelity artificial images. This study breaks new ground by exploring image synthesis through generative learning using the D-Wave 2000Q quantum annealer, marking the first attempt to address the issue of generative image synthesis on a Quantum Processing Unit (QPU). Alongside executing image synthesis on the quantum annealer, this research also compares its performance with existing classical models and delves into resolving the Generative Learning Trilemma.

The advancement of technology and the availability of specialized digital signal processing chips have made digital filter design and implementation more feasible in a variety of fields, including biomedical engineering. This paper makes two key contributions. First, it uses a genetic algorithm to optimize the coefficients of Finite Impulse Response (FIR) filters. Second, it conducts a case study on using genetic algorithms to optimize FIR filters for electrocardiogram (ECG) biomedical signal noise removal. The goal of the proposed filter design approach is to achieve the desired signal bandwidth while minimizing the side lobe level and eliminating unwanted signals using a genetic algorithm. The results of the comprehensive analysis of the impact of different genetic operators show that the genetic algorithm-based filter outperforms conventional filter designs.

In this paper, possibilities for the bandwidth and wavelength utilization in future next-generation passive optical networks are presented and reasons for realizing and utilizing of extended dynamic wavelength and bandwidth algorithms for NG-PON2 networks are analyzed. Next, principles of the effective dynamic bandwidth allocation are introduced in details, focused on the importance of the decision criterion optimization. For achieving better bandwidth utilization of dedicated wavelengths, this paper is focused on the novel effective dynamic bandwidth allocation algorithm with adaptive allocation of wavelengths to ONU units and on the optimization of the decision criterion. For analyzing the novel extended DWBA algorithm utilizing for various wavelength allocation cases possible in NG-PON2 networks, a simulation program with the enhancement of the EDBA algorithm is realized. Finally, an optimization of the decision criterion defining a minimum bandwidth utilization of the actual wavelength is executed for NG-PON2 networks based on the hybrid TWDM technique.

With the exponential growth of machine learning and development of Artificial Neural Network (ANNs) in recent years, there is great opportunity to leverage this approach and accelarate bio-logical discoveries through applications on the analysis of bioinformatics data. Various types of datasets including for example protein or gene interaction networks, molecular structures and cellular signalling pathways, have already been used for machine learning by training ANNs for inference and pattern classification. However, unlike regular data structures that are commonly used in the computer science and engineering fields, bioinformatics datasets present challenges that require unique algorithmic approaches. The recent development of the geometric and deep learning approach within the machine learning field, is very promising towards accelerating analysis complex bioinformatics datasets. The principles of ANNs and their importance for bio-informatics machine learning is demonstrated herein, through presentation of the undelying mathematical and statistical foundations from group theory, symmetry, linear algebra. Further-more, the structure and functions of ANN algorithms that form the core principles of artificial intelligence are explained, in relation to the bioinformatics data domain. Overall, the manuscript provides guidance for researchers to understand the principles required for practicing machine learning and artificial intelligence, with the special considerations towards bioinformatics applications.

The evolutionary systems (ES) include software applications that solve problems using heuristic methods instead of the deterministic ones. The classical computing used for ES development involves random methods to improve different kinds of genomes. The mappings of these genomes lead to individuals that correspond to the searched solutions. The individual evaluations by simulations serve for the improvement of their genotypes. Quantum computations, unlike the classical computations, can describe and simulate a large set of individuals simultaneously. This feature is used to diminish the time for finding the solutions. Quantum Petri Nets (QPNs) can model dynamical systems with probabilistic features that make them appropriate for the development of ES. Some examples of ES applications using the QPNs are given to show the benefits of the current approach.

This article discusses the use of a hand held electronic nose to obtain information on the presence of some aromatic defects in natural cork stoppers, such as haloanisoles, alkylmethoxypyrazines and ketones. The proposed prototype has been developed as an instrumentation system with up to eight commercial gas sensors. Machine learning algorithms such as k-nearest neighbors and artificial neural networks has been used. The use of this system tries to improve the current aromatic defect detection process in the cork stopper industry, which is done by gas chromatography or human test panels.

Achieving global goals on sustainable nutrition, health, and wellbeing will depend on delivering enhanced diets to humankind. This will require, among others, instantaneous access to information on food quality at key points within agri-food systems. Although stationary methods are usually used to quantify grain quality (wet-lab chemistry, benchtop NIR spectrometer); these do not suit many required user-cases, such as stakeholders in decentralized agri-food-chains that are typical for emerging economies. Therefore, we explored new technologies and models that might aid these particular user-cases. For this purpose, we generated the NIR spectra of 328 grain samples from multiple cereals (finger millet, foxtail millet, maize, pearl millet, sorghum) with a standard benchtop NIR Spectrometer (DS2500, FOSS) and a novel mobile NIR-based sensor (HL-EVT5, Hone). We explored a range of classical deterministic and novel machine learning (ML)-driven models to build calibrations out of the NIR spectra. We were able to build relevant calibrations out of both types of spectra. At the same time, ML-based methods enhanced the prediction capacity of calibration models compared to classical deterministic methods. We also documented that the prediction of grain protein content based on NIR spectra generated by a mobile sensor (HL-EVT5, Hone) was highly relevant for quantitative protein predictions (R2 = 0.91, RMSE = 0.97, RPD = 3.48). Thus, the findings of this study lay the foundations on which to expand the utilization of NIR spectroscopy applications for agricultural research and development.

The global climate change mitigation efforts have increased the efforts of national government to incentivize local households in adopting individual renewable energy as a mean to help reduce the usage of electricity generated using fossil fuels and to gain independence from the grid. Since the majority of residential generation is made by PV panels that generate electricity at off-peak hours, the optimal management of such installations often considers local storage that can defer the use of locally generated electricity at later times. On the other hand, the presence of distributed generation can affect negatively the operating conditions of low-voltage distribution networks. The energy stored in batteries located in optimal places in the network can be used by the utility to improve the operation of the network. This paper proposes a metaheuristic approach based on a Genetic Algorithm that considers three different scenarios of using energy storage for reducing the losses in the network. Prosumer and network operator priorities can be considered in different scenarios inside the same algorithm, to provide a comparative study of different priorities in storage placement. A case study performed on a real distribution network provides insightful results.

Artificial intelligence (AI) is a versatile term that is a conclusive remedy to solve the problem using past rational data after deep contemplation using these terms i-e basic statistics, carving data, familiarity with common AI algorithms. Seafood especially tiger prawn export as a busi-ness will provide enormous foreign exchange to any country if the farmers overcome the corre-lated vulnerabilities in prawn farming. This research is elucidating lacking in Tiger prawn (TP) farming like curbing of Oxygen, pH, water temperature, and nutrients, etc. Moreover, hatchery statistics in terms of juveniles will depict this study's clear picture of curbed aquaculture. For normative decisions, the Analytical Hierarchical Process (AHP) is used. The problem which has been faced by local prawn farmers that there is a stagnant TP growth in ponds, the reason is the predominant sensitivity factor in TP. For this reason, they need indemnification of thirteen fac-tors with natural resources to get the plausible results to get calmness in their lives. This study will solely focus on the TP growth model, and the monitoring effect will be established by the Artificial Intelligence algorithm. This study will employ the AHP, 0-1 scaling method, data cura-tion techniques, and ecological statistics. The life of Tiger Prawn (TP) depends upon these factors mainly, a) Physical and b) Chemical parameters. Physical parameters contain environment (E) provided to TP like season (S) and temperature (T) etc. whereas the quality of Ammonia NH3 (N) from fish waste, Oxygen level (O), and water quality hard & soft (W) lies in chemicals do-main. This research will Elucidate the factors which cause conceptual muddles in the aquamarine life of TP, for this reason, Statistical tools will assess the current result, forecast the gap. AHP will analyze the domain inputs, circumspect ramification which will depict visceral factors, later results depict which pond suits the TP. In curtail, these factors will be curbed to improve the growth of TP in a control conditioned environment.

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.

Abstract: Patient blood samples are invaluable in clinical omics databases, yet current methodologies often fail to fully uncover the molecular mechanisms driving patient pathology. While Genome-scale Metabolic Models (GEMs) show promise in systems medicine by integrating various omics data, having only exometabolomic data remains a limiting factor. To address this gap, we introduce a comprehensive pipeline integrating GEMs with patient plasma metabolome. This pipeline constructs case-specific GEMs using literature-based and patient-specific metabolomic data. Novel computational methods, including adaptive sampling and an in-house developed algorithm for the rational exploration of the sampled space of solutions, enhance integration accuracy while improving computational performance. Model characterization involves task analysis in combination with clustering methods to identify critical cellular functions. The new pipeline was applied to a cohort of trauma patients to investigates shock-induced endotheliopathy using patient plasma metabolome data. By analyzing endothelial cell metabolism comprehensively, the pipeline identified critical substrates and contributed to the development of targeted therapeutic strategies. Our study demonstrates the efficacy of integrating patient plasma metabolome data into computational models to analyze endothelial cell metabolism in disease contexts. This approach offers a deeper understanding of metabolic dysregulations and provides insights into diseases with metabolic components and potential treatments.

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.

Concern about the planet's future has motivated governments around the world to adopt policies that promote more responsible energy consumption. Reducing emissions of the principal cause of climate change man-made greenhouse gases requires greater system efficiency and the utilization of renewable energy sources. The generation of electricity is the single largest source of hazardous pollutants, followed by the transportation sector. This is true due to the extreme reliance on petroleum and its derivatives that these industries have. Electric mobility is receiving more attention from businesses, governments, and academic institutions as a means to reduce the negative impacts of current energy consumption. Without measures to address common technical issues, electric vehicles would strain electrical infrastructure. In order to determine the best strategy for switching operations and feeder reconfiguration, this research presents a helpful hybrid genetic algorithm particle swarm optimization (HGAPSO) method. Meet transmission limits while decreasing real power losses and enhancing the system's bus voltage profile. The effects of HGAPSO on power losses and voltage distributions in the network are analyzed. Then, a report is produced contrasting GA and PSO. This cross-breeding of GA and PSO led to HGAPSO. This important problem can be solved more effectively with the use of new or improved algorithms. To find the optimal reconfiguration and properly rearrange transmission network interconnection, it employs a plethora of heuristic optimization algorithms. The objective is to limit bus voltage variations while maintaining the system's radial topology and minimizing power usage. The reliability and performance of the procedure were evaluated using MATLAB's IEEE 33-bus communication network. The outcomes demonstrate the effectiveness of the proposed technique, which cuts down on power waste during standalone runs and speeds up the processing time.

In this work, we introduce a scalable and efficient GPU-accelerated methodology for volumetric particle advection and finite-time Lyapunov exponent (FTLE) calculation, focusing on the analysis of Lagrangian Coherent Structures (LCS) in large-scale Direct Numerical Simulation (DNS) datasets across incompressible, supersonic, and hypersonic flow regimes. LCS play a significant role in turbulent boundary layer analysis, and our proposed methodology offers valuable insights into their behavior in various flow conditions. Our novel owning-cell locator method enables efficient, constant-time cell search, and the algorithm draws inspiration from classical search algorithms and modern multi-level approaches in numerical linear algebra. The proposed method is implemented for both multi-core CPUs and Nvidia GPUs, demonstrating strong scaling up to 32,768 CPU cores and up to 62 Nvidia V100 GPUs. By decoupling particle advection from other problems, we achieve modularity and extensibility, resulting in consistent parallel efficiency across different architectures. Our methodology was applied to calculate and visualize the FTLE on four turbulent boundary layers at different Reynolds and Mach numbers, revealing that coherent structures grow more isotropic proportional to the Mach number, and their inclination angle varies along the streamwise direction. We also observed increased anisotropy and FTLE organization at lower Reynolds numbers, with structures retaining coherency along both spanwise and streamwise directions. Additionally, we demonstrated the impact of lower temporal frequency sampling by upscaling with an efficient linear upsampler, preserving general trends with only 10% of the required storage. In summary, we present a particle search scheme for particle advection workloads in the context of visualizing LCS via FTLE that exhibits strong scaling performance and efficiency at scale. Our proposed algorithm is applicable across various domains requiring efficient search algorithms in large structured domains. While this manuscript focuses on the methodology and its application to LCS, an in-depth study of the physics and compressibility effects in LCS candidates will be explored in a future publication.

Project managers should balance a variety of resource elements in building projects while taking into account many major concerns, including time, cost, quality, risk, and the environment. This study presents a framework for resource trade-offs in project scheduling based on the Building Information Modeling (BIM) methodology and metaheuristic algorithms. First, a new metaheuristic algorithm called Fire Hawk Optimizer (FHO) is used. Using project management software and the BIM process, a 3D model of the construction is created. In order to maximize quality while minimizing time, cost, risk, and CO2 in the project under consideration, an optimization problem is created, and the FHO's capability for solving it is assessed. A predefined stopping condition is taken into account while doing 30 independent optimization runs to obtain the statistical metrics, such as the mean, standard deviation, and the required number of objective function evaluations. The results show that the FHO algorithm is capable of producing competitive and exceptional outcomes when it comes to trade-off various resource options in projects.

Total cloud cover (TCC) retrieval from ground-based optical imagery is a problem being tackled by a few generations of researchers. The number of human-designed algorithms for the estimation of TCC grows every year. However, there is not very much progress in terms of quality, mostly due to the lack of systematic approach to the design of the algorithms, to the assessment of their generalization ability, and to the assessment of the TCC retrieval quality. In this study, we discuss the optimization nature of data-driven schemes for TCC retrieval. In order to compare the algorithms, we propose the framework for the assessment of the algorithms characteristics. We present several new algorithms that are based on deep learning techniques: a model for outliers filtering, and a few models for TCC retrieval from all-sky imagery. For training and assessment of data-driven algorithms of this study, we present the Dataset of All-Sky Imagery over the Ocean (DASIO) containing over one million of all-sky optical images of visible sky dome taken in various regions of the World Ocean. The research campaigns contributed to DASIO collection took place in the Atlantic ocean, the Indian ocean the Red and Mediterranean seas, and also in the Arctic ocean. Optical imagery collected during these missions are accompanied by standard meteorological observations of cloudiness characteristics made by experienced observers. We assess the generalization ability of the presented models in several scenarios that differ in terms of the regions selected for the train and validation subsets. As a result, we demonstrate that our models based on convolutional neural networks deliver superior quality compared to all previously published schemes. As a key result, we demonstrate considerable drop of the ability to generalize the training data in case of strong covariate shift between training and validation subsets of imagery which may take place in case of region-aware subsampling.

Classification of electromyographic signals has a wide range of applications, from clinical diagnosis of different muscular diseases to biomedical engineering, where their use as input control of prosthetic devices has become a hot topic of research. Challenge of classifying this signals relies on the accuracy of the proposed algorithm and the possibility of its implementation on hardware. This paper consider the problem of electromyography signal classification, solved with the proposed signal processing and feature extraction stages, with focus lying on the signal model and time domain characteristics for better classification accuracy. The proposal considers a simple preprocessing technique that produces signals suitable for feature extraction, and the Burg reflection coefficients to form learning and classification patterns. These coefficients yield a competitive classification rate compared to used time domain features. Sometimes, the feature extraction from electromyographic signals showed that procedure can omit less useful traits for machine learning models. Using feature selection algorithms provides a higher classification performance with as fewer traits as possible. Algorithms achieved a high classification rate up to 100% with low pattern dimensionality, with other kinds of uncorrelated attributes for hand movement identification.

Genetic testing has expanded out of the research laboratory into medical practice and the direct-to-consumer market, and rapid analysis of the resulting genotype data can now have significant impact. We present a method for summarizing personal genotypes as ‘genotype fingerprints’ that meet these needs. Genotype fingerprints can be derived from any single nucleotide polymorphism (SNP)-based assay, and remain comparable as chip designs evolve to higher marker densities. We demonstrate that they support distinguishing types of relationships among closely related individuals and closely related individuals from individuals from the same background population, as well as high-throughput identification of identical genotypes, individuals in known background populations, and de novo separation of subpopulations within a large cohort through extremely rapid comparisons. While fingerprints do not preserve anonymity, they provide a useful degree of privacy by summarizing a genotype in a way that prevents reconstruction of individual marker states. Genotype fingerprints are therefore well-suited as a format for public aggregation of genetic information to support ancestry and relatedness determination without revealing personal health risk status.

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

The oxidative coupling of methane (OCM) to produce ethane and ethylene (C2 compounds) as platform chemicals involves complex chemistry with reactions both in the gas phase and on the catalyst surface, resulting in a distribution of products at the expense of C2 selectivity. This work uses experimental data from a variety of mixed metal oxides on supports at different reaction conditions (temperature, contact time, and reactant flow rates) to train a random forest regressor that predicts methane conversion and C2 selectivity (key performance indicators (KPIs)), and deploys it to locate optimal conditions that maximize C2 yield for a catalyst. Investigating the regressor interpretability via feature importance reveals that the choice of metals and support are crucial to C2 selectivity predictions, while the predictions of methane conversion are driven by the reaction conditions. The machine learning (ML) regressor is used as a surrogate to develop performance curves for each of the catalysts via a multi-objective optimization routine that seeks to maximize the KPIs in the decision space of reaction conditions, is seen to locate optimal conditions at which the maximum C2 yields for catalysts are predicted to be 15%, higher on average. Analyzing the catalysts in the space of their performance curves with respect to a popular OCM catalyst, Mn-Na2WO4/SiO2, reveals distinct patterns based on intrinsic properties of metals and supports. Further, the decision space with catalyst descriptors and reaction conditions is optimized for high C2 yields using the ML surrogate, in a static multi-objective optimization routine, and an adaptive Bayesian routine, where the latter was found to have a wider field focus in proposing catalyst formulations and conditions. Transition metal oxides on a variety of supports were proposed but not their lanthanide oxide counterparts.

This paper introduces new improvements to the modified version of the BIRECT (BI secting RECTangles) algorithm referred to as BIRECTv. We explore various approaches, by first including a grouping strategy for hyper-rectangles having almost the same sizes by categorizing them into different classes. Therefore constraining them not to exceed a certain pre-defined threshold (a small positive value to define the tolerance level). This approach allows for more efficient computation and can be particularly useful when dealing with a large number of hyper-rectangles with varying sizes. To avoid over-sampling, and preventing redundant or excessive sampling, at some shared vertices in descendant subregions, a particular vertex database is used to limit the number of samples taken within each subregion to two. The experimental investigation shows that these improvements have a positive impact on the performance of the BIRECTv(imp.) algorithm and the proposal is a promising global optimization algorithm compared to the original BIRECTv algorithm and its variants. Additionally, the BIRECTv(imp.) algorithm showed particular efficacy in solving high-dimensional problems.

Dynamic adaptive video streaming over HTTP (DASH) plays a crucial role in video transmission across networks. Traditional adaptive bitrate (ABR) algorithms adjust the quality of video segments based on network conditions and buffer occupancy. However, these algorithms rely on fixed rules within a complex environment, making it challenging to achieve optimal decisions considering the overall context. In this paper, we propose a novel Deep Reinforcement Learning-based approach for streaming DASH, focusing on maintaining consistent perceived video quality throughout the streaming session to enhance user experience. Our approach optimizes the Quality of Experience (QoE) by dynamically controlling the quality distance factor between consecutive video segments. We evaluate this approach through a simulation model that encompasses diverse wireless network environments and various video sequences. Additionally, we compare our proposed approach with state-of-the-art methods. The experimental results demonstrate significant improvements in QoE, ensuring users enjoy stable, high-quality video streaming sessions.

Tapping panel dryness (TPD) syndrome is a complex disease of Rubber tree (Hevea brasiliensis L.) which causes cessation of latex drainage upon tapping of rubber tree. Rubber tree virus (RTV1) was identified as a novel pathogen associated with rubber tree and a potential causal agent of TPD. RTV1 is a monopartite RNA virus that is linear, non-enveloped and has a single-stranded (ss) positive RNA genome of approximately 6081 nucleotides and is composed of two major open reading frames (ORFs), ORF1 (polyprotein), and ORF2 (movement protein. This study aimed to investigate the possibility of rubber genome encoded tree microRNAs (miRNAs) as novel therapeutic targets against RTV1 using in silico algorithms. Mature rubber tree miRNAs are retrieved from the miRBase database and are used for hybridization of RTV1 using five different five different computational algorithms including miRanda, RNA22, RNAhybrid and psRNATarget. A total of eleven common rubber tree miRNAs were identified based on consensus genomic positions. The consensus of four algorithms predicted the hybridization sites of hbr-miR396a and hbr-miR398 at common locus positions 6676, 1840 respectively. To validate the prediction, secondary structures of the consensual rubber tree miRNAs and free energy of duplex binding were calculated using the RNAfold and RNAcofold algorithms respectively. We created a plot between rubber tree miRNAs and RTV1 ORFs by using Circos algorithm. In this study, we predicted eleven consensual rubber tree miRNAs. Among these miRNAs, hbr-miR398 was identified as the most effectual miRNA that may target the ORF1 gene of the RTV1 genome. The predicted data will be important in the development of rubber trees resistant to RTV1.

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

To secure computers and information systems from attackers taking advantage of vulnerabilities in the system to commit cybercrime, several methods have been proposed for real-time detection of vulnerabilities to improve security around information systems. Of all the proposed methods, machine learning had been the most effective method in securing a system with capabilities ranging from early detection of software vulnerabilities to real-time detection of ongoing compromise in a system. As there are different types of cyberattacks, each of the existing state-of-the-art machine learning models depends on different algorithms for training which also impact their suitability for detection of a particular type of cyberattack. In this research, we analyzed each of the current state-of-theart machine learning models for different types of cyberattack detection from the past 10 years with a major emphasis on the most recent works for comparative study to identify the knowledge gap where work is still needed to be done with regard to detection of each category of cyberattack

Cotton leaf curl Kokhran virus (CLCuKoV) (genus, Begomovirus; family, Geminiviridae) is highly infectious, widespread and the most dangerous pathogen of cotton (Gossypium hirsutum L.) that is responsible to a serious disorder, cotton leaf curl disease (CLCuD). Begomoviruses are spread very efficiently by the whitefly Bemisia tabaci cryptic species, causing economic losses to cotton crop, all over the world. The ‘Lucknow’ strain of CLCuKoV has emerged as a divergent isolate that could cause CLCuD. The monopartite ssDNA genome of CLCuKoV-Lu (2.7 Kb) contains six open reading frames (ORFs) that was shown to encode four major proteins. RNA interference (RNAi)-based antiviral innate immunity is a sequence-specific biological phenomenon and a powerful tool to control plant viruses. The present study aims to determine cotton locus-derived microRNAs (ghr-miRNAs) that are identified for targeting the CLCuKoV-Lu ss-DNA-encoded mRNAs using a predictive approach that involves four computational algorithms, miRanda, RNA22, psRNATarget and RNAhybrid. Mature ghr-miRNA sequences (n=80) from allotetraploid upland cotton (2n = 4x = 52) were selected from the miRBase and were tested for alignment with the CLCuKoV-Lu genome. Among the 80 cotton locus-derived ghr-miRNAs evaluated, only one consensus cotton locus-derived ghr-miRNA (ghr-miR2950) was concluded to have effective ghr-miRNA target site at common nucleotide position 82 in the CLCuKoV-Lu genome respectively, using a stringent criterion, identified by all the algorithms used. The miRNA targeting is reliant on base pairing of miRNA-mRNA target pairings. Conservation of the hybridization binding site of the predicted ghr-miR2950 was validated using multiple sequence alignment within all the strains of CLCuKoV. We constructed a regulatory interaction network of miRNA–mRNA to identify novel targets. The efficacy of the predicted miRNAs against CLCuKoV-Lu was evaluated by RNAi-mediated targeted mRNA cleavage. The current investigated miRNA targets provide evidence for the development of CLCuD-resistant cotton plants.

With the continuous improvement and observable benefits of electric vehicles (EVs), major logistic companies are introducing more EVs into their conventional fleets. This gives rise to a new type of vehicle routing problem with mixed vehicles, where heterogeneous internal combustion vehicles (ICVs) and electric vehicles are considered in route planning. In addition, certain deliveries that are not efficient on any type of vehicles, are outsourced to third-party common carriers. In this paper, we define this problem as a mixed vehicle routing problem with common carriers (MVRPC). The objective of such problems is to minimize the transportation costs by considering routes with ICVs and EVs, the possibility of visiting recharging stations, outsourcing options, and drivers’ layover regulations. This variant of the vehicle routing problems has many practical applications, particularly in the design of long-haul transportation and last-mile delivery services. Effective MVRPC solutions play a key role in promoting the going Green image and optimally allocating resources. The problem has received limited attention in the literature likely because addressing all the needed aspects is especially challenging. To solve the large-scale problem, we develop a branch-and-cut pricing framework that relies on strong cuts and customized labeling algorithms. Numerical experiments highlight the effectiveness of our algorithm. This success can be attributed to tailored critical resources, dynamically bounded bidirectional labeling procedures, strong dominance criteria, and implementation strategies.

A topical challenge for algorithms in general and for automatic image categorization and generation in particular is presented with the aim of highlighting strengths and deficiencies of current Artificial Intelligence approaches while sketching a way forward. A general lack of encompassing symbol-embedding and (not only) -grounding in some bodily basis is made responsible for current deficiencies. A concomitant dearth of hierarchical organization of concepts follows suite. As a remedy for these shortcomings, it is proposed to take a wide step back and to newly incorporate aspects of cybernetics and analog control processes. It is claimed that a promising overarching perspective is provided by the Ouroboros Model with a valid and versatile algorithmic backbone for general cognition at all accessible levels of abstraction and capabilities.

Breast cancer is a significant health issue across the world. Breast cancer is the most widely-diagnosed cancer in women; early-stage diagnosis of disease and therapies increase patient safety. This paper proposes a synthetic model set of features focused on the optimization of the genetic algorithm (CHFS-BOGA) to forecast breast cancer. This hybrid feature selection approach combines the advantages of three filter feature selection approaches with an optimize Genetic Algorithm (OGA) to select the best features to improve the performance of the classification process and scalability. We propose OGA by improving the initial population generating and genetic operators using the results of filter approaches as some prior information with using the C4.5 decision tree classifier as a fitness function instead of probability and random selection. The authors collected available updated data from Wisconsin UCI machine learning with a total of 569 rows and 32 columns. The dataset evaluated using an explorer set of weka data mining open-source software for the analysis purpose. The results show that the proposed hybrid feature selection approach significantly outperforms the single filter approaches and principal component analysis (PCA) for optimum feature selection. These characteristics are good indicators for the return prediction. The highest accuracy achieved with the proposed system before (CHFS-BOGA) using the support vector machine (SVM) classifiers was 97.3%. The highest accuracy after (CHFS-BOGA-SVM) was 98.25% on split 70.0% train, remainder test, and 100% on the full training set. Moreover, the receiver operating characteristic (ROC) curve was equal to 1.0. The results showed that the proposed (CHFS-BOGA-SVM) system was able to accurately classify the type of breast tumor, whether malignant or benign.

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

The incorporation of renewable energy systems in the world energy system has been steadily increasing during the last years. In terms of the building sector, the usual consumers are becoming increasingly prosumers, and the trend is that communities of energy, whose households share produced electricity, will increase in number in the future. Another observed tendency is that the aggregator (the entity that manages the community) trades the net community energy in public energy markets. To accomplish economically good transactions, accurate and reliable forecasts of the day-ahead net energy community must be available. These can be obtained using an ensemble of multi-step shallow artificial neural networks, with prediction intervals obtained by the covariance algorithm. Using real data obtained by a small energy community of four houses located in the South region of Portugal, one can verify that the deterministic and probabilistic performance of the proposed approach is at least similar, typically better than using complex, deep models.

As the core components of water jet propulsion system, water jet pump, directly affect the ship's propulsion performance. 3D reverse design method can effectively suppress the impeller secondary flow to get better performing hydraulic models. Aiming at fast and efficient optimization of the impellers, we parameterize the impellers and runner, and coupled with optimization algorithms and numerical calculations. It is an efficient and feasible way to coupling optimization based on multi-parameter, multi-objective and optimization algorithms, and parameterizing the impellers and guide vane geometry based on the 3D model designed by 3D reverse design method. In this paper, the waterjet propulsion pump is taken as the research object. According to the design method of the waterjet propulsion pump hydraulic model, the traditional axial flow blade design method, the modern ternary design theory of the blades, and the parametric three-dimensional reverse design method are selected to constructing an optimal design optimization strategy for the impeller of water-jet propulsion pump based on multi-parameter and multi-object genetic algorithm. Under the design conditions, the optimized pump efficiency reaches 89.28%, which is 1.24% higher than the original hydraulic model. The optimized pump head is 13.51 m, which is 0.39m more than the original hydraulic model. Under the design condition, the test measured head is 13.26m, the numerical calculation result is 1.88% higher than the test result, the test measured efficiency is 87.1%, the numerical calculation result is 2.5% higher than the test result. From the test results, the optimized impeller has higher hydraulic performance. Experiments have shown that it is feasible to optimize the design strategy.

Fault detection in PV arrays and inverters is critical for ensuring maximum efficiency and performance. Artificial intelligence (AI) learning can be used to quickly identify issues, resulting in a sustainable environment with reduced downtime and maintenance costs. As the use of solar energy systems continues to grow, the need for reliable and efficient fault detection and diagnosis techniques becomes more critical. This paper presents a novel approach for fault detection in photovoltaic (PV) arrays and inverters, combining AI techniques. It integrates Elman Neural Network (ENN), Boosted Tree Algorithms (BTA), Multi-layer Perceptron (MLP), and Gaussian Processes Regression (GPR) for enhanced accuracy and reliability in fault diagnosis. It leverages their strengths for accuracy and reliability of fault diagnosis. Feature engineering-based sensitivity analysis was utilized for feature extraction, the fault detection and diagnosis were assessed using several statistical criteria including PBAIS, MAE, NSE, RMSE, and MAPE. Two intelligent learning scenarios are carried out, the first scenario is done for PV array fault detection with DC power (DCP) as output. The second scenario is done for inverter fault detection with AC power (ACP) as the output. The proposed technique is capable of detecting faults in PV arrays and inverters, providing a reliable solution for enhancing the performance and reliability of solar energy systems. Real-world solar energy dataset is used to evaluate the proposed technique, with results compared to existing detection techniques and obtained results show that it outperforms existing fault detection techniques, achieving higher accuracy and better performance. The GPR-M4 optimization justified reliably among all the models with MAPE=0.0393, and MAE=0.002 for inverter fault detection and MAPE=0.091, and MAE=0.000 for PV array fault detection.

Automatic milking systems (AMSs) are among the earliest Precision Livestock Farming developments that have transformed dairy farming worldwide. This review aims to gather, evaluate, and summarize papers that focus on the use of modeling approaches in the context of AMS. We provided a review of 60 articles with a specific focus on cows’ health, production, and behavior/management. The most used modeling approach was Machine Learning (ML, present in 63% of the studies), followed by statistical analysis (14%), fuzzy algorithms (9%), deterministic mod-els (7%), and detection algorithms (7%). Most of the reviewed studies (82%) focused on the detection of cows' health, specifically mastitis, while only 11% were concerned with milk production. Accurate forecasting of dairy cow milk yield and knowledge on the deviation between expected and observed milk yields of individual cows would be beneficial in dairy cow management. Likewise, the study of cows’ behavior and the herd management in AMSs is under-explored (7%). Despite the increasing use of ML techniques in this field there is still a lack of a robust methodology for their application. In particular, we identified a significant gap in the systematic balancing of positive and negative classes for health prediction models.

Compared with conventional methods of fault diagnosis for power transformers, which have defects such as imperfect encoding and too absolute encoding boundaries, this paper systematically discusses various intelligent approaches applied in fault diagnosis and decision making for large oil-immersed power transformers based on dissolved gas analysis (DGA), including expert system (EPS), artificial neural network (ANN), fuzzy theory, rough sets theory (RST), grey system theory (GST), swarm intelligence (SI) algorithms, data mining technology, machine learning (ML), and other intelligent diagnosis tools, and summarizes existing problems and solutions. From this survey, it is found that a single intelligent approach for fault diagnosis can only reflect operation status of the transformer in one particular aspect, causing various degrees of shortcomings that cannot be resolved effectively. Combined with the current research status in this field, the problems that must be addressed in DGA-based transformer fault diagnosis are identified, and the prospects for future development trends and research directions are outlined. This contribution presents a detailed and systematic survey on various intelligent approaches to faults diagnosing and decisions making of the power transformer, in which their merits and demerits are thoroughly investigated, as well as their improvement schemes and future development trends are proposed. Moreover, this paper concludes that a variety of intelligent algorithms should be combined for mutual complementation to form a hybrid fault diagnosis network, such that avoiding these algorithms falling into a local optimum. Moreover, it is necessary to improve the detection instruments so as to acquire reasonable characteristic gas data samples. The research summary, empirical generalization and analysis of predicament in this paper provide some thoughts and suggestions for the research of complex power grid in the new environment, as well as references and guidance for researchers to choose optimal approach to achieve DGA-based fault diagnosis and decision of the large oil-immersed power transformers in preventive electrical tests.

The rapid advancement of technology has revolutionized language learning, introducing innovative methods that depart from traditional instructional approaches. This study employs a mixed-methods research design to examine the impact of chatbot-based language learning support, adaptive learning algorithms, and virtual reality language immersion on the language learning proficiency and self-regulated learning skills of English as a Foreign Language (EFL) learners. The research design includes quantitative analysis of language proficiency scores and qualitative exploration of learner experiences with the technological interventions. The theoretical implications of this study are rooted in constructivist and socio-cultural learning theories, which underpin the design and implementation of the technological interventions. The triangulation of qualitative and quantitative data revealed that the participants' positive perceptions of the effectiveness of chatbot-based language learning support were supported by the quantitative results, with the variable "chat-bot based support" demonstrating a substantial mean difference compared to other groups. This convergence of findings reinforces the positive influence of chatbot-based support on language learning outcomes and highlights the importance of integrating theoretical perspectives with empirical evidence to gain a comprehensive understanding of the impact of technological interventions on language learning outcomes for EFL learners. The study's findings provide insights into the potential of these technological interventions to optimize language learning outcomes for EFL learners and promote autonomous learning behaviors.

Cyber diplomacy is critical in dealing with evolving cybersecurity dangers and possibilities in the digital era. This article investigates the impact of Artificial Intelligence (AI), the Internet of Things (IoT), Blockchains, and Quantum Computing on cyber diplomacy. AI holds the potential for proactive threat identification and response, while IoT enables international information sharing. Blockchains enable secure data sharing and document verification, but they also pose new threats, such as AI-driven cyber-attacks, IoT privacy breaches, blockchain vulnerabilities, and the potential for quantum computing to break encryption. This article conducts case study reviews, in combination with secondary data analysis, and emphasises the value of international cooperation in developing global norms and frameworks to control responsible technology adoption. Cyber diplomacy can promote cybersecurity, protect national interests, and foster mutual trust among nations in the digital sphere by capitalising on possibilities and reducing threats.

For many years, energy monitoring at the most disaggregate level has been mainly sought through the idea of Non-Intrusive Load Monitoring (NILM). Nevertheless, a practical application of this concept in the residential sector should address the underlying concerns raised by the technical specifications of case studies. From one side, such an operation must handle common matters related to the essence of any NILM system. Although this aspect has been thoroughly investigated by basic research, it is limited to the properties of public datasets. On the other side, it must deal with specific concerns corresponding to uncommon situations. These circumstances impose further restrictions on existent NILM schemes, however, they have been overlooked due to the lack of pertinent databases to scrutinize. Accordingly, this paper presents applied research on a potential solution to NILM for Quebec residences. It carries out a relevant investigation into the multi-faceted nature of this problem in order to reveal barriers to feasible implementations in the context of Quebec. This work commences with a concise discussion about the NILM idea to highlight its essential requirements for a fruitful practice. Afterward, it provides a comparative statistical analysis to represent the specificity and potential challenges of the case study in accordance with NILM necessities. For this purpose, the examination exploits data from real-world measurement systems in the same and European regions. Subsequently, this study focuses on a load identification exercise by proposing a combinatory approach that utilizes the promise of sub-meter smart technologies to integrate the intrusive aspect of load monitoring with the non-intrusive one. The former is aimed at extracting overall heating demand from the aggregate one by a supervised procedure based on Deep Learning (DL) models while the latter is designed for disaggregating the residual load through an unsupervised process on the basis of clustering techniques. The results demonstrate that geographically-dependent cases create electricity consumption scenarios under which existing NILM methods can be questioned. From a realistic standpoint, this research elaborates on critical remarks to realize viable NILM systems, particularly, in Quebec houses.

Advanced machine learning algorithms, have the potential to be successfully applied to many areas of system modelling. In the present study the capability of ten machine learning algorithms in predicting the structural damage of an 8-storey reinforced concrete frame building subjected to single and successive ground motions is examined. From this point of view, the initial damage state of the structural system, as well as 16 well known ground motion intensity measures are adopted as the features of the machine-learning algorithms that aim to predict the structural damage after each seismic event. The structural analyses are performed considering both real and artificial mainshock–aftershock sequences, while the structural damage is expressed in terms of two overall damage indices. The comparative study results in the most efficient damage index, as well as the most promising machine learning algorithm in predicting the structural response of a reinforced concrete building under single or multiple seismic events. Finally, the configured methodology deployed in a user-friendly web-application.

Genomic selection (GS) can accelerate variety improvement when training set (TS) size, and its relationship with the breeding set (BS) are optimized for prediction accuracies (PA) of genomic prediction (GP) models. Sixteen GP algorithms were run on phenotypic best linear unbiased predictors (BLUPs) and estimators (BLUEs) of resistance to both fall armyworm (FAW) and maize weevil (MW) in a tropical maize panel. For MW resistance, 37% of the panel was the TS, and BS was the remainder whilst for FAW, random-based training sets (RBTS) and pedigree-based training sets (PBTS) were designed. PAs achieved with BLUPs varied from 0.66 to 0.82 for MW resistance traits, and, for FAW resistance, 0.694 to 0.714 for RBTS of 37%, and 0.843 to 0.844 for RBTS of 85%, and, these were at least two-fold those from BLUEs. For PBTS, FAW resistance PAs were generally higher than those for RBTS, except for one dataset. GP models generally showed similar PAs across individual traits whilst the TS designation was determinant since a positive correlation (R=0.92***) between TS size and PAs was observed for RBTS and, for the PBTS, it was negative (R=0.44**). This study pioneers the use of GS for maize resistance to insect pests in sub-Saharan Africa.

“You should know the words by the company they keep!” has been one of the most famous slogans attributed to John Rubert Firth, 1957. This has ignited a whole school in linguistic research known as the British empiricist contextualism. Sixty years later, many un- or semi-supervised machine learning algorithms have been successfully designed and implemented aiming at extracting word meaning from within the context of a text corpus. These algorithms treat words, more or less, as vectors of real numbers representing frequencies of word occurrences within context and word meaning as positions of words in a high-dimensional vector space model. Word associations, in turn, are treated as calculated distances among them. With the rise of Deep Learning (DL) and other artificial neural networks based architectures, learning the positioning of words and extracting word associations as measured by their distances has further improved. In this paper, however, we revisited the main stream of algorithmic approaches and set the stage for a partly cross-disciplinary evaluation framework to judge about the nature of the extracted word associations by state-of-the-art machine learning algorithms. Our preliminary results are based on word associations extracted from the application of DL framework on a Google News text corpus, as well as on comparisons with human created word association lists such as word collocation dictionaries and psycholinguistic experiments. The results and conclusions provide some insights into the inherited limitations in interpreting the type of word associations and underpinning relations between words with inevitable consequences in other areas, such as extraction of knowledge graphs or image understanding.

Today, Colebrook’s equation is mostly accepted as an informal standard for modeling of turbulent flow in hydraulically smooth and rough pipes including transient zone in between. The empirical Colebrook’s equation relates the unknown flow friction factor (λ) with the known Reynolds number (R) and the known relative roughness of inner pipe surface (ε/D). It is implicit in unknown friction factor (λ). Implicit Colebrook’s equation cannot be rearranged to derive friction factor (λ) directly and therefore it can be solved only iteratively [λ=f(λ, R, ε/D)] or using its explicit approximations [λ≈f(R, ε/D)]. Of course, approximations carry in certain error compared with the iterative solution where the highest level of accuracy can be reached after enough number of iterations. The explicit approximations give a relatively good prediction of the friction factor (λ) and can reproduce accurately Colebrook’s equation and its Moody’s plot. Usually, more complex models of approximations are more accurate and vice versa. In this paper, numerical values of parameters in various existing approximations are changed (optimized) using genetic algorithms to reduce maximal relative error. After this improvement computational burden stays unchanged while accuracy of approximations increases in some of the cases very significantly.

Inferring algorithmic structure in data is essential for discovering causal generative models. In this research, we present a quantum computing framework using the circuit model, for estimating algorithmic information metrics. The canonical computation model of the Turing machine is restricted in time and space resources, to make the target metrics computable under realistic assumptions. The universal prior distribution for the automata is obtained as a quantum superposition, which is further conditioned to estimate the metrics. Specific cases are explored where the quantum implementation offers polynomial advantage, in contrast to an indispensable exhaustive enumeration in the corresponding classical case. The unstructured output data and the computational irreducibility of Turing machines make this algorithm impossible to approximate using heuristics. Thus, exploring the space of program-output relations is one of the most promising problems for demonstrating quantum supremacy using Grover search that cannot be dequantized. Experimental use cases for quantum acceleration are developed for self-replicating programs and algorithmic complexity of short strings. With quantum computing hardware rapidly attaining technological maturity, we discuss how this framework will have significant advantage for various genomics applications in meta-biology, phylogenetic tree analysis, protein-protein interaction mapping and synthetic biology. This is the first time experimental algorithmic information theory is implemented using quantum computation. Our implementation on the Qiskit quantum programming platform is copy-left and can be found on https://github.com/Advanced-Research-Centre/QPULBA

Cooling fans are one of the critical components of air-forced (AF) dry-type transformers for regulating internal temperatures. Therefore, effective malfunction detection is crucial to maintain the transformer temperature within an acceptable range and prevent overheating. Regular maintenance occurs periodically and issues with cooling fans may arise between maintenance periods, leading to prolonged operation under malfunctioning conditions and potential failures. In addition, utilities typically have online information about whether a fan works or not without providing information about cooling fan malfunctioning circumstances. To address these challenges, this study proposes learning-based online monitoring techniques to detect malfunctions in AF transformer cooling fans. Random forests (RFs) and convolutional neural networks (CNNs) are developed to classify the audio signals from cooling fans into normal and malfunctioning classes. Unlike RFs, which require separate feature extraction, CNNs are trained based on spectrogram images derived from audio signals. Thus, various time-frequency techniques are utilized for feature extraction in RFs. Besides, multiple data augmentation techniques are employed to enhance the dataset size and diversity. Algorithmic performance is optimized through hyperparameter tuning and classifier threshold adjustment. Simulations reveal that CNNs outperform RFs, whereas the latter provides superior interpretability of acoustic features compared to the former.

In photolithography process, nanometer level precise, wavefront aberration models enable the machine to be able to meet the overlay (OVL) drift and critical dimension (CD) specifications. Software control algorithms take as input these models and correct any expected wavefront imperfections before reaching the wafer. In such way a near optimal image is exposed on the wafer surface. Optimizing the parameters of these models though, involves several time costly sensor measurements which reduce the throughput performance, in terms of exposed wafers per hour, of the machine. In that case, photolithography machines come across the trade-off between throughput and quality. Therefore one of the most common Optimal Experimental Design (OED) problems in photolithography machines (and not only) is how to choose the minimum amount of sensor measurements that will provide the maximum amount of information. Additionally, each sensor measurement corresponds to a point on the wafer surface and therefore we must measure uniformly around the wafer surface as well. In order to solve this problem, we propose a Sensor Marks Selection Algorithm which exploits Genetic Algorithms. The proposed solution first selects a pool of points that qualify as candidates to be selected in order to meet the uniformity constraint. Then, the point that provides the maximum amount of information, quantified by the Fisher based criteria of G, D and A-Optimality, is selected and added to the measurement scheme. This process though is considered "greedy", and for this reason Genetic Algorithms (GA) are exploited to further improve the solution. By repeating in parallel the "greedy" part several times we get an initial population that will be the input to our GA. This meta-heuristic approach outperforms the "greedy" approach significantly. The proposed solution is applied in a real life semiconductors industry use case and achieves interesting industry and academical results as well.

Advancements in Parametric Design, Generative Design, and automation in Building Information Modelling (BIM) have opened new opportunities for architects and engineers working on complex buildings, such as offices. These developments allow designers to enhance their designs, increase project efficiency, improve performance, and reduce project time and costs. To address conflicting objectives that arise during the design process, genetic algorithms with multi-objective optimization (MOO) have been employed in architectural design. The GENIUS project aims to optimize building shape, apertures, and shading systems in the concept and design stages, with a focus on energy and daylight performance. The project integrates BIM and visual programming tools with Artificial Intelligence techniques like Genetic Algorithms and RBFOpt model-based optimization. Optimization algorithms are used to identify the best solutions that meet all design objectives, helping architects optimize their designs and achieve desired outcomes. The workflow was tested on a case study of a large office building, with MOO focused on maximizing daylight performance using Spatial Daylight Autonomy metric and minimizing energy consumption using Energy Use Intensity metric. The project provides architects with a method to improve their designs using Algorithm Aided Design tools, which help identify the best solutions for complex design problems.

Solar radiation prediction is an important process in ensuring optimal exploitation of solar energy power. Numerous models have been applied to this problem, such as numerical weather prediction models and artificial intelligence models. However, well-designed hybridization approaches that combine numerical models with artificial intelligence models to yield a more powerful model can provide a significant improvement in prediction accuracy. In this paper, we propose novel hybrid machine learning approaches that exploit auxiliary numerical data. The proposed hybrid methods invoke different machine learning paradigms, including feature selection, classification, and regression. Additionally, numerical weather prediction (NWP) models are used in the proposed hybrid models. Feature selection is used for feature space dimension reduction to reduce the large number of recorded parameters that affect estimation and prediction processes. The rough set theory is applied for attribute reduction and the dependency degree is used as a fitness function. We investigate the effect of the attribute reduction process with thirty different classification and prediction models in addition to the proposed hybrid model. Then, different machine learning models are constructed based on classification and regression techniques to predict solar radiation. Moreover, other hybrid prediction models are formulated to use the output of the numerical model of Weather Research and Forecasting (WRF) as learning elements in order to improve the prediction accuracy. The proposed methodologies are evaluated using a data set that is collected from different regions in Saudi Arabia.

We introduce linear probing hashing schemes that construct a hash table of size $n$, with constant load factor $\alpha$, on which the worst-case unsuccessful search time is asymptotically almost surely $O(\log \log n)$. The schemes employ two linear probe sequences to find empty cells for the keys. Matching lower bounds on the maximum cluster size produced by any algorithm that uses two linear probe sequences are obtained as well.

Recently, the Integrated Air Defense System (IADS) has become vital for the defense system as the military defense system is vital for national security. Placing Integrated Air Defense System batteries among locations to protect locations assets is a crucial problem because optimal solutions are needed for interceptor missiles to intercept attacker missiles for maximizing protection of assets across locations or places. In this research, the procedures of using network algorithms along with developing several network algorithms are going to be demonstrated to develop a model for sequential development of seven network securing strategies of placing Surface to Air Missile (SAM) batteries to maximize the protection of assets across locations (based on given asset values) by generating optimal solutions through computation to destroy maximum attacker missiles by using minimum interceptor missiles with given intercept probability. This network securing strategies can be implemented not only for Integrated Air Defense System (IADS) planning but also Counter Air (CA) planning as Integrated Air Defense System (IADS) is conducted with defensive counter air supported by attack operations in offensive counter air.

Clustering is a data mining task used for the data extraction from the data bases or files. Clustering is used to find unknown groups present in the data sources like files or data bases. This paper focuses on clustering algorithms performance dependency on the parallel clustering platforms and the clustering algorithms along with their clustering criteria. The problems with the present Traditional clustering algorithms were throughput and data source size changes (scalability). So they can’t address the big data. So for handling the huge volumes of data, parallel clustering algorithms along with clustering criteria were used. For processing the big Data Parallel clustering algorithms are of two types based on computing platforms used. They were the horizontal scaling platforms and vertical scaling platforms.

The safe and reliable operation of autonomous vehicles in complex and dynamic environments is heavily dependent upon exteroceptive and proprioceptive sensors. A LiDAR system generates accurate 3D point clouds, which are crucial for the detection, classification, and tracking of multiple targets. LiDAR data, however, presents significant challenges due to its density, noise, and varying sampling rates. In this study, various clustering and MTT techniques for LiDAR point clouds will be identified and classified within the context of autonomous driving to assess the state-of-the-art methods’ key challenges and their performances. We have categorized clustering and MTT methods used in AV applications, identified research gaps and challenges and analyzed existing algorithms and their challenges in detail. Researchers and practitioners in the field of autonomous driving will find this review to be a valuable resource.

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

The core motivation for this study emanates from Voronin S.'s seminal work on the universality of the zeta function. This universality positions the zeta function as a pivotal element in the conceptual framework of global artificial intelligence, suggesting its potential as a foundational component. A critical barrier to harnessing this promising universality has been the absence of efficient algorithms capable of actualizing this concept.

In the face of the burgeoning electricity demands and the imperative for sustainable development amidst rapid industrialization, this study introduces a dynamic and adaptable framework suitable for policy-makers and renewable energy experts working on integrating and optimizing renewable energy solutions. While using a case study representative model for Sub-Saharan Africa (SSA) to demonstrate the challenges and opportunities present in introducing optimization methods to bridge power supply deficits and the scalability of the model to other regions, this study presents an agile multi-criteria decision tool that pivots on four key development phases, advancing upon established methodologies and pioneering refined computational techniques, to select optimal configurations from a set of Policy Decision Making Metrics (PDM-DPS). Central to this investigation lies a rigorous comparative analysis of variants of three advanced algorithmic approaches: Swarm-Based Multi-objective Particle Swarm Optimization (MOPSO), Decomposition-Based Multi-objective Evolutionary Algorithm (MOEA/D), and Evolutionary-Based Strength Pareto Evolutionary Algorithm (SPEA2). These are applied to a grid-connected hybrid system, evaluated through a comprehensive 8760-hour simulation over a 20-year planning horizon. The evaluation is further enhanced by a set of refined Algorithm Performance Evaluation Metrics (AL-PEM) tailored to the specific constraints. The findings not only underscore the robustness and consistency of the SPEA2 variant over 15 runs of 200 generations each, which ranks first on the AL-PEM scale but also validate the strategic merit of combining multiple technologies and empowering policymakers with a versatile toolkit for informed decision-making.

The hybridization of conventional thermal power plants by incorporation of renewable energy systems has witnessed widespread adoption in recent years. This trend aims not only to mitigate carbon emissions but also to enhance the overall efficiency and performance of these power generation facilities. However, calculating the performance of such intricate systems using fundamental thermodynamic equations proves to be both laborious and time-intensive. Nevertheless, possessing accurate and real-time insights into their performance is of utmost significance to ensure optimal plant operation, facilitate decision-making, and streamline power production planning. In this paper, we delve into the application of machine learning techniques, particularly hybrid methodologies, to predict the performance of power plants. Specifically, we employ three approaches: the Adaptive Neuro-Fuzzy Inference System (ANFIS), the ANFIS optimized via Particle Swarm Optimization (ANFIS-PSO), and the ANFIS optimized through Genetic Algorithm (ANFIS-GA). These techniques are alternatively applied to a complex hybrid thermal power plant, namely an Integrated Solar Combined Cycle Power Plant (ISCCPP). This ISCCPP comprises a steam turbine section, a gas turbine section, and a concentrated solar power system utilizing troughs as collectors. The energy transfer fluid, in conjunction with exhaust from the gas turbine section, heats water within a vessel or steam generator, producing steam to propel the steam turbine's rotor. Electricity generation is facilitated by both gas and steam turbines, which are coupled to a generator. The findings of this study underscore the accuracy and appropriateness of ANFIS-based models in evaluating and predicting the performance of intricate hybrid power plants. The ANFIS model exhibited an impressive overall coefficient of correlation of 0.9991. Notably, the integration of evolutionary algorithms (PSO and GA) into the ANFIS framework elevated model performance, yielding correlation coefficients of 0.9994 for ANFIS-PSO and 0.9997 for ANFIS-GA. It is noteworthy that ANFIS-GA demonstrated superior predictive capability. The modeling framework developed in this research offers valuable support to designers, energy managers, and decision-makers. It provides a robust and dependable tool to assess the performance of hybrid thermal power plants, which are poised for a global surge in numbers amid the ongoing energy transition.

A single Information security is of pivotal concern for consistently streaming information over the widespread internetwork. The bottleneck flow of incoming and outgoing data traffic introduces the issue of malicious activities taken place by intruders, hackers and attackers in the form of authenticity desecration, gridlocking data traffic, vandalizing data and crashing the established network. The issue of emerging suspicious activities is managed by the domain of Intrusion Detection Systems (IDS). The IDS consistently monitors the network for identifica-tion of suspicious activities and generates alarm and indication in presence of malicious threats and worms. The performance of IDS is improved by using different signature based machine learning algorithms. In this paper, the performance of IDS model is determined using hybridization of nestrov-accelerated adaptive moment estimation –stochastic gradient descent (HNADAM-SDG) algorithm. The performance of the algorithm is compared with other classi-fication algorithms as logistic regression, ridge classifier and ensemble algorithm by adapting feature selection and optimization techniques