International Journal of Intelligent Systems最新文献

Currently, cloud computing is increasing on a daily basis and has evolved into an efficient and flexible paradigm for addressing large-scale issues. It is recognized as an internet-based computing model where various cloud users share computing and virtual resources such as services, applications, storage, servers and networks. In the present study, we propose an innovative strategy for enhancing the fault tolerance and load balancing capabilities of cloud computing environments: we combined graph neural networks (GNNs) with dynamic multiqueue optimization scheduling (DMQOS). The present study uses GNNs and DMQOS to provide a novel solution to these challenges. GNN–DMQS uses a DMQOS system that adjusts to the dynamic nature of cloud workloads. This dynamic method develops response times and resource consumption, which improve load balancing and system effectiveness. Using GNNs to predict and mitigate probable faults grows fault tolerance and safeguards service accessibility. We evaluate the proposed method, GNN–DMQOS, using extensive experiments on real-world cloud computing datasets. The results demonstrate significant developments: 95.66% in fault tolerance, 97.13% in adaptability, 1598.14 kbps in throughput, 94.78% in resource utilization, 96.77% in reliability, 2.876 ms in response time, 0.141 s in network lifetime, 1.627 s in end-to-end delay and 129.34 ms in time complexity compared with traditional methods. In addition, our method, GNN–DMQOS, exhibits adaptability to varying workloads, making it suitable for dynamic cloud environments.

In response to the limitations of traditional fuzzing approaches that rely on static mutators and fail to dynamically adjust their test case mutations for deeper testing, resulting in the inability to generate targeted inputs to trigger vulnerabilities, this paper proposes a directed fuzzing methodology termed DocFuzz, which is predicated on a feedback mechanism mutator. Initially, a sanitizer is used to target the source code of the tested program and stake in code blocks that may have vulnerabilities. After this, a taint tracking module is used to associate the target code block with the bytes in the test case, forming a high-value byte set. Then, the reinforcement learning mutator of DocFuzz is used to mutate the high-value byte set, generating well-structured inputs that can cover the target code blocks. Finally, utilizing the feedback mechanism of DocFuzz, when the reinforcement learning mutator converges and ceases to optimize, the fuzzer is rebooted to continue mutating toward directions that are more likely to trigger vulnerabilities. Comparative experiments are conducted on multiple test sets, including LAVA-M, and the experimental results demonstrate that the proposed DocFuzz methodology surpasses other fuzzing techniques, offering a more precise, rapid, and effective means of detecting vulnerabilities in source code.

With the wide application of deep learning (DL) across various fields, deep joint source–channel coding (DeepJSCC) schemes have emerged as a new coding approach for image transmission. Compared with traditional separated source and CC (SSCC) schemes, DeepJSCC is more robust to the channel environment. To address the limited sensing capability of individual devices, distributed cooperative transmission is implemented among edge devices. However, this approach significantly increases communication overhead. In addition, existing distributed DeepJSCC schemes primarily focus on specific tasks, such as classification or data recovery. In this paper, we explore the wireless semantic image collaborative nonorthogonal transmission for distributed edge networks, where edge devices distributed across the network extract features of the same target image from different viewpoints and transmit these features to an edge server. A two-view distributed cooperative DeepJSCC (two-view-DC-DeepJSCC) with or without information disentanglement scheme is proposed. In particular, the two-view-DC-DeepJSCC with information disentanglement (two-view-DC-DeepJSCC-D) is proposed for achieving balancing performance between multitasking of image semantic communication; while the two-view-DC-DeepJSCC without information disentanglement only pursues outstanding data recovery performance. Through curriculum learning (CL), the proposed two-view-DC-DeepJSCC-D effectively captures both common and private information from two-view data. The edge server uses the received information to accomplish tasks such as image recovery, classification, and clustering. The experimental results demonstrate that our proposed two-view-DC-DeepJSCC-D scheme is capable of simultaneously performing image recovery, classification, and clustering tasks. In addition, the proposed two-view-DC-DeepJSCC has better recovery performance compared to the existing schemes, while the proposed two-view-DC-DeepJSCC-D not only maintains a competitive advantage in image recovery but also has a significant improvement in classification and clustering accuracy. However, the proposed two-view-DC-DeepJSCC-D will sacrifice some image recovery performance to balance multiple tasks. Furthermore, two-view-DC-DeepJSCC-D exhibits stronger robustness across various signal-to-noise ratios.

