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.

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

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.

Beans are the most widely used protein source in the world and their productivity is directly linked to nitrogen (N). The short crop cycle imposes the need for fast methodologies for N quantification. In this work, we evaluated the performance of four machine learning algorithms in nitrogen prediction using NIR spectroscopy. Increasing doses of nitrogen were applied to the plants and leaf reflectance was collected. Weka software was used to test the algorithms. The selection of the most effective spectral zones was made with the VIP. Considering predictions with the whole NIR, the best results were achieved with RF (R2 = 0,84 and RMSE = 2,69 g kg-1) and KNN (R2 = 0,77 and RMSE = 3,86 g kg-1). The intervals of 700-740 nm and 983-995 nm were considered the most important for the study of N. More efficient predictions were verified when only spectral regions screened by VIP were included, increasing the accuracy of the RF, KNN and M5 models by 6%, 4% and 8%, respectively. The efficiency of N prediction based on NIR reflectance combined with machine learning was verified. This approach can optimize the management of nitrogen fertilization, serving as an important tool in precision agriculture.

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.

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

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

We assume that the current mathematical knowledge K is a finite set of statements from both formal and constructive mathematics, which is time-dependent and publicly available. Any theorem of any mathematician from past or present belongs to K. The set K exists only theoretically. Ignoring K and its subsets, sets exist formally in ZFC theory although their properties can be time-dependent (when they depend on K) or informal. In every branch of mathematics, the set of all knowable truths is the set of all theorems. This set exists independently of K. Algorithms always terminate. We explain the distinction between algorithms whose existence is provable in ZFC and constructively defined algorithms which are currently known. By using this distinction, we obtain non-trivial statements on decidable sets X⊆N that belong to constructive and informal mathematics and refer to the current mathematical knowledge on X. This and the next sentence justify the article title. For any empirical science, we can identify the current knowledge with that science because truths from the empirical sciences are not necessary truths but working models of truth about particular real phenomena.

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

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

Clustering is a crucial at the same time challenging task in several application domains. It is important to incorporate the optimum feature finding into our clustering algorithms for getting better prediction accuracy but this is difficult when there is no or little information about the importance or relevance of features. To tackle this task in an efficient manner we employ the natural evolution process inherent in genetic algorithms (GA) to find the optimum features for clustering for the healthy aging dataset. In order to empirically verify the findings, genetic algorithms were combined with a number of clustering algorithms including parti-tional, density based as well as agglomerative. A variant of the popular KMeans algorithm, named KMeans++ gave the best performance on all performance metrics when combined with GA.

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

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

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

The cultural transmissions of a society like famous paintings, popular music, good poetry, and enduring religious rituals/doctrines/texts serve as mediums for the embodiment of algorithms that interact with the mind and body in looping, mostly unconscious interactions that are mutually beneficial to the participants of the society and the algorithms themselves. Useful algorithms are also found in the mind and bodies of other people, and individuals in a group can be used to outsource specialized tasks to benefit the society as a whole. Since useful algorithms must be embodied in a medium to work, there are physical limitations to the computations that can be performed in our universe.

Magnetic resonance imaging (MRI) is crucial for its superior soft tissue contrast and high spatial resolution. Integrating deep learning algorithms into MRI reconstruction enhances image quality and efficiency, but a comprehensive review of optimization-based deep learning models for MRI reconstruction has been missing. This study fills that gap by examining the latest optimization-based algorithms in deep learning for MRI reconstruction, including gradient descent algorithms, proximal gradient descent algorithms, ADMM, PDHG, and diffusion models combined with gradient descent. Learnable optimization algorithms (LOA) are highlighted for their ability to map optimization processes to structured neural networks, improving model interpretability and performance. The study demonstrates significant advancements in MRI reconstruction through deep learning, with successful clinical applications. These findings provide valuable insights and resources for researchers aiming to advance medical imaging using innovative deep learning techniques.

