International Journal of Intelligent Systems

Precisely segmenting the organs at risk (OARs) in computed tomography (CT) plays an important role in radiotherapy’s treatment planning, aiding in the protection of critical tissues during irradiation. Renowned deep convolutional neural networks (DCNNs) and prevailing transformer-based architectures are widely utilized to accomplish the segmentation task, showcasing advantages in capturing local and contextual characteristics. Graph convolutional networks (GCNs) are another specialized model designed for processing the nongrid dataset, e.g., citation relationship. The DCNNs and GCNs are considered as two distinct models applicable to the grid and nongrid datasets, respectively. Motivated by the recently developed dynamic-channel GCN (DCGCN) that attempts to leverage the graph structure to enhance the feature extracted by the DCNNs, this paper proposes a novel architecture termed adaptive sparse GCN (ASGCN) to mitigate the inherent limitations in DCGCN from the aspect of node’s representation and adjacency matrix’s construction. For the node’s representation, the global average pooling used in the DCGCN is replaced by the learning mechanism to accommodate the segmentation task. For the adjacency matrix, an adaptive regularization strategy is leveraged to penalize the coefficient in the adjacency matrix, resulting in a sparse one that can better exploit the relationships between nodes. Rigorous experiments on multiple OARs’ segmentation tasks of the head and neck demonstrate that the proposed ASGCN can effectively improve the segmentation accuracy. Comparison between the proposed method and other prevalent architectures further confirms the superiority of the ASGCN.

This study identifies critical inefficiencies within a dual-channel operation model employed by a fast fashion company, particularly the independent operation of three logistics distribution systems. These systems result in high operational costs and low resource utilization, primarily due to redundant vehicle dispatches to meet the distinct demands of retail store replenishment, online customer orders, and customer return demands, as well as random and scattered return requests leading to vehicle underutilization. To address these challenges, we propose a novel integrated logistics distribution system design and management method tailored for dual-channel sales and distribution businesses. The approach consolidates the three distribution systems into one cohesive framework, thus streamlining the delivery process and reducing vehicle trips by combining retail and customer visits. An optimization algorithm is introduced to factor in inventory and distribution distance, aiming to achieve global optimization in pairing retail store inventory with online customer orders and unifying the distribution of replenishment products, online products, and returned products. The paper contributes to the field by introducing a new variation of the Vehicle Routing Problem (VRP) that arises from an integrated distribution system, combining common VRP issues with more complex challenges. A custom Branch-and-Price (B&P) algorithm is developed to efficiently find optimal routes. Furthermore, we demonstrate the benefits of the integrated system over traditional, segregated systems through real-world data analysis and assess various factors including return rates and inventory conditions. The study also enhances the model by allowing inventory transfers between retail stores, improving inventory distribution balance, and offering solutions for scenarios with critically low inventory levels. Our findings highlight a significant reduction in total operating cost savings of up to 49.9% and vehicle usage when using the integrated distribution system compared to independent two-stage and three-stage systems. The integrated approach enables the utilization of vacant vehicle space and the dynamic selection and combination of tasks, preventing unnecessary mileage and space wastage. Notably, the integration of inventory sharing among retail stores has proven to be a key factor in generating feasible solutions under tight inventory conditions and reducing operational costs and vehicle numbers, with the benefits amplified in large-scale problem instances.

Syslog is a critical data source for analyzing system problems. Converting unstructured log entries into structured log data is necessary for effective log analysis. However, existing log parsing methods demonstrate promising accuracy on limited datasets, but their generalizability and precision are uncertain when applied to diverse log data. Enhancements in these areas are necessary. This paper proposes an online log parsing method called DLLog, which is based on deep learning and has the longest common subsequence. DLLog utilizes the GRU neural network to mine template words and applies the longest common subsequence to parse log entries in real-time. In the offline stage, DLLog combines multiple log features to accurately extract the template words, creating a log template set to assist online log parsing. In the online stage, DLLog parses log entries by calculating the matching degree between the real-time log entry and the log template in the log template set. This method also supports the incremental update of the log template set to handle new log entries generated by systems. We summarized the previous works and validated DLLog using real log data collected from 16 systems. The results demonstrate that DLLog achieves high parsing accuracy, universality, and adaptability.

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, , and VIF. The 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.