The prevalence of algorithms and computational tools in the modern-day has intersected with nearly every field. Generative design, specifically those using genetic algorithms, is an increasingly effective, yet cost efficient way to generate architectural designs in modern engineering. Thus, we adopt a genetic algorithm model in pursuit of maximizing the durability of a structure when it is stressed while minimizing the material cost. After the model is formulated, the algorithm is able to approximate with high accuracy the load a small-scale structure is able to bear, as well as iterate upon its designs to maximize a fitness function.

Most popular machine learning algorithms like k-nearest neighbour, k-means, SVM uses a metric to identify the distance(or similarity) between data instances. It is clear that performances of these algorithm heavily depends on the metric being used. In absence of prior knowledge about data we can only use general purpose metrics like Euclidean distance, Cosine similarity or Manhattan distance etc, but these metric often fail to capture the correct behaviour of data which directly affects the performance of the learning algorithm. Solution to this problem is to tune the metric according to the data and the problem, manually deriving the metric for high dimensional data which is often difficult to even visualize is not only tedious but is extremely difficult. Which leads to put effort on \textit{metric learning} which satisfies the data geometry.Goal of metric learning algorithm is to learn a metric which assigns small distance to similar points and relatively large distance to dissimilar points.

We present a new model formulation for a class of capacitated lot-sizing problem considering setup costs, product returns, and remanufacturing (CLSP-RM). We investigate a broad class of instances that fall into two groups, in the first group we can reformulate the problem with a relaxation and test whether the original problem is solvable. The relaxation gives near optimal solutions and the solution of this class does not give any difficulty to known solvers such as Cplex, Gurobi or Xpress. The second group of instances are of category NP and will be solved with a simple period-by-period simulation.

Reconfiguration is concerned with relationships among solutions to a problem instance, where the reconfiguration of one solution to another is a sequence of steps such that each step produces an intermediate feasible solution. The solution space can be represented as a reconfiguration graph, where two vertices representing solutions are adjacent if one can be formed from the other in a single step. Work in the area encompasses both structural questions (Is the reconfiguration graph connected?) and algorithmic ones (How can one find the shortest sequence of steps between two solutions?) This survey discusses techniques, results, and future directions in the area.

Algorithms for machine learning have found extensive use in numerous fields and applications. One important aspect of effectively utilizing these algorithms is tuning the hyperparameters to match the specific task at hand. The selection and configuration of hyperparameters directly impact the performance of machine learning models. Achieving optimal hyperparameter settings often requires a deep understanding of the underlying models and the appropriate optimization techniques. While there are many automatic optimization techniques available, each with its own advantages and disadvantages, this article focuses on hyperparameter optimization for well-known machine learning models. It explores cutting-edge optimization methods and provides guidance on applying them to different machine learning algorithms. The article also presents real-world applications of hyperparameter optimization by conducting tests on spatial data collections for landslide susceptibility mapping. Based on the experiment's results, both Bayesian optimization and metaheuristic algorithms showed promising performance compared to baseline algorithms. For example, the metaheuristic algorithm improved the overall accuracy of the random forest model. Additionally, Bayesian algorithms, such as Gaussian processes, performed well for models like KNN and SVM. The paper thoroughly discusses the reasons behind the efficiency of these algorithms. By successfully identifying appropriate hyperparameter configurations, this research paper aims to assist researchers, spatial data analysts, and industrial users in developing machine learning models more effectively. The findings and insights provided in this paper can contribute to enhancing the performance and applicability of machine learning algorithms in various domains.

This study aims to determine the influence of selected social and health factors on the quality of inpatient treatments when regional health organizations use stacking ensemble model. The proposed procedure is based on the logistic regression method, which is used for direct prediction in the case of good fitting data and impossibility of including aggregation of classification algorithms but also in the opposite case, for fine calibration to obtain prediction. In opposite case, the procedure uses classification algorithms and several filter methods which initially rank individual factors according to their importance to reduce the dimensionality of problem and, in such way. obtaining one optimized classification prediction. The proposed procedure is trained using one part and tested using another part of dataset from case study which enables the generalization of the solution to the set goal and is verified by the Kaggle dataset Brest cancer. Case study was conducted using the real data acquired in the region connected to the city of Nis, Republic of Serbia. The obtained results show that the proposed model achieves better results that each of methods included in this stacking ensemble-regression and classification used individually.

In the landscape of network management, software-defined networking (SDN) technology emerges as a dynamic approach, facilitating efficient network configuration for improved performance and monitoring, akin to the agility of cloud computing rather than traditional methods. However, its centralized structure exposes SDN to various attack vectors. Distributed Denial of Service (DDoS) attacks, particularly, pose a significant threat to SDN. This study employs machine learning algorithms and Network Traffic Classification Analysis (NCA) to classify SDN traffic as potential attacks. Notably, Decision Trees (DT) out shine other algorithms with a flawless 100% classification success, spotlighting their supremacy. Through this research, a robust path toward fortified SDN security takes form, where technological prowess and strategic intelligence unite for enhanced defense.

The exploration of heath data by clustering algorithms allows to better describe the populations of interest by seeking the sub-profiles that compose it. This therefore reinforces medical knowledge, whether it is about a disease or a targeted population in real life. Nevertheless, contrary to the so-called conventional biostatistical methods where numerous guidelines exist, the standardization of data science approaches in clinical research remains a little discussed subject. This results in a significant diversity in the execution of data science projects, whether in terms of algorithms used, reliability and credibility of the designed approach. Taking the path of parsimonious and judicious choice of both algorithms and implementations at each stage, this paper proposes Qluster, a practical workflow for performing clustering tasks. Indeed, this workflow makes a compromise between (1) genericity, as it is suitable regardless of the data volume (small/big) and regardless of the nature of the variables (continuous/qualitative/mixed), (2) ease of implementation, as it is based on few easy-to-use software packages, and (3) robustness, through the stability evaluation of the final clusters and through recognized algorithms and implementations. This workflow can be easily automated and/or routinely applied on a wide range of clustering projects. A synthesis of the literature on data clustering as well as the scientific rationale supporting the proposed workflow is also provided. Finally, a detailed application of the workflow on a concrete use case is provided, along with a practical discussion for data scientists. An implementation on the Dataiku platform is available upon request to the authors.

"Public legal information from all countries and international institutions is part of the common heritage of humanity. Maximizing access to this information promotes justice and the rule of law". In accordance with the aforementioned declaration on Free Access to Law by Legal information institutes of the world, a plethora of legal information is available through the Internet, while the provision of legal information has never before been easier. Given that law is accessed by a much wider group of people, the majority of whom are not legally trained or qualified, diversification techniques, should be employed in the context of legal information retrieval, as to increase user satisfaction. We address diversification of results in legal search by adopting several state of the art methods from the web search, network analysis and text summarization domains. We provide an exhaustive evaluation of the methods, using a standard data set from the Common Law domain that we subjectively annotated with relevance judgments for this purpose. Our results i) reveal that users receive broader insights across the results they get from a legal information retrieval system, ii) demonstrate that web search diversification techniques outperform other approaches (e.g., summarization-based, graph-based methods) in the context of legal diversification and iii) offer balance boundaries between reinforcing relevant documents or sampling the information space around the legal query.

