Abduction as Incomplete Parameter Estimation

In this article, the least squares (LS) estimates of the parameters of periodic autoregressive (PAR) models are investigated for various distributions of error terms via Monte-Carlo simulation. Beside the Gaussian distribution, this study covers the exponential, gamma, student-t, and Cauchy distributions. The estimates are compared for various distributions via bias and MSE criterion. The effect of other factors are also examined as the non-constancy of model orders, the non-constancy of the variances of seasonal white noise, the period length, and the length of the time series. The simulation results indicate that this method is in general robust for the estimation of AR parameters with respect to the distribution of error terms and other factors. However, the estimates of those parameters were, in some cases, noticeably poor for Cauchy distribution. It is also noticed that the variances of estimates of white noise variances are highly affected by the degree of skewness of the distribution of error terms.

the University of Amsterdam, May 20-31, 1974.This Tract collects the lecture notes of five of the courses given.The sixth course, given by Dr. R. Kowalski on Predicate Logic as a Programming Language in Artificial Intelligence, is scheduled to appear elsewhere.We are very grateful to the Netherlands Organization for the Advancement of Pure Research (Z.W.O.)

Modular Algorithms for Scientific Computing in Julia

Genetic programming and data structures: Geneticprogramming + datastructures = automaticprogramming: By W. B. Langdon. Kluwer Academic Publishers, Boston, MA. (1998). 278 pages. $125.00. NLG 285.00, GBP 85.00

The advent of artificial intelligence (AI) in algorithm discovery represents a fundamental shift in computer science, unlocking new levels of computational efficiency, performance, and optimization. This paper explores the capabilities of AI - driven methodologies, including reinforcement learning, genetic algorithms, neural architecture search, and symbolic AI, in designing novel and more efficient algorithms. These innovations hold profound significance in areas such as sorting, searching, data structures, and numerical simulations. By analyzing various case studies, including Google DeepMind’s AlphaDev and its groundbreaking contributions to optimizing low - level assembly operations, we delve into the broader implications of AI in software development and theoretical computer science. Furthermore, the study examines AI’s impact on cryptographic security, machine learning model optimization, and high - performance computing. Despite these advancements, challenges such as interpretability, formal verification, and ethical concerns persist, necessitating further research. This paper provides a comprehensive review of AI's role in algorithm discovery and discusses future research directions to refine and standardize AI - generated algorithms.

Human-computer interaction for virtual-real fusion

The article conducts research on the fundamental importance and methodological implementation of interdisciplinary connections between mathematics and computer science in the educational process. Attention is focused on the close interweaving of these two disciplines, creating a powerful synergistic effect where mathematics acts as the theoretical foundation, and computer science provides tools for solving complex problems and visualizing abstract concepts. It is emphasized that such an integrated approach is key to forming a holistic scientific worldview in students, as well as developing critical, algorithmic, and computational thinking. The paper provides a detailed analysis of how exactly key mathematical sections provide the theoretical basis for computer science. Specifically, discrete mathematics is the foundation for algorithms and data structures (arrays, trees), mathematical logic is critically important for programming languages and artificial intelligence, graph theory is applied to network modeling and pathfinding algorithms, and probability theory and statistics lie at the core of machine learning, data analysis, and cryptography. This review confirms the thesis that mathematics is essentially "the language computer science speaks". Particular attention is paid to practical methodological approaches that help the teacher effectively use this connection in lessons. Specific educational examples are provided. In particular, the study of arithmetic progression in a mathematics lesson is proposed to be combined with writing a simple code (a Python example is given) that calculates the $n$-th term or the sum of the first $n$ terms of the sequence. Furthermore, the role of computer science in visualizing complex mathematical concepts, such as function graphs using Matplotlib or GeoGebra, as well as the creation of fractals and 3D modeling of geometric bodies using SketchUp or Tinkercad, is highlighted.

