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

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

Despite Low Power Wide Area Networks’ ability to offer an extended range, it might still encounter challenges with coverage blind spots in the network. This article proposes an innovative energy-efficient nature-inspired relay selection algorithm for LoRa-based LPWAN networks, serving as a solution for challenges related to poor signal range in areas with limited coverage. A behavior swarm-inspired approach has been utilized to select the relays’ localization in the network, providing network energy efficiency and radio signal extension. These relays help bridge communication gaps, significantly reducing the impact of coverage blind spots by forwarding signals from devices with poor direct connectivity with the gateway. The proposed algorithm considers critical factors for the LoRa standard, such as the Spreading Factor or device energy budget analysis. The simulation experiments validate the proposed scheme’s effectiveness in terms of energy efficiency under diverse multi-gateway topology scenarios involving thousands of devices. Specifically, it has been verified that the proposed approach outperforms the reference method in preventing the battery depletion of relays, which is vital for battery-powered IoT devices. Furthermore, for some large-scale problems, the proposed heuristic method achieves over twice the speed of the exact method with a negligible accuracy loss of less than 2%.

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.

Fast Field-Cycling (FFC) Nuclear Magnetic Resonance (NMR) relaxometry is a powerful non-destructive magnetic resonance technique that enables, among other things, the investigation of slow molecular dynamics at low magnetic field intensities. FFC-NMR relaxometry measurements provide insight into molecular motion across various timescales within a single experiment. This study focuses on a \textit{model-free} approach, representing the NMRD profile $R_1$ as a linear combination of Lorentzian functions, thereby addressing the challenges of fitting data within an ill-conditioned linear least-squares framework. Tackling this problem, we present a comprehensive review and experimental validation of three regularization approaches to implement the model-free approach to analysing NMRD profiles. These include: (1) \nameUpe, utilizing locally adapted $L_2$ regularization; (2) \nameL, based on $L_1$ penalties; and (3) a hybrid approach combining locally adapted $L_2$ and global $L_1$ penalties. Each method's regularization parameters are determined automatically, according to the Balancing and Uniform Penalty principles. % Our contributions include the implementation and experimental validation of the \nameUpe{} and \nameUp{} algorithms, and the development of a "dispersion analysis" technique to assess the existence range of the estimated parameters. The objective of this work is to delineate the variance in fit quality and correlation time distribution yielded by each algorithm, thus broadening the set of software tools for the analysis of sample structures in FFC-NMR studies. The findings underline the efficacy and applicability of these algorithms in the analysis of NMRD profiles from samples representing different potential scenarios. 1

Mutual exclusion algorithms are at the heart of concurrent, distributed/parallel, real-time and operating systems. It is well-known that such algorithms are very difficult to analyze and in the literature different conjectures about starvation-freedom and the number of by-passes (also said the overtaking factor), which in turn affects the (hopefully) bounded waiting time that a process competing for entering the critical section has to suffer before accessing the shared resource, have been formulated for specific algorithms. This paper proposes a novel modelling approach based on Timed Automata and the Uppaal toolset, which proves effective for studying all the properties of a mutual exclusion algorithm for N≥2 processes, by exhaustive model checking. Although the approach, as already confirmed by similar experiments reported in the literature, is not scalable due to state explosion problems, and can be practically applied until N≤5, it is of great value for revealing true properties of analyzed algorithms. For dimensions N>5 the statistical model checker of Uppaal can be used which, although based on simulations, can confirm properties by estimations and probabilities. The paper describes the proposed modelling and verification method and applies it to several mutual exclusion algorithms, thus retrieving known properties but also showing new results about properties often studied only by peer-review and intuitive reasoning.

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

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.

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.

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.

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

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.

This paper proposes a novel formulation of the fuzzy newsvendor problem for inventory management applications. This new formulation allows the use of any profit function. A new credibility estimation is proposed to explore the neighborhood around the most impactful demand scenarios. Further, a simulation procedure was designed for the different demand scenarios, which allows the comparison of the proposed approach with probabilistic demand curves. The fuzzy newsvendor problem is solved using a modified genetic algorithm (GA), where an initialization mechanism with null values is proposed. The new formulation of the fuzzy newsvendor problem together with the modified GA have shown to improve the average profit up to 55% in problems with low-budget scenarios.

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.

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