We assume that the current mathematical knowledge K is a finite set of statements in the public domain which is time-dependent. This set exists only theoretically. Ignoring K and its subsets, sets exist formally in ZFC theory although their properties can be time-dependent (when they depend on K) or informal. In every branch of mathematics, the set of all knowable truths is the set of all theorems. This set exists independently of K. Algorithms always terminate. We explain the distinction between algorithms whose existence is provable in ZFC and constructively defined algorithms which are currently known. By using this distinction, we obtain non-trivial statements on decidable sets X⊆N that belong to constructive and informal mathematics and refer to the current mathematical knowledge on X. This and the next sentence justify the article title. For any empirical science, we can identify the current knowledge with that science because truths from the empirical sciences are not necessary truths but working models of truth from a particular context. For a set X⊆N whose infiniteness is false or unproven, we define which elements of X are classified as known. No known set X⊆N satisfies Conditions (1)-(4) and is widely known in number theory or naturally defined, where this term has only informal meaning. (1) A known algorithm with no input returns an integer n satisfying card(X)<ω ⇒ X⊆(-∞,n]. (2) A known algorithm for every k∈N decides whether or not k∈X. (3) No known algorithm with no input returns the logical value of the statement card(X)=ω. (4) There are many elements of X and it is conjectured, though so far unproven, that X is infinite. (5) X is naturally defined. The infiniteness of X is false or unproven. X has the simplest definition among known sets Y⊆N with the same set of known elements. We prove that the set X={n∈N: the interval [-1,n] contains more than 29.5+(11!/(3n+1))∙sin(n) primes of the form k!+1} satisfies Conditions (1)-(5) except the requirement that X is naturally defined. 501893∈X. Condition (1) holds with n=501893. card(X∩[0,501893])=159827. X∩[501894,∞)={n∈N: the interval [-1,n] contains at least 30 primes of the form k!+1}. If we add to X some set W satisfying 14≤card(W)≤23, then the following statements hold: X does not satisfy Condition (1), 159827+14≤card(X), the above lower bound is currently the best known, card(X)<ω ⇒ card(X)≤159827+23, the above upper bound is currently the best known, X satisfies Conditions (2)-(5) except the requirement that X is naturally defined. We present a table that shows satisfiable conjunctions of the form #(Condition 1)∧(Condition 2)∧#(Condition 3)∧(Condition 4)∧#(Condition 5), where # denotes the negation ¬ or the absence of any symbol. No set X⊆N will satisfy Conditions (1)-(4) forever, if for every algorithm with no input, at some future day, a computer will be able to execute this algorithm in 1 second or less.

Recent SDN advances address traditional network management challenges through centralized control and plane separation. SDN prevents breaches using a centralized controller but introduces risks. The controller can be a single point of failure. Thus, an OpenFlow Controller's flow-based anomaly detection enhances SDN security. Our research explored two OpenFlow intrusion detection methods. The first employed machine learning, NSL-KDD dataset, and feature selection, yielding 82% accuracy with random forest. The second combined deep neural networks with GRU-LSTM, achieving 88% accuracy using ANOVA F-Test and feature elimination. Experiments highlighted deep learning as superior for OpenFlow intrusion detection.

In this paper, a new relay system that uses the UAV as a relay station between the tethered UAV and ground user (TU2U2G) is proposed. The TU2U2G system replaces the base station (BS) in the cellular system with a tethered UAV (TUAV). The TUAV is a UAV that receives power over a cable from a ground control station. It has advantages of high and variable altitude up to (100m) compared to BS. In addition, it overcomes the UAV drawback of the batteries' limited capacity. After that, a 3D placement Algorithm of the UAV as a relay station in the TU2U2G system is proposed. It is presented to maximize the coverage by jointly optimizing the transmitting power and relaying distance. The TU2U2G system shows better results than the traditional cellular system in terms of optimum UAV height, maximum coverage radius, and maximum distance between BS and UAV.

The purpose of this study is to present a systematic review of the literature on public blockchain consensus algorithms. Blockchain consensus algorithms have gain much popularity in last few years especially in the cryptocurrency field. Based on a systematic review of the relevant literature, we provide a classification of blockchain consensus algorithms, philosophy behind creation of blockchain consensus algorithms and as well as the rewards and incentive strategies of various public blockchain consensus algorithms. On the basis of these results, the research gaps and future work directions are identified for further study.

Quantum computers are machines that are designed to use quantum mechanics in order to improve upon classical computers by running quantum algorithms. One of the main applications of quantum computing is solving optimization problems. For addressing optimization problems, we can use linear programming. Linear programming is a method to obtain the best possible outcome in a special case of mathematical programming. Application areas of this problem consist of resource allocation, production scheduling, parameter estimation, etc. In our study, we look at quantum speedup ratios of HHL Algorithm for different scenarios of linear programming. In a first scenario we look quantum speedup ratio (S(N)) as a function of phase transition and the ratio (κ) between the greatest and smallest eigenvalues of the matrix in linear equation system. As a second scenario, we investigate the changes in S(N) as a function of κ and s, which is the coefficient for defining the matrix as s-sparse.

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

This paper presents an approach to damage identification in beams by modal curvatures based on the use of beamforming algorithms. These processors have been successfully used in acoustics for the last thirty years to solve the inverse problems encountered in source recognition and image reconstruction, based on ultrasonic waves. In addition, beamformers apply to a broader range of problems in which the forward solutions are computable and measurable, especially regarding the field of structural vibrations, where the use of such estimators has not received attention to date. In this paper, modal curvatures will play the role of the replica vectors of the imaging field. By means of numerical studies and experimental tests on a steel beam, we motivate the choice of modal curvatures as observed quantities. Furthermore, we compare the performance of the Bartlett and minimum variance distortionless beamformers (MVDR) with an estimator based on the simple minimization of the difference between model and measured data. The results suggest that the application of the MVDR beamformer is highly effective, especially in cases of slight damage between two sensors. MVDR enabled both damage localization, and quantification.

This review paper provides a comprehensive overview of machine vision pose measurement algorithms. The paper focuses on the state-of-the-art algorithms and their applications. The paper is structured as follows: The introduction in Section 1 provides a brief overview of the field of machine vision pose measurement. Section 2 describes the commonly used algorithms for machine vision pose measurement. Section 3 discusses the factors that affect the accuracy and reliability of machine vision pose measurement algorithms. Section 4 presents the applications of machine vision pose measurement in various fields. The paper provides specific examples of how machine vision pose measurement is used in each of these fields. Finally, Section 5 summarizes the paper and provides future research directions. The paper highlights the need for more robust and accurate algorithms that can handle varying lighting conditions and occlusion. It also suggests that the integration of machine learning techniques may improve the performance of machine vision pose measurement algorithms. Overall, this review paper provides a comprehensive overview of machine vision pose measurement algorithms, their applications, and the factors that affect their accuracy and reliability. It provides a valuable resource for researchers and practitioners working in the field of computer vision.

The paper continues the study of efficient algorithms for the computation of zeta functions over the complex plane. We aim to apply the modifications of algorithms to the investigation of underlying fractal structures associated with the Riemann zeta function. We discuss the computational complexity and numerical aspects of the implemented algorithms based on series with binomial-like coefficients.

Neural networks present the characteristics that the results are strongly dependent on the training data, the weight initialisation, and the hyper-parameters chosen. The determination of the distribution of a statistical estimator, as the Mean Squared Error (MSE) or the accuracy, is fundamental to evaluate the performance of a neural network model (NNM). For many machine learning models, as linear regression, it is possible to analytically obtain information as variance or confidence intervals on the results. Neural networks present the difficulty of being not analytically tractable due to their complexity. Therefore, it is impossible to easily estimate distributions of statistical estimators. When estimating the global performance of an NNM by estimating the MSE in a regression problem, for example, it is important to know the variance of the MSE. Bootstrap is one of the most important resampling techniques to estimate averages and variances, between other properties, of statistical estimators. In this tutorial, the application of two resampling (including bootstrap) techniques to the evaluation of neural networks’ performance is explained from both a theoretical and practical point of view. Pseudo-code of the algorithms is provided to facilitate their implementation. Computational aspects, as the training time, are discussed since resampling techniques always require to run simulations many thousands of times and, therefore, are computationally intensive. A specific version of the bootstrap algorithm is presented that allows the estimation of the distribution of a statistical estimator when dealing with an NNM in a computationally effective way. Finally, algorithms are compared on synthetically generated data to demonstrate their performance.