Introduction: The paper explores the trends in the field of artificial intelligence, especially analyzing the improvements in deep learning and machine learning that are revolutionizing the computer science discipline. The study gives details of the current trends and new approaches, possible uses, and other possible advancements. The author discusses a literature review incorporating trends identified in the prior year to discuss what these trends mean for academia and industry as well as the future of AI in computer science. Artificial intelligence has developed quite fast to be one of the key factors in the progress of computer science. Out of all the subfields of AI, DL and ML are receiving substantial attention from academicians as well as industrialists owing to the game-changing effects that these two fields have brought in data processing, decision-making, and automation zones. These technologies have not only helped transform conventional solution-seeking procedures in computer science but have also facilitated various new courses for research. Methodology: This work employs the literature review and analysis from 2015 to 2024 approach for the analysis of current advancements and emerging trends in deep learning and machine learning in computer science. The analysis of the research papers published in recent years, the industry reports, and case studies in the paper presents the views seeking to understand the state of AI in computer science. The examination is built based on categories, which are algorithmic improvement, real-world uses, and artificial intelligence implementation across industries. This approach means a systematic assessment of how deep learning and machine learning affect the field for better. Conclusion: An analysis of the trends in inventiveness of AI shows that the future of AI, especially in areas such as deep learning as well as machine learning, indicates increased inventiveness at a very impressive pace. It is one thing to use these technologies to progress computer sciences to the limits of what is possible today. It is clearly seen that the future of AI heavily relies on the future advancement of deep learning and machine learning, where it is anticipated to increase in its importance within artificial intelligence. The findings of this paper affirm the necessity to advance the studies of the specific areas of artificial intelligence proposed and call for interdisciplinarity to harness the potential of artificial intelligence for computer science.

Permutation is a fundamental combinatorial object appeared in various areas in mathematics, computer science, and artificial intelligence. In some applications, a subset of a permutation group must be maintained efficiently. In this study, we develop a new data structure, called group decision diagram (GDD), to maintain a set of permutations. This data structure combines the zero-suppressed binary decision diagram with the computable subgroup chain of the permutation group. The data structure enables efficient operations, such as membership testing, set operations (e.g., union, intersection, and difference), and Cartesian product. Our experiments demonstrate that the data structure is efficient (i.e., 20–300 times faster) than the existing methods when the permutation group is considerably smaller than the symmetric group, or only subsets constructed by a few operations over generators are maintained.

Machine Learning is a modern and actively developing field of computer science, devoted to extracting and estimating dependencies from empirical data. It combines such fields as statistics, optimization theory and artificial intelligence. In practical tasks, the general aim of Machine Learning is to construct algorithms able to generalize and predict in previously unseen situations based on some set of examples. Given some finite information, Machine Learning provides ways to exract knowledge, describe, explain and predict from data. Kernel Methods are one of the most successful branches of Machine Learning. They allow applying linear algorithms with well-founded properties such as generalization ability, to non-linear real-life problems. Support Vector Machine is a well-known example of a kernel method, which has found a wide range of applications in data analysis nowadays. In many practical applications, some additional prior knowledge is often available. This can be the knowledge about the data domain, invariant transformations, inner geometrical structures in data, some properties of the underlying process, etc. If used smartly, this information can provide significant improvement to any data processing algorithm. Thus, it is important to develop methods for incorporating prior knowledge into data-dependent models. The main objective of this thesis is to investigate approaches towards learning with kernel methods using prior knowledge. Invariant learning with kernel methods is considered in more details. In the first part of the thesis, kernels are developed which incorporate prior knowledge on invariant transformations. They apply when the desired transformation produce an object around every example, assuming that all points in the given object share the same class. Different types of objects, including hard geometrical objects and distributions are considered. These kernels were then applied for images classification with Support Vector Machines. Next, algorithms which specifically include prior knowledge are considered. An algorithm which linearly classifies distributions by their domain was developed. It is constructed such that it allows to apply kernels to solve non-linear tasks. Thus, it combines the discriminative power of support vector machines and the well-developed framework of generative models. It can be applied to a number of real-life tasks which include data represented as distributions. In the last part of the thesis, the use of unlabelled data as a source of prior knowledge is considered. The technique of modelling the unlabelled data with a graph is taken as a baseline from semi-supervised manifold learning. For classification problems, we use this apporach for building graph models of invariant manifolds. For regression problems, we use unlabelled data to take into account the inner geometry of the input space. To conclude, in this thesis we developed a number of approaches for incorporating some prior knowledge into kernel methods. We proposed invariant kernels for existing algorithms, developed new algorithms and adapted a technique taken from semi-supervised learning for invariant learning. In all these cases, links with related state-of-the-art approaches were investigated. Several illustrative experiments were carried out on real data on optical character recognition, face image classification, brain-computer interfaces, and a number of benchmark and synthetic datasets.

Artificial Intelligence in the American Healthcare Industry: Looking Forward to 2030