Artificial neural networks are widely established models of computational intelligence that have been tested for effectiveness in a variety of real-world applications. These models require fitting a set of parameters through the use of some optimization technique. However, an issue that researchers often face is finding an efficient range of values for the parameters of the artificial neural network. This paper proposes an innovative technique of generating a promising range of values for the parameters of the artificial neural network. Finding the value field is done by a series of rules for partitioning the original set of values or expanding it, which rules are generated using Grammatical Evolution. After finding a promising interval of values, any optimization technique such as a genetic algorithm can be used to train the artificial neural network on that interval of values. The new technique was tested on a wide range of problems from the relevant literature and the results were extremely promising.

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

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

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

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

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

The integration of Genetic Algorithms (GAs) into Serious Games (SGs) has gained traction as a method to optimize game mechanics and personalize user experiences. While GAs are well-known for their effectiveness in solving complex optimization problems, their application in SGs remains relatively under-explored. This review aims to address this gap by systematically mapping the existing literature on the intersection of these two fields. The primary objective of this scoping review is to identify and synthesize the existing research on the application of GAs in SGs, with a focus on understanding the current state of the field, identifying common applications, challenges, and potential future directions. The review includes studies published in English that focus on the use of GAs within SGs. The search encompassed articles from academic journals and conference proceedings without restrictions on publication dates. Exclusion criteria included studies that did not specifically address the integration of GAs in SGs. A systematic search was conducted in databases such as ACM Digital Library, Web of Science, Scopus and Inspec in July 2024. The search terms used included "genetic algorithm," "evolutionary algorithm," "computational algorithm," and "serious games." Unpublished data and articles were not considered. Data were charted using a PRISMA flowchart developed by the author VV. Key categories for data extraction included study objectives, methods, outcomes, type of study and GA used and the specific applications of GAs in SGs. Data charting was conducted independently by two reviewers, with disagreements resolved through discussion and consensus. The search identified 154 studies, of which 23 met the inclusion criteria. The included studies highlight the diverse applications of GAs in SGs, ranging from optimizing game scenarios to personalizing learning experiences. Challenges identified include the computational complexity of GAs and difficulties in their integration into existing game frameworks. The findings of this review suggest that while the use of GAs in SGs is a promising area of research, it remains in its nascent stages. Future research should focus on addressing the technical challenges of integrating GAs into SGs and exploring their application across a wider range of game genres and educational contexts. Limitations of the review include the potential for publication bias and the exclusion of non-English language studies.

This paper provides a new multi-function Blockchain Technology-enabled Pharmaceutical Supply Chain (BT-enabled PSC) mathematical cost model, including PSC costs, BT costs, and uncertain demand fluctuations. The purpose of this study is to find the most appropriate algorithm(s) with minimum prediction errors to predict the costs of the BT-enabled PSC model. This paper also aims to determine the importance and cost of each component of the multi-function model. To reach these goals, we combined four Supervised Learning algorithms (KNN, DT, SVM, and NB) with two Evolutionary Computation algorithms (HS and PSO) after data generation. Each component of the multi-function model has its own importance, and we applied the Feature Weighting approach to analyse their importance. Next, four performance metrics evaluated the multi-function model, and the Total Ranking Score determined predictive algorithms with high reliability. The results indicate the HS-NB and PSO-NB algorithms perform better than the other six algorithms in predicting the costs of the multi-function model with small errors. The findings also show that the Raw Materials cost has a stronger influence on the model than the other components. This study also introduces the components of the multi-function BT-enabled PSC model.

In this paper, we investigate whether greedy algorithms, traditionally used for pedestrian-based crowdsensing, remain effective in the context of vehicular crowdsensing (VCS). Vehicular crowdsensing leverages vehicles equipped with sensors to gather and transmit data to address several urban challenges. Despite its potential, VCS faces issues with user engagement due to inadequate incentives and privacy concerns. In this paper, we use a dynamic incentive mechanism based on a recurrent reverse auction model, incorporating vehicular mobility patterns and realistic urban scenarios using the Simulation of Urban Mobility (SUMO) traffic simulator and OpenStreetMap (OSM). By selecting a representative subset of vehicles based on their locations within a fixed budget, our mechanism aims to improve coverage and reduce data redundancy. We evaluate the applicability of successful participatory sensing approaches designed for pedestrian data and demonstrate their limitations when applied to VCS. This research provides insights into adapting greedy algorithms for the particular dynamics of vehicular crowdsensing.

