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.

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.

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.

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.

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.

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.

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

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.

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.

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

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.

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

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.

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.

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

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

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

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.

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.

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.

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.

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

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

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

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

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

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

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.

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.

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.

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.

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.

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

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.

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.

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.

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.

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.

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.

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.

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

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.

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.

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.

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.

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

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.

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

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.

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.

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.

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.

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.

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.

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.

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.

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.

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

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

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.

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.

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

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

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 is an opinion piece based on observations from more than two decades of biomedical data mining insights studying health and disease. It has led me to reevaluate modern life and how lived experiences in many parts of the world are being questioned and now answered through the various technological advances that have taken place in biomedical science. Our mitochondria are multi-faceted and the next generation will need to ensure that they develop a strong understanding from a scientific basis for how they are important to our health. The mind-body connection is also now being investigated through researching the networks of mitochondrial bioenergetics. This article provides a brief introduction to how we can reduce chronic disease burden globally, by introducing a simple first algorithm for healthy aging. This work is aimed to jump start the collection of Algorithms for Healthy Aging (AHA) in the context of global populations in their locally lived generational experiences, which may have underlying scientific bases that are yet to be discovered and validated.

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

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

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.

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

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

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.

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.

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.

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.

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.

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

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

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

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

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

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.

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.

In this paper, we introduce an innovative approach to distinguish Gliosarcoma (GSM) from Glioblastoma (GBM). Our method combines causal fuzzy logic rules with the Big Bird architecture, a Transformer-based Deep Learning algorithm. Unlike prior research, which often relied on statistical models to reduce dataset dimensions before causal analysis, our approach harnesses the complete dataset in tandem with our causal fuzzy Big Bird architecture. Additionally, we benchmark our results not only against previous Gliosarcoma/Glioblastoma studies but also against GPT-2 for a comprehensive evaluation.

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%).

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.

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.

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.

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.

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.

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

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

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

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.