Search

Pre-evaluating scientific paper quality aids in alleviating peer review pressure and fostering scientific advancement. Although prior studies have identified numerous quality-related features, their effectiveness and representativeness of paper content remain to be comprehensively investigated. Addressing this issue, we propose a content-based interpretable method for pre-evaluating the quality of scientific papers. Firstly, we define quality attributes of computer science (CS) papers as integrity , clarity , novelty , and significance , based on peer review criteria from 11 top-tier CS conferences. We formulate the problem as two classification tasks: Accepted/Disputed/Rejected (ADR) and Accepted/Rejected (AR). Subsequently, we construct fine-grained features from metadata and knowledge entity networks, including text structure, readability, references, citations, semantic novelty, and network structure. We empirically evaluate our method using the ICLR paper dataset, achieving optimal performance with the Random Forest model, yielding F1 scores of 0.715 and 0.762 for the two tasks, respectively. Through feature analysis and case studies employing SHAP interpretable methods, we demonstrate that the proposed features enhance the performance of machine learning models in scientific paper quality evaluation, offering interpretable evidence for model decisions. • Define four criteria for quality evaluation of scientific papers: integrity, clarity, novelty, and significance. • Propose a framework for quality evaluation of scientific papers based on coarse features and knowledge entity network. • An effective algorithm for measuring the novelty and significance of scientific papers based on knowledge entity networks. • Create and release a rigorous dataset, which could serve as the gold standard for quality evaluation of scientific papers. • Conduct extensive experiments to validate the effectiveness of the proposed framework. [ABSTRACT FROM AUTHOR]

Science as a whole is organized into broad fields, and as a consequence, research, resources, students, etc., are also classified, assigned, or invited following a similar structure. Some fields have been established for centuries, and some others are just flourishing. Funding, staff, etc., to support fields are offered if there is some activity on it, commonly measured in terms of the number of published scientific papers. How to find them? There exist well-respected listings where scientific journals are ascribed to one or more knowledge fields. Such lists are human-made, but the complexity begins when a field covers more than one area of knowledge. How to discern if a particular paper is devoted to a field not considered in such lists? In this work, we propose a methodology able to classify the universe of papers into two classes; those belonging to the field of interest, and those that do not. This proposed procedure learns from the title and abstract of papers published in monothematic or "pure" journals. Provided that such journals exist, the procedure could be applied to any field of knowledge. We tested the process with Geographic Information Science. The field has contacts with Computer Science, Mathematics, Cartography, and others, a fact which makes the task very difficult. We also tested our procedure and analyzed its results with three different criteria, illustrating its power and capabilities. Interesting findings were found, where our proposed solution reached similar results as human taggers also similar results compared with state-of-the-art related work. [ABSTRACT FROM AUTHOR]

The article discusses the intersection of machine learning and the law, highlighting how machine learning is revolutionizing social life and impacting legal processes. It explores various research topics, such as law as data, predictive policing, and machine learning decision-aids for judicial decision-making. The article also examines the advantages and limitations of using machine learning in legal research, including the reproducibility of results and the potential for bias in algorithms. Overall, the symposium aimed to foster interdisciplinary exchange and explore the ways in which machine learning can contribute to legal scholarship and empirical legal research. [Extracted from the article]

"Multi-agent systems (MAS)" have been extensively studied across various fields, including robotics, economics, biology, and computer science. A distinctive feature of these systems is the ability of multiple agents, each with different characteristics, to perform system-wide tasks through local bottom-up interactions. Furthermore, design and control methods for system networks based on graph theory are being developed. Recent applications of these methods include autonomous driving technology, smart grids, and understanding social systems. This special issue aims to deepen the understanding of MAS, focusing on their control and applications. It features 16 papers, including one review paper. The accepted papers cover a wide range of topics, including reinforcement learning, autonomous mobility systems, and machine learning, presenting the latest research findings on MAS. These studies provide valuable insights into various aspects and potential applications of MAS. We hope that this issue will be beneficial to our readers and contribute to the advancement of future research. [ABSTRACT FROM AUTHOR]

Large language models are transforming scientific writing and publishing. But the productivity boost that these tools bring could have a downside. [ABSTRACT FROM AUTHOR]

