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

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

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

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

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

Monogenity is a classical area of algebraic number theory that is very actively researched even today. This paper is a collection of the results obtained during the last few years in this area. Several of these results were presented at the series of online conferences "Monogenity and power integral bases".

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

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

In data-scarce regions, prudent planning and precise decision-making for sustainable development especially in agriculture remains a challenging task due to the lack of correct information. Remotely sensed satellite images provide a powerful source for assessing land use land cover (LULC) classes and crop identification. Applying Remote Sensing (RS) in conjunction with the Geographical Information System (GIS) and modern tools/ algorithms of artificial intelligence (AI) and deep learning has been proven effective for strategic planning and integrated resources management. The (this)study was conducted in the canal command area of the Lower Chenab Canal system in Punjab, Pakistan. Crop features/ classes were assessed using the Normalized Difference Vegetation Index (NDVI) algorithm. The MODIS (Moderate Resolution Imaging Spectroradiometer) 250 m and Landsat 5 TM (thematic mapper) images were deployed for NDVI time-series analysis with unsupervised classification technique to get LULC classes that helped to discern cropping pattern, crop rotation, and the area of specific crops, which were then used as a key input for agricultural mechanization planning and resources management. The accuracy of the LULC map was 78%, assessed by the error matrix approach. Limitations of high-resolution RS data availability and the accuracy of the results are the concerns observed in this study that could be managed by the availability of good quality local sources and advanced techniques of processing, which will make it more useful and applicable for regional agriculture and environmental management.

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

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

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

The different systems in the nuclear power plants (NPP) are critical and complex which requires a continuous rigorous monitoring for both normal and abnormal conditions. However, due to the nonlinearity of the dynamic behavior of these systems, implementation of artificial intelligence within the NPP components is crucial to enhance the monitoring and the predictability of the key operating parameters trend. On the other hand, lessons learned from large nuclear accident proves that a remote real-time coordination between the different stakeholders involved in the safety of the nuclear reactor is needed. This remote feature can be implemented in the existing power plants by embedding a mobile computing networks within the plant components. This network will send early warning and transmit the NPP data on real-time to different authorities such as the regulatory authority and the decision-making committees, to enhance the interpretability of the nuclear event and deliver a collaborative decision which in return mitigate the risk associated with these events and increase the overall safety of the plant. The integration of AI and mobile computing in NPP would be most of interest in countries where nuclear reactors data are challenged to reach during an accident. For instance, during the meltdown of Chernobyl, the Soviet government covered the accident from the news in an attempt to contain the consequences but there was a spread of radioactive contamination to some other Europe countries. Therefore, in the case of such scenario the implementation of mobile computing and AI would result in different outcomes as the European countries would be notified through the mobile networking and the spread of contamination would be forecasted by the AI algorithms. In this paper, we examine the different modern AI and mobile computing technologies, the different potential application, the associated features and challenges, and future work direction.

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

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

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

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