Groundwater represents a pivotal asset in conserving natural water reservoirs for potable consumption, irrigation, and diverse industrial uses. Nevertheless, human activities intertwined with industry and agriculture contribute significantly to groundwater contamination, highlighting the critical necessity to appraise water quality for safe drinking and effective irrigation. This research primarily focused on employing the Water Quality Index (WQI) to gauge water's appropriateness for these purposes. However, the generation of an accurate WQI can prove time-intensive owing to potential errors in sub-index calculations. In response to this challenge, an artificial intelligence (AI) forecasting model was devised, aiming to streamline the process while mitigating errors. The study collected 422 data samples from Mirpurkash, a city nestled in the province of Sindh, for a comprehensive exploration of the region's WQI attributes. Furthermore, the study probed into unraveling the interdependencies amidst variables in the physiochemical analysis of water. Diverse machine learning classifiers were employed for WQI prediction, with findings revealing that random forest and gradient boosting eclipsed other algorithms, achieving an accuracy rate of 99%. In close pursuit were SVM and XGBoost, registering accuracy scores of approximately 95% and 93%, respectively, while KNN and Decision Trees garnered accuracy rates of 88% and 87%, respectively. In addition to WQI prediction, the study conducted an uncertainty analysis of the models using the R-factor, providing insights into the reliability and consistency of predictions. This dual approach, combining accurate WQI prediction with uncertainty assessment, contributes to a more comprehensive understanding of water quality in Mirpurkash and enhances the reliability of decision-making processes related to groundwater utilization

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

The world has changed. New technologies, new trends, new protocols, new efficient algorithms, and systems have been used widely by civilized countries to have better and more convenient living. In this research, there have been introduced many new terms, technologies, and mechanisms. Moreover, threats, attacks, and vulnerabilities have been studied and a novel scenario has been proposed in order to overcome all these violations that have been presented in this paper. The scenario is based on a security model that has been proposed for critical sectors, such as hospitals, industries, etc., which need efficient solutions to go one step further and improve the secure and efficient living and treatment of people. The aim of this research has been to understand through research the IoT security issues and propose the appropriate solutions based on the most suitable security algorithms. The results, which have been based on the complexity, the throughput, the power consumption, the strength, and the memory usage of the algorithms studied, have been hopeful and helpful for future research and experimentation.

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

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.

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

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

Moving object detection plays a crucial role in various applications, particularly in traffic surveillance and collision warning systems. However, the high cost of training and slow detection pose significant challenges to the practicality and real-time performance of existing methods. These challenges hinder the practicality and real-time performance of existing methods. The need for a reliable and efficient moving object detection system prompts the search for cost-effective strategies. Enhancing detection speed without sacrificing accuracy is crucial for real-time applications. Overcoming these challenges is essential to advance the field of moving object detection and improve its applicability in various domains. This paper presents a comprehensive review of the literature on moving object detection, proposes novel strategies to overcome the challenges of high training costs and slow detection. The study emphasizes the importance of reliable speed monitoring systems and advancements in control systems to enhance driver assistance on urban highways. Each frame in the dataset undergoes YOLOv6 processing to detect and classify objects, generating bounding box predictions and class probabilities. Optical flow, specifically the Lucas-Kanade method, is then utilized to compute motion vectors between consecutive frames. These motion vectors facilitate object tracking across frames, enabling refined bounding box positions and improving overall object tracking accuracy. The results demonstrate the effectiveness of the proposed technique in reducing training costs, improving detection speed, and maintaining a high level of accuracy when compared to existing methods. The paper concludes by summarizing the findings and highlighting the potential of the proposed strategy for precise and reliable moving object recognition in real-world traffic scenarios

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

A symbolic analysis of Archimedes’ periodical number system is developed, from which a natural link emerges with the modern positional number systems with zero. After the publication of Fibonacci’s Liber Abaci, the decimal Indo-Arabic positional system was the basis of the algorithmic and algebraic trend of modern mathematics, but even if zero plays a crucial role in algebra and mathematical analysis, zeroless positional systems show the same capability of producing efficient arithmetical algorithms based on operation tables over digits. The crucial role of digits is assessed, by considering a representation of numbers based on strings in lexicographic order. A new algorithm for the determination of decimal periods is presented,, by remarking the cruciality of this topic in number theory. Periods of ordinal numbers, and enumerations of recursive enumerability are shortly recalled. Concluding remarks are formulated about the deep relationship among numbers and information, which shed new light on a red line passing through the whole history of mathematics

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

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.

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

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.

