Search Results (55)

Variational inequality problems (VIPs) provide a versatile framework for modeling a wide range of real-world applications, including those in economics, engineering, transportation, and image processing. In this paper, we propose a novel iterative algorithm for solving VIPs in real Hilbert spaces. The method integrates a double-inertial mechanism with the two-subgradient extragradient scheme, leading to improved convergence speed and computational efficiency. A distinguishing feature of the algorithm is its self-adaptive step size strategy, which generates a non-monotonic sequence of step sizes without requiring prior knowledge of the Lipschitz constant. Under the assumption of monotonicity for the underlying operator, we establish strong convergence results. Numerical experiments under various initial conditions demonstrate the method’s effectiveness and robustness, confirming its practical advantages and its natural extension of existing techniques for solving VIPs. Full article

Herein, we present two hybrid inertial self-adaptive iterative methods for determining the combined solution of the split variational inclusions and fixed-point problems. Our methods include viscosity approximation, fixed-point iteration, and inertial extrapolation in the initial step of each iteration. We employ two self-adaptive step sizes to compute the iterative sequence, which do not require the pre-calculated norm of a bounded linear operator. We prove strong convergence theorems to approximate the common solution of the split variational inclusions and fixed-point problems. Further, we implement our methods and results to examine split variational inequality and split common fixed-point problems. Finally, we illustrate our methods and compare them with some known methods existing in the literature. Full article

In this work, we study a class of variational inequality problems defined over the intersection of sub-level sets of a countable family of convex functions. We propose a new iterative method for approximating the solution within the framework of Hilbert spaces. The method incorporates several strategies, including inertial effects, a self-adaptive step size, and a relaxation technique, to enhance convergence properties. Notably, it requires computing only a single projection onto a half space. Using some mild conditions, we prove that the sequence generated by our proposed method is strongly convergent to a minimum-norm solution to the problem. Finally, we present some numerical results that validate the applicability of our proposed method. Full article

In this paper, an Improved Manta Ray Foraging Optimization (IMRFO) algorithm is proposed to address the challenge of parameter tuning in traditional PID controllers for artillery stabilization systems. The proposed algorithm introduces chaotic mapping to optimize the initial population, enhancing the global search capability; additionally, a sigmoid function and Lévy flight-based dynamic adjustment strategy regulate the selection factor and step size, improving both convergence speed and optimization accuracy. Comparative experiments using five benchmark test functions demonstrate that the IMRFO algorithm outperforms five commonly used heuristic algorithms in four cases. The proposed algorithm is validated through co-simulation and physical platform experiments. Experimental results show that the proposed approach significantly improves control accuracy and response speed, offering an effective solution for optimizing complex nonlinear control systems. By introducing heuristic optimization algorithms for self-tuning artillery stabilization system parameters, this work provides a new approach to enhancing the intelligence and adaptability of modern artillery control. Full article

The automatic and accurate segmentation of bladder tumors is a key step in assisting urologists in diagnosis and analysis. At present, existing Transformer-based methods have limited ability to restore local detail features and insufficient boundary segmentation capabilities. We propose FEBE-Net, which aims to effectively capture global and remote semantic features, preserve more local detail information, and provide clearer and more precise boundaries. Specifically, first, we use PVT v2 backbone to learn multi-scale global feature representations to adapt to changes in bladder tumor size and shape. Secondly, we propose a new feature exploration attention module (FEA) to fully explore the potential local detail information in the shallow features extracted by the PVT v2 backbone, eliminate noise, and supplement the missing fine-grained details for subsequent decoding stages. At the same time, we propose a new boundary enhancement and refinement module (BER), which generates high-quality boundary clues through boundary detection operators to help the decoder more effectively preserve the boundary features of bladder tumors and refine and adjust the final predicted feature map. Then, we propose a new efficient self-attention calibration decoder module (ESCD), which, with the help of boundary clues provided by the BER module, gradually and effectively recovers global contextual information and local detail information from high-level features after calibration enhancement and low-level features after exploration attention. Extensive experiments on the cystoscopy dataset BtAMU and five colonoscopy datasets have shown that FEBE-Net outperforms 11 state-of-the-art (SOTA) networks in segmentation performance, with higher accuracy, stronger robust stability, and generalization ability. Full article

Aiming to address the problems of nonlinearity, a large time delay, poor adjustment ability, and a difficult parameter setting process of the tension control system of belt conveyor tensioning devices, an adaptive Proportional-Integral-Derivative (PID) parameter self-tuning algorithm based on an improved seeker optimization algorithm (ISOA) is proposed in this paper. The algorithm uses inertia weight random mutation to determine step size. An improved boundary reflection strategy avoids the defect of a large number of out-of-bound individuals gathering on the boundary in a traditional algorithm, and projects the individual reflection beyond the boundary into the boundary, which increases the diversity of the population and improves the convergence accuracy of the algorithm. To improve the system response speed and suppress the overshoot problem of the control target, coefficients related to the proportional term are introduced into the fitness function to accelerate the convergence of the algorithm. The improved algorithm is tested on three test functions such as Sphere and compared with other classical algorithms, which verify that the proposed algorithm is better in accuracy and stability. Finally, the interference and tracking performance of the ISOA-PID controller are verified in industrial experiments, which show that the PID controller optimized using the ISOA has good control quality and robustness. Full article

In this paper, we investigate a class of hierarchical variational inequalities (HVIPs, i.e., strongly monotone variational inequality problems defined on the solution set of multiple-set split common fixed-point problems) with quasi-pseudocontractive mappings in real Hilbert spaces, with special cases being able to be found in many important engineering practical applications, such as image recognizing, signal processing, and machine learning. In order to solve HVIPs of potential application value, inspired by the primal-dual algorithm, we propose a novel accelerated cyclic iterative algorithm that combines the inertial method with a correction term and a self-adaptive step-size technique. Our approach eliminates the need for prior knowledge of the bounded linear operator norm. Under appropriate assumptions, we establish strong convergence of the algorithm. Finally, we apply our novel iterative approximation to solve multiple-set split feasibility problems and verify the effectiveness of the proposed iterative algorithm through numerical results. Full article

In this paper, two Halpern-type inertial iteration methods with self-adaptive step size are proposed for estimating the solution of split common null point problems (${\mathrm{S}}_{\mathrm{p}}\mathrm{CNPP}$) in such a way that the Halpern iteration and inertial extrapolation are computed simultaneously in the beginning of each iteration. We prove the strong convergence of sequences driven by the suggested methods without estimating the norm of bounded linear operator when certain appropriate assumptions are made. We demonstrate the efficiency of our iterative methods and compare them with some related and well-known results using relevant numerical examples. Full article

We study three classes of variational inclusion problems in the framework of a real Hilbert space and propose a simple modification of Tseng’s forward-backward-forward splitting method for solving such problems. Our algorithm is obtained via a certain regularization procedure and uses self-adaptive step sizes. We show that the approximating sequences generated by our algorithm converge strongly to a solution of the problems under suitable assumptions on the regularization parameters. Furthermore, we apply our results to an elastic net penalty problem in statistical learning theory and to split feasibility problems. Moreover, we illustrate the usefulness and effectiveness of our algorithm by using numerical examples in comparison with some existing relevant algorithms that can be found in the literature. Full article

Photovoltaic (PV) power generation is considered to be a clean energy source. Solar modules suffer from nonlinear behavior, which makes the maximum power point tracking (MPPT) technique for efficient PV systems particularly important. Conventional MPPT techniques are easy to implement but require fine tuning of their fixed step size. Unlike conventional MPPT, the MPPT based on reinforcement learning (RL-MPPT) has the potential to self-learn to tune step size, which is more adaptable to changing environments. As one of the typical RL algorithms, the Q-learning algorithm can find the optimal control strategy through the learned experiences stored in a Q-table. Thus, as the cornerstone of this algorithm, the Q-table has a significant impact on control ability. In this paper, a novel Q-table of reinforcement learning is proposed to maximize tracking efficiency with improved Q-table update technology. The proposed method discards the traditional MPPT idea and makes full use of the inherent characteristics of the Q-learning algorithm such as its fast dynamic response and simple algorithm principle. By establishing six kinds of Q-tables based on the RL-MPPT method, the optimal discretized state of a photovoltaic system is found to make full use of the energy of the photovoltaic system and reduce power loss. Therefore, under the En50530 dynamic test standard, this work compares the simulation and experimental results and their tracking efficiency using six kinds of Q-table, individually. Full article

A modified viscosity-type self-adaptive iterative algorithm is presented in this study, having a strong convergence theorem for estimating the common solution to the split generalized equilibrium problem along with the split common null point problem with multiple output sets, subject to some reasonable control sequence restrictions. The suggested algorithm and its immediate consequences are also discussed. The effectiveness of the proposed algorithm is finally demonstrated through analytical examples. The findings presented in this paper will help to consolidate, extend, and improve upon a number of recent findings in the literature. Full article

Manually tuning the hyperparameters of a deep learning model is not only a time-consuming and labor-intensive process, but it can also easily lead to issues like overfitting or underfitting, hindering the model’s full convergence. To address this challenge, we present a BiLSTM-TCSA model (BiLSTM combine TextCNN and Self-Attention) for deep learning-based sentiment analysis of short texts, utilizing an improved particle swarm optimization (IPSO). This approach mimics the global random search behavior observed in bird foraging, allowing for adaptive optimization of model hyperparameters. In this methodology, an initial step involves employing a Generative Adversarial Network (GAN) mechanism to generate a substantial corpus of perturbed text, augmenting the model’s resilience to disturbances. Subsequently, global semantic insights are extracted through Bidirectional Long Short Term Memory networks (BiLSTM) processing. Leveraging Convolutional Neural Networks for Text (TextCNN) with diverse convolution kernel sizes enables the extraction of localized features, which are then concatenated to construct multi-scale feature vectors. Concluding the process, feature vector refinement and the classification task are accomplished through the integration of Self-Attention and Softmax layers. Empirical results underscore the effectiveness of the proposed approach in sentiment analysis tasks involving succinct texts containing limited information. Across four distinct datasets, our method attains impressive accuracy rates of 91.38%, 91.74%, 85.49%, and 94.59%, respectively. This performance constitutes a notable advancement when compared against conventional deep learning models and baseline approaches. Full article

To enhance the efficiency of mechanical automatic picking of cherry tomatoes in a precision agriculture environment, this study proposes an improved target detection algorithm based on YOLOv5n. The improvement steps are as follows: First, the K-means++ clustering algorithm is utilized to update the scale and aspect ratio of the anchor box, adapting it to the shape characteristics of cherry tomatoes. Secondly, the coordinate attention (CA) mechanism is introduced to expand the receptive field range and reduce interference from branches, dead leaves, and other backgrounds in the recognition of cherry tomato maturity. Next, the traditional loss function is replaced by the bounding box regression loss with dynamic focusing mechanism (WIoU) loss function. The outlier degree and dynamic nonmonotonic focusing mechanism are introduced to address the boundary box regression balance problem between high-quality and low-quality data. This research employs a self-built cherry tomato dataset to train the target detection algorithms before and after the improvements. Comparative experiments are conducted with YOLO series algorithms. The experimental results indicate that the improved model has achieved a 1.4% increase in both precision and recall compared to the previous model. It achieves an average accuracy mAP of 95.2%, an average detection time of 5.3 ms, and a weight file size of only 4.4 MB. These results demonstrate that the model fulfills the requirements for real-time detection and lightweight applications. It is highly suitable for deployment in embedded systems and mobile devices. The improved model presented in this paper enables real-time target recognition and maturity detection for cherry tomatoes. It provides rapid and accurate target recognition guidance for achieving mechanical automatic picking of cherry tomatoes. Full article

To investigate if the Personality Disorder (PD) severity concept (Criterion A) of the ICD-11 and DSM-5 AMPD is applicable to children and adolescents, following the ICD-11 lifespan perspective of mental disorders, age-specific and informant-adapted assessment tools are needed. The LoPF-Q 6-18 PR (Levels of Personality Functioning Questionnaire Parent Rating) was developed to assess Impaired Personality Functioning (IPF) in children aged 6–18 in parent-reported form. It is based on the established self-report questionnaire LoPF-Q 12-18. Psychometric properties were investigated in a German-speaking clinical and school sample containing 599 subjects. The final 36-item version of LoPF-Q 6-18 PR showed good scale reliabilities with 0.96 for the total scale IPF and 0.90-0.87 for the domain scales Identity, Self-direction, Empathy, and Intimacy/Attachment and an acceptable model fit in a hierarchical CFA with CFI = 0.936, RMSEA = 0.078, and SRMR = 0.068. The total score discriminated significantly and with large effect sizes between the school population and (a) adolescent PD patients (d = 2.7 standard deviations) and (b) the younger patients (6–11-year-olds) with internalizing and externalizing disorders (d = 2.2 standard deviations). Informant agreement between parent and self-report was good at 0.47. Good construct validity can be assumed given sound covariation with related measures of psychopathology (CBCL 4-18, STiP-5.1, OPD-CA2-SQ PR) and maladaptive traits (PID5BF+ M CA IRF) in line with theory and matching the result patterns obtained in older samples in self-report. The results suggest that parent-reported assessments of IPF and maladaptive traits are equivalent to self-reported measures for Criterion A and B. Assessing IPF as early as age six might be a valuable step to foster early detection of PD, or maladaptive personality development, respectively individuals at risk. Full article

This paper proposes an improved Bacterial Foraging Optimization for economically optimal dispatching of the microgrid. Three optimized steps are presented to solve the slow convergence, poor precision, and low efficiency of traditional Bacterial Foraging Optimization. First, the self-adaptive step size equation in the chemotaxis process is present, and the particle swarm velocity equation is used to improve the convergence speed and precision of the algorithm. Second, the crisscross algorithm is used to enrich the replication population and improve the global search performance of the algorithm in the replication process. Finally, the dynamic probability and sine-cosine algorithm are used to solve the problem of easy loss of high-quality individuals in dispersal. Quantitative analysis and experiments demonstrated the superiority of the algorithm in the benchmark function. In addition, this study built a multi-objective microgrid dynamic economic dispatch model and dealt with the uncertainty of wind and solar using the Monte Carlo method in the model. Experiments show that this model can effectively reduce the operating cost of the microgrid, improve economic benefits, and reduce environmental pollution. The economic cost is reduced by 3.79% compared to the widely used PSO, and the economic cost is reduced by 5.23% compared to the traditional BFO. Full article