Finding methods to teach sorting algorithms is a challenge for most Computer Science teachers, but also for students who are open to learn and search for information. Because nowadays students are very receptive to educational software, we want to introduce our instrument named ALSort – a software designed for teachers and students interested in the instructional process of sorting algorithms. ALSort is an educational software based on gamification and modelling. It is built on six stages of challenges related to the six levels of learning from the Revised Bloom Taxonomy and the version from this paper is a prototype. [ABSTRACT FROM AUTHOR]

With the tremendous increase in human population the demand of milk and meat is also increasing. This necessitates the centralization of animal husbandry sector both in developed and developing countries. More production has to be taken from fewer animals which seem to be possible only with the usage of advanced technologies. Earlier this seems to be impractical due to non-availability of such technologies to the farmers. Nowadays, computational power is very cheap and easily available. Artificial intelligence is one such field of computer science devoted to creating computing machines and systems that perform operations analogous to human learning and decision-making. Artificial intelligence includes the machine learning, deep learning and predictive analytics. With the implementation of various software and algorithms, the production has been increased from the farm animals along with better management and welfare. This paper illustrates the application domains and maneuvering of artificial intelligence in the animal husbandry sector. [ABSTRACT FROM AUTHOR]

ChatGPT, a recently developed product by openAI, is successfully leaving its mark as a multi-purpose natural language based chatbot. In this paper, we are more interested in analyzing its potential in the field of computational biology. A major share of work done by computational biologists these days involve coding up bioinformatics algorithms, analyzing data, creating pipelining scripts and even machine learning modeling and feature extraction. This paper focuses on the potential influence (both positive and negative) of ChatGPT in the mentioned aspects with illustrative examples from different perspectives. Compared to other fields of computer science, computational biology has (1) less coding resources, (2) more sensitivity and bias issues (deals with medical data), and (3) more necessity of coding assistance (people from diverse background come to this field). Keeping such issues in mind, we cover use cases such as code writing, reviewing, debugging, converting, refactoring, and pipelining using ChatGPT from the perspective of computational biologists in this paper. [ABSTRACT FROM AUTHOR]

With the increase interest and number of the users in Social media, the file handling has also increased. To manage the load, cloud servers are being used by the service providers. To identify and cluster file is a difficult task that is important in the domain of computer science. Various traditional approaches for identification exists that uses design features. The problem with these methods is get that they can be easily spoofed. To resolve the issue, in this paper, a hybrid algorithm combining the features of Random Forest with AdaBoost is proposed. The algorithm Internet of Thing (IoT) data file formatting (IDFF) classifies data as (text, image, audio and video) and gives better accuracy. Our proposed research obtains better Accuracy (93%), Precision (95%), Recall (95%), F-Measure (95%), and G-Mean (96%). [ABSTRACT FROM AUTHOR]

The integration of biology, computer science, and statistics has given rise to the interdisciplinary field of bioinformatics, which aims to decode biological intricacies. It produces extensive and diverse features, presenting an enormous challenge in classifying bioinformatic problems. Therefore, an intelligent bioinformatics classification system must select the most relevant features to enhance machine learning performance. This paper proposes a feature selection model based on the fractal concept to improve the performance of intelligent systems in classifying high-dimensional biological problems. The proposed fractal feature selection (FFS) model divides features into blocks, measures the similarity between blocks using root mean square error (RMSE), and determines the importance of features based on low RMSE. The proposed FFS is tested and evaluated over ten high-dimensional bioinformatics datasets. The experiment results showed that the model significantly improved machine learning accuracy. The average accuracy rate was 79% with full features in machine learning algorithms, while FFS delivered promising results with an accuracy rate of 94%. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Chinese Institute of Food Science & Technology is the property of Journal of Chinese Institute of Food Science & Technology Periodical Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The increasing demand for mobility in our society poses various challenges to traffic engineering, computer science in general, and artificial intelligence in particular. Increasing the capacity of road networks is not always possible, thus a more efficient use of the available transportation infrastructure is required. Another issue is that many problems in traffic management and control are inherently decentralized and/or require adaptation to the traffic situation. Hence, there is a close relationship to multiagent reinforcement learning. However, using reinforcement learning poses the challenge that the state space is normally large and continuous, thus it is necessary to find appropriate schemes to deal with discretization of the state space. To address these issues, a multiagent system with agents learning independently via a learning algorithm was proposed, which is based on estimating Q-values from k-nearest neighbors. In the present paper, we extend this approach and include transfer of experiences among the agents, especially when an agent does not have a good set of k experiences. We deal with traffic signal control, running experiments on a traffic network in which we vary the traffic situation along time, and compare our approach to two baselines (one involving reinforcement learning and one based on fixed times). Our results show that the extended method pays off when an agent returns to an already experienced traffic situation. [ABSTRACT FROM AUTHOR]

