Search

The rapid development of the Internet leads to the rapid growth of network information, we call it information explosion. The Internet is full of information, and it is difficult for users to find this information and useful knowledge of the ocean. The Web has become the world's largest information repository, and there is an urgent need for efficient access to the valuable knowledge of vast amounts of web information. The purpose of this paper is to study the process and algorithm analysis of text mining system based on artificial intelligence. This paper presents an algorithm of document feature acquisition based on genetic algorithm. Selecting suitable features is an important task in specific text classification and information retrieval. Finding appropriate feature vectors to represent the text will undoubtedly help with subsequent sorting and grouping. Based on the genetic algorithm of variable length chromosome, this paper improves the crossover, mutation and selection operations, and proposes an algorithm to obtain text feature vectors. This method has a wide range of applications and good results. [ABSTRACT FROM AUTHOR]

With the rapid growth of social economy, the requirements for resource utilization are becoming higher and higher. How to effectively solve the problem of energy shortage has become a hot topic. However, there are still many deficiencies in the current resource scheduling algorithm. For example, for different types of satellites with different needs and requirements, their performance indicators are different, and in the satellite communication system, the interaction between multiple nodes needs to be considered. Therefore, this paper studies the artificial intelligence algorithm, and proposes an improved particle complementary scheduling strategy for a single user in view of the shortcomings of the existing particle swarm optimization (PSO) algorithm. On this basis, this paper applies this method to evaluate the system performance and verify its effectiveness. The verification results show that the utilization efficiency of the satellite communication system resource scheduling algorithm is above 93%. [ABSTRACT FROM AUTHOR]

Rao algorithms that include three algorithms are very simple and parameter-less algorithms with effective and desirable performance. This paper modifies these three algorithms, merges them, and establishes a powerful group algorithm. In the first optimization step, the suggested algorithm is tested on 30 standard CEC2014 functions with 50 dimensions to compare it with main algorithms, several well-known algorithms, and modified versions of RAO algorithm. It becomes evident in the first test that the suggested optimizer is effective, and reliable for optimization of real-parameter functions, and it has shown its superiority to original RAO algorithm and several modern and modified versions of RAO algorithms for most of the test functions and achieved more acceptable results than them. Moreover, the suggested algorithm benefits a faster convergence characteristic than original RAO algorithms. The proposed Colonial Competitive RAO (CCRAO) has been applied on five popular engineering problems and its results have been compared with those of recent papers. According to the results, CCRAO is an effective, robust, and reliable optimizer for engineering design problems and can contain all useful features of RAO algorithms altogether. CCRAO has succeeded to converge to the best solution for these engineering problems and surpasses most of the other algorithms. [ABSTRACT FROM AUTHOR]

• Proposes an improved YOLOv5s model which combines the GIoU, Mish, and CBAM modules. • The improved algorithm can effectively detect different-size insulator defects under different environmental backgrounds. • The AP value in detecting insulator defects can be improved by 5 %. As one of the most important components on the transmission line, the insulator is prone to failure, which affects the safe operation of electrical power system. Hence, it is crucial to accurately detect the insulator defects for further maintenance in time. Recently, with the development of artificial intelligence and target detection algorithms, the insulator defect detection has received more and more attention. However, there are still existing some difficulties: insufficient samples and low detection accuracy. To improve the accuracy of insulator defect detection, this paper proposes an auto-detection method based on an improved lightweight YOLOv5s model. First, this paper introduces the basic network frame of YOLOv5s and proposes an improved algorithm by utilizing the GIoU loss function, Mish activation function, and CBAM module. Then, performs data enhancement in the insulator dataset to enhance the robustness of the model. Finally, trains and tests the improved YOLOv5s model, and compares it with traditional target detection algorithms. Compared with traditional target detection algorithms, the AP value of the proposed algorithm in detecting insulator defects can be improved by 5 %. The results demonstrate the improved algorithm proposed in this paper can effectively identify and position the insulator defects. [ABSTRACT FROM AUTHOR]

Deep learning models have achieved high performance across different domains, such as medical decision-making, autonomous vehicles, decision support systems, among many others. However, despite this success, the inner mechanisms of these models are opaque because their internal representations are too complex for a human to understand. This opacity makes it hard to understand the how or the why of the predictions of deep learning models. There has been a growing interest in model-agnostic methods that make deep learning models more transparent and explainable to humans. Some researchers recently argued that for a machine to achieve human-level explainability, this machine needs to provide human causally understandable explanations, also known as causability. A specific class of algorithms that have the potential to provide causability are counterfactuals. This paper presents an in-depth systematic review of the diverse existing literature on counterfactuals and causability for explainable artificial intelligence (AI). We performed a Latent Dirichlet topic modelling analysis (LDA) under a Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) framework to find the most relevant literature articles. This analysis yielded a novel taxonomy that considers the grounding theories of the surveyed algorithms, together with their underlying properties and applications to real-world data. Our research suggests that current model-agnostic counterfactual algorithms for explainable AI are not grounded on a causal theoretical formalism and, consequently, cannot promote causability to a human decision-maker. Furthermore, our findings suggest that the explanations derived from popular algorithms in the literature provide spurious correlations rather than cause/effects relationships, leading to sub-optimal, erroneous, or even biased explanations. Thus, this paper also advances the literature with new directions and challenges on promoting causability in model-agnostic approaches for explainable AI. • A survey on model-agnostic counterfactual approaches for XAI. • A novel taxonomy for model-agnostic counterfactual approaches for XAI. • A set of properties for causability systems for XAI. • Opportunities and challenges for causability systems based on modelagnostic counterfactual approaches. [ABSTRACT FROM AUTHOR]

The development of stereo matching algorithm is still one of the challenging problems, especially in ill-posed regions. Hence, this article presents a survey on the algorithm frameworks related to the stereo matching algorithm. Based on the early survey that had been conducted, two major frameworks available in current stereo matching algorithm development, they are traditional and artificial intelligence (AI) frameworks. Most of the traditional methods are very low accuracy compared to the AI-based approach. This can be observed in the standard benchmarking dataset, such as from the KITTI and the Middlebury, where AI methods rank at the top of the accuracy list. Additionally, the trend for solving computer vision problems uses AI or machine learning tools that become more apparent in recent years. Thus, this paper is focusing on the survey between the deep learning frameworks, which is one of the machine learning tools related to the convolutional neural network (CNN). Several mixed approaches between CNN based method and traditional handcraft method, as well as the end to end CNN method also discussed in this paper. [ABSTRACT FROM AUTHOR]

In the last years, the massive deployment of new photovoltaic (PV) power plants has launched the connection of PV inverters to the electrical network. A single medium-sized ground-mounted PV plant may have thousands of these inverters linked to the grid and even more PV panels on the DC side. Upon reaching such a substantial magnitude of devices involved in grid-connected installations, the effective operation, management, predictive maintenance, and fault detection becomes increasingly challenging without integrating advanced prediction and automated anomaly detection systems. Artificial intelligence algorithms, grounded in data measurements, can be pivotal in addressing this challenge. This paper proposes several regression-based methods to predict PV plants' energy generation, which is useful for detecting transient and long-term anomalies. These models are trained using a Recursive Least Squares (RLS) method and require a minimum number of variables to yield satisfactory outcomes, which is one of the paper's contributions. They mainly rely on energy generation measurements and geolocation. Within the scope of this research, two distinct algorithms have been implemented and validated. The first algorithm, a simplified model, is engineered to analyse the daily efficiency variation, prioritizing the identification of faults and abnormal operational profiles in PV plants. On the other hand, the second algorithm adopts a more intricate model tailored to facilitate long-term diagnosis, enabling the assessment of PV efficiency degradation. In this work, both algorithms are described and their performance is validated using the historical data from more than 20 PV plants placed in different climatic regions. • Photovoltaic systems' modelling using linear regression models. • Photovoltaic fault detection using linear regression coefficients evaluation. • Automatic fault detection for photovoltaic plants with low sensors' availability. • Short-term and long-term efficiency trend evaluation of photovoltaic plants. [ABSTRACT FROM AUTHOR]