Development of rovers and development of infrastructure which enables them to probe other planets (such as Mars) have sparked a lot of interest recently specially with increasing public attention in Moon and Mars program by National Aeronautics and Space Administration. This is designed to be achieved by various means such as advanced spectroscopy and artificial intelligent techniques such as deep learning and transfer learning to enable the rover to not only map the surface of planet but to get a detailed information about its chemical makeup in layers beneath (deep learning) and in areas around point of observation (transfer learning). In this work, which is part of a proposal, later approach is explored. A systematic strategy is presented which make use of aforementioned techniques developed for metallic glass matrix composites as benchmark and helps develop algorithms for chemistry mapping of actual Martian surface on Perseverance Rover launching shortly.

Spike shape and morphometric characteristics are among the key characteristics of cultivated cereals associated with their productivity. Identification of the genes controlling these traits requires morphometric data at harvesting and analysis of numerous plants, which could be automatically done using technologies of digital image analysis. A method for wheat spike morphometry utilizing 2D image analysis is proposed. Digital images are acquired in two variants: a spike on a table (one projection) or fixed with a clip (four projections). The method identifies spike and awns in the image and estimates their quantitative characteristics (area in image, length, width, circularity, etc.). Section model, quadrilaterals, and radial model are proposed for describing spike shape. Parameters of these models are used to predict spike shape type (spelt, normal, or compact) by machine learning. The mean error in spike density prediction for the images in one projection is 4.61 (~18%) versus 3.33 (~13%) for the parameters obtained using four projections.

The web ecosystem is rapidly evolving with changing business and functional models. Cloud platforms are available in a SaaS, PaaS and IaaS model designed around commoditized Linux based servers. 10 billion users will be online and accessing the web and its various content. The industry has seen a convergence around IP based technology. Additionally, Linux based designs allow for a system wide profiling of application characteristics. The customer is an OEM who provides Linux based servers for telecom solutions. The end customer will develop business applications on the server. Customers are interested in a latency profiling mechanism which helps them to understand how the application behaves at run time. The latency profiler is supposed to find the code path which makes an application block on I/O, and other synchronization primitives. This will allow the customer to understand the performance bottleneck and tune the system and application parameters.

Sequential hypothesis test and change-point detection when the distribution parameters are unknown is a fundamental problem in statistics and machine learning. We show that for such problems, detection procedures based on sequential likelihood ratios with simple one-sample update estimates such as online mirror descent are nearly second-order optimal. This means that the upper bound for the algorithm performance meets the lower bound asymptotically up to a log-log factor in the false-alarm rate when it tends to zero. This is a blessing, since although the generalized likelihood ratio (GLR) statistics are optimal theoretically, but they cannot be computed recursively, and their exact computation usually requires infinite memory of historical data. We prove the nearly second-order optimality by making a connection between sequential analysis and online convex optimization and leveraging the logarithmic regret bound property of online mirror descent algorithm. Numerical and real data examples validate our theory.

The aim of this work is to explain the behaviour of the multiresistance percentage of Pseudomona aeruginosa in some countries of Europe through a multivariate statistical analysis and machine learning validation, using data from the European Antimicrobial Resistance Surveillance System, the World Health Organization and the World Bank. First, we will use a descriptive analysis and a principal components analysis. Then, we use a k-means clustering to determine the countries and regions that are most affected by the antibiotic resistance. Second, we expand the database by adding some socioeconomic, governance and antibiotic-consumption variables. We then run a data panel regression analysis to determine some functions that relates the multiresistance percentage with those new variables. Finally, we use machine learning techniques to validate a pooling panel data case, using XGBoost and random forest algorithms. The results of the data panel analysis indicate that the most important variables for the multiresistance percentage are corruption control and the rule of law. Similar results are found with the machine learning validation analysis, where the human development index is an additional important variable for the multiresistance percentage.

Financial bubble prediction has been a significant area of interest in empirical finance, garnering substantial attention in the literature. This study aimed to detect and forecast financial bubbles in the Vietnamese stock market from 2001 to 2021. The PSY procedure, which involves a right-tailed unit root test to identify the existence of financial bubbles, was employed to achieve this goal. Machine learning algorithms were then utilized to predict real-time financial bubble events. The results revealed the presence of financial bubbles in the Vietnamese stock market during 2006-2007 and 2017-2018. Additionally, the empirical evidence supported the superior performance of the Random Forest and Artificial Neural Network algorithms over traditional statistical methods in predicting financial bubbles in the Vietnamese stock market.

Cybersecurity plays a relevant role in the new digital age in aerospace industry. Predictive algorithms are necessary to interconnect complex systems within the cyberspace. In this context, where security protocols do not apply, challenges to maintain data privacy and security arise for the organizations. Thus, the need of cybersecurity is required. The four main categories to classify threats are interruption, fabrication, modification and interception. They all share a common thing, soften the three pillars which cybersecurity needs to guarantee. These pillars are confidentiality, availability and integrity of data (CIA). Data injection can contribute to this event by creation of false indicators which can lead to errors creation during the manufacturing engineering process. In this paper, the impact of data injection on existing dataset used on manufacturing process is shown. The design model synchronizes the following mechanisms developed within machine learning techniques which are, the risk matrix indicator to assess the probability of producing an error, the dendrogram to clusters the dataset in groups with similarities, the logistic regression to predict the potential outcomes and the confusion matrix to analyze the performance of the algorithm. The results presented in this study, which was carried out using a real dataset related to the electrical harnesses installed in a C295 military aircraft, estimate that injection of false data indicators increase the probability of errors creation in 24.22 % on the predicted outcomes required for the generation of the manufacturing process. Overall, implementing cybersecurity measures and advanced methodologies to detect and prevent cyberattacks are necessary.

RBF networks are used in a variety of real-world applications such as medical data or signal processing problems. The success of these parametric models lies in the successful adaptation of their parameters using efficient computational techniques. In the current work, a method of adjusting the parameters of these networks using Grammatical Evolution is presented. Grammatical Evolution will be used to successfully discover the most promising range of parameter values and then the training of the parameter set will be achieved using a Genetic Algorithm. The new method was applied to a wide range of data fitting and classification problems, and the results were more than promising.

This study focused on the predictive models incorporating machine learning techniques that induce new dynamics for forecasting energy generation, enabling effective planning, financing, and system monitoring. The research developed a machine learning-based power generation prediction model tailored explicitly for Kenya's Garissa solar power plant. The selected model demonstrated a root mean squared error of 5.23 during evaluation, resulting in a prediction accuracy of 90.42%. This high accuracy indicates that the model can be relied upon for precise generation prediction, facilitating effective planning, and system performance monitoring

The increased demand and use of autonomous vehicles and advanced driver-assistance systems has been constrained by an incidence of accidents involving errors with the perception layer’s functionality. In tandem, recent papers have noted the lack of standardized, independent testing formats and insufficient methods with which to analyze, verify and qualify LiDAR-based data and categorization. While camera-based approaches benefit from an ample amount of research, camera images can be unreliable in situations with impaired visibility such as dim lighting and fog. This paper aims to introduce a novel method based entirely on LiDAR data with the capability to detect anomalous patterns as well as complementing other performance evaluators using a Copula-based approach. With a promising set of preliminary results, this methodology may be used to evaluate an algorithm’s confidence score, the impact conditions may have on LiDAR data and detect cases in which LiDAR data may be insufficient or otherwise unusable.