Alternating direction method of multipliers (ADMM) receives much attention in the field of optimization and computer science, etc. The generalized ADMM (G-ADMM) proposed by Eckstein and Bertsekas incorporates an acceleration factor and is more efficient than the original ADMM. However, G-ADMM is not applicable in some models where the objective function value (or its gradient) is computationally costly or even impossible to compute. In this paper, we consider the two-block separable convex optimization problem with linear constraints, where only noisy estimations of the gradient of the objective function are accessible. Under this setting, we propose a stochastic linearized generalized ADMM (called SLG-ADMM) where two subproblems are approximated by some linearization strategies. And in theory, we analyze the expected convergence rates and large deviation properties of SLG-ADMM. In particular, we show that the worst-case expected convergence rates of SLG-ADMM are $\mathcal{O}\left({{N}^{-1/2}}\right)$ and $\mathcal{O}\left({\ln N} \cdot {N}^{-1}\right)$ for solving general convex and strongly convex problems, respectively, where N is the iteration number, similarly hereinafter, and with high probability, SLG-ADMM has $\mathcal{O}\left (\ln N \cdot N^{-1/2} \right) $ and $\mathcal{O}\left (\left (\ln N \right)^{2} \cdot N^{-1} \right) $ constraint violation bounds and objective error bounds for general convex and strongly convex problems, respectively. [ABSTRACT FROM AUTHOR]

Generative AI models are now widely accessible, enabling everyone to create their own machine-made something. But these models can collapse if their training data sets contain too much AI-generated content.Generative-AI models collapse when trained recursively. [ABSTRACT FROM AUTHOR]

The number of errors produced by an LLM can be reduced by grouping its outputs into semantically similar clusters. Remarkably, this task can be performed by a second LLM, and the method’s efficacy can be evaluated by a third.Confabulations detected by clustering semantically similar LLM responses. [ABSTRACT FROM AUTHOR]

This paper introduces a novel perspective to significantly mitigate catastrophic forgetting in continuous learning (CL), which emphasizes models' capacity to preserve existing knowledge and assimilate new information. Current replay-based methods treat every task and data sample equally and thus can not fully exploit the potential of the replay buffer.In response, we propose COgnitive REplay (CORE), which draws inspiration from human cognitive review processes. CORE includes two key strategies: Adaptive Quantity Allocation and Quality-Focused Data Selection. The former adaptively modulates the replay buffer allocation for each task based on its forgetting rate, while the latter guarantees the inclusion of representative data that best encapsulates the characteristics of each task within the buffer. Our approach achieves an average accuracy of 37.95\% on split-CIFAR10, surpassing the best baseline method by 6.52\%. Additionally, it significantly enhances the accuracy of the poorest-performing task by 6.30\% compared to the top baseline. Code is available at https://github.com/sterzhang/CORE.

Patient-based real-time QC (PBRTQC) uses patient-derived data to assess assay performance. PBRTQC algorithms have advanced in parallel with developments in computer science and the increased availability of more powerful computers. The uptake of Artificial Intelligence in PBRTQC has been rapid, with many stated advantages over conventional approaches. However, until this review, there has been no critical comparison of these. The PBRTQC algorithms based on moving averages, regression-adjusted real-time QC, neural networks and anomaly detection are described and contrasted. As Artificial Intelligence tools become more available to laboratories, user-friendly and computationally efficient, the major disadvantages, such as complexity and the need for high computing resources, are reduced and become attractive to implement in PBRTQC applications. [ABSTRACT FROM AUTHOR]

The eight papers included in this special issue represent a selection of extended contributions presented at the 17th International Conference on Soft Computing Models in Industrial and Environmental Applications, SOCO 2022 held in Salamanca, Spain, September 6th-8th, 2022, and organized by the BISITE group at University of Salamanca. SOCO 2022 international conference represents a collection or set of computational techniques in machine learning, computer science and some engineering disciplines which investigate, simulate, and analyse very complex issues and phenomena. This special issue is aimed at practitioners, researchers, and postgraduate students who are engaged in developing and applying advanced intelligent systems principles to solve real-world problems in the mentioned fields. [ABSTRACT FROM AUTHOR]