Object detection techniques are the foundation for the artificial intelligence field. This research paper gives a brief overview of the You Only Look Once (YOLO) algorithm and its subsequent advanced versions. Through the analysis, we reach many remarks and insightful results. The results show the differences and similarities among the YOLO versions and between YOLO and Convolutional Neural Networks (CNNs). The central insight is the YOLO algorithm improvement is still ongoing.This article briefly describes the development process of the YOLO algorithm, summarizes the methods of target recognition and feature selection, and provides literature support for the targeted picture news and feature extraction in the financial and other fields. Besides, this paper contributes a lot to YOLO and other object detection literature. [ABSTRACT FROM AUTHOR]

• The current 3D human body reconstruction technology requires a large number of 3D scanning equipment and a complex dynamic capture process, which significantly limits its rapid adoption in these application domains. The purpose of this article is to simplify the process of 3D reconstruction. • By combining deep learning methods, an end-to-end 3D human body reconstruction framework is proposed to achieve the goal of reconstructing a high-precision 3D human body model based on RGB images. [Display omitted] In recent years, with the improvement of artificial intelligence technology, it has become possible to reconstruct high-precision 3D human body models based on ordinary RGB images. The current 3D human body reconstruction technology requires complex external equipment to scan all angles of the human body, which is complicated to be implemented and cannot be popularized. In order to solve this problem, this paper applies deep learning models on reconstructing 3D human body based on monocular images. First of all, this paper uses Stacked Hourglass network to perform convolution operations on monocular images collected from different views. Then Multi-Layer Perceptrons (MLPs) are used to decode the encoded high-level images. The feature codes in the two views(main and side) are fused, and the interior and exterior points are classified by the fusion features, so as to obtain the corresponding 3D occupancy field. At last, the Marching Cube algorithm is used for 3D reconstruction with a specific threshold and then we use Laplace smoothing algorithm to remove artifacts. This paper proposes a dense sampling strategy based on the important joint points of the human body, which has a certain optimization effect on the realization of high-precision 3D reconstruction. The performance of the proposed scheme has been validated on the open source datasets, MGN dataset and the THuman dataset, provided by Tsinghua University. The proposed scheme can reconstruct features such as clothing folds, color textures, and facial details,and has great potential to be applied in different applications. [ABSTRACT FROM AUTHOR]

Despite the existence of evidence-based rehabilitation strategies that address biomechanical deficits, the persistence of recurrent ankle problems in 70% of patients with acute ankle sprains highlights the unresolved nature of this issue. Artificial intelligence (AI) emerges as a promising tool to identify definitive predictors for ankle sprains. This paper aims to summarize the use of AI in investigating the ankle biomechanics of healthy and subjects with ankle sprains. Articles published between 2010 and 2023 were searched from five electronic databases. 59 papers were included for analysis with regards to: i). types of motion tested (functional vs. purposeful ankle movement); ii) types of biomechanical parameters measured (kinetic vs kinematic); iii) types of sensor systems used (lab-based vs field-based); and, iv) AI techniques used. Most studies (83.1%) examined biomechanics during functional motion. Single kinematic parameter, specifically ankle range of motion, could obtain accuracy up to 100% in identifying injury status. Wearable sensor exhibited high reliability for use in both laboratory and on-field/clinical settings. AI algorithms primarily utilized electromyography and joint angle information as input data. Support vector machine was the most used supervised learning algorithm (18.64%), while artificial neural network demonstrated the highest accuracy in eight studies. The potential for remote patient monitoring is evident with the adoption of field-based devices. Nevertheless, AI-based sensors are underutilized in detecting ankle motions at risk of sprain. We identify three key challenges: sensor designs, the controllability of AI models, and the integration of AI-sensor models, providing valuable insights for future research. [Display omitted] • Application of sensors and artificial intelligence to analyse ankle biomechanics. • Lab sensors predict parameters, paving the way for post-modern rehabilitation. • Field devices show potential for ankle injury prediction. • Focus on streamlined smart sensors and effective data management in the future. [ABSTRACT FROM AUTHOR]

• A multi-constraint model for impulsive orbital pursuit-evasion game (OPEG) is constructed. • A learning-based algorithm (i.e. PRD-MADDPG) for impulsive OPEG is designed. • The Predict-Reward-Detect (PRD) training framework for improving MADDPG is established. • The PRD-MADDPG performs better than conventional MADDPG in impulsive OPEGs. • The winning mechanism of the game for both players under multiple factors is analyzed. This paper comprehensively investigates the problem of impulsive orbital pursuit-evasion games (OPEGs) by using an artificial intelligence-based approach. First, the mathematical model for the impulsive OPEGs in which the pursuer and evader both perform their orbital maneuvers by imposing the impulsive velocity increments is constructed. Second, the problem of impulsive OPEGs is transformed into a bilateral optimization problem with a minimum–maximum optimization index in terms of terminal time and multiple constraints such as maneuverability, total fuel consumption, and mission time, etc. To determine the optimal impulsive maneuvers for both sides, a PRD-MADDPG (Predict-Reward-Detect Multi-Agent Deep Deterministic Policy Gradient) algorithm in the frame of multi-agent reinforcement learning is designed. This novel algorithm uses the basic MADDPG to achieve the strategies training and learning, and applies the supplemental PRD to predict the change of game state during the interval between two adjacent impulsive maneuvers and incorporate these information into the algorithm training in the form of predicted reward. Finally, some pursuit-evasion missions near the Geosynchronous Earth Orbit are numerically analyzed to verify the validness and effectiveness of the algorithm. The results prove that the PRD-MADDPG algorithm is very efficient to find applicable strategies even considering rather complex constraints. It is also shown that the learning-based strategies can be effectively applied in the extended scenarios which are not seen in the training process. [ABSTRACT FROM AUTHOR]

Intelligent machines are an important carrier of artificial intelligence, which are widely used not only in the industrial field, but also in various fields of daily life and work. Path planning is an important research direction for studying machine intelligence. The main purpose is to search for a feasible path so that the robot can walk along the searched path in a complex environment. This paper aims to study the evolutionary algorithm of intelligent machines based on artificial intelligence. On the basis of introducing the characteristics of artificial potential field algorithm, the concept and characteristics of genetic algorithm, using genetic algorithm as the framework, the artificial potential field algorithm is combined with the crossover of genetic algorithm. In the operator, the optimization performance of the crossover operator is improved. The research results show that the length of the path obtained by the improved algorithm is shorter and better than that of the genetic algorithm of the single-point crossover operator. [ABSTRACT FROM AUTHOR]