The main goal of optimization is to find factors values that bring minimum feedstock consumption or maximum final product or services of the production process. In a production process, the factors that make up the model that describes it are usually the properties of the final product. In the case of biodiesel, which is the final product of the process that is the object of study, among the various properties, the glycerol content is among the most important. The present study aims to maximize the model yield that defines glycerol content on the biodiesel composition. This optimization was executed by a hybrid metaheuristic algorithm (SAGAC),and its experimental results are compared with other optimization techniques named by RSM (Response Surface Methodology). After run the experimental assays, SAGAC algorithm has find the follow values of model factors: molar ratio = 3(mol/mol), catalyst content = 0.52 (wt%), reaction temperature = 49(^oC), Time = 45 (min) generating model yield of 14.46 that, match with EN 14105 standard value of 0.33 (wt%). Comparing results between SAGAC and RSM methodologies, SAGAC has presented an improvement of 31%.

This paper proposes an optimal path type classification scheme for the three-point Dubins problem. It allows to directly extract the shortest path type from a Dubins set, evaluating only the relative initial and final configurations with the via point position using a suitable partition of the Cartesian plane. Two alternative approaches are proposed to address the problem: an analytical approach and a heuristic one. The latter was revealed to be much faster from a computational point of view. The proposed classification logic makes the path planning for the three-point Dubins problem much more effective and suitable for real-time applications. Numerical examples are provided to show the efficiency of the proposed strategy.

Deep learning image reconstruction (DLIR) algorithms employs convolutional neural networks (CNNs) for CT image reconstruction to produce CT images with a very low noise level, even at low radiation dose. The aim of this study was to assess whether the DLIR algorithm reduces the CT effective dose (ED) and im-proves CT image quality in comparison with filtered back projection (FBP) and iterative reconstruction (IR) algorithms in intensive care unit (ICU) patients. We identified all consecutive patients referred to the ICU of a single hospital who underwent at least two consecutive chest and/or abdominal contrast-enhanced CT scans within a time period of 30 days using DLIR and subsequently FBP or IR algorithm (Advanced Mod-eled Iterative Reconstruction model-based algorithm [ADMIRE], or Adaptive Iterative Dose Reduction 3D [AIDR 3D]) for CT image reconstruction. The radiation ED, noise level, and signal-to-noise ratio (SNR) were compared between the different CT scanners. The non-parametric Wilcoxon test was used for statistical comparison. Statistical significance was set at p < 0.05. A total of 83 patients (mean age, 59 ± 15 years [standard deviation]; 56 men) were included. DLIR vs FBP reduced ED (18.45 ± 13.16 mSv vs 22.06 ± 9.55 mSv, P < 0.05), while DLIR vs FBP and vs ADMIRE and AIDR 3D IR algorithms reduced image noise (8.45 ± 3.24 vs 14.85 ± 2.73 vs 14.77 ± 32.77 and 11.17 ± 32.77\, P < 0.05) and increased SNR (11.53 ± 9.28 vs 3.99 ± 1.23 vs 5.84 ± 2.74 and 3.58 ± 2.74, P < 0.05). CT scanners employing DLIR reduced radiation ED and im-proved SNR compared to CT scanners using FBP, whereas CT scanners using DLIR improved SNR com-pared to CT scanners using FBP or IR algorithms in ICU patients.

This review article explores the transformative impact of Artificial Intelligence (AI) on glaucoma care, focusing on advancements in diagnosis, monitoring, and treatment algorithms. AI technologies have revolutionized the field of ophthalmology by enhancing the accuracy and efficiency of diagnosing glaucoma. Furthermore, AI-powered monitoring systems enable continuous and personalized patient care, facilitating early detection of disease progression. Integrating AI algorithms in treatment protocols promises individualized and optimized therapeutic strategies for better management of glaucoma. This comprehensive review elucidates AI applications' current state and future directions in transforming glaucoma care, emphasizing the potential benefits of improving patient outcomes.

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

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

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

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

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

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

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

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