This paper addressed the trade-off between timeliness and reliability in joint communication and over-the-air computation offloading (JCACO) system under short-packet communications (SPCs). The inevitable decoding errors introduced by SPC lead to errors in the data aggregation process of over-the-air computation (AirComp). Due to limited resources, pursuing high reliability may prevent the JCACO system from meeting delay requirements, resulting in a trade-off between reliability and timeliness. To address this issue, this paper investigates the timeliness and reliability of the JCACO system. Specifically, the moment generating function method is used to derive the delay outage probability (DOP) of the JCACO system, and the outage probability of AirComp is calculated based on the errors that occur during its data aggregation process. The paper established an asymptotic relationship between blocklength, DOP, and AirComp outage probability (AOP). To balance timeliness and reliability, an AOP minimization problem is formulated under constraints of delay, queue stability, and limited resources based on computation offloading strategies and beamformer design. To overcome the issues of slow convergence and susceptibility to local optima in traditional algorithms, this paper proposed a stochastic successive mean-field game (SS-MFG) algorithm. This algorithm utilizes stochastic continuous convex approximation methods to leverage Nash equilibria among different users, achieving faster convergence to the global optimal solution. Numerical results indicate that SS-MFG reduces AOP by up to 60%, offering up to a 20% improvement in optimization performance compared to other algorithms while also converging faster.

The expanding importance of technology, particularly mobile banking, in the financial industry, is examined in this literature review, as well as the crucial role that cybersecurity knowledge plays in protecting online transactions. Users now have the flexibility to conduct payments whenever and wherever they wish thanks to the advent of mobile banking. Further consumer behavior study is necessary due to difficulties with its acceptability. Given the hazards involved in online and mobile banking, cybersecurity is revealed as a critical component. Users’ actions might lead to financial losses since they represent security concerns. The evaluation places a strong emphasis on the necessity of increasing user cybersecurity knowledge and comprehension. Wireless banking is still in its early phases and needs more study on consumer acceptability and behavior despite the greater accessibility of technology. Furthermore, the research study emphasizes the socio-technical difficulties governments encounter in tackling cybersecurity and emphasizes how urgently better readiness is needed in the face of cyberwarfare threats. It investigated how user behavior in mobile banking in particular geographic areas, such as Thailand, relates to cyberspace knowledge and consciousness. The assessment emphasizes the value of technology in banking, the difficulties associated with cybersecurity, and the demand for increased customer knowledge and comprehension to ensure safe digital transactions. To conduct this research activity, standardized questionnaires are used. The technique employed to get this data was convenience sampling. The statistics collection size stood at 500 and was gathered from males as well as females of all ages, belonging to diverse revenue groups, and numerous professional backgrounds. The survey finds that even while these services are becoming widespread in the UAE, customers’ awareness and understanding of cyber security are still insufficient. Users frequently underrate the security dangers involved with online transactions, which might create openings. Additionally, the study underlines the necessity of more effective training programs and efforts to raise mobile banking consumers’ knowledge of cybersecurity issues. It also emphasizes how crucial it is to build cybersecurity precautions into the structure and functioning of services for mobile banking. The purpose of this study was to examine the demographic characteristics of consumers and companies (online transactions) that use mobile banking apps to get special advantages. It was shown that people’s satisfaction with mobile banking applications was influenced by a number of criteria, including age, employment, income, marital status, and educational attainment. Younger consumers, such as students and recent graduates, are seen to be happy than customers of various ages and vocations, and males are thought to be happier than women.

Medical images play a significant part in biomedical diagnosis, but they have a significant feature. The medical images, influenced by factors such as imaging equipment limitations, local volume effect, and others, inevitably exhibit issues like noise, blurred edges, and inconsistent signal strength. These imperfections pose significant challenges and create obstacles for doctors during their diagnostic processes. To address these issues, we present a pathology image segmentation technique based on the multiscale dual attention mechanism (MSDAUnet), which consists of three primary components. Firstly, an image denoising and enhancement module is constructed by using dynamic residual attention and color histogram to remove image noise and improve image clarity. Then, we propose a dual attention module (DAM), which extracts messages from both channel and spatial dimensions, obtains key features, and makes the edge of the lesion area clearer. Finally, capturing multiscale information in the process of image segmentation addresses the issue of uneven signal strength to a certain extent. Each module is combined for automatic pathological image segmentation. Compared with the traditional and typical U-Net model, MSDAUnet has a better segmentation performance. On the dataset provided by the Research Center for Artificial Intelligence of Monash University, the IOU index is as high as 72.7%, which is nearly 7% higher than that of U-Net, and the DSC index is 84.9%, which is also about 7% higher than that of U-Net.

Breast cancer is ranked as the second most common cancer among women globally, highlighting the critical need for precise and early detection methods. Our research introduces a novel approach for classifying benign and malignant breast ultrasound images. We leverage advanced deep learning methodologies, mainly focusing on the vision transformer (ViT) model. Our method distinctively features progressive fine-tuning, a tailored process that incrementally adapts the model to the nuances of breast tissue classification. Ultrasound imaging was chosen for its distinct benefits in medical diagnostics. This modality is noninvasive and cost-effective and demonstrates enhanced specificity, especially in dense breast tissues where traditional methods may struggle. Such characteristics make it an ideal choice for the sensitive task of breast cancer detection. Our extensive experiments utilized the breast ultrasound images dataset, comprising 780 images of both benign and malignant breast tissues. The dataset underwent a comprehensive analysis using several pretrained deep learning models, including VGG16, VGG19, DenseNet121, Inception, ResNet152V2, DenseNet169, DenseNet201, and the ViT. The results presented were achieved without employing data augmentation techniques. The ViT model demonstrated robust accuracy and generalization capabilities with the original dataset size, which consisted of 637 images. Each model’s performance was meticulously evaluated through a robust 10-fold cross-validation technique, ensuring a thorough and unbiased comparison. Our findings are significant, demonstrating that the progressive fine-tuning substantially enhances the ViT model’s capability. This resulted in a remarkable accuracy of 94.49% and an AUC score of 0.921, significantly higher than models without fine-tuning. These results affirm the efficacy of the ViT model and highlight the transformative potential of integrating progressive fine-tuning with transformer models in medical image classification tasks. The study solidifies the role of such advanced methodologies in improving early breast cancer detection and diagnosis, especially when coupled with the unique advantages of ultrasound imaging.

The unique fingerprints of radio frequency (RF) devices play a critical role in enhancing wireless security, optimizing spectrum management, and facilitating device authentication through accurate identification. However, high-accuracy identification models for radio frequency fingerprint (RFF) often come with a significant number of parameters and complexity, making them less practical for real-world deployment. To address this challenge, our research presents a deep convolutional neural network (CNN)–based architecture known as the separation and fusion convolutional neural network (SFCNN). This architecture focuses on enhancing the identification accuracy of RF devices with limited complexity. The SFCNN incorporates two customizable modules: the separation layer, which is responsible for partitioning the data group size adapted to the channel dimension to keep the low complexity, and the fusion layer which is designed to perform deep channel fusion to enhance feature representation. The proposed SFCNN demonstrates improved accuracy and enhanced robustness with fewer parameters compared to the state-of-the-art techniques, including the baseline CNN, Inception, ResNet, TCN, MSCNN, STFT-CNN, and the ResNet-50-1D. The experimental results based on the public datasets demonstrate an average identification accuracy of 97.78% among 21 USRP transmitters. The number of parameters is reduced by at least 8% compared with all the other models, and the identification accuracy is improved among all the models under any considered scenarios. The trade-off performance between the complexity and accuracy of the proposed SFCNN suggests that it is an effective architecture with remarkable development potential.

Federated learning (FL) is a novel approach to privacy-preserving machine learning, enabling remote devices to collaborate on model training without exchanging data among clients. However, it faces several challenges, including limited client-side processing capabilities and non-IID data distributions. To address these challenges, we propose a partitioned FL architecture that a large CNN is divided into smaller networks, which train concurrently with other clients. Within a cluster, multiple clients concurrently train the ensemble model. The Jensen–Shannon divergence quantifies the similarity of predictions across submodels. To address discrepancies in model parameters between local and global models caused by data distribution, we propose an ensemble learning method that integrates a penalty term into the local model’s loss calculation, thereby ensuring synchronization. This method amalgamates predictions and losses across multiple submodels, effectively mitigating accuracy loss during the integration process. Extensive experiments with various Dirichlet parameters demonstrate that our system achieves accelerated convergence and enhanced performance on the CIFAR-10 and CIFAR-100 image classification tasks while remaining robust to partial participation, diverse datasets, and numerous clients. On the CIFAR-10 dataset, our method outperforms FedAvg, FedProx, and SplitFed by 6%–8%; in contrast, it outperforms them by 12%–18% on CIFAR-100.

Counterfactual regret minimization (CFR) is an effective algorithm for solving extensive-form games with imperfect information (IIEGs). However, CFR is only allowed to be applied in known environments, where the transition function of the chance player and the reward function of the terminal node in IIEGs are known. In uncertain situations, such as reinforcement learning (RL) problems, CFR is not applicable. Thus, applying CFR in unknown environments is a significant challenge that can also address some difficulties in the real world. Currently, advanced solutions require more interactions with the environment and are limited by large single-sampling variances to narrow the gap with the real environment. In this paper, we propose a method that combines CFR with information gain to compute the Nash equilibrium (NE) of IIEGs with unknown environments. We use a curiosity-driven approach to explore unknown environments and minimize the discrepancy between uncertain and real environments. In addition, by incorporating information into the reward, the average strategy calculated by CFR can be directly implemented as the interaction policy with the environment, thereby improving the exploration efficiency of our method in uncertain environments. Through experiments on standard testbeds such as Kuhn poker and Leduc poker, our method significantly reduces the number of interactions with the environment compared to the different baselines and computes a more accurate approximate NE within the same number of interaction rounds.