This paper presents a Text similarity detection method based on artificial intelligence and natural language processing. The method combines statistical machine learning and deep learning techniques and designs six models from three perspectives: character-level, word-level, and semantic-level. These models include the diff model based on machine learning, cosine similarity model, Jaccard model, TF-IDF model, as well as the SimCSE and SBERT models based on deep learning methods. To fully leverage the characteristics of these models, three scenarios are designed to calculate the similarity scores based on experience and multiple experimental results. The results show that calculating the similarity scores using these three scenarios not only achieves high accuracy but also requires fewer computational resources. As deep learning and natural language processing technologies continue to advance, Text similarity detection methods based on artificial intelligence and natural language processing will continue to be improved and play a more significant role in practice. Future research can explore more models and algorithms to enhance the accuracy and robustness of plagiarism detection. [ABSTRACT FROM AUTHOR]

The peak shear strength of clayey soil-geomembrane interfaces is a vital parameter for the design of relevant engineering infrastructure. However, due to the large number of influence factors and the complex action mechanism, accurate prediction of the peak shear strength for clayey soil-geomembrane interfaces is always a challenge. In this paper, a machine learning model was established by combining Mind Evolutionary Algorithm (MEA) and the ensemble algorithm of Adaptive Boosting Algorithm (ADA)-Back Propagation Artificial Neural Network (BPANN) to predict the peak shear strength of clayey soil-geomembrane interfaces based on the results of 623 laboratory interface direct shear experiments. By comparing with the conventional machine learning algorithms, including Particle Swarm Optimisation Algorithm (PSO) and Genetic Algorithm (GA) tuned ADA-BPANN, MEA tuned Support Vector Machine (SVM) and Random Forest (RF), the superior performance of MEA tuned ADA-BPANN has been validated, with higher predicting precision, shorter training time, and the avoidance of local optimum and overfitting. By adopting the proposed novel model, sensitivity analysis was carried out, which indicates that normal pressure has the largest influence on the peak shear strength, followed by geomembrane roughness. Furthermore, an analytical equation was proposed to assess the peak shear strength that allows the usage of machine learning skills for the practitioners with limited machine learning knowledge. The present research highlights the potential of the MEA tuned ADA-BPANN model as a useful tool to assist in preciously estimating the peak shear strength of clayey soil-geomembrane interfaces, which can provide benefits for the design of relevant engineering applications. • The ensemble artificial intelligence algorithms in predicting the peak shear strength of interfaces is compared. • An analytical equation for estimating the peak shear strength is proposed. • Physical experiments are conducted to validate the effectiveness of the proposed analytical equation. [ABSTRACT FROM AUTHOR]

K-Nearest Neighbors (KNN) are very popular supervised machine learning algorithm which can be effectively used for both multi-class classification and regression utilizing multiple features of the dataset. It trains extremely fast, that is with time complexity of O(n). However, the time complexity for generating results with KNN is O(n3dk) (where k=number of neighbours, d=dimension of data, n=number of training points) and hence it becomes very difficult to work with larger dataset. Although there are parallelizing and distributed computing techniques available for speeding up KNN, it still have limitations on horizontal scalability, fault tolerance and incremental learning capabilities. To solve these issues, the paper presents a KNN inspired novel Supervised Machine Learning algorithm called Distributed Nearest Hash utilizing unique usage of hashmap and primary key clustering order with help of wide column store databases facilitating easy incremental near-realtime scalability to train unlimited datapoints with O(n) time complexity and also predict them in near realtime with O(1) time complexity considering n >> d. This can be readily integrated in any system that uses KNN as a base classifier or regressor. The experimental results shows that the proposed DNH model is 25% faster than state of the art distributed KNN algorithm. Integrating with fuzzy logic the algorithm can be used for several class classification. Using this could aid in building very powerful smart decision making systems with very little computational power. [ABSTRACT FROM AUTHOR]

As language corpora have been playing an increasingly important role in the field of Artificial Intelligence (AI) research, lots of extremely large corpora are created. However, a larger corpora size not only increases power and accuracy but also brings redundancy. Therefore, researchers began to emphasize the study of appropriate subset extraction methods. Due to the trade-off between data sufficiency and redundancy, a group of interesting and challenging problems are emerged that are studied in this paper: (1) How to make the resulting subset include as much data as possible under some necessary constraints? (2) How to preserve the potential useful semantic relatedness included in the original corpora while reducing the size of the corpora? For these two problems, existing work mainly focuses on the methods to construct particular subsets for special usage. These methods are limited in their focus. In this paper, we try to address the problems listed above. First, considering the cubic and binary semantic relatedness among tokens, we construct a general system model and formulate the mix problem as a cubic pseudo-Boolean optimization problem. Then, by analyzing the characteristics of the objective function, we transfer the problem into the maximum flow problem of a corresponding graph. Third, we propose a new algorithm by introducing discrete Lagrangian iteration method. We prove that the objective function is supermodular, which allows us to use fast minimum cut algorithms in each iteration step to propose another fast algorithm. Finally, we experimentally validate our new algorithms on several randomly created corpora. [ABSTRACT FROM AUTHOR]

Climatic chamber are enclosures where the ambient conditions, i.e. the temperature and humidity, are finely controlled. This one can play multiple roles such as the cultivation of plants (phytotron), the breeding of insects or habitat for exotic animals. The availability on the market of a wide variety of equipment makes it difficult to share settings and operating recipes. In this paper, we propose a versatile and automated modular climatic enclosure system that can be adapted according to the use cases and available material. In this paper, we use IoT device virtual representation, data validation by means AI algorithm, the semantic description of material, and ontology locally deployed from the cloud allowing to automate the local installation with container technology. [ABSTRACT FROM AUTHOR]

Background: Due to the high susceptivity of the walking pattern to be affected by several disorders, accurate analysis methods are necessary. Given the complexity and relevance of such assessment, the utilization of methods to facilitate it plays a significant role, provided that they do not compromise the outcomes.Research Questions: This paper aimed at identifying the standards for the application of adaptive predictive systems to gait analysis, given the extensive research on this field. Furthermore, we also intended to check whether such methods can effectively support clinicians in determining the number of physiotherapy sessions necessary to recover gait-related dysfunctions.Methods: Through a screening process of scientific databases, we considered studies encompassed from 1968 to April 2019. Within these 50 years, we found 24 papers that met our inclusion criteria. They were analyzed according to their data acquisition and processing methods via ad hoc questionnaires. Additionally, we examined quantitatively the adaptive approaches.Results: Concerning data acquisition, the included papers presented a mean score of 6.1 SD 1.0, most of them applying optoelectronic systems, and the ground reaction force (GRF) was the most used parameter. The AI quality assessment showed an above-average rate of 7.8 SD 1.0, and artificial neural networks (ANN) being the paradigm most frequently utilized. Our systematic review identified only one study that addressed therapeutics including a predictive method.Significance: While much progress has been identified to predict assessment aspects, there is little effort to assist healthcare professionals in establishing the rehabilitation duration and prognostics. Therefore, future studies should focus on accomplishing the production of applications of predictive methods to therapeutics and prognosis, not lingering extremely on the analysis of gait features. [ABSTRACT FROM AUTHOR]