Psychomotor developmental delay in infants includes failure to acquire abilities such as sitting, walking, grasping objects and communication at the ages when most infants have acquired these abilities. Known risk factors include a large number of aspects of family environment, socioeconomic position, problems in pregnancy and birth, and maternal health. It is clinically useful to be able to screen for developmental delay so that healthcare interventions can be considered. The present research used machine learning (random forest) to create an algorithm predicting psychomotor delay in 9-month-old infants using information ascertainable at birth and in early infancy. The dataset was the UK longitudinal Millennium Cohort study. Fifty-two predictors measuring socioeconomic indicators, paternal, family and social support for the mother, beliefs about good parenting, maternal health, pregnancy and birth were included in the initial algorithm. Feature reduction showed that of the 52 variables, birthweight, family income and parents’ ages had the highest feature importance scores and could alone correctly predict developmental delay with over 99% sensitivity and 100% specificity. The relationships between delay and some of the predictors, particularly income, were nonlinear and complex. The results suggest that the risk of psychomotor developmental delay can be identified in early infancy using machine learning, and that the best predictors are factors present prior to birth. Surprisingly, the most important factors included in the present study did not include illnesses during pregnancy such as eclampsia and infections.

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

Globally, zoonotic diseases have been on the rise in recent years. Predictive modelling approaches have been successfully used in the literature to identify the underlying causes of these zoonotic diseases. We examine the latest research in the field of predictive modeling that verifies the growth of zoonotic pathogens and assesses the factors associated with their spread. The results of our survey indicate that popular mathematical models can successfully be used in modeling the growth rate of these pathogens under varying storage temperatures. Additionally, some of them are used for the assessment of the inactivation of these pathogens based on various conditions. Based on the results of our study, machine learning models and deep learning are commonly used to detect pathogens within food items and to predict the factors associated with the presence of the pathogens.

Moore’s law will cease to be relevant once transistors are the size of electrons. Once this occurs, we will no longer be able to use silicon for technological advancement. However, breakthroughs will continue in the form of a sixth paradigm: a 3D molecular computing model such as quantum comput- ing. Some of the promising areas of quantum computing researched in this study are (i) algorithmic advancements - such as Shor’s, Grover’s, error correction, fault tolerance and other new algorithms; (ii) hardware - such as the quantum system architecture, circuit models, entanglement, superposition and no-cloning qubits; (iii) market segments - such as finance, healthcare, and chemistry; (iv) the supremacy established over classical computing; and (v) areas of applicability. Significant progress has been made in these areas in recent decades, and they have garnered immense interest, attention and the funding required to make good progress.

Quantum computers are invaluable tools to explore the properties of complex quantum systems. We show that dynamical localization of the quantum sawtooth map, a highly sensitive quantum coherent phenomenon, can be simulated on actual, small-scale quantum processors. Our results demonstrate that quantum computing of dynamical localization may become a convenient tool for evaluating advances in quantum hardware performances.

In this paper, we address the problem of stabilization of switched linear systems. The idea is to look for a state feedback control law using evolutionary algorithms (EA) in order to assure the stability of the switched linear systems under control constraints. In some cases when states are not available and only outputs are measurable, the previous method is applied to design an output feedback controller which stabilizes the system. Both stabilizing controllers are developed using deferential evolution and genetic algorithm. Two numerical examples illustrate our proposed theory and point out the effectiveness of our proposed approaches.

Security has become a critical issue in today’s highly distributed and networked systems. Network intrusion detection systems (NIDSs), especially signature-based NIDSs, are being widely deployed in a distributed network environment with the purpose of defending against a variety of network attacks. Most of the commercially available NIDSs are software based and rely on pattern matching to extract the threat from network traffic. The increase in network speed and traffic may make existing algorithms to become a performance bottleneck. Therefore it is very necessary to develop faster and more efficient pattern matching algorithm in order to overcome the troubles on performance of NIDSs. Therefore, we propose a multi fusion pattern matching algorithm for Network Intrusion Detection Systems. The results obtained in percentages from the proposed fusion algorithm given better values in terms processing time in milliseconds than the existing algorithms when data English text are applied to evaluate the fusion performances.

Regulation at the level of translation plays an essential role in modulating gene expression. Given the importance of knowledge about translationally active mRNAs as an indicator of translation efficiency, it is crucial for researchers to have at their disposal organised sources of functional information on translation - plant translatomic maps similar to transcription maps. The development of a general experimental and computational methodology for constructing translatome maps is essential to address this challenge. In this manuscript, we discuss what researchers can do to design plant translatome maps, namely, we review: (i) experimental methods to obtain translationally active mRNA fractions, considering their advantages and limitations; (ii) additional methodological approaches to obtain complete pools of translationally active mRNAs; (iii) sequencing methods to qualitatively and quantitatively assess different mRNA fractions; and (iv) multivariate analyses of sequencing results by bioinformatics methods, including metrics for assessing mRNA translational activity.

This paper introduces a novel algorithm for solving the point-to-point shortest path problem in a static regular 8-neighbor connectivity (G8) grid. This algorithm can be seen as a generalization of Hadlock algorithm to G8 grids, and is shown to be theoretically equivalent to the relaxed A* (RA*) algorithm in terms of the provided solution's path length, but with substantial time and memory savings, due to a completely different computation strategy, based on defining a set of lookup matrices. Through an experimental study on grid maps of various types and sizes (1290 runs on 43 maps), it is proven to be 2.25 times faster than RA* and 17 times faster than the original A*, in average. Moreover, it is more memory-efficient, since it does not need to store a G score matrix.

Wireless sensor networks (WSN) are mostly utilized in many applications. Indeed, WSN is composed of sensors to evaluate some physical phenomena. However, the information brought by the sensor still missed if we don't know the exact location of the event. Several localization algorithms have been proposed in order to locate the nodes in WSN. The localization algorithms are categorized into range-based and range-free techniques. The range-based techniques use either distance or time to calculate the coordinates of unknown nodes. Nevertheless, those kinds of techniques need some additional material in computation purpose. Therefore, range-based techniques present an expensive solution for positioning in WSN. Alternatively, range-free techniques may do the same task without involving additional material. But they don’t offer a high precision of localization in comparison with range-based techniques. DVHOP is the most popular range-free technique that uses the hop count method in the localization process. In this work, we propose an improvement of DVHOP localization algorithm to create three improved versions of this algorithm and we have achieved that by adopting two meta-heuristic (simulated annealing, particle swarm optimization) and FMINCON solver dedicated to the optimization in the field of WSN nodes localization. The experimental results obtained in this work show clearly the gain and the good impact of our proposition.

Information cascades (tree-like structures formed by posts, comments, likes, replies, etc.) constitute the spine of the public online information environment, reflecting its various trends, evolving with it and, importantly, affecting its development. While users participate in online discussions, they display their views and thus contribute to the growth of cascades. At the same time, users’ opinions are influenced by cascades’ elements. The current paper aims to advance our knowledge regarding this social phenomenon by developing an agent-based model in which agents participate in a discussion around a post on the Internet. Agents display their opinions by writing comments on the post and liking them (i.e., leaving positive assessments). The result of these processes is dual: on the one hand, agents develop an information cascade; on the other hand, they update their views. Our purpose is to understand how agents’ activity, openness to influence, and cognitive constraints (that condition the amount of information individuals are able to proceed with) affect opinion dynamics. We also control for social contagions (when people’ perception of a message may depend not only on the message’s opinion, but also on how other individuals perceive this object, with more positive evaluations increasing the probability of adoption) and ranking algorithms that steer the order in which agents learn new messages. Among other things, we demonstrated that replies to disagreeable opinions are extremely effective for promoting your own position. In contrast, likes have a tiny effect on this issue.