Traditional population-based metaheuristic algorithms are effective in solving complex real-world problems but require careful strategy selection and parameter tuning. Parameter-less population-based optimization algorithms have gained importance due to their simplicity and efficiency. However, research on their applicability for solving large systems of nonlinear equations is still incipient. In this paper, a systematic review and detailed description of metaphor-less optimization algorithms is made, including the Jaya algorithm, the main Jaya variants for continuous optimization problems, with a focus on the Enhanced Jaya (EJAYA) algorithm, the three Rao algorithms, the best-worst-play (BWP) algorithm, and the very recent max-min-greedy-interaction (MaGI) algorithm. This paper also discusses a few previous parallelizations of the Jaya optimization algorithm, as well as recent GPU-based massively parallel implementations of the Jaya, Enhanced Jaya (EJAYA), Rao, and BWP algorithms developed by the authors. In addition, a novel GPU-accelerated version of the MaGI algorithm is proposed. The GPU-accelerated versions of the metaphor-less algorithms developed by the authors were implemented using the Julia programming language and tested primarily on GeForce RTX 3090 and NVIDIA A100 GPUs, as well as on Tesla V100S and Tesla T4 GPUs, using a set of difficult, large-scale nonlinear equation system problems. The computational experiments carried out produced quite significant speedups, which highlights the efficiency of the GPU-based versions of the metaphor-less algorithms developed for solving large-scale systems of nonlinear equations.

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.

In recent years, consensus algorithms have gained significant importance in the context of blockchain networks. These algorithms play a crucial role in allowing network participants to reach agreements on the state of the Blockchain without needing a central authority. The present study focuses on carrying out a systematic mapping of these consensus algorithms to explore in detail their use, benefits, and challenges in the context of blockchain networks. Understanding consensus algorithms is essential to appreciating how blockchain networks achieve the reliability and integrity of their distributed ledgers. These algorithms allow network nodes to reach agreement on the validity of transactions and the creation of new blocks on the Blockchain. In this sense, consensus algorithms are the engine that drives trust in these decentralized networks. Numerous authors have contributed to the development and understanding of consensus algorithms in the context of blockchain networks. For example, Satoshi Nakamoto's (2008) original paper on Bitcoin introduced proof-of-work (PoW) as a method of achieving consensus on the network. This revolutionary concept paved the way for numerous cryptocurrencies and blockchain systems. Despite advances in this field, significant challenges remain: centralization, fair token distribution, scalability, and sustainability. The energy consumption of blockchain networks, particularly those using algorithms such as Proof of Work, Proof of Stake, Delegated Proof of Stake, Proof of Authority, and hybrid algorithms (Proof of Work/Proof of Stake), has raised concerns about their environmental impact, motivating the scientific and technological community to investigate more sustainable alternatives that promise to reduce energy consumption and contribute to climate change mitigation. Furthermore, interoperability between different blockchains and security in specific environments, such as IoT, are areas that still require significant research attention. This systematic mapping not only seeks to shed light on the current state of consensus algorithms in blockchain, but also their impact on sustainability, identifying those algorithms that, in addition to guaranteeing integrity and security, minimize the environmental footprint, promoting a more efficient use of energy resources, being a relevant approach in a context in which the adoption of sustainable technologies has become a global priority. Understanding and improving these algorithms are critical to unlocking the full potential of blockchain technology in a variety of applications and industry sectors.

Drug discovery and development is a highly complex and costly endeavor, typically requiring over a decade and substantial financial investment to bring a new drug to market. Traditional computer-aided drug design (CADD) has made significant progress in accelerating this process, but the development of quantum computing offers potential due to its unique capabilities. This paper discusses the integration of quantum computing into drug discovery and development, focusing on how quantum technologies might accelerate and enhance various stages of the drug development cycle. Specifically, we explore the application of quantum computing in addressing challenges related to drug discovery, such as molecular simulation and the prediction of drug-target interactions, as well as the optimization of clinical trial outcomes. By leveraging the inherent capabilities of quantum computing, we might be able to reduce the time and cost associated with bringing new drugs to market, ultimately benefiting public health.

This study developed a three-dimensional kinematic and dynamic model of a center-driven linkage system (CDLS). Force analysis was conducted to determine the required driving torque to ensure that the input link of the CDLS rotates at a constant speed with a certain angular velocity, even in the presence of frictional resistance torque. The primary objective was to optimize the maximum angular acceleration of the output links to reduce wiper noise. This optimization can enhance the stability of the linkage system while maintaining its operational functionality. In the adopted methodology, the frames of the fixed links are assumed to remain unchanged, and the input link is considered to operate at a constant angular speed and have a constant length. To meet standard vehicle windshield wiper requirements, 10 constraints were imposed on the optimization problem, which was solved using the differential evolution method. The lengths of both output links were reduced by over 10% after optimization.

Cold chains are essential in providing us humans with food and medicine across the globe. However, cold transportation, like all transportation, has massive negative impacts on the environment and human well-being, which especially culminate in cities. Thus, it is important to research the ways to reduce these impacts and reinvent urban logistics infrastructure. In this article, we articulate the massive problems the road-based transportation sector imposes on the environment and on the health of humans, especially in cities. We present algorithms that show promise in optimizing the whole road transportation sector as well as some innovations and alternative ways to model cities and the whole urban transportation infrastructure. We approach the issues discussed specifically from the point of view of refrigerated transportation, but many of the solutions can be applied to all the transportation sector in general.

Intrusion Detection Systems play a crucial role in a network. They can detect different network attacks and raise warnings on them. Machine learning-based IDSs are trained on datasets that, due to the context, are inherently large, since they can contain network traffic from different time periods and often include a large number of features. In this paper, we present two contributions: the study of the importance of feature selection when using an IDS dataset, while striking a balance between performance and the number of features; and the study of the feasibility of using a low-capacity device, the Nvidia Jetson Nano, to implement an IDS in a low-capacity network. The results, comparing the GA with other well-known techniques in feature selection and reduction, show that the GA has a higher F1-score of 76%, although the time to find the optimal set of features surpasses other methods; the reduction of the number of features reduces the processing time without a significant impact in f1-score. The Jetson Nano allows the classification of network traffic with an overhead of 10 times in comparison to a traditional server.

The conventional well placement was done manually by using a numerical reservoir simulator, and it required a lengthy trial-and-error process. It required great experience and expertise to manipulate the variables and uncertainties that lie on the reservoir to determine the best placement of the well. In addition, the traditional gradient-based methods such as Line-search and Trust-region were not viable in terms of maximum results obtained. Gradient-based methods were too dependent on the surface gradient of the solution and may only converge to local optima instead of global optima. Complex reservoirs have rough surfaces with high uncertainties, which hinders the traditional gradient-based method from converging to global optima. Thus, genetic algorithms were utilized to automate the manual trial-and-error process and to overcome the limitations of the traditional gradient-based method. The objectives of this study were to analyse the effect of different initial well placement distributions, the number of random solution sizes, and the crossover rate on cumulative oil production. A synthetic reservoir model built using CMG Builder was used as the testing platform for the optimization problems. Well-placement parameterization and optimization set-up were carried out using the CMG CMOST optimization tool. The integration of CMG IMEX and CMOST optimized cumulative oil production based on the objectives of the study. The results obtained showed that the higher number of random solutions used resulted in higher cumulative oil production, with more generations needed to reach the optimum solution. It can be concluded that the larger number of random solutions used increased the probability of reaching the optimum solution, but will take more generations.

Quantum amplitude estimation is a numerical integration technique and a candidate for the first operationally used quantum algorithm providing a quantum advantage in the NISQ era. Its main metric is the generated Fisher information per second, as it describes the accuracy of the numerical integration. The development of this metric can be coupled to the quantum volume of the used quantum processor with a phenomenological noise model. Since the increase of the quantum volume seems to follow an exponential pattern, insight in the integration power of quantum amplitude estimation for the upcoming years can be obtained. This shows that quantum amplitude estimation as a numerical integration technique will not provide an advantage for functions without significant improvements to the connectivity, reliability and speed of quantum processors. Beyond that, this method may be used the estimate the development of many more NISQ era algorithms.

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.

Image denoising has been one of the important problems in the field of computer vision, and it has a wide range of practical value in many applications, such as medical image processing, image enhancement, and computational photography. Traditional image denoising methods are usually based on hand-designed features and filters, but these methods perform poorly under complex noise and image structures. In recent years, the rapid development of neural network technology has revolutionized the image-denoising task. This paper introduces the knowledge about neural networks and image denoising, explores the impact of neural networks on image denoising, and how is it possible to denoise images by neural networks. It also summarises other image-denoising methods and finally points out the challenges and problems faced by image-denoising at present. Some possible new development directions are proposed to provide new solutions for image-denoising researchers and to promote the development of the field.

The MLL1 gene located on chromosome 11q23, is crucial for histone lysine-specific methylation and is frequently implicated in various leukemia types. Despite prior in silico investigations into non-synonymous single nucleotide polymorphisms (nsSNPs) associated with leukemia in the MLL1 gene, there is a dearth of comprehensive studies evaluating their impact on the protein's structure, function, and post-translational modifications. Addressing this, our study screened 2049 nsSNPs from the dbSNP database, identifying 62 high-risk variants. A thorough domain analysis revealed that these nsSNPs are distributed across seven domains of the MLL1 protein, potentially affecting their functions. Our conservation analysis highlighted 31 nsSNPs as deleterious, suggesting their potential effects on protein stability and function. Furthermore, utilizing the MutPred2 tool, we identified mutations affecting metal-binding, protein loop structures, and post-translational modifications, which could alter the MLL1 protein's native functionality. Interaction network analysis underscored the role of MLL1 in hematopoietic cell development, implying that mutations may influence hematological malignancies. Additionally, a subset of non-coding SNPs was found to possess regulatory capabilities, potentially affecting gene expression and chromatin modification. Most significantly, using CScape and CScape-somatic tools, four nsSNPs were predicted to be oncogenic, with two classified as cancer drivers, underscoring their potential role in leukemia development. The oncogenic nsSNP, D2724G, located between the FY-rich N and FY-rich C domain of the MLL1 protein, has raised significant interest due to its potential impact on proteolytic cleavage. Predictive analyses, such as those by Mutpred2, suggest a loss of cleavage at D2724 caused by this mutation, potentially affecting the formation of essential MLL1 fragments, p320 and p180. These fragments play a crucial role in creating a stable multiprotein complex that localizes to a specific subnuclear region. Therefore, mutations like D2724G can potentially alter gene expression patterns, influencing cellular behavior and possibly fostering a cancer-prone environment. In conclusion, our research provides an in-depth assessment of the effects of nsSNPs in the MLL1 gene on leukemia, offering potential avenues for personalized treatment strategies, early detection, prognosis, and a better understanding of hematological malignancy genesis.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Conceptual distance refers to the degree of proximity between two concepts within a conceptualization. It is closely linked with semantic similarity and relationship, but its computation relies entirely on the context of the given concepts. The DIS-C algorithm, which requires using search algorithms such as Breadth First Search, represents an advance in computing the semantic similarity/relation regardless of the type of knowledge structure and semantic relationships. The shortest path algorithm facilitates the determination of the semantic closeness between two indirectly connected concepts in an ontology by propagating local distances. This process is implemented for each concept pair to establish the most effective and efficient paths to connect these concepts. The algorithm identifies the shortest path between the concepts, allowing for the inference of the most relevant relationships between them. This approach contributes to developing a comprehensive understanding of the ontology and enhances the accuracy and precision of the semantic representation of the concepts. However, one of the critical issues is associated with the computational complexity due to the nature of the algorithm, which is errorn3. This paper studies alternatives to accelerate the DIS-C based on approximation and optimized algorithms, focusing on Dijkstra, pruned Dijkstra, and Sketched-based algorithms to compute conceptual distance. Based on the experiments, we discovered that the bottleneck can be avoided using the proposed 2-hop coverages, bringing DIS-C almost linearity.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

This paper presents a methodology based on deep learning models and metaheuristic algorithms for the optimization of airfoils for the design of aircraft wings with large endurance. The use of AZTLI-NN (a neural network with an architecture composed of a multilayer perceptron and a variational autoencoder) is implemented for the prediction of graphs of the aerodynamic coefficients of the airfoil as a function of the angle of attack. This neural network presents good predictions of the aerodynamic coefficients, similar to the coefficients obtained with computational fluid dynamics simulations. AZTLI-NN in combination of metaheuristic algorithms and the CST profile parameterization method show excellent performance in single-objective and multi-objective profile optimization tasks.

A new approach based on input-output (IO) analysis has emerged to estimate the carbon footprints of companies and their products from cradle to gate. While they rely on the same principles as the GHG Protocol, they use a distributed iterative framework to improve the footprint estimations and reduce their uncertainty. While optimal estimations would result if all the world’s companies would enter such a system, this paper shows how such a distributed system could apply to the real world where many enterprises would stay out of the system. We show how it would increase the quality of the estimations with respect the GHG Protocol by integrating scope 1 and scope 2 data of the value chains in the footprint estimations and reducing the part of remaining scope 3 data. To help analyzing uncertainty, we show how to use the scope 1/2/3 decomposition to estimate the biases and the standard deviations of the computed production intensities. We illustrate the model on macroeconomic data for 44 sectors and two regions (Europe and Rest of World), using the Inter-Country Input-Output database (ICIO). Such a system would necessarily rely on Information and Communication Technology since the companies would be permanently interconnected in a large-scale meshed network, using an application protocol for data exchange.

The prediction of hydrological flows (rainfall-depth or rainfall-discharge) is becoming increasingly important in the management of hydrological risks such as floods. In this study, the Long Short-Term Memory (LSTM) network, a state-of-the-art algorithm dedicated to time series, is applied to predict the daily water level of lake Nokoue in Benin. This paper aims to provide an effective and reliable method enable of reproducing the future daily water level of Lake Nokoue, which is influenced by a combination of two phenomena: rainfall and river flow (runoff from the Ouémé River, the Sô River, the Porto-Novo lagoon, and the Atlantic Ocean). Performance analysis based on the forecasting horizon indicates that LSTM can predict the water level of Nokoué Lake up to a forecast horizon of t+10 days. Performance metrics such as Root Mean Square Error (RMSE), coefficient of correlation (R²), Nash-Sutcliffe Efficiency (NSE), and Mean Absolute Error (MAE) agree on a forecast horizon of up to t+3 days. The values of these metrics remain stable for forecast horizons of t+1 days, t+2 days, and t+3 days. The values of R² and NSE are greater than 0.97 during the training and testing phases in the Nokoué Lake basin. Based on the evaluation indices used to assess the model's performance for the appropriate forecast horizon of water level in the Nokoué lake basin, the forecast horizon of t+3 days is chosen for predicting future daily water levels.

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

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

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

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

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

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

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

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

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

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

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

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

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

Advanced persistent threat (APT) attacks are sophisticated and organized attacks commonly motivated by political, financial, and strategic objectives. In order to comprehend their tactics, techniques, and procedures (TTP) and indicators, APT reports are valuable sources. While blue teams typically rely on server logs, firewall rules and user authorizations managed in database tables, attackers have a graph-based mindset. In this work, we propose a framework for discovering and evaluating APTs using graph-based algorithms. Cyber threat intelligence (CTI) was extracted from 40,358 pages of APT reports and transformed into a graph. Centrality, community, and similarity analyses were executed on the graph. As a result, critical and influential APT groups and indicators of compromise (IoC) were discovered. Similar attacks and APT groups were revealed. Analysis results were interpreted to create new strategic CTI that can be utilized in future security operations.

Traffic accidents are among the most common causes of death worldwide. According to statistics from the World Health Organization (WHO), 50 million people are involved in traffic accidents every year. Canada, particularly Montreal, is not immune to this problem. Data from the Société de l’Assurance Automobile du Québec (SAAQ) shows that there were 392 deaths on Québec roads in 2022, 38 of them related to the city of Montreal. This value represents an increase of 29.3% for the city of Montreal compared to the average for the years 2017 to 2021. In this context, it is important to take concrete measures to improve traffic safety in the city of Montreal. In this article, we present a web-based solution based on machine learning that predicts the severity of traffic accidents in the city of Montreal. This solution uses dataset of traffic accidents that occurred in Montreal between 2012 and 2021. Classification algorithms such as eXtreme Gradient Boosting (XGBoost), Categorical Boosting (CatBoost), Random Forest (RF) and Gradient Boosting (GB) were used to develop the prediction model. When evaluating the prediction model, performance metrics such as precision, recall, F1 score, and accuracy are taken into account. The performance analysis shows an excellent accuracy of 96% for the prediction model based on the XGBoost classifier. The other models (CatBoost, RF, GB) achieved 95%, 93% and 89% accuracy, respectively. The prediction model based on the XGBoost classifier was deployed using a client-server web application managed by Swagger-UI and the Flask Python framework.

Droughts have a substantial effect on water resources, agriculture, and ecosystems on a worldwide scale. In the Mekong Delta of Vietnam, droughts exacerbated by climate change are significantly endangering the region's agricultural sustainability and output. Conventional forecasting techniques frequently do not capture the intricate dynamics of meteorological phenomena associated to drought effectively, prompting the exploration of more advanced methodologies. This work utilises artificial intelligence, par-ticularly machine learning methods like Gradient Boosting and Extreme Gradient Boosting (XGBoost), to enhance drought pre-diction in the Mekong Delta. The study utilises data from 11 meteorological stations spanning from 1990 to 2022 to create and evaluate Machine Learning models based on several climatic factors. We utilise Gradient Boosting and XGBoost algorithms to estimate the Standardised Precipitation-Evapotranspiration Index (SPEI) and evaluate their effectiveness in comparison to con-ventional forecasting techniques. The results show that Machine Learning, particularly XGBoost, surpasses traditional approaches in predicting SPEI accuracy at various time scales. XGBoost demonstrates skill in understanding the complex relationships between climatic factors, with R² values falling between 0.90 and 0.94 for 1-month forecasts. The progress highlights the potential of Machine Learning in improving drought management and adaptation tactics, proposing the incorporation of Machine Learning forecasting models into decision-making processes to enhance drought resistance in susceptible areas.

Graph visualization has evolved significantly over time, offering various methods to effectively represent complex data structures. This study introduces a novel force-directed algorithm for 3D data visualization, specifically tailored for commonly used datasets in linked data visualization. Leveraging the power of graph theory and methods, the algorithm aims to address the challenge of creating visually appealing and easily interpretable visualizations, which often necessitate advanced user interaction. By utilizing 3D space and the Unity Engine, the research successfully visualizes data and develops interactive visualizations, overcoming limitations of basic force-directed implementations. The main contribution of presented research is in the force-directed algorithm with springs and controlled placement as a visualization technique that combines the use of springs and attractive forces to stabilize a graph in a 3D environment. The combination of these two techniques also helps prevent the formation of a single large cluster within the graph, enhancing the overall visualization quality.

Quantum computing (QC) has opened the door to advancements in machine learning (ML) tasks that are currently implemented in the classical domain. Convolutional neural networks (CNNs) are classical ML architectures that exploit data locality and possess a simpler structure than fully-connected multi-layer perceptrons (MLPs) without compromising the accuracy of classification. However, the concept of preserving data locality is usually overlooked in the existing quantum counterparts of CNNs, particularly for extracting multi-features in multidimensional data. In this paper, we present a multidimensional quantum convolutional classifier (MQCC) that performs multidimensional and multi-feature quantum convolution with average and Euclidean pooling and thus adapting the CNN structure to a variational quantum algorithm (VQA). Average pooling is based on the quantum Haar transform (QHT) and Euclidean pooling is based on partial quantum measurement. The experimental work was conducted using multidimensional data to validate the correctness and demonstrate the scalability of the proposed method utilizing both noisy and noise-free quantum simulations. We evaluated the MQCC model with reference to reported work on state-of-the-art quantum simulators from IBM Quantum and Xanadu using a variety of standard ML datasets. The experimental results showed favorable characteristics of our proposed techniques compared to existing work with respect to a number of quantitative metrics such as the number of training parameters, cross-entropy loss, classification accuracy, circuit depth, and quantum gate count.