Criticism of our decision to publish AlphaFold3 raises important questions. We welcome readers’ views. [ABSTRACT FROM AUTHOR]

Artificial intelligence (AI) techniques are increasingly applied across various domains, favoured by the growing acquisition and public availability of large, complex datasets. Despite this trend, AI publications often suffer from lack of reproducibility and poor generalisation of findings, undermining scientific value and contributing to global research waste. To address these issues and focusing on the learning aspect of the AI field, we present RENOIR (REpeated random sampliNg fOr machIne leaRning), a modular open-source platform for robust and reproducible machine learning (ML) analysis. RENOIR adopts standardised pipelines for model training and testing, introducing elements of novelty, such as the dependence of the performance of the algorithm on the sample size. Additionally, RENOIR offers automated generation of transparent and usable reports, aiming to enhance the quality and reproducibility of AI studies. To demonstrate the versatility of our tool, we applied it to benchmark datasets from health, computer science, and STEM (Science, Technology, Engineering, and Mathematics) domains. Furthermore, we showcase RENOIR's successful application in recently published studies, where it identified classifiers for SET2D and TP53 mutation status in cancer. Finally, we present a use case where RENOIR was employed to address a significant pharmacological challenge—predicting drug efficacy. RENOIR is freely available at https://github.com/alebarberis/renoir. [ABSTRACT FROM AUTHOR]

Artificial neural networks become incapable of mastering new skills when they learn them one after the other. Researchers have only scratched the surface of why this phenomenon occurs — and how it can be fixed.Continual learning breaks down for some artificial neural networks. [ABSTRACT FROM AUTHOR]

Some researchers see superhuman qualities in artificial intelligence. All scientists need to be alert to the risks this creates. [ABSTRACT FROM AUTHOR]

A critical worldwide problem is that ransomware cyberattacks can be costly to organizations. Moreover, accidental employee cybercrime risk can be challenging to prevent, even by leveraging advanced computer science techniques. This exploratory project used a novel cognitive computing design with detailed explanations of the action-research case-study methodology and customized machine learning (ML) techniques, supplemented by a workflow diagram. The ML techniques included language preprocessing, normalization, tokenization, keyword association analytics, learning tree analysis, credibility/reliability/validity checks, heatmaps, and scatter plots. The author analyzed over 8 GB of employee behavior big data from a multinational Fintech company global intranet. The five-factor personality theory (FFPT) from the psychology discipline was integrated into semi-supervised ML to classify retrospective employee behavior and then identify cybercrime risk. Higher levels of employee neuroticism were associated with a greater organizational cybercrime risk, corroborating the findings in empirical publications. In stark contrast to the literature, an openness to new experiences was inversely related to cybercrime risk. The other FFPT factors, conscientiousness, agreeableness, and extroversion, had no informative association with cybercrime risk. This study introduced an interdisciplinary paradigm shift for big data cognitive computing by illustrating how to integrate a proven scientific construct into ML—personality theory from the psychology discipline—to analyze human behavior using a retrospective big data collection approach that was asserted to be more efficient, reliable, and valid as compared to traditional methods like surveys or interviews. [ABSTRACT FROM AUTHOR]

Educational data mining is widely deployed to extract valuable information and patterns from academic data. This research explores new features that can help predict the future performance of undergraduate students and identify at-risk students early on. It answers some crucial and intuitive questions that are not addressed by previous studies. Most of the existing research is conducted on data from 2-3 years in an absolute grading scheme. We examined the effects of historical academic data of 15 years on predictive modelling. Additionally, we explore the performance of undergraduate students in a relative grading scheme and examine the effects of grades in core courses and initial semesters on future performances. As a pilot study, we analyzed the academic performance of Computer Science university students. Many exciting discoveries were made; the duration and size of the historical data play a significant role in predicting future performance, mainly due to changes in curriculum, faculty, society, and evolving trends. Furthermore, predicting grades in advanced courses based on initial pre-requisite courses is challenging in a relative grading scheme, as students' performance depends not only on their efforts but also on their peers. In short, educational data mining can come to the rescue by uncovering valuable insights from academic data to predict future performances and identify the critical areas that need significant improvement. [ABSTRACT FROM AUTHOR]