Artificial learning and machine learning is playing a pivotal role is the society especially in the field of medicinal chemistry and drug discovery. Particularly its algorithms, neural networks or other recurrent networks drive this area. In this review, we have taken into account the diverse use of AI in a number of pharmaceutical industries including discovery of drugs, repurposing, development of pharmaceutical drug and its clinical trials. In addition, the efficiency of these artificial or machine learning programs in achieving the target drugs in short time period, along with accurate dosage and cost effectively of the drug has also been discussed. Numerous applications of AI in property prediction such as ADMET have been used for prediction of strength of this technology in QSAR. In case of de-novo synthesis, it results in generation of novel drug molecules with unique design proving this a promising field fir drug design. Moreover, its involvement in synthetic planning, ease of synthesis and much more contribute to automated drug discovery in near future.

The paper describes a method of solving some stochastic processes using generating functions. A general theorem of generating functions of a particular type is derived. A generating function of this type is applied to a stochastic process yielding polynomial time algorithms for certain partitions. The method is generalized to a stochastic process describing a rather general linear transform. Finally, the main idea of the method is used in deriving a theoretical polynomial time algorithm to the knapsack problem.

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

Gas sensor arrays, also known as electronic noses, leverage a diverse set of materials to identify the components of complex gas mixtures. Metal-organic frameworks (MOFs) have emerged as promising materials for electronic noses due to their high-surface areas and chemical as well as structural tunability. Using our recently reported genetic algorithm design approach, we examined a set of 50 MOFs and searched through the over 1.125x1015 unique array combinations to identify optimal arrays for the detection of CO₂ in air. We found that despite individual MOFs having lower selectivity for O2 or N2 relative to CO₂, intelligently selecting the right combinations of MOFs enabled accurate prediction of the concentrations of all components in the mixture (i.e. CO₂, O₂, N₂). We also analyzed the physical properties of the elements in the arrays to develop an intuition for improving array design. Notably, we find that diversity among the surface areas in the MOFs leads to improved sensing. Consistent with the observation, we found that, as one might expect, the best arrays consistently had more structural diversity than the worst arrays.

Longitudinal dispersion coefficient (LDC) plays an essential role in modeling the transport of pollution and sediment in the natural rivers. As a result of transportation processes, the concentration of pollution changes along the river. Different studies have been conducted to provide simple equations for estimating LDC. In this study, Support Vector Regression (SVR), Gaussian Process Regression (GPR), M5P and Random Forest (RF) examined to predict the LDC in the natural streams. The hydraulic and geometric features of different rivers gathered for developing the mentioned models for LDC estimation and various statistical criteria were utilized to scrutinize of the models. Furthermore, the Taylor chart was used to evaluate the models and achieved results showed that among machine learning models, M5P displayed the superior performance with CC of 0.823, SI of 0.812, NS of 0.577 and WI of 0.879. As well, S-D model with CC of 0.795 SI of 0.827, NS of 0.558 and WI of 0.890 had more precise results than other empirical models. The results indicates that the developed M5P model with simple formulations was superior to other machine learning models and empirical models and therefore, it can be used as a proper tool for estimating LDC in natural rivers.

Spike shape and morphometric characteristics are among the key characteristics of cultivated cereals associated with their productivity. Identification of the genes controlling these traits requires morphometric data harvesting and analysis for numerous plants, which is automatable using technologies of digital image analysis. A method for wheat spike morphometry utilizing 2D image analysis is proposed. Digital images are acquired in two variants: a spike on a table (one projection) or fixed with a clip (four projections). The method identifies spike and awns in the image and estimates their quantitative characteristics (area in image, length, width, circularity, etc.). Models of sections, quadrilaterals, and radial model are proposed for describing spike shape. Parameters of these models are used to predict spike shape type (spelt, normal, or compact) by machine learning. The mean error in spike density prediction for the images in one projection is 4.61 (~18%) versus 3.33 (~13%) for the parameters obtained using four projections. F1 measure in automated spike classification into three types is 0.78 using logistic regression (one projection) and 0.85 using random forest method (four projections). The proposed method is implemented in Java; examples of images and user guide are available at http://wheatdb.org/werecognizer.

This paper examines an important problem in smart grid energy scheduling; peaks in power demand are proportionally more expensive to generate and provision for. The issue is exacerbated in local microgrids that do not benefit from the aggregate smoothing experienced by large grids. Demand-side scheduling can reduce these peaks by taking advantage of the fact that there is often flexibility in job start times. We focus attention on the case where the jobs are non-preemptible, meaning once started, they run to completion. The associated optimization problem is called the Peak Demand Minimization problem and has been previously shown to be NP-hard. Our results include an optimal fixed-parameter tractable algorithm, a polynomial-time approximation algorithm, as well as an effective heuristic that can also be used in an online setting of the problem. Simulation results show these methods can reduce peak demand by up to 50% versus on-demand scheduling for household power jobs.

In multi-objective optimization problems, the optimization target is to obtain a set of non-dominated solutions. Comparing solution sets is crucial in evaluating the performances of different optimization algorithms. The use of performance indicators is common in comparing those sets and, subsequently, optimization algorithms. A good solution set must be close to the Pareto-optimal front, well-distributed, maximally extended and fully filled. Therefore, an effective performance indicator must encompass these features as a whole and must be Pareto dominance compliant. Unfortunately, some of the known indicators often fail to properly reflect the quality of a solution set or cost a lot to compute. This paper demonstrates that the Degree of Approximation (DOA) quality indicator, is a weakly Pareto compliant unary indicator that gives a good estimation of the match between the approximated front and the Pareto-optimal front. Moreover, DOA computation is easy and fast.