Today, intelligent optimization has become a science that few researchers have not used in dealing with problems in their field. Diversity and flexibility have made the use, efficiency, and usefulness of various nature-inspired optimization methods, such as evolutionary and meta-heuristic algorithms, more evident in such problems. This work first provides a comprehensive overview of all considerations governing various optimization problems with detailed corresponding categories. Then, the most comprehensive review and recent methods (during 1965–2022) are presented in evolution-based, swarm-based, physics-based, human-based, and hybrid-based categories. More than 320 new algorithms have been reviewed. All specifications including authors, year, abbreviation, inspired source, controls, and their application are considered in this regard. Statistical analyzes of papers and publishers, annually and for 57 years, along with their ranking, are also examined in detail. Among the key achievements of the paper include: the most number of algorithms with 47.71% (156 methods) have been from the swarm category, and most of them were published in the five years of 2021 (72, 22.02%), 2020 (39, 11.93%), 2022 (31, 9.48%), 2019 (26, 7.95%), and 2016 (21, 6.42%) respectively; the top five rankings of publishers of reviewed algorithms/papers were also: "Proceedings of the Congress" (33, 10.09%), "Applied Soft Computing" (19, 5.81%), "Expert Systems with Applications" (18, 5.51%), "Knowledge-Based Systems" (12, 3.67%), "Engineering Applications of Artificial Intelligence" (12, 3.67%), "Advances in Engineering Software" (12, 3.67%), " Neural Computing and Applications " (12, 3.67%), and " Information Sciences " (11, 3.36%). The paper's data is available at: https://github.com/ali-ece. [Display omitted] • A detailed overview of optimization and its variants. • A literature review on state-of-the-art algorithms from 1965 to 2022. • Statistical analyzes and explanations in each year and during the 57 years. [ABSTRACT FROM AUTHOR]

In actual industrial control, the performance of the control system may be undermined or destabilized by the various complex nonlinear control processes. To ensure the stability of the control system, this paper improves the generalized active disturbance rejection control (GADRC). Firstly, the dead zone of the governor was converted to obtain the total transfer function of the control system, and the system stability was analyzed, considering the applicability of GADRC to non-minimum phase processes. Then, an error compensation strategy was proposed to control the system performance. Simulation results show that the improved GADRC can fully utilize the known information of the plant model, and obtain proper gains of the controller and the observer. In addition, the load frequency control (LFC) system can work effectively, when the dead zone of the governor has nonlinear processes. Finally, the proposed error compensation strategy can ensure the control performance of the system. [ABSTRACT FROM AUTHOR]

The amount of network traffic generated from the Internet of Things (IoT) devices is massive which leads to Big data. In present scenario, IoT devices has taken a leap ahead in terms of growing technology and insecure network traffic flow. The sensitivity of the data in the IoT network is becoming very high, which concern the security in legal and privacy issues. Traditional Intrusion Detection System (IDS) is used as a primary line security to differentiate between the attack and benign network traffic flow. As the size of the network traffic capture increases, it becomes more important to handle such big data. Similarly, when the number of classes and instances increases, the complexity of the data also increases. In this paper, we propose a big data platform based intrusion detection system which can differentiate between the types of network traffic flow generated from the IoT devices. We compared the performance of deep learning algorithms with machine learning algorithms on Apache Spark platform and found that machine learning algorithms outperform deep learning algorithms with greater accuracy and less training time for the model. We evaluated our research based on real world network traffic dataset BoT-IoT [1] for an improved intrusion detection system in IoT network traffic. [ABSTRACT FROM AUTHOR]

As the deployment of artificial intelligence (AI) algorithms at edge devices becomes increasingly prevalent, enhancing the robustness and reliability of autonomous AI-based perception and decision systems is becoming as relevant as precision and performance, especially in applications areas considered safety-critical such as autonomous driving and aerospace. This paper delves into the robustness assessment in embedded Deep Neural Networks (DNNs), particularly focusing on the impact of parameter perturbations produced by single event upsets (SEUs) on convolutional neural networks (CNN) for image semantic segmentation. By scrutinizing the layer-by-layer and bit-by-bit sensitivity of various encoder–decoder models to soft errors, this study thoroughly investigates the vulnerability of segmentation DNNs to SEUs and evaluates the consequences of techniques like model pruning and parameter quantization on the robustness of compressed models aimed at embedded implementations. The findings offer valuable insights into the mechanisms underlying SEU-induced failures that allow for evaluating the robustness of DNNs once trained in advance. Moreover, based on the collected data, we propose a set of practical lightweight error mitigation techniques with no memory or computational cost suitable for resource-constrained deployments. The code used to perform the fault injection (FI) campaign is available at https://github.com/jonGuti13/TensorFI2 , while the code to implement proposed techniques is available at https://github.com/jonGuti13/parameterProtection. [ABSTRACT FROM AUTHOR]

In the last decade it became increasingly apparent the inability of technical metrics such as accuracy, sustainability, and non-regressiveness to well characterize the behavior of intelligent systems. In fact, they are nowadays requested to meet also ethical requirements such as explainability, fairness, robustness, and privacy increasing our trust in their use in the wild. Of course often technical and ethical metrics are in tension between each other but the final goal is to be able to develop a new generation of more responsible and trustworthy machine learning. In this paper, we focus our attention on machine learning algorithms and associated predictive models, questioning for the first time, from a theoretical perspective, if it is possible to simultaneously guarantee their performance in terms of both technical and ethical metrics towards machine learning algorithms that we can trust. In particular, we will investigate for the first time both theory and practice of deterministic and randomized algorithms and associated predictive models showing the advantages and disadvantages of the different approaches. For this purpose we will leverage the most recent advances coming from the statistical learning theory: Complexity-Based Methods, Distribution Stability, PAC-Bayes, and Differential Privacy. Results will show that it is possible to develop consistent algorithms which generate predictive models with guarantees on multiple trustworthiness metrics. • AI is nowadays requested to optimize both technical and ethical metrics. • Focus on ML algorithms and associated models (both deterministic and randomized). • We prove that it is possible to develop consistent algorithms and models. • We bound generalization in terms of both technical and ethical metrics. • We leverage the most recent advances coming from the statistical learning theory. [ABSTRACT FROM AUTHOR]

One of the most important phases in text processing is stemming, whose aim is to aggregate all variations in a word into one group to aid natural language processing. The morphological structure of the Arabic language is more challenging than that of the English language; thus, it requires superior stemming algorithms for Arabic stemmers to be effective. One of the challenges is the irregular broken plural, which has been a problematic issue in Arabic natural language processing that affects the performance of Arabic information retrieval and other Arabic language engineering applications. Several studies have attempted to develop solutions to irregular plural problems, but the challenge remains, especially in extracting correct Arabic root words. In this paper, the broken plural rule (BPR) algorithm introduces new solutions to solve the problem in which an existing root-based method cannot extract correct roots by using their proposed rules. The BPR algorithm introduces several rules (main rules and subrules) to extract the correct roots of the Arabic irregular broken plural words. To evaluate the effectiveness of the BPR algorithm, we extracted roots from an Arabic standard dataset and applied the BPR algorithm as an enhancement to a root-based Arabic stemmer, ISRI. The obtained results from both evaluations showed encouraging results: (i) Only a few numbers of incorrect roots were stemmed on the large-sized Arabic word dataset. (ii) The enhanced root-based Arabic stemmer, ISRI + BPR, exhibited the best performance compared with the original ISRI stemmer and a well-known Arabic stemmer, ARLS 2. Thus, the proposed BPR algorithm has solved some of the irregular broken plural problems that eventually increase the performance of a root-based Arabic stemmer. [ABSTRACT FROM AUTHOR]