Autosomal recessive cerebellar ataxias (ARCAs) are a heterogeneous group of neurodegenerative disorders affecting primarily the cerebellum and/or its afferent tracts, often accompanied by damage of other neurological or extra-neurological systems. Due to the overlap of clinical presentation among ARCAs and the variety of hereditary, acquired, and reversible etiologies that can determine cerebellar dysfunction, the differential diagnosis is challenging, but also urgent considering the ongoing development of promising target therapies. The examination of afferent and efferent visual system may provide neurophysiological and structural information related to cerebellar dysfunction and neurodegeneration thus allowing a possible diagnostic classification approach according to ocular features. While optic coherence tomography (OCT) is applied for the parametrization of the optic nerve and macular area, the eye movements analysis relies on a wide range of eye-tracker devices and the application of machine-learning techniques. We discuss the results of clinical and eye-tracking oculomotor examination, the OCT findings and some advancing of computer science in ARCAs thus providing evidence sustaining the identification of robust eye parameters as possible markers of ARCAs. [ABSTRACT FROM AUTHOR]

In computer network security, the escalating use of computer networks and the corresponding increase in cyberattacks have propelled Intrusion Detection Systems (IDSs) to the forefront of research in computer science. IDSs are a crucial security technology that diligently monitor network traffic and host activities to identify unauthorized or malicious behavior. This study develops highly accurate models for detecting a diverse range of cyberattacks using the fewest possible features, achieved via a meticulous selection of features. We chose 5, 9, and 10 features, respectively, using the Artificial Bee Colony (ABC), Flower Pollination Algorithm (FPA), and Ant Colony Optimization (ACO) feature-selection techniques. We successfully constructed different models with a remarkable detection accuracy of over 98.8% (approximately 99.0%) with Ant Colony Optimization (ACO), an accuracy of 98.7% with the Flower Pollination Algorithm (FPA), and an accuracy of 98.6% with the Artificial Bee Colony (ABC). Another achievement of this study is the minimum model building time achieved in intrusion detection, which was equal to 1 s using the Flower Pollination Algorithm (FPA), 2 s using the Artificial Bee Colony (ABC), and 3 s using Ant Colony Optimization (ACO). Our research leverages the comprehensive and up-to-date CSE-CIC-IDS2018 dataset and uses the preprocessing Discretize technique to discretize data. Furthermore, our research provides valuable recommendations to network administrators, aiding them in selecting appropriate machine learning algorithms tailored to specific requirements. [ABSTRACT FROM AUTHOR]

Loss functions measure algorithmic errors in artificial-intelligence models, but there’s more than one way to do that. Here’s why the right function is so important. [ABSTRACT FROM AUTHOR]

The Boolean satisfiability problem, a renowned NP-complete challenge in computer science, has recently garnered interest in the Discrete Hopfield Neural Network - Satisfiability model. This model adeptly integrates logical rules into Hopfield networks, excelling in locating global minima for traditional SAT problems. However, it faces efficiency challenges when dealing with SAT problems characterized by dynamic evolution constraints due to its static network architecture. During dynamic evolution iterations, there is a significant exponential increase in the computational costs due to redundant and repetitive computations. In order to address this challenge, this paper introduces a dynamic evolution variant of the Discrete Hopfield Neural Network - Satisfiability model. In extensive simulation experiments, we progressively augmented the number of constraint clauses from 1 to 1500, seeking global minima for CNF problems. The proposed model exhibited congruent performance with the traditional model, achieving a Global Minimum Ratio of 1 and a Hamming distance of 0. Crucially, the proposed model minimized CPU utilization and neared zero error metrics, while the traditional model experienced exponential CPU and error metric escalation. These outcomes affirm the proposed model's robust global search capabilities and high precision, aligning with the traditional model. Furthermore, owing to this model's incorporation of not only temporal constraint increment operator but also innovative real-time learning techniques and clever integration methods, along with the establishment of a novel real-time decision mechanism, the proposed model effectively addresses the issues of redundancy and repeated calculations inherent in traditional models. This results in a stable and significantly improved computational speed. Additionally, this model's dynamic evolution network architecture is specifically designed to accommodate arbitrary and efficient extensions of dynamic constraints, while also featuring a built-in preprocessing function to filter out duplicate variables. In the future, as a dynamic evolution processor, this model exhibits immense potential for solving large-scale SAT problems with dynamic evolution constraints and holds broad application prospects in emerging fields such as automated reasoning, intelligent recommendation systems, and machine learning. [ABSTRACT FROM AUTHOR]