Nearest-neighbour clustering is a simple yet powerful machine learning algorithm that finds natural application in the decoding of signals in classical optical-fibre communication systems. Quantum k-means clustering promises a speed-up over the classical k-means algorithm; however, it has been shown to currently not provide this speed-up for decoding optical-fibre signals due to the embedding of classical data, which introduces inaccuracies and slowdowns. Although still not achieving an exponential speed-up for NISQ implementations, this work proposes the generalised inverse stereographic projection as an improved embedding into the Bloch sphere for quantum distance estimation in k-nearest-neighbour clustering, which allows us to get closer to the classical performance. We also use the generalised inverse stereographic projection to develop an analogous classical clustering algorithm and benchmark its accuracy, runtime and convergence for decoding real-world experimental optical-fibre communication data. This proposed `quantum-inspired' algorithm provides an improvement in both the accuracy and convergence rate with respect to the k-means algorithm. Hence, this work presents two main contributions. Firstly, we propose the general inverse stereographic projection into the Bloch sphere as a better embedding for quantum machine learning algorithms; here, we use the problem of clustering quadrature amplitude modulated optical-fibre signals as an example. Secondly, as a purely classical contribution inspired by the first contribution, we propose and benchmark the use of the general inverse stereographic projection and spherical centroid for clustering optical-fibre signals, showing that optimizing the radius yields a consistent improvement in accuracy and convergence rate.

Particle Swarm Optimization (PSO) is a metaheuristic global optimization paradigm that has gained prominence in the last two decades due to its ease of application in unsupervised, complex multidimensional problems which cannot be solved using traditional deterministic algorithms. The canonical particle swarm optimizer is based on the flocking behavior and social co-operation of birds and fish schools and draws heavily from the evolutionary behavior of these organisms. This paper serves to provide a thorough survey of the PSO algorithm with special emphasis on the development, deployment and improvements of its most basic as well as some of the very recent state–of-the-art implementations. Concepts and directions on choosing the inertia weight, constriction factor, cognition and social weights and perspectives on convergence, parallelization, elitism, niching and discrete optimization as well as neighborhood topologies are outlined. Hybridization attempts with other evolutionary and swarm paradigms in selected applications are covered and an up-to-date review is put forward for the interested reader.

This paper examines the correlation between numbers of computer cores in parallel genetic algorithms. The objective to determine the linear polynomial complementary equation in order represent the relation between number of parallel processing and optimum solutions. Model this relation as optimization function (f(x)) which able to produce many simulation results. F(x) performance is outperform genetic algorithms. Compression results between genetic algorithm and optimization function is done. Also the optimization function give model to speed up genetic algorithm. Optimization function is a complementary transformation which maps a TSP given to linear without changing the roots of the polynomials.

Olive Anthracnose (OA) is the most important fungal disease of olive fruits worldwide. In the context of integrated pest management, the development of predictive models could be used for early diagnosis and control. In the current study, a dataset representing 58 cases (6 locations with 12 olive cultivars) was used to study the relationship between ΟΑ incidence (OAI) and 35 heterogeneous variables, including orchard characteristics, olive fruit parameters, foliar and soil nutrients, soil parameters and soil texture classes. The Random Forest-Recursive Feature Elimination with Cross Validation (RF-RFECV) feature selection method identified Location, Water Content, P, Ca, Mg, Exchangeable Mg, Trace Zn, Trace Cu as possible new indicators associated with OAI. Six different classification algorithms, namely Decision Tree (DT), Gradient Boosting (GB), Logistic Regression (LR), Random Forest (RF), K-Nearest Neighbors (KNN) and Support Vector Machine (SVM), were developed for predicting conditions leading to OAI >0% and 10%. Hyperparameter optimization using grid search was used to optimize the parameters of the models and finally the best parameters were applied to predict the OAI. The final models were evaluated in terms of several standard metrics, such as accuracy, sensitivity, specificity and ROC AUC score. Findings suggested that GB performance was superior compared to the other models for the prediction of the occurrence of OA disease (OAI>0%) with an accuracy of 86.7%, a sensitivity of 100%, a specificity of 75% and a ROC-AUC score of 93%, while for the prediction of the spread of the disease (OAI>10%), DT stood out with an accuracy of 86.7%, a sensitivity of 81.8%, a specificity of 100% and a ROC-AUC score of 91%. RF classifier performed very well in both cases, with an accuracy of 80%, a sensitivity of 85.7%, a specificity of 75% and a ROC-AUC score of 93% for the prediction of the occurrence of the disease (OAI>0%), and an accuracy of 86.7%, a sensitivity of 90.9%, a specificity of 75% and a ROC-AUC score of 84% for the prediction of the spread of the disease (OAI>10%).

Without the use of medicine drones, users are responsible for transporting goods at a high cost. The goal of this patient monitoring system is to identify people's health and, if necessary, administer medicine. The transportation drone is capable of finding healthcare information in a 360-degree rotation within the transportation infrastructure. IoT: Drone doctors are critical for the transportation of small gadgets such as drug treatments, blood leakages, and vaccines in the critical conditions of a heart patient, in the event of failure of traffic location infrastructure, highway roads, or hospitals due to intense climate or site visitor congestion, and for the transportation of small gadgets such as drug treatments, blood leakages, and vaccines. When transmission is difficult, the self-maintaining drone is the format for quickly transporting drug treatments to the appropriate locations. The shipping drone equipped with an Ardupilot can drive in autopilot mode, which guides the drone to its destination. It has a 7-minute flying period and can deliver up to 2 kg of medicine. When the detected heartbeat is 94bpm and the fever range is 101 degrees, a method has been presented in which an IoT Drone Doctor (IDD) System distributes the first AID box to vulnerable patients and heart patients.

The Severe acute respiratory syndrome-Corona virus-2 (SARS-CoV-2) which is responsible for recurring pandemics takes advantage of host-cell processes including the glycosylation pathway. The heavily glycosylated spike protein assists viruses in attachment and penetration. The N-glycans of N-terminal domain N165 and N234 play a significant role in conformational dynamics of the receptor-binding domain (RBD) with angiotensin-converting enzyme 2 (ACE2). In addition, the deletion of N-glycan sites N331 and N334 have been associated with reduced infectivity. This signifies the importance of targeting the N-glycans making them unavailable for interacting with the ACE2 receptor, ultimately leading to reduced infectivity. These glycans can be specifically targeted and can be used for designing SARS specific drugs or neutralizing molecules. In the current study, lectins Griffithsin, Cyanovirin-N, Cyanovirin homolog, and BanLec H84T were used to target the spike protein's N-glycans. Molecular docking programs AutoDock Vina and HADDOCK were used to study lectin-glycan interactions. The interactions look convincible in accordance with the lowest interaction energies best-fit approach but the characteristic feature (scoring functions) of the docking programs are questionable concerning Lectin-Glycan interactions exist in nature. There is a high need of the hour for developing specific algorithms for docking glycans with a preferential selection of terminal residues.

Microgrids are becoming popular nowadays because they provide clean, efficient, and low-cost energy. To use the stored energy in times of emergency or peak loads, microgrids require bulk storage capacity. Since microgrids are the future of renewable energy, the energy storage technology employed should be optimized to generate electricity. Batteries play a variety of essential roles in daily life and are used at peak hours and during a time of emergency. There are different types of batteries i.e., lion batteries, lead-acid batteries, etc. Optimal battery sizing of microgrids is a challenging problem, that limits modern technologies such as electric vehicles, etc. It is important to know different battery features such as battery life, battery throughput, and battery autonomy to get optimal battery sizing for microgrids. Mixed-integer linear programming (MILP) is an established technique for the integration and optimization of different energy sources and parameters for optimal battery sizing. A new MILP based dataset is introduced in this work. Support vector machine (SVM) is the machine learning application used to estimate the optimum battery size. The impact of feature selection algorithms on the proposed machine learning-based model is evaluated. The performance of the six best-performing feature selection algorithms is analyzed. The experimental results show that the feature selection algorithms improve the performance of the proposed methodology. Ranker search shows the best performance with a Spearman’s rank-ordered correlation constant of 0.9756, linear correlation constant of 0.9452, Kendall correlation constant of 0.8488 and root mean squared error of 0.0525.

Metaheuristic algorithms have been frequently using to tackle optimization problems, however such algorithms in the analysis of health-related data is not commonly used as developing metaheuristic algorithms that work well on health-related data is a difficult task due to complexity of the health data in particular genomics and epigenetics data. One of the important tasks in genomics is to predict genomic elements that are incorporating together to regulate a disease-related genes. Predicting such elements are important as they can be used to develop a personalized cure. In this study, we present for the first time, a multi-object simulated annealing algorithm to identify enhancer-promoter like interactions from Hi-C (chromosome conformation capture) data. These regulatory elements can potentially play vital roles as promoters and/or enhancers in appearance and exacerbation of the regulation of gene.s To evaluate the efficiency of the proposed method, we applied our proposed method and traditional methods on the Hi-C data from mice and compared together. Our results show that the interacting elements identified by our new method are more likely to be functional. The source code of the method is publicly available.

The practical application of a multi-objective optimization strategy based on evolutionary algorithms was proposed to optimize the plastics thermoforming process. For that purpose, the various steps of the process were considered individually and the optimization strategy was applied to the determination of the final part thickness distribution with the aim of demonstrating the validity of the methodology proposed. The preliminary results obtained considering three different theoretical initial sheet shapes indicates clearly that the methodology proposed is valid, as it provides solutions with physical meaning and with a great potential to be applied in real practice.

Chemistry has been viewed as one of the most fruitful near-term applications to science of quantum computing. Recent work in transitioning classical algorithms to a quantum computer has led to great strides in improving quantum algorithms and illustrating their quantum advantage. Much less effort has been placed on how one finishes these calculations by using the results from the quantum computer (on the active region of the molecule) and embeds them back into the remainder of the molecule in order to determine the properties of the entire molecule. Such strategies are critical if one wants to expand the focus to biochemical molecules that contain active regions that cannot be properly explained with classical algorithms on classical computers. While we do not solve this problem here, we provide an overview of where the field is going to enable such problems to be tackled in the future.

There exist numerous high-dimensional problems in the real world which cannot be solved through the common traditional methods. The metaheuristic algorithms have been developed as successful techniques for solving a variety of complex and difficult optimization problems. Notwithstanding their advantages, these algorithms may turn out to have weak points such as lower population diversity and lower convergence rate when facing complex high-dimensional problems. An appropriate approach to solve such problems is to apply multi-agent systems along with the metaheuristic algorithms. The present paper proposes a new approach based on the multi-agent systems and the concept of agent, which is named Multi-Agent Metaheuristic (MAMH) method. In the proposed approach, several basic and powerful metaheuristic algorithms, including Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), Firefly Algorithm (FA), Bat Algorithm (BA), Flower Pollination Algorithm (FPA), Gray Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), Crow Search Algorithm (CSA), Farmland Fertility Algorithm (FFA), are considered as separate agents each of which sought to achieve its own goals while competing and cooperating with others to achieve the common goals. In overall, the proposed method was tested on 32 complex benchmark functions, the results of which indicated effectiveness and powerfulness of the proposed method for solving the high-dimensional optimization problems. In addition, in this paper, the binary version of the proposed approach, called Binary MAMH (BMAMH), was executed on the spam email dataset. According to the results, the proposed method exhibited a higher precision in detection of the spam emails compared to other metaheuristic algorithms and methods.

This paper investigates a range of popular differential evolution (DE) configurations to identify components responsible for emergence of structural bias – a recently identified tendency of algorithms to prefer some regions of search space over others, for reasons unrelated to objective function values. Previous work has explored this tendency for genetic algorithms (GA) and particle swarm optimisation (PSO), finding a relationship between population size and extent of structural bias, hence highlighting potential weaknesses of those algorithms. In current article, we focus on DE, extend the investigation to include consideration of an algorithmic component that is often overlooked – constraint handling mechanism. Towards this end, a wide range of DE configurations was tested here. Results suggest that DE is generally robust to structural bias. Unlike the case with GA and PSO, population size seems to have no influence on DE structural bias. Only one of variants studied – DE/current-to-best/1/bin – shows clear signs of bias, however, we show that this effect is mitigated by a judicious choice of constraint handling technique. These findings contribute towards explaining widespread success of DE variants in algorithm comparison studies; its robustness to structural bias represents the absence of a factor that may confound other algorithms.

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

Keyhole neurosurgery implies reaching a target area inside the brain through an entry point specified by the neurosurgeon. In order to avoid complications, a risk assessment procedure must be done to establish the minimum risk trajectory from the entry point to the target area. The neurosurgeon establishes the risk values for the brain structure according to the type of intervention. The preset brain structure risk value is used to assess the risk value for each voxel of the brain. This paper proposes an improved risk assessment methodology based on the sum of N maximum risk values for each voxel. Then, risk assessment for a trajectory is done by adding the risk of all voxels that are part of the path. The safest trajectory is defined as the trajectory with the lower risk. Our proposed search trajectory methodology includes a Genetic Algorithm (GA) for finding the safest trajectories. The use of a GA drastically reduces the number of trajectories to analyze, speeding up the planning procedure. The achieved results were qualified by expert neurosurgeons as satisfactory. Our proposed method allows neurosurgeons to calibrate the surgical planning system by allowing them to establish the risk brain structure and the risk value for each structure.

Accurate and efficient battery modeling is essential to maximize the performance of isolated energy systems and to extend battery lifetime. This paper proposes a battery model that represents the charging and discharging process of a lead-acid battery bank. This model is validated over real measures taken from a battery bank installed in a research center placed at “El Chocó”, Colombia. In order to fit the model, three optimization algorithms (Particle Swarm Optimization, Cuckoo Search, and Particle Swarm Optimization+Perturbation) are implemented and compared, being the last one a new proposal. This research shows that the model with the proposed algorithm is able to estimate and manage the real battery characteristics as SOC and charging/discharging voltage. The comparison between simulations and real measures shows that the model is able to absorb reading problems, signal delays, and scaling errors. The approach we present can be implemented in other types of batteries especially those used in stand-alone systems.

Self-adaptive systems are capable of reconfiguring themselves while in use to reduce the risks forced by environments for which they may not have been specifically designed. Run-time validation techniques are required because complex Self-adaptive systems must consistently offer acceptable behavior for important services. The run-time testing can offer further confidence that a Self-adaptive system will continue to act as intended even when operating in unknowable circumstances. This article introduces an evolutionary framework that supports adaptive testing for Self-adaptive systems. To ensure that the adaptive systems continue to operate following its requirements and that both test plans and test cases continuously stay relevant to shifting operational conditions. The proposed approach using the SPEA2 algorithm facilitates both the execution and adaptation of run-time testing operations.

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

The monitoring of lake waterbody area in the Qinghai Tibet Plateau (QTP) is of great significance to deal with global climate change. As the latest generation of Landsat series satellites, Landsat-9 data not only have higher radiometric resolution, but also cooperate with other Landsat satellites to greatly improve the temporal resolution. It has great application potential in lake waterbody area monitoring. In order to explore the performance of different algorithms for extracting waterbody and lake waterbody area in Landsat-9 data under large-scale QTP regions, this study relies on Google Earth Engine (GEE) platform and selects 10 waterbody extraction algorithms as the basis to realize the quantitative evaluation of QTP lake waterbody area extraction results. The results show that the Random Forest (RF) algorithm performs best in all models. The overall accuracy of waterbody extraction is 95.84%, and the average error of lake waterbody area extraction is 1.505%. Among the traditional threshold segmentation waterbody extraction algorithms, the overall accuracy of the NDWI waterbody extraction method is 89.89%, and the average error of lake waterbody area extraction is 3.501%, which is the highest performance model in this kind of algorithms. This study proves that Landsat-9 data can effectively classify QTP waterbodies. With the development of cloud computing technologies such as Gee, more complex models such as RF can be selected to improve the extraction accuracy of water body and Lake area in large-scale research.

Radiation Fireballs are singular phenomena which involve severe thermal radiation and consequently, they need to be duly assessed and prevented. Although the radiative heat transfer produced by a sphere is relatively well known, the shadowing measures implemented to control the fireball’s devastating effects have frequently posed a difficult analytical instance, mainly due to its specific configuration. In this article, since the usual solving equations for the said cases are impractical, the authors propose a novel graphic-algorithm method that sorts the problem efficiently for different kinds of obstructions and relative positions of the fireball and the defenses. Adequate application of this method may improve the safety of a significant number of facilities exposed to such risks.

Since its advent in the mid-twentieth century, the field of artificial intelligence (AI) has been heavily influenced by biology. From the structure of the brain to evolution by natural selection, core biological concepts underpin many of the fundamental breakthroughs in modern AI. Here, focusing specifically on artificial neural networks (ANNs) that have become commonplace in machine learning, we show the numerous connections between theories based on coevolution, multi-level selection, modularity and competition and related developments in ANNs. Our aim is to illuminate the valuable but often overlooked inspiration biologists have provided AI research and to spark future contributions at this intersection of biology and computer science. Although recent advances in AI have been swift, many significant challenges remain requiring innovative solutions. Thankfully, biology in all its forms still has a lot to teach us, especially when trying to create truly intelligent machines.

This work deals with aerofoil aerodynamic features optimization, not only to improve flight features, but also to improve economy, ecology and safety of parameters of flight technique. In cruise mission, occupying the most flight time, the most important parameter is aerodynamic drag, which directly influences the aeroplane operational economy of transportation. Drag reduction is adequately reflected in the fuel consumption reduction. Consumption reduction is also adequately reflected in the flight ecology. In take-off and landing mission, the safety is priority and directly influences the aerofoil geometry. For cruise mission the new modified evolutionary algorithms (EA) are used to parameters incoming to Bezier-PARSEC 3434 parametrization. Such aerofoil is processed and evaluated by the Xfoil program. The change of model parameters results to optimal aerofoil shape. The DCAG (Direct Control Aerofoil Geometry) is unique developed mechanical device, makes possible the change of curvature of aerofoil, and also aerofoil geometry. DCAG is based on the rotary principle, which makes it possible to define the curvature of aerofoil for every roll as well as defining the geometry in the variable parts of aerofoil. For take-off and landing mission the best combination of slots and flaps is choosed. To improve of laminarity and reduce turbulent flow the DCAG is used. The work results to optimization, which is 50 times faster in comparison to ordinary optimization, with minimum of input parameters (flight speed, chord length, range of angles of attack and fitness function). The optimized aerofoil can achieve savings in fuel consumption up to 44% in comparison with unoptimized aerofoil, the aerodynamic drag reduction up to 44%. The output was checked by ANSYS Fluent simulation.

AbstractThis work deals with aerofoil aerodynamic features optimization, not only to improve flight features, but also to improve economy, ecology and safety of parameters of flight technique.In cruise mission, occupying the most flight time, the most important parameter is aerodynamic drag, which directly influences the aeroplane operational economy of transportation. Drag reduction is adequately reflected in the fuel consumption reduction. Consumption reduction is also adequately reflected in the flight ecology. In take-off and landing mission, the safety is priority and directly influences the aerofoil geometry.For cruise mission the new modified evolutionary algorithms (EA) are used to parameters incoming to Bezier-PARSEC 3434 parametrization. Such aerofoil is processed and evaluated by the Xfoil program. The change of model parameters results to optimal aerofoil shape.The DCAG (Direct Control Aerofoil Geometry) is unique developed mechanical device, makes possible the change of curvature of aerofoil, and also aerofoil geometry. DCAG is based on the rotary principle, which makes it possible to define the curvature of aerofoil for every roll as well as defining the geometry in the variable parts of aerofoil.For take-off and landing mission the best combination of slots and flaps is choosed. To improve of laminarity and reduce turbulent flow the DCAG is used.The work results to optimization, which is 50 times faster in comparison to ordinary optimization, with minimum of input parameters (flight speed, chord length, range of angles of attack and fitness function).The optimized aerofoil can achieve savings in fuel consumption up to 44% in comparison with unoptimized aerofoil, the aerodynamic drag reduction up to 44%.The output was checked by ANSYS Fluent simulation.

This paper presents a comparison between a kite model with a constant-length tether and a model based on a system identification algorithm. The concept of system identification is applied to predict the uncertainties related to the variation of the wind speed and the shape deformation of the tethered membrane wing during flight. A pole-placement controller is used to ensure that the kite follows the planned flight path. Thus, we can determine the required locations of the closed loop poles, and then enforce them by changing the controller's gains in real-time. The capability of the system identification algorithm to recognize sudden changes in the dynamic model, and the ability of the controller to stabilize the system in the presence of such changes are confirmed. Furthermore, the system identification algorithm is applied to determine the parameters of a kite with variable-length tether used in a flight test of the 20 kW kite power system of TU Delft. Experimental data of this test were compared with the system identification results in real-time and significant changes were observed in the parameters of the dynamic model which heavily affect the resulting response.

Big Data classification has recently received a great deal of attention due to the main properties of Big Data, which are volume, variety, and velocity. The furthest-pair-based binary search tree (FPBST) shows a great potential for Big Data classification. This work attempts to improve the performance the FPBST in terms of computation time, space consumed and accuracy. The major enhancement of the FPBST includes converting the resultant BST to a decision tree, in order to remove the need for the slow K-nearest neighbors (KNN), and to obtain a smaller tree, which is useful for memory usage, speeding both training and testing phases and increasing the classification accuracy. The proposed decision trees are based on calculating the probabilities of each class at each node using various methods; these probabilities are then used by the testing phase to classify an unseen example. The experimental results on some (small, intermediate and big) machine learning datasets show the efficiency of the proposed methods, in terms of space, speed and accuracy compared to the FPBST, which shows great potential for further enhancements of the proposed methods to be used in practice.

This paper presents an alternative constraint handling approach within a specialized genetic algorithm (SGA) for the optimal reactive power dispatch (ORPD) problem. The ORPD is formulated as a nonlinear single-objective optimization problem aiming to minimize power losses while keeping network constraints. The proposed constraint handling approach is based on a product of sub-functions that represents permissible limits on system variables and that includes a specific goal on power loss reduction. The main advantage of this approach is the fact that it allows a straightforward verification of both feasibility and optimality. The SGA is examined and tested with the proposed constraint handling approach and the traditional penalization of deviations from feasible solutions. Several tests are run in the IEEE 30, 57, 118 and 300 bus test power systems. The results obtained with the proposed approach are compared to those offered by other metaheuristic techniques reported in the specialized literature. Simulation results indicate that the proposed genetic algorithm with the alternative constraint handling approach yields superior solutions when compared to other recently reported techniques.

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

Olive trees have been of economic and cultural value since pre-Roman times, and continue to dominate landscapes and agriculture in many mediterranean regions. Recent mass losses of olive trees in Southern Italy due to an exotic plant pathogen highlight the need for methods that to monitor the olive trees in a landscape or region operationally. Here, we develop a method for counting olive trees from aerial photographs and test it in areas with a high diversity of olive tree ages, sizes, and shapes. This heterogeneity complicates tree counting as centennial trees often have crowns that are split into multiple segments, resembling multiple crowns, while nearby crowns often form a semi-closed canopy comprising multiple trees. Comparisons with reference counts in two 20 ha sites and over three different years indicate the automated counts tend to be reasonably accurate (median error 13%, n = 6), but heavily influenced by a few olive orchards with particularly high planting densities and a relatively closed canopy in which distinguishing individual trees is challenging. Overall, the algorithm estimated tree densities well (counting 82 to 109 trees/ha versus 87 to 104 trees/ha in the reference counts), indicating the method is suitable to track the number of olive trees over large areas.

With recent focus on deep neural network architectures for development of algorithms for computer-aided diagnosis (CAD), we provide a review of studies within the last 3 years (2015-2017) reported in selected top journals and conferences. 29 studies that met our inclusion criteria were reviewed to identify trends in this field and to inform future development. Studies have focused mostly on cancer-related diseases within internal medicine while diseases within gender-/age-focused fields like gynaecology/pediatrics have not received much focus. All reviewed studies employed image datasets, mostly sourced from publicly available databases (55.2%) and few based on data from human subjects (31%) and non-medical datasets (13.8%), while CNN architecture was employed in most (70%) of the studies. Confirmation of the effect of data manipulation on quality of output and adoption of multi-class rather than binary classification also require more focus. Future studies should leverage collaborations with medical experts to aid future with actual clinical testing with reporting based on some generally applicable index to enable comparison. Our next steps on plans for CAD development for osteoarthritis (OA), with plans to consider multi-class classification and comparison across deep learning approaches and unsupervised architectures were also highlighted.

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.

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.

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.