Highlights • Process model for transformation of formalized sentences into relational database. • Algorithms of functions and procedures for each step of transformation. • Meta model for the structure and content of formalized sentences in the relational database. Abstract Verbalized text contains knowledge necessary and sufficient for transfer of numerous human cognitions. The question is how this knowledge was saved into text. Authors believe that they found an important idea how to assemble knowledge into nodes of knowledge. Similar methods in the field of knowledge networks exist, but none of them does it in the same way as the Node of Knowledge (NOK) method. Basic terms and concepts in a language are represented in words whose meaning is final and cannot be divided in subterms. More complex meaning can be achieved by combining words in sentences. According to authors' opinion, each sentence includes connective medium for words in the sentence (related to semantic reasons), which is inwrought in the Node of Knowledge method. Using the Node of Knowledge method each sentence can be presented as a network of connected words. This network is enriched with links between words so a computer can interpret meaning and knowledge of the sentence in the same way an intelligent person does. A formalized and semantically enriched record of sentences (called Formalized Node of Knowledge – FNOK) is developed. Authors find that in this way, even without statistical text analysis, an algorithm can give correct answer to a question set based on written text. This paper presents the system for transformation of textual knowledge expressed in natural language sentences into a relational database. The system is a part of a larger knowledge-based system based on the Node of Knowledge (NOK) conceptual framework for knowledge-based system development. This paper starts with sentences written in the formalized and enriched form for which a logical transformation into the structure of a relational database is proposed. The system and algorithms for the transformation of formalized sentences into n-tuples of the relational database are distributed and represented in several steps. The research has shown that it is possible to store semantically enriched sentences in relational databases. The solution presented in this paper is important for further development of the system for receiving questions from users and providing answers (i.e. question-answering system), with the ability to use well-developed relational SQL languages. Relational database of texts enables numerous applications in the field of expert and intelligent systems. [ABSTRACT FROM AUTHOR]

Collaborative filtering is the most widely used and successful recommendation technology in recommendation systems. In view of the problem that the effect of collaborative filtering technology depends on an accurate similarity measurement method and its poor scalability can not deal with big data, in the information age of computer development, all undertakings are developing rapidly. English has long been an important tool for people to communicate with each other, but due to the limitation of learning mode and environment, the level of Chinese oral English is generally low. The cloud computation-based oral English learning system is designed. Users can learn oral English knowledge, simulate oral English testing and establish exclusive dictionaries through mobile terminals. According to the specific learning situation of Chinese English learners, a flexible and expandable virtual interactive platform is constructed through virtual technology and artificial intelligence, and multi-dimensional virtual scenes and intelligent AI roles are designed to realize the communication and learning of AI roles in different scenarios and improve learners' oral ability and language sense knowledge. However, compared with the traditional self-help learning method, there are huge changes. Our modern English self-help learning has basically got rid of the limitation of paper books, and most of it is carried out through the computer network. [ABSTRACT FROM AUTHOR]

The quest for learning more about the minute intricacies of the universe has fascinated mankind since ages. From stars to planets and asteroids to exoplanets, each research endeavor in astronomy has supplemented our knowledge about the cosmos. NASA's Kepler Mission is one monumental step in this direction wherein, telescopes conduct a survey of the Milky Way galaxy and try to identify thousands of earth-size and other smaller planets in or near the habitable zone, so as to determine the thousands or even millions of stars in our galaxy that might have such orbiting planets. Exoplanet is any new planet outside the solar system which orbits a star. Identifying new exoplanets gives us a chance to precisely understand the planet formation processes. Earlier, it was a laborious endeavour to mine the mission data using traditional algorithms and churn out the possible exoplanets. Ever since the advent of various machine learning algorithms, this process has become quite seamless. However, not all algorithms give equal and promising results when it comes to analysing different types of data. A comparative study of algorithms helps in this regard, thereby identifying the pros and cons of different algorithms for analysing certain forms of data. In this paper, we initially focus on feature set reduction using principal component analysis and thereafter make a detailed comparative analysis of ML algorithms for the identification of exoplanets, in the NASA Kepler mission data. [ABSTRACT FROM AUTHOR]

The first section picks up the central theme of the series by focusing on ill-considered or compulsive innovation. It questions fatalistic attitudes and argues that, far from being inevitable, concerns such as artificial intelligence (AI) or Chinese surveillance practices need to be brought more fully into the open and subjected to more sustained critical enquiry. The rest of the paper takes up the theme of recovery and renewal. Some critical ‘blind spots’ are briefly outlined (a distinct lack of interest in global challenges; a pervasive tendency to under-value ‘the social’) and reframed in more positive terms. The notion of ‘constitutive human interests’ is raised. It’s here that the implications of the project become ever more obvious since many of the concerns raised can be viewed as positive opportunities for productive innovation and adaptive change. A variety of innovations for better managing IT-related innovations and re-purposing the Internet are subsequently discussed. They include working with three scales of innovation, taming algorithms and supporting human agency. The positive innovation theme continues in the following section where wider questions about social democracy, new infrastructure and regulation are discussed. The question of ‘re-humanising’ the IT revolution then brings in notions of the public good, moral universals and the ambiguity of rapid and unconstrained technical innovation. The overall conclusions of the paper, and indeed, of the whole project, are framed by a growing imperative to ‘disrupt the disruptors’ by investing in socially democratic actions and processes across the board. Finally, a new look at values and moral development arguably has significant implications for the issues discussed throughout. [ABSTRACT FROM AUTHOR]

Multiple instance learning (MIL) is a form of weakly supervised learning where training instances are arranged in sets, called bags, and a label is provided for the entire bag. This formulation is gaining interest because it naturally fits various problems and allows to leverage weakly labeled data. Consequently, it has been used in diverse application fields such as computer vision and document classification. However, learning from bags raises important challenges that are unique to MIL. This paper provides a comprehensive survey of the characteristics which define and differentiate the types of MIL problems. Until now, these problem characteristics have not been formally identified and described. As a result, the variations in performance of MIL algorithms from one data set to another are difficult to explain. In this paper, MIL problem characteristics are grouped into four broad categories: the composition of the bags, the types of data distribution, the ambiguity of instance labels, and the task to be performed. Methods specialized to address each category are reviewed. Then, the extent to which these characteristics manifest themselves in key MIL application areas are described. Finally, experiments are conducted to compare the performance of 16 state-of-the-art MIL methods on selected problem characteristics. This paper provides insight on how the problem characteristics affect MIL algorithms, recommendations for future benchmarking and promising avenues for research. Code is available on-line at https://github.com/macarbonneau/MILSurvey . [ABSTRACT FROM AUTHOR]

Grid-interactive building control poses a critical challenge in the context of grid modernization and decarbonization. Recently, various artificial intelligence-based optimal control approaches have been proposed, providing innovative solutions to optimal building control problems. However, researchers and practitioners are now confronted with a dilemma when selecting appropriate control strategies, ranging from model-based (knowledge-incorporating) to learning-based (data-driven) approaches, and hybrid methods combining them. Although each algorithm in existing literature claims superiority over specific baselines, their performance has never been systematically compared and analyzed, owing to the absence of a unified platform for comprehensive evaluation. To fill this knowledge gap, we identify and implement all state-of-the-art approaches within a modular training and evaluation framework, assessing their efficacy in a grid-interactive building control problem. In this paper, we also introduce a streamlined hybrid method that complements existing hybrid approaches. Our comparative study reveals and quantifies the advantages of hybrid methods: on average, they achieve near-optimal control while requiring less than 14% of the online computation of traditional model-based methods. To achieve this performance, they need as few as 2% of the training samples of purely learning-based methods. Finally, we provide insights into the merits, limitations, and implementation of each method to help researchers better understand the state of the art and future directions. The software framework implemented in this study is open-sourced to facilitate future research. [ABSTRACT FROM AUTHOR]

With the development of big data and artificial intelligence, distributed optimization has emerged as an indispensable tool for solving large-scale problems. In particular, the multi-agent system based on distributed information processing can be elaborately designed for distributed optimization, in which the agents collaboratively minimize a global objective function made up of a sum of local objective cost functions subject to some local and/or global constraints. Inspired by the applications involving resource allocation, machine learning, power systems, sensor networks and cloud computing, a variety of distributed optimization models and algorithms have been investigated and developed. The optimization models include unconstrained and constrained problems in continuous and discontinuous systems with undirected and directed communication topology graphs. The constraints include bounded constraint, separable and inseparable equality and inequality constraints. Meanwhile, in distributed algorithms, every agent executes its local computation and updating on basis of its own data information and that exchanging with its neighboring agents by means of the underlying communication networks, in order to deal with the optimization problems in a distributed way. This paper is designed to provide a comprehensive overview of extant distributed models and algorithms for distributed optimization. [ABSTRACT FROM AUTHOR]

This paper illustrates the efficacy of an artificial intelligence (AI) (a convolutional neural network, based on the U-Net), for the burn-depth assessment using semantic segmentation of polarized high-performance light camera images of burn wounds. The proposed method is evaluated for paediatric scald injuries to differentiate four burn wound depths: superficial partial-thickness (healing in 0-7 days), superficial to intermediate partial-thickness (healing in 8-13 days), intermediate to deep partial-thickness (healing in 14-20 days), deep partial-thickness (healing after 21 days) and full-thickness burns, based on observed healing time. In total 100 burn images were acquired. Seventeen images contained all 4 burn depths and were used to train the network. Leave-one-out cross-validation reports were generated and an accuracy and dice coefficient average of almost 97% was then obtained. After that, the remaining 83 burn-wound images were evaluated using the different network during the cross-validation, achieving an accuracy and dice coefficient, both on average 92%. This technique offers an interesting new automated alternative for clinical decision support to assess and localize burn-depths in 2D digital images. Further training and improvement of the underlying algorithm by e.g., more images, seems feasible and thus promising for the future. [ABSTRACT FROM AUTHOR]

The conventional methods to assess human gait are either expensive or complex to be applied regularly in clinical practice. To reduce the cost and simplify the evaluation, inertial sensors and adaptive algorithms have been utilized, respectively. This paper aims to summarize studies that applied adaptive also called artificial intelligence (AI) algorithms to gait analysis based on inertial sensor data, verifying if they can support the clinical evaluation. Articles were identified through searches of the main databases, which were encompassed from 1968 to October 2016. We have identified 22 studies that met the inclusion criteria. The included papers were analyzed due to their data acquisition and processing methods with specific questionnaires. Concerning the data acquisition, the mean score is 6.1±1.62, what implies that 13 of 22 papers failed to report relevant outcomes. The quality assessment of AI algorithms presents an above-average rating (8.2±1.84). Therefore, AI algorithms seem to be able to support gait analysis based on inertial sensor data. Further research, however, is necessary to enhance and standardize the application in patients, since most of the studies used distinct methods to evaluate healthy subjects. [ABSTRACT FROM AUTHOR]

Geotechnical reliability analysis provides a novel way to rationally take the underlying geotechnical uncertainties into account and evaluate the stability of geotechnical structures by failure probability (or equivalently, reliability index) from a probabilistic perspective, which has gained great attention in the past few decades. With the rapid development of artificial intelligence techniques, various machine learning (ML) algorithms have been successfully applied in geotechnical reliability analysis and the number of relevant papers has been increasing at an accelerating pace. Although significant advances have been made in the past two decades, a systematic summary of this subject is still lacking. To better conclude current achievements and further shed light on future research, this paper aims to provide a state-of-the-art review of ML in geotechnical reliability analysis applications. Through reviewing the papers published in the period from 2002 to 2022 with the topic of applying ML in the reliability analysis of slopes, tunneling, and excavations, the pros and cons of the developed methods are explicitly tabulated. The great achievements that have been made are systematically summarized from two major aspects. In addition, the four potential challenges and prospective research possibilities underlying geotechnical reliability analysis are also outlined, including multisensor data fusion, time-variant reliability analysis, three-dimensional reliability analysis of practical cases, and ML model selection and optimization. • A state-of-the-art review of ML in geotechnical reliability analysis applications. • Several commonly used ML algorithms and some latest advanced ML methods are summarized. • The potential challenges and prospective research possibilities are outlined. [ABSTRACT FROM AUTHOR]

In this paper, we propose a reversible and recoverable authentication technique for demosaiced images using the k-means clustering algorithm and side match technique. Prior methods generate the recovery codes directly using the most significant bits of sampled components or their compressed codes, which requires excessive bits to record them. This not only damages the image to a large extent, but also limits the quality of the recovered image. In this paper, the sampled components are clustered and their cluster indices are used as the recovery codes. A tampered block can mostly be recovered by other untampered ones with the same cluster index. For an unrecoverable block, the cluster indices of its neighboring untampered blocks are employed to predict the block, and the recovery is performed by using the side match technique. Since unrecoverable blocks are sparsely scattered in the tampered areas, the recovered blocks around them are mostly available, and therefore an accurate prediction can be made. The experimental results show that the average quality of marked and recovered images of our method increases by around 3.36 dB and 2.96 dB, respectively, compared to previous methods. [ABSTRACT FROM AUTHOR]

Data processing, analysis and forecasting by applying artificial intelligence algorithms plays a pivotal role in the big data era. Hybrid forecasting of time series data is considered to be a potentially viable alternative compared with the conventional single forecasting modeling approaches. However, to perform forecasting in the electrical power system has been proven to be a challenging task due to various unstable factors, such as high fluctuations, autocorrelation and stochastic volatility. In this paper, a novel hybrid model that combines denoising methods and optimization algorithms with forecasting techniques is developed to solve the upper problems and forecast the key indicators in the electrical power system, including short-term wind speed, electrical load and electricity price . The proposed model can be applied to forecast the complex electrical power system with a high rate of convergence, forecasting accuracy and a fast computing speed. One of features of this paper is to integrate the already existing algorithms and models, which show a good forecasting performance. The results of three experiments confirm that the proposed hybrid model can satisfactorily approximate the actual value, and it can also be used as an effective and simple tool for planning for smart grids. [ABSTRACT FROM AUTHOR]

Today, artificial intelligence is everywhere in people's daily lives. Visual tracking, which is used to identify and continuously track specific targets, is an important research domain in the study of artificial intelligence. However, current visual tracking methods are not accurate enough for object tracking with background clutter, which can easily lead to tracking failures. Therefore, in this paper, in order to solve the problem of tracking failure in clutter background, we propose a template update mechanism to improve the accuracy of visual tracking. First, an original template is saved when the background clutter is detected. During background clutter, we use both the original template and the current template at the location estimated by the optical flow and choose better one. Next, the original template is reused after the background clutter is ended. Finally, the proposed mechanism is used both in the KCF and BACF algorithm to verify the effectiveness of the mechanism. With experiments on the OTB2015 dataset, results show that the proposed mechanism has improved accuracy and success rate of the two baseline algorithms. Meanwhile, in state-of-the-art algorithms, the algorithm using the proposed mechanism also has excellent tracking performance. In addition, this method also has strong tracking robustness and adaptation capability to sequential learning for video data. [ABSTRACT FROM AUTHOR]

Biochemical sensors have become indispensable tools for real-time, on-site monitoring and analysis in diverse domains such as healthcare, environmental protection, and food safety. The rapid evolution of artificial intelligence (AI) has opened new frontiers for enhancing the capabilities of these sensors across a spectrum of detection modalities. This paper delves into the recent integration of AI algorithms into biochemical sensors, examining this advancement from a functional standpoint and focusing on the empowerments it brings to electrochemical, electrochemiluminescence, colorimetric, and Raman sensors. AI techniques aim to enhance the capabilities of biochemical sensors beyond traditional techniques and have enabled improved selectivity, drift correction, efficiency, resolution, assisted diagnosis, and biomarker screening from complex multidimensional data. In the end, we provide a personal perspective on future development and address the remaining challenges in the commercialization of AI-based biochemical sensors. • We introduce the common types and functions of AI algorithms used in biochemical sensors. • AI algorithms enhance biochemical sensors' performance, achieving highly sensitive, precise, and high-throughput analysis. • AI-assisted sensors unlock tremendous benefits across healthcare, environmental protection, and food safety. • A personal perspective on the challenges and future opportunities is discussed. [ABSTRACT FROM AUTHOR]

Due to the complex environment and variable demands, unmanned surface vessel (USV) task assignment and path planning have received much attention from academia and industry in recent years. Artificial intelligence technologies are increasingly adopted for solving the USV task assignment and path planning problems. This paper aims to give a comprehensive literature review of achievements, trends and challenges about the USV tasks assignment and path planning. First, the concerned problems are divided into two categories (single-USV and multi-USV), and the related work is thoroughly reviewed. Second, the solution methods, especially artificial intelligence (AI) related technologies and approaches, are analyzed and discussed. Third, the common external constraints and disturbances in the maritime environment are described. In particular, the obstacle avoidance strategies and algorithms are discussed and summarized systematically. Next, the applications to scientific exploration , military, and fishery industry are presented. Finally, we conclude this survey and indicate future research directions. [ABSTRACT FROM AUTHOR]

Optimal path planning is a fundamental problem in artificial intelligence (AI) and has wide applications in areas such as robotics, transportation, and logistics. In this paper, we propose a novel approach for ordering algorithms in pathfinding problems using the concept of shell layers. Our approach aims to improve the computational efficiency and distance cost of ordering algorithms. To evaluate the effectiveness of our approach, we compare it with five state-of-the-art techniques commonly used in the field of ordering algorithms on eight different scenarios with varying configurations. Our results show that our proposed approach outperformed the state-of-the-art techniques in terms of time-computational complexity and distance cost in most of the scenarios, demonstrating its potential as a new state-of-the-art technique for ordering algorithms. Specifically, our approach outperformed the nearest neighbor, A*, branch and bound, Christofides, and genetics ordering algorithms. However, we also identified two specific situations where our approach was outperformed by two state-of-the-art algorithms due to the specific distribution of the goal nodes. These findings highlight the importance of evaluating and comparing ordering algorithms in various scenarios. Our approach has significant implications for AI research and development, as it has the potential to improve the performance of pathfinding algorithms in various applications. We also discuss the limitations of our approach and potential areas for further research, such as investigating the effectiveness of our approach in different types of graphs and exploring the potential use of machine learning techniques to optimize the shell layer construction. The code for this study is available at https://github.com/abdullah1aloush1/MuGONA. • Equally-spaced nodes formed over workspace with obstacles, optimizing search process. • Efficient neighboring graph built for equally-spaced nodes, reducing complexity. • Path optimization for navigation by ordering goal nodes, reducing time and distance. • Path smoothing for navigation via interpolation to yield a trajectory on path nodes. [ABSTRACT FROM AUTHOR]

In today's world of connectivity, various domains use different multi-sensor Internet of Things (IoT) and Intelligent Systems (IS) applications. These applications involve extensive interactions between thousands or millions of components in open environments, which challenges verifying their reliability and efficiency. This paper introduces the first investigation in verifying IoT applications and intelligent systems in multi-source data settings with multi-agent commitment protocols in uncertain or inconsistent environments. Specifically, we present original and efficient solutions for modeling and verifying these systems with conditional and unconditional commitment protocols under uncertain or inconsistent settings. We introduce 4v-CTL c and 4v-CTL c c , multi-valued logics of commitment for reasoning about inconsistency over these systems that expand 3v-CTL c and 3v-CTL c c for reasoning about uncertainty. Moreover, we introduce new reduction algorithms for reducing our multi-valued model checking problems to the two-valued ones. To implement these algorithms, we develop two new automatic verification tools. The first tool translates the multi-valued logics to CTL and automatically interacts with the NuSMV model checker. The second tool translates these logics to the two-valued versions, CTL c and CTL c c , and automatically interacts with the MCMAS+ model checker. We apply our verification approaches to a Smart Home, a Smart Hospital and a Smart Mortgage system with multi-source data as case studies using sets of properties, including safety, liveness and reachability. The experimental results obtained by the proposed multi-valued model checking techniques proved these techniques' high efficiency and applicability to modeling and verifying intelligent and autonomous multi-source data systems. • New multi-valued logics to reason about inconsistency in multi-source data settings. • Modeling IoT and IS applications using different multi-valued commitment logics. • New reduction-based model checking algorithms for multi-source data applications. • Implementing two new model checking tools: MCMAS-interactor and NuSMV-interactor. [ABSTRACT FROM AUTHOR]

Peer review is the established method for evaluating the quality and validity of research manuscripts in scholarly publishing. However, scientific peer review faces challenges as the volume of submitted research has steadily increased in recent years. Time constraints and peer review quality assurance can place burdens on reviewers, potentially discouraging their participation. Some artificial intelligence (AI) tools might assist in relieving these pressures. This study explores the efficiency and effectiveness of one of the artificial intelligence (AI) chatbots, ChatGPT (Generative Pre-trained Transformer), in the peer review process. Twenty-one peer-reviewed research articles were anonymised to ensure unbiased evaluation. Each article was reviewed by two humans and by versions 3.5 and 4.0 of ChatGPT. The AI was instructed to provide three positive and three negative comments on the articles and recommend whether they should be accepted or rejected. The human and AI results were compared using a 5-point Likert scale to determine the level of agreement. The correlation between ChatGPT responses and the acceptance or rejection of the papers was also examined. Subjective review similarity between human reviewers and ChatGPT showed a mean score of 3.6/5 for ChatGPT 3.5 and 3.76/5 for ChatGPT 4.0. The correlation between human and AI review scores was statistically significant for ChatGPT 3.5, but not for ChatGPT 4.0. ChatGPT can complement human scientific peer review, enhancing efficiency and promptness in the editorial process. However, a fully automated AI review process is currently not advisable, and ChatGPT's role should be regarded as highly constrained for the present and near future. [ABSTRACT FROM AUTHOR]

Nash equilibrium is one of the most influential solution concepts in game theory. With the development of computer science and artificial intelligence, there is an increasing demand on Nash equilibrium computation, especially for Internet economics and multi-agent learning. This paper reviews various algorithms computing the Nash equilibrium and its approximation solutions in finite normal-form games from both theoretical and empirical perspectives. For the theoretical part, we classify algorithms in the literature and present basic ideas on algorithm design and analysis. For the empirical part, we present a comprehensive comparison on the algorithms in the literature over different kinds of games. Based on these results, we provide practical suggestions on implementations and uses of these algorithms. Finally, we present a series of open problems from both theoretical and practical considerations. • A classification on Nash equilibrium algorithms in the literature with basic ideas on design and analysis presented. • A comprehensive comparison on Nash equilibrium algorithms in the literature over different kinds of games. • Practical suggestions on implementations and uses of Nash equilibrium algorithms. [ABSTRACT FROM AUTHOR]

In order to improve the signal analysis and diagnosis effect of the chain drive system of the scraper conveyor, this paper combines the artificial intelligence algorithm to analyze and diagnose the signal of the chain drive system of the scraper conveyor to judge the signal condition of the chain drive system of the scraper conveyor in time. Moreover, by referring to the actual application environment of the chain drive system of the scraper conveyor, the relevant parameters of the signal are set, and the model is simulated. In addition, this paper analyzes the DC gain under different link conditions, and proves that it is more practical to consider the reflection in the channel through simulation. From the data statistics, the method proposed in this paper can play an important role in the signal analysis and diagnosis of the chain drive system of the scraper conveyor, and effectively improve the signal analysis and diagnosis accuracy of the chain drive system of the scraper conveyor. [ABSTRACT FROM AUTHOR]

Artificial Immune System (AIS) is inspired from Biological Immune System (BIS) and demonstrates a lot of interesting facets and intelligence that include self-learning, self adaption, self regulatory, distributed with self/non-self detection capabilities. Due to these astonishing qualities AIS are predominantly used in anomaly detection where anomalies are treated as non-self that needs to be detected. Therefore, AIS appears appropriate for development of a proactive system to identify and prevent novel and unseen anomalies. This paper presents “An Efficient Proactive Artificial Immune System based Anomaly Detection and Prevention System (EPAADPS)” which embodies immune attributes to distinguish self and non-self in quest to identify and prevent novel, unseen anomalies. Negative Selection Algorithm (NSA) is a key AIS concept and is used for anomaly detection in various publications. Despite its relative success, detector selection and thereafter anomaly detection demands a more effective algorithm. This paper put forwards concept of self-tuning of detectors and detector power in NSA with the intension to make a detector evolve and facilitate better and correct self and non-self coverage. Thereafter, agents accompanying detectors collaborate and communicate between themselves to proactively discover correct anomalies and then take appropriate preventive measures. The performance of EPAADPS is contrasted with closely related state of art RNS algorithm using real valued representation and Euclidean distance. Experimental results revels promising EPAADPS performance which very comfortably outperforms the RNS. Furthermore, these results also demonstrate that EPAADPS shows remarkable resilience and intelligence in detecting novel unseen anomalies and with preventive measures to overcome the threat perception. [ABSTRACT FROM AUTHOR]

Financial markets play an important role on the economical and social organization of modern society. In these kinds of markets, information is an invaluable asset. However, with the modernization of the financial transactions and the information systems, the large amount of information available for a trader can make prohibitive the analysis of a financial asset. In the last decades, many researchers have attempted to develop computational intelligent methods and algorithms to support the decision-making in different financial market segments. In the literature, there is a huge number of scientific papers that investigate the use of computational intelligence techniques to solve financial market problems. However, only few studies have focused on review the literature of this topic. Most of the existing review articles have a limited scope, either by focusing on a specific financial market application or by focusing on a family of machine learning algorithms. This paper presents a review of the application of several computational intelligent methods in several financial applications. This paper gives an overview of the most important primary studies published from 2009 to 2015, which cover techniques for preprocessing and clustering of financial data, for forecasting future market movements, for mining financial text information, among others. The main contributions of this paper are: (i) a comprehensive review of the literature of this field, (ii) the definition of a systematic procedure for guiding the task of building an intelligent trading system and (iii) a discussion about the main challenges and open problems in this scientific field. [ABSTRACT FROM AUTHOR]

Deep learning algorithms are a subset of the machine learning algorithms, which aim at discovering multiple levels of distributed representations. Recently, numerous deep learning algorithms have been proposed to solve traditional artificial intelligence problems. This work aims to review the state-of-the-art in deep learning algorithms in computer vision by highlighting the contributions and challenges from over 210 recent research papers. It first gives an overview of various deep learning approaches and their recent developments, and then briefly describes their applications in diverse vision tasks, such as image classification, object detection, image retrieval, semantic segmentation and human pose estimation. Finally, the paper summarizes the future trends and challenges in designing and training deep neural networks. [ABSTRACT FROM AUTHOR]

Visual recognition of crowd dynamics has had a huge impact on several applications including surveillance, situation awareness, homeland security and intelligent environments. However, the state-of-the-art in crowd analysis has become diverse due to factors such as: (a) the underlying definition of a crowd, (b) the constituent elements of the crowd processing model, (c) its application, hence (d) the dataset and (e) the evaluation criteria available for benchmarking. Although such diversity is healthy, the techniques for crowd modelling thus developed have failed to establish credibility therefore becoming unreliable and of questionable validity across different research disciplines. This paper aims to give an account of such issues by deducing key statistical evidence from the existing literature and providing recommendations towards focusing on the general aspects of techniques rather than any specific algorithm. The advances and trends in crowd analysis are drawn in the context of crowd modelling studies published in leading journals and conferences over the past 7 years. Finally, this paper shall also provide a qualitative and quantitative comparison of some existing methods using various publicly available crowd datasets to substantiate some of the theoretical claims. [ABSTRACT FROM AUTHOR]

Due to its very peculiar features, the development of e-skin can be effectively tackled using a holistic approach. Starting from the definition of system specifications, the mechanical arrangement of the skin itself needs to be designed and fabricated together with the electronic embedded system, to move towards aspects such as tactile data processing algorithms and the communication channel interface. In this paper we present the design, the implementation and the results on the way of the development of an electronic skin (e-skin) system based on arrays of piezopolymer transducers. Focus of the paper is on both the development of innovative approaches for tactile information processing and electronic system embedding into the e-skin structure. In particular, Machine Learning technologies can provide a powerful tool to tackle the pattern-recognition problems involved in the tactile sensing framework and the ability of processing data represented as N-th order tensor is the key aspect of the presented research, which can be seen as an application of an existing method (Signoretto et al., 2011). The experimental session compares two different implementations of the ML-based framework, which differ in the learning paradigm adopted, namely SVM and ELM (K-ELM). The effectiveness of the adopted pattern-recognition technologies in the classification of touch modalities has been confirmed by addressing two different binary classification problems in an experiment involving 70 participants. The computational requirements for the hardware implementation of the proposed algorithm together with an overview of what exists in the existing literature are finally discussed. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Medical Imaging & Radiation Sciences is the property of Elsevier B.V. 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.)