This article discusses a study on designing a fake news detection system using machine learning models. The study found that the Decision Tree model was the most efficient in accurately detecting fake news, with an accuracy of 99.64%. The article emphasizes the importance of detecting fake news and provides a detailed methodology for the study. The research aims to raise awareness about fake news and contribute to its eradication in society. [Extracted from the article]

Starting from the contribution of such thinkers as the famous Giordano Bruno (1583) and the great mathematician and physicist Henri Poincaré (1889) and the surprising discovery of the meteorologist Edward Lorenz (1963), we consider the expansion of the mathematics of chaos in this article, paying attention to topology, qualitative geometry, and Catastrophe Theory, on the one hand, and addressing the possibilities derived from the new Computer Science as Quantum Algorithms and the advances in Artificial Intelligence, on the other. We especially highlight the section on computing chaos, which we consider to be new calculation and analysis instruments, such as machine learning and its algorithm called reservoir computing, through which we can know the dynamics of a chaotic system. With past data, with equations like Karamoto–Sivashinsky, one can improve predictions of the system eight times further ahead than in previous methods. Integrating the machine learning approach and traditional model-based prediction, one could obtain accurate predictions twelve Lyapunov times. As we know, in the framework of chaos theory, it is habitually accepted that the idea of long-term prediction seems impossible because we live under a veil of uncertainty. But with technological advances, the landscape begins to change, both in chaos theory and in its applications, especially in the field of economics, to which we devote particular attention, carrying out as an example the analysis of the evolution of the Madrid Stock Exchange in the 2006–2013 crisis. Above all this, a reflection of a general nature is necessary to enlighten us on the possibility of opening a new horizon. [ABSTRACT FROM AUTHOR]

Generative Artificial Intelligence (AI) is one of the most exciting developments in Computer Science of the last decade. At the same time, Reinforcement Learning (RL) has emerged as a very successful paradigm for a variety of machine learning tasks. In this survey, we discuss the state of the art, opportunities and open research questions in applying RL to generative AI. In particular, we will discuss three types of applications, namely, RL as an alternative way for generation without specified objectives; as a way for generating outputs while concurrently maximizing an objective function; and, finally, as a way of embedding desired characteristics, which cannot be easily captured by means of an objective function, into the generative process. We conclude the survey with an in-depth discussion of the opportunities and challenges in this fascinating emerging area. [ABSTRACT FROM AUTHOR]

Automated Machine Learning (AutoML) tools are revolutionizing the field of machine learning by significantly reducing the need for deep computer science expertise. Designed to make ML more accessible, they enable users to build high-performing models without extensive technical knowledge. This study delves into these tools in the context of time series analysis, which is essential for forecasting future trends from historical data. We evaluate three prominent AutoML tools—AutoGluon, Auto-Sklearn, and PyCaret—across various metrics, employing diverse datasets that include Bitcoin and COVID-19 data. The results reveal that the performance of each tool is highly dependent on the specific dataset and its ability to manage the complexities of time series data. This thorough investigation not only demonstrates the strengths and limitations of each AutoML tool but also highlights the criticality of dataset-specific considerations in time series analysis. Offering valuable insights for both practitioners and researchers, this study emphasizes the ongoing need for research and development in this specialized area. It aims to serve as a reference for organizations dealing with time series datasets and a guiding framework for future academic research in enhancing the application of AutoML tools for time series forecasting and analysis. [ABSTRACT FROM AUTHOR]

Artificial-intelligence models are typically used online, but a host of openly available tools is changing that. Here’s how to get started with local AIs. [ABSTRACT FROM AUTHOR]

Companies are using artificial intelligence tools to help scientists to query their data without the need for programming skills. [ABSTRACT FROM AUTHOR]

More than 7,000 languages are in use throughout the world, but popular translation tools cannot deal with most of them. A translation model that was tested on under-represented languages takes a key step towards a solution. Under-resourced languages incorporated into machine-translation model. [ABSTRACT FROM AUTHOR]

Researchers say their artificial-intelligence system could help to democratize medicine. [ABSTRACT FROM AUTHOR]