Missing data in test result tables can significantly impact the analysis quality, especially in relation to technical sciences, where the mechanism generating missing data is often non-random, and their presence depends on the non-observed part of studied variables. In such cases, the application of an inappropriate method for dealing with missing data will lead to bias in the estimated distribution parameters. The article presents a relatively simple method to implement in dealing with missing data generated as a result of the MNAR mechanism, which utilizes the censored random variable. This procedure does not modify the variable distribution form, which is why it ensures objective and efficient estimation of distribution parameters within studies affected by certain restrictions of technical or physical nature (censored distribution), with a relatively low workload. Furthermore, it does not require the application of specialized software. A prerequisite for using this method is the knowledge of the frequency and cause of missing data. The method for estimating the random variable censored distribution parameters was shown based on the example of studying the leachability of selected heavy metals from a hardening slurry. The analysis results were compared with classical methods for dealing with missing data, such as, ignoring missing data observations (listwise or pairwise deletion), single imputation and stochastic regressive imputation.

A regression model is considered in which the response variable has the generalized log-gamma distribution. Bias approximations for the maximum likelihood estimators of the regression coefficients and scale parameter are presented. The estimator of the scale parameter has a negative bias, which becomes increasingly marked as the number of regressor variates increases. A bias-corrected estimator is proposed that has improved mean squared error properties provided there is at least one regressor variate. Approximations to the percentiles of the unconditional distributions of pivotal random variables used for statistical inference for the parameters in the log-gamma regression model are proposed and evaluated for the normal error and Type I extreme-value error models. The results suggest that bias correction for the estimate of the scale parameter will be important in small samples for all densities in the log-gamma family.

Artificial intelligence (AI) is a rapidly evolving field that has seen tremendous growth in recent years. In this chapter, the authors provide an overview of current trends in AI and their applications in computer science. They also discuss the future directions of AI research and their potential impact on the field of computer science. They start by introducing the basic concepts of AI and its various subfields. Then, they present an overview of current trends in AI research, including machine learning, natural language processing, computer vision, and robotics. The authors discuss how these trends are applied in computer science, such as autonomous vehicles, fraud detection, and personalized medicine. Finally, they discuss the future directions of AI research, including the development of more explainable AI systems, the integration of AI with other emerging technologies, and the ethical considerations of AI.

The pervasive deployment of Deep Learning models has recently prompted apprehensions regarding their ecological footprint, owing to the exorbitant levels of energy consumption necessitated by the training and inference processes. The term "Red AI" is employed to denote artificial intelligence (AI) models that undergo training using resource-intensive methodologies on very large datasets. This practice can engender substantial energy usage and emissions of carbon, thereby opposing "Green AI." The latter concept alludes to AI models designed for similar efficiency and reduced environmental impact. This objective is realized through the utilization of smaller datasets, less computationally intensive training techniques, or sustainable energy resources. While Red AI prioritizes accuracy and performance, Green AI emphasizes efficiency and sustainability. Given that both paradigms exhibit advantages and limitations, the debates around the topics have burgeoned in the scientific arena, delving into novel algorithms, hardware innovations, and improved data utilization techniques aimed at mitigating the ecological consequences of intricate applications such as GPT and BERT. Nevertheless, due to the relative novelty of this debate, not much effort has been dedicated yet to contextualizing the essence of Red AI and the prospects of Green AI in a coherent framework. Within this context, the present work contributes by meticulously delineating both domains through a multifaceted analysis of their causes and ramifications, described from the points of computer architectures, data structures, and algorithms. Additionally, the study reviews notable instances of study cases based on complex Red AI models. The primary contribution of this article encompasses a comprehensive survey of Red and Green AI, stemming from a selection of the literature performed by the authors, subsequently organized into distinct clusters. These clusters encompass i) articles that qualitatively or quantitatively address the issue of Red AI, identifying Green AI as a plausible remedy, ii) articles offering insights into the environmental impact associated with the deployment of extensive Deep Learning models, and iii) articles introducing the techniques underpinning Green AI, aiming at mitigating the cost of Red AI. The outcome emerging from the analysis performed by this work consists of a compromise between sustainability in contrast to the performance of AI tools. Unless the complex training and inference procedures of software models mitigate their environmental impact, it will be necessary to decrease the level of accuracy of production systems, inevitably conflicting with the objective of the major AI vendors. The outcomes of this work would be beneficial to scholars pursuing intricate Deep Learning architectures in scientific research, as well as AI enterprises struggling with the protracted training demands of commercial products within the realms of Computer Vision and Natural Language Processing.