The quickest path problem in the multistate flow networks, also known as the quickest path reliability problem (QPRP), aims at calculating the probability of transmitting a minimum of d units of flow/dat/commodity from a source node to a destination node through one single path within T units of time. Several exact and approximation algorithms have been proposed in the literature to address this problem. Most of the exact algorithms in the literature need prior knowledge of all the network’s minimal paths (MPs), which is considered a weak point. In addition to the time, the budget is always limited in real-world systems, making it an essential consideration in the analysis of systems’ performance. Hence, this study considers the QPRP under the cost constraints and provides an efficient approach based on the node-child matrix to address the problem without knowing the MPs. We show the correctness of the algorithm, compute its complexity results, illustrate it through a benchmark example, and conduct extensive experimental results on the known benchmarks and one thousand randomly generated test problems to demonstrate its practical superiority compared to the existing algorithms in the literature.

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

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

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.

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

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.

Anomaly detection in equipment processes plays an important role in the oil and gas sector. Algorithms for detecting anomalies in measured data are best understood in computer science and mathematics. Therefore, a possible transfer of knowledge from the latter knowledge area to the former can play a significant role. This paper addresses such a task by analyzing bibliometric data of Computer Science and Mathematics papers published in MDPI journals and publications found on the SPE search platform. It is shown that the main algorithms both extensively studied in MDPI publications and found in SPE publications and reflecting the anomaly detection problem are Random Forest, Support Vector Machine, Long-term Memory Method and Recurrent Neural Network. The main advantages and disadvantages of these methods are briefly described. Examples of classical, highly cited publications describing the work of these algorithms are given. Examples of papers describing their application in the oil and gas industry are given. The sections of SPE disciplines with the largest number of publications using the above algorithms that are frequently used for anomaly detection are presented.

This Article demonstrates how an eigendecomposition problem is inputted into a quantum circuit, how gates are applied in the quantum circuit, and how the output measurements are the correct eigenvalues. This process is known as quantum phase estimation (QPE). A quantum harmonic oscillator example, a foundational quantum physical chemistry problem, is demonstrated within the context of QPE. A particle in a box example, another quantum physical chemistry problem, may be solved by QPE with a caveat. These examples are of the limiting cases of diagonal matrices. Future advances in taking matrix inverses for solving linear sets of equations or finding ground state energies in the Schrödinger equation will use the principles implemented in this Article.

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

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.

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

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

Cyber-Physical Systems (CPS) play an essential role in today’s production processes, leveraging Artificial Intelligence (AI) to enhance operations such as optimization, anomaly detection, and predictive maintenance. This article reviews a cognitive architecture for artificial intelligence, which has been developed to establish a standard framework for integrating AI solutions into existing production processes. Given that machines in these processes continuously generate large streams of data, Online Machine Learning (OML) was identified as a crucial extension to the existing architecture. To substantiate this claim, real-world experiments using a slitting machine were conducted to compare the performance of OML with traditional Batch Machine Learning. The evaluations clearly indicate that OML adds significant value to CPS and is strongly recommeded as an extension of related architectures such as the cognitive architecture for AI discussed in this article. Additionally, surrogate model-based optimization is employed to determine the optimal hyperparameter settings for the corresponding OML algorithms, aiming to achieve peak performance in their respective tasks.

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

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.

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.

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.

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.

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

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

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.

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

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

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.

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

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.

Data Extraction is a technique is called as clustering which is used to retrieve data either from the files or data bases or both. This paper focuses on the performance evaluation parameters of the clustering algorithms based on different parameters or conditions or constraints and parameters which are used to perform the clustering process to get the clusters on the data sets. Therefore best clusters are retrieved when best parameters or conditions or constraints or preferences which are applied on the data sources for the clustering process. These parameters or conditions or constraints are opted by the user called as user preferences.

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

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

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

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

This 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

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.

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.

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

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

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

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

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

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

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

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

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

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

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.

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

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.

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

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.

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

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.

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

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

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

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

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.

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

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

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.

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.

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.

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

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.

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

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.

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.

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

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

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.

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