International Journal of Intelligent Systems最新文献

Pretrained Language Models (PLMs) acquire rich prior semantic knowledge during the pretraining phase and utilize it to enhance downstream Natural Language Processing (NLP) tasks. Entity Matching (EM), a fundamental NLP task, aims to determine whether two entity records from different knowledge bases refer to the same real-world entity. This study, for the first time, explores the potential of using a PLM to boost the EM task through two transfer learning techniques, namely, fine-tuning and prompt learning. Our work also represents the first application of the soft prompt in an EM task. Experimental results across eleven EM datasets show that the soft prompt consistently outperforms other methods in terms of F1 scores across all datasets. Additionally, this study also investigates the capability of prompt learning in few-shot learning and observes that the hard prompt achieves the highest F1 scores in both zero-shot and one-shot context. These findings underscore the effectiveness of prompt learning paradigms in tackling challenging EM tasks.

Semi-supervised learning (SSL) is a common approach to learning predictive models using not only labeled, but also unlabeled examples. While SSL for the simple tasks of classification and regression has received much attention from the research community, this is not the case for complex prediction tasks with structurally dependent variables, such as multi-label classification and hierarchical multi-label classification. These tasks may require additional information, possibly coming from the underlying distribution in the descriptive space provided by unlabeled examples, to better face the challenging task of simultaneously predicting multiple class labels. In this paper, we investigate this aspect and propose a (hierarchical) multi-label classification method based on semi-supervised learning of predictive clustering trees, which we also extend towards ensemble learning. Extensive experimental evaluation conducted on 24 datasets shows significant advantages of the proposed method and its extension with respect to their supervised counterparts. Moreover, the method preserves interpretability of classical tree-based models.

This paper presents a comparative analysis of bioinspired algorithms employed on a PV system subject to standard conditions, under step-change of irradiance conditions, and a partial shading condition for tracking the global maximum power point (GMPP). Four performance analysis and comparison techniques are artificial bee colony, particle swarm optimization, genetic algorithm, and a new metaheuristic technique called jellyfish optimization, respectively. These existing algorithms are well-known for tracking the GMPP with high efficiency. This paper compares these algorithms based on extracting GMPP in terms of maximum power from a PV module running at a uniform (STC), nonuniform solar irradiation (under step-change of irradiance), and partial shading conditions (PSCs). For analysis and comparison, two modules are taken: 1Soltech-1STH-215P and SolarWorld Industries GmbH Sunmodule plus SW 245 poly module, which are considered to form a panel by connecting four series modules. Comparison is based on maximum power tracking, total execution time, and minimum number of iterations to achieve the GMPP with high tracking efficiency and minimum error. Minitab software finds the regression equation (objective function) for STC, step-changing irradiation, and PSC. The reliability of the data (P-V curves) was measured in terms of p value, R, R², and VIF. The R² value comes out to be near 1, which shows the accuracy of the data. The simulation results prove that the new evolutionary jellyfish optimization technique gives better results in terms of higher tracking efficiency with very less time to obtain GMPP in all environmental conditions, with a higher efficiency of 98 to 99.9% with less time of 0.0386 to 0.1219 sec in comparison to ABC, GA, and PSO. The RMSE value for the proposed method JFO (0.59) is much lower than that of ABC, GA, and PSO.

In the dynamic global trade environment, accurately predicting trade values of diverse commodities is challenged by unpredictable economic and political changes. This study introduces the Meta-TFSTL framework, an innovative neural model that integrates Meta-Learning Enhanced Trade Forecasting with efficient multicommodity STL decomposition to adeptly navigate the complexities of forecasting. Our approach begins with STL decomposition to partition trade value sequences into seasonal, trend, and residual elements, identifying a potential 10-month economic cycle through the Ljung–Box test. The model employs a dual-channel spatiotemporal encoder for processing these components, ensuring a comprehensive grasp of temporal correlations. By constructing spatial and temporal graphs leveraging correlation matrices and graph embeddings and introducing fused attention and multitasking strategies at the decoding phase, Meta-TFSTL surpasses benchmark models in performance. Additionally, integrating meta-learning and fine-tuning techniques enhances shared knowledge across import and export trade predictions. Ultimately, our research significantly advances the precision and efficiency of trade forecasting in a volatile global economic scenario.

To reduce diesel emissions and fuel consumption and improve DPF regeneration performance, a multiobjective optimization method for DPF regeneration conditions, combined with nondominated sorting genetic algorithms (NSGA-III) and a back propagation neural network (BPNN) prediction model, is proposed. In NSGA-III, DPF regeneration temperature (T4 and T5), O₂, NO_x, smoke, and brake-specific fuel consumption (BSFC) are optimized by adjusting the engine injection control parameters. An improved seagull optimization algorithm (ISOA) is proposed to enhance the accuracy of BPNN predictions. The ISOA-BP diesel engine regeneration condition prediction model is established to evaluate fitness. The optimized fuel injection parameters are programmed into the engine’s electronic control unit (ECU) for experimental validation through steady-state testing, DPF active regeneration testing, and WHTC transient cycle testing. The results demonstrate that the introduced ISOA algorithm exhibits faster convergence and improved search abilities, effectively addressing calculation accuracy challenges. A comparison between the SOA-BPNN and ISOA-BPNN models shows the superior accuracy of the latter, with reduced errors and improved R² values. The optimization method, integrating NSGA-III and ISOA-BPNN, achieves multiobjective calibration for T4 and T5 temperatures. Steady-state testing reveals average increases of 3.14%, 2.07%, and 10.79% in T4, T5, and exhaust oxygen concentrations, while NO_x, smoke, and BSFC exhibit average decreases of 8.68%, 12.07%, and 1.03%. Regeneration experiments affirm the efficiency of the proposed method, with DPF regeneration reaching 88.2% and notable improvements in T4, T5, and oxygen concentrations during WHTC transient testing. This research provides a promising and effective solution for calibrating the regeneration temperature of DPF, thus reducing emissions and fuel consumption of diesel engines while ensuring safe and efficient DPF regeneration.

As is well known, differential algebraic equations (DAEs), which are able to describe dynamic changes and underlying constraints, have been widely applied in engineering fields such as fluid dynamics, multi-body dynamics, mechanical systems, and control theory. In practical physical modeling within these domains, the systems often generate high-index DAEs. Classical implicit numerical methods typically result in varying order reduction of numerical accuracy when solving high-index systems. Recently, the physics-informed neural networks (PINNs) have gained attention for solving DAE systems. However, it faces challenges like the inability to directly solve high-index systems, lower predictive accuracy, and weaker generalization capabilities. In this paper, we propose a PINN computational framework, combined Radau IIA numerical method with an improved fully connected neural network structure, to directly solve high-index DAEs. Furthermore, we employ a domain decomposition strategy to enhance solution accuracy. We conduct numerical experiments with two classical high-index systems as illustrative examples, investigating how different orders and time-step sizes of the Radau IIA method affect the accuracy of neural network solutions. For different time-step sizes, the experimental results indicate that utilizing a 5th-order Radau IIA method in the PINN achieves a high level of system accuracy and stability. Specifically, the absolute errors for all differential variables remain as low as 10⁻⁶, and the absolute errors for algebraic variables are maintained at 10⁻⁵. Therefore, our method exhibits excellent computational accuracy and strong generalization capabilities, providing a feasible approach for the high-precision solution of larger-scale DAEs with higher indices or challenging high-dimensional partial differential algebraic equation systems.

In traditional state feedback control, the difficulty in determining the coefficient matrix is a significant factor that prevents achieving optimal control. To address this issue, this paper proposes the integration of adaptive genetic algorithms with state feedback control. The effectiveness of the proposed algorithm is validated via an electro-hydraulic braking system. Firstly, a model of the electro-hydraulic braking system is introduced. Next, a state feedback controller optimized by parameter-adaptive genetic algorithm is designed. Additionally, a penalty term is introduced into the fitness function to suppress overshoots. Finally, simulations are conducted to compare the convergence speed of parameter-adaptive genetic algorithm with genetic algorithm, ant colony optimization, and particle swarm optimization. Furthermore, the performance of the proposed algorithm, the state feedback control, and the proportional-integral control are also compared. The comparison results show that the proposed algorithm effectively accelerates the settling time of the electro-hydraulic braking system and suppresses the overshoots.

Wireless technologies are growing unprecedentedly with the advent and increasing popularity of wireless services worldwide. With the advancement in technology, profound techniques can potentially improve the performance of wireless networks. Besides, the advancement of artificial intelligence (AI) enables systems to make intelligent decisions, automation, data analysis, insights, predictive capabilities, learning, and adaptation. A sophisticated AI will be required for next-generation wireless networks to automate information delivery between smart applications simultaneously. AI technologies, such as machines and deep learning techniques, have attained tremendous success in many applications in recent years. Hances, researchers in academia and industry have turned their attention to the advanced development of AI-enabled wireless networks. This paper comprehensively surveys AI technologies for different wireless networks with various applications. Moreover, we present various AI-enabled applications that exploit the power of AI to enable the desired evolution of wireless networks. Besides, the challenges of unsolved research in this area, which represent the future research trends of AI-enabled wireless networks, are discussed in detail. We provide several suggestions and solutions that help wireless networks be more intelligent and sophisticated to handle complicated problems. In summary, this paper can help researchers deeply understand the up-to-the-minute wireless network designs based on AI technologies and identify interesting unsolved issues to be pursued in their research in a fast way.

Currently, individual artificial intelligence (AI) algorithms face significant challenges in effectively diagnosing and predicting early stage emerging serious diseases. Our investigation indicates that these challenges primarily arise from insufficient clinical treatment data, leading to inadequate model training and substantial disparities among algorithm outcomes. Therefore, this study introduces an adaptive framework aimed at increasing prediction accuracy and mitigating instability by integrating various AI algorithms. In analyzing two cohorts of early cases of the coronavirus disease 2019 (COVID-19) in Wuhan, China, we demonstrate the reliability and precision of the adaptive combined learning algorithm. Employing an adaptive combination with three feature importance methods (Random Forest (RF), Scalable end-to-end Tree Boosting System (XGBoost), and Sparsity Oriented Importance Learning (SOIL)) for two cohorts, we identified 23 clinical features with significant impacts on COVID-19 outcomes. Subsequently, the adaptive combined prediction leveraged and enhanced the advantages of individual methods based on three forecasting algorithms (RF, XGBoost, and Logistic regression). The average accuracy for both cohorts exceeded 0.95, with the area under the receiver operating characteristics curve (AUC) values of 0.983 and 0.988, respectively. We established a severity grading system for COVID-19 based on the combined probability of death. Compared to the original classification, there was a significant decrease in the number of patients in the severe and critical levels, while the levels of mild and moderate showed a substantial increase. This severity grading system provides a more rational grading in clinical treatment. Clinicians can utilize this system for effective and reliable preliminary assessments and examinations of patients with emerging diseases, enabling timely and targeted treatment.

Electronic Health Record (EHR) systems are a valuable and effective tool for exchanging medical information about patients between hospitals and other significant healthcare sector stakeholders in order to improve patient diagnosis and treatment around the world. Nevertheless, the majority of the hospital infrastructures that are now in place lack the proper security, trusted access control, and management of privacy and confidentiality concerns that the current EHR systems are supposed to provide. Goal. For various EHR systems, this research proposes a Blockchain-enabled Hyperledger Fabric Architecture as a solution to this delicate issue. The three steps of the suggested system are the secure upload phase, the secure download phase, and authentication. Patient registration, login, and verification make up the authentication step. The administrator grants authorization to read, edit, delete, or revoke the files following user details verification. In the secure upload phase, feature extraction is carried out first, and then a hashed access policy is created from the extracted feature. Next, the hash value is stored in an IoT-based Hyperledger blockchain. The uploaded EHR files are additionally encrypted before being stored on the cloud server. In the secure download step, the physician uses a hashed access policy to send the request to the cloud and decrypts the corresponding files. The experimental findings demonstrate that the system outperformed cutting-edge techniques. The proposed Modified Key Policy Attribute-Based Encryption performs better for the remaining 10 to 25 mb file sizes. This IoT framework compares MKP-ABE with certain efficiency indicators, such as encryption, decryption period, protection level analysis and encrypted memory use, resource use on decryption, upload time, and transfer time, which are present in the KP-ABE, the ECC, RSA, and AES. Here, the IoT device suggested requires 4008 ms for data encryption and 4138 ms for the data decryption.