A Dynamic Neighborhood-Based Switching Particle Swarm Optimization Algorithm

FROM: A Fish Recognition-Inspired Optimization Method for Multi-Agent Decision-Making Problems with a Fluid Environment

Underwater multi-agent systems face critical hydrodynamic constraints that significantly degrade the performance of conventional constraint optimization algorithms in dynamic fluid environments. To meet the needs of underwater multi-agent applications, a fish recognition-inspired optimization method (FROM) is proposed in this paper. The proposed method introduces the characteristics of fish recognition. There are two major improvements in the proposed method: the neighbor topology improvement based on vision recognition and the learning strategies improvement based on hydrodynamic recognition. The computational complexity of the proposed algorithm was analyzed, and it was found to be acceptable. The statistical analysis of the experimental results shows that the FROM algorithm performs better than other algorithms in terms of minimum, maximum, standard deviation, mean, and median values calculated from objective functions. With solid experiment results, we conclude that the proposed FROM algorithm is a better solution to solve multi-agent decision-making problems with fluid environment constraints.

A μGal MOEMS gravimeter designed with free-form anti-springs

Gravimeter measures gravitational acceleration, which is valuable for geophysical applications such as hazard forecasting and prospecting. Gravimeters have historically been large and expensive instruments. Micro-Electro-Mechanical-System gravimeters feature small size and low cost through scaling and integration, which may allow large-scale deployment. However, current Micro-Electro-Mechanical-System gravimeters face challenges in achieving ultra-high sensitivity under fabrication tolerance and limited size. Here, we demonstrate a μGal-level Micro-Opto-Electro-Mechanical-System gravimeter by combining a freeform anti-spring design and an optical readout. A multi-stage algorithmic design approach is proposed to achieve high acceleration sensitivity without making high-aspect ratio springs. An optical grating-based readout is integrated, offering pm-level displacement sensitivity. Measurements reveal that the chip-scale sensing unit achieves a resonant frequency of 1.71 Hz and acceleration-displacement sensitivity of over 95 μm/Gal with an etching aspect ratio of smaller than 400:30. The benchmark with a commercial gravimeter PET demonstrates a self-noise of 1.1 μGal Hz-1/2 at 0.5 Hz, sub-1 μGal Hz-1/2 at 0.45 Hz, and a drift rate down to 153 μGal/day. The high performance and small size of the Micro-Opto-Electro-Mechanical-System gravimeter suggest potential applications in industrial, defense, and geophysics.

Optimal design of a novel modified electric eel foraging optimization (MEEFO) based super twisting sliding mode controller for controlling the speed of a switched reluctance motor

Switched Reluctance Motor (SRM) has a very high potential for adjustable speed drive operation due to their cost-effectiveness, high efficiency, robustness, simplicity, etc. Now a days SRMs are widely used in automotive industries as traction motors in electric vehicles and hybrid electric vehicles, air-conditioning compressors, and for other auxiliary services. In this article, a novel super twisting sliding mode controller (STSMC) is proposed to improve the performance of an SRM for reducing the ripple in speed and torque. Initially, a novel Modified Electric Eel Foraging Optimization (MEEFO) technique is developed by incorporating a quasi-oppositional phase and its performance is compared with the conventional Electric Eel Foraging Optimization (EEFO) technique with four popular benchmark functions. Then, both MEEFO and EEFO techniques are implemented to optimally design PI, SMC and STSMC controllers to effectively control the speed of an SRM. The study is carried in three different scenarios such as during starting, during a torque change and during a speed change. Finally, performance of the SRM in real time is studied with OPAL-RT 4510 simulator. It is observed that MEEFO based STSMC exhibits significant improvements in effectively controlling speed of the SRM, as compared to its other proposed counterparts.

Adaptive multi-source domain collaborative fine-tuning for transfer learning

Fine-tuning is an important technique in transfer learning that has achieved significant success in tasks that lack training data. However, as it is difficult to extract effective features for single-source domain fine-tuning when the data distribution difference between the source and the target domain is large, we propose a transfer learning framework based on multi-source domain called adaptive multi-source domain collaborative fine-tuning (AMCF) to address this issue. AMCF utilizes multiple source domain models for collaborative fine-tuning, thereby improving the feature extraction capability of model in the target task. Specifically, AMCF employs an adaptive multi-source domain layer selection strategy to customize appropriate layer fine-tuning schemes for the target task among multiple source domain models, aiming to extract more efficient features. Furthermore, a novel multi-source domain collaborative loss function is designed to facilitate the precise extraction of target data features by each source domain model. Simultaneously, it works towards minimizing the output difference among various source domain models, thereby enhancing the adaptability of the source domain model to the target data. In order to validate the effectiveness of AMCF, it is applied to seven public visual classification datasets commonly used in transfer learning, and compared with the most widely used single-source domain fine-tuning methods. Experimental results demonstrate that, in comparison with the existing fine-tuning methods, our method not only enhances the accuracy of feature extraction in the model but also provides precise layer fine-tuning schemes for the target task, thereby significantly improving the fine-tuning performance.

Parrot optimizer: Algorithm and applications to medical problems

Stochastic optimization methods have gained significant prominence as effective techniques in contemporary research, addressing complex optimization challenges efficiently. This paper introduces the Parrot Optimizer (PO), an efficient optimization method inspired by key behaviors observed in trained Pyrrhura Molinae parrots. The study features qualitative analysis and comprehensive experiments to showcase the distinct characteristics of the Parrot Optimizer in handling various optimization problems. Performance evaluation involves benchmarking the proposed PO on 35 functions, encompassing classical cases and problems from the IEEE CEC 2022 test sets, and comparing it with eight popular algorithms. The results vividly highlight the competitive advantages of the PO in terms of its exploratory and exploitative traits. Furthermore, parameter sensitivity experiments explore the adaptability of the proposed PO under varying configurations. The developed PO demonstrates effectiveness and superiority when applied to engineering design problems. To further extend the assessment to real-world applications, we included the application of PO to disease diagnosis and medical image segmentation problems, which are highly relevant and significant in the medical field. In conclusion, the findings substantiate that the PO is a promising and competitive algorithm, surpassing some existing algorithms in the literature. The supplementary files and open source codes of the proposed Parrot Optimizer (PO) is available at https://aliasgharheidari.com/PO.html and https://github.com/junbolian/PO.

A Random Particle Swarm Optimization Based on Cosine Similarity for Global Optimization and Classification Problems

In today's fast-paced and ever-changing environment, the need for algorithms with enhanced global optimization capability has become increasingly crucial due to the emergence of a wide range of optimization problems. To tackle this issue, we present a new algorithm called Random Particle Swarm Optimization (RPSO) based on cosine similarity. RPSO is evaluated using both the IEEE Congress on Evolutionary Computation (CEC) 2022 test dataset and Convolutional Neural Network (CNN) classification experiments. The RPSO algorithm builds upon the traditional PSO algorithm by incorporating several key enhancements. Firstly, the parameter selection is adapted and a mechanism called Random Contrastive Interaction (RCI) is introduced. This mechanism fosters information exchange among particles, thereby improving the ability of the algorithm to explore the search space more effectively. Secondly, quadratic interpolation (QI) is incorporated to boost the local search efficiency of the algorithm. RPSO utilizes cosine similarity for the selection of both QI and RCI, dynamically updating population information to steer the algorithm towards optimal solutions. In the evaluation using the CEC 2022 test dataset, RPSO is compared with recent variations of Particle Swarm Optimization (PSO) and top algorithms in the CEC community. The results highlight the strong competitiveness and advantages of RPSO, validating its effectiveness in tackling global optimization tasks. Additionally, in the classification experiments with optimizing CNNs for medical images, RPSO demonstrated stability and accuracy comparable to other algorithms and variants. This further confirms the value and utility of RPSO in improving the performance of CNN classification tasks.

PriMPSO: A Privacy-Preserving Multiagent Particle Swarm Optimization Algorithm

Centralized particle swarm optimization (PSO) does not fully exploit the potential of distributed or parallel computing and suffers from single-point-of-failure. Particularly, each particle in PSO comprises a potential solution (e.g., traveling route and neural network model parameters) which is essentially viewed as private data. Unfortunately, previously neither centralized nor distributed PSO algorithms fail to protect privacy effectively. Inspired by secure multiparty computation and multiagent system, this article proposes a privacy-preserving multiagent PSO algorithm (called PriMPSO) to protect each particle's data and enable private data sharing in a privacy-preserving manner. The goal of PriMPSO is to protect each particle's data in a distributed computing paradigm via existing PSO algorithms with competitive performance. Specifically, each particle is executed by an independent agent with its own data, and all agents jointly perform global optimization without sacrificing any particle's data. Thorough investigations show that selecting an exemplar from all particles and updating particles through the exemplar are critical operations for PSO algorithms. To this end, this article designs a privacy-preserving exemplar selection algorithm and a privacy-preserving triple computation protocol to select exemplars and update particles, respectively. Strict privacy analyses and extensive experiments on a benchmark and a realistic task confirm that PriMPSO not only protects particles' privacy but also has uniform convergence performance with the existing PSO algorithm in approximating an optimal solution.

Adaptive Filtering: Issues, Challenges, and Best-Fit Solutions Using Particle Swarm Optimization Variants

Adaptive equalization is crucial in mitigating distortions and compensating for frequency response variations in communication systems. It aims to enhance signal quality by adjusting the characteristics of the received signal. Particle swarm optimization (PSO) algorithms have shown promise in optimizing the tap weights of the equalizer. However, there is a need to enhance the optimization capabilities of PSO further to improve the equalization performance. This paper provides a comprehensive study of the issues and challenges of adaptive filtering by comparing different variants of PSO and analyzing the performance by combining PSO with other optimization algorithms to achieve better convergence, accuracy, and adaptability. Traditional PSO algorithms often suffer from high computational complexity and slow convergence rates, limiting their effectiveness in solving complex optimization problems. To address these limitations, this paper proposes a set of techniques aimed at reducing the complexity and accelerating the convergence of PSO.

Multi-weight susceptible-infected model for predicting COVID-19 in China

The mutant strains of COVID-19 caused a global explosion of infections, including many cities of China. In 2020, a hybrid AI model was proposed by Zheng et al., which accurately predicted the epidemic in Wuhan. As the main part of the hybrid AI model, ISI method makes two important assumptions to avoid over-fitting. However, the assumptions cannot be effectively applied to new mutant strains. In this paper, a more general method, named the multi-weight susceptible-infected model (MSI) is proposed to predict COVID-19 in Chinese Mainland. First, a Gaussian pre-processing method is proposed to solve the problem of data fluctuation based on the quantity consistency of cumulative infection number and the trend consistency of daily infection number. Then, we improve the model from two aspects: changing the grouped multi-parameter strategy to the multi-weight strategy, and removing the restriction of weight distribution of viral infectivity. Experiments on the outbreaks in many places in China from the end of 2021 to May 2022 show that, in China, an individual infected by Delta or Omicron strains of SARS-CoV-2 can infect others within 3-4 days after he/she got infected. Especially, the proposed method effectively predicts the trend of the epidemics in Xi'an, Tianjin, Henan, and Shanghai from December 2021 to May 2022.

The Performance Analysis of PSO-ResNet for the Fault Diagnosis of Vibration Signals Based on the Pipeline Robot

In the context of pipeline robots, the timely detection of faults is crucial in preventing safety incidents. In order to ensure the reliability and safety of the entire application process, robots' fault diagnosis techniques play a vital role. However, traditional diagnostic methods for motor drive end-bearing faults in pipeline robots are often ineffective when the operating conditions are variable. An efficient solution for fault diagnosis is the application of deep learning algorithms. This paper proposes a rolling bearing fault diagnosis method (PSO-ResNet) that combines a Particle Swarm Optimization algorithm (PSO) with a residual network. A number of vibration signal sensors are placed at different locations in the pipeline robot to obtain vibration signals from different parts. The input to the PSO-ResNet algorithm is a two-bit image obtained by continuous wavelet transform of the vibration signal. The accuracy of this fault diagnosis method is compared with different types of fault diagnosis algorithms, and the experimental analysis shows that PSO-ResNet has higher accuracy. The algorithm was also deployed on an Nvidia Jetson Nano and a Raspberry Pi 4B. Through comparative experimental analysis, the proposed fault diagnosis algorithm was chosen to be deployed on the Nvidia Jetson Nano and used as the core fault diagnosis control unit of the pipeline robot for practical scenarios. However, the PSO-ResNet model needs further improvement in terms of accuracy, which is the focus of future research work.

AGGN: Attention-based glioma grading network with multi-scale feature extraction and multi-modal information fusion

In this paper, a magnetic resonance imaging (MRI) oriented novel attention-based glioma grading network (AGGN) is proposed. By applying the dual-domain attention mechanism, both channel and spatial information can be considered to assign weights, which benefits highlighting the key modalities and locations in the feature maps. Multi-branch convolution and pooling operations are applied in a multi-scale feature extraction module to separately obtain shallow and deep features on each modality, and a multi-modal information fusion module is adopted to sufficiently merge low-level detailed and high-level semantic features, which promotes the synergistic interaction among different modality information. The proposed AGGN is comprehensively evaluated through extensive experiments, and the results have demonstrated the effectiveness and superiority of the proposed AGGN in comparison to other advanced models, which also presents high generalization ability and strong robustness. In addition, even without the manually labeled tumor masks, AGGN can present considerable performance as other state-of-the-art algorithms, which alleviates the excessive reliance on supervised information in the end-to-end learning paradigm.

A scheduling route planning algorithm based on the dynamic genetic algorithm with ant colony binary iterative optimization for unmanned aerial vehicle spraying in multiple tea fields

The complex environments and weak infrastructure constructions of hilly mountainous areas complicate the effective path planning for plant protection operations. Therefore, with the aim of improving the current status of complicated tea plant protections in hills and slopes, an unmanned aerial vehicle (UAV) multi-tea field plant protection route planning algorithm is developed in this paper and integrated with a full-coverage spraying route method for a single region. By optimizing the crossover and mutation operators of the genetic algorithm (GA), the crossover and mutation probabilities are automatically adjusted with the individual fitness and a dynamic genetic algorithm (DGA) is proposed. The iteration period and reinforcement concepts are then introduced in the pheromone update rule of the ant colony optimization (ACO) to improve the convergence accuracy and global optimization capability, and an ant colony binary iteration optimization (ACBIO) is proposed. Serial fusion is subsequently employed on the two algorithms to optimize the route planning for multi-regional operations. Simulation tests reveal that the dynamic genetic algorithm with ant colony binary iterative optimization (DGA-ACBIO) proposed in this study shortens the optimal flight range by 715.8 m, 428.3 m, 589 m, and 287.6 m compared to the dynamic genetic algorithm, ant colony binary iterative algorithm, artificial fish swarm algorithm (AFSA) and particle swarm optimization (PSO), respectively, for multiple tea field scheduling route planning. Moreover, the search time is reduced by more than half compared to other bionic algorithms. The proposed algorithm maintains advantages in performance and stability when solving standard traveling salesman problems with more complex objectives, as well as the planning accuracy and search speed. In this paper, the research on the planning algorithm of plant protection route for multi-tea field scheduling helps to shorten the inter-regional scheduling range and thus reduces the cost of plant protection.

Intelligent Extraction of Salient Feature From Electroencephalogram Using Redundant Discrete Wavelet Transform

At present, electroencephalogram (EEG) signals play an irreplaceable role in the diagnosis and treatment of human diseases and medical research. EEG signals need to be processed in order to reduce the adverse effects of irrelevant physiological process interference and measurement noise. Wavelet transform (WT) can provide a time-frequency representation of a dynamic process, and it has been widely utilized in salient feature analysis of EEG. In this paper, we investigate the problem of translation variability (TV) in discrete wavelet transform (DWT), which causes degradation of time-frequency localization. It will be verified through numerical simulations that TV is caused by downsampling operations in decomposition process of DWT. The presence of TV may cause severe distortions of features in wavelet subspaces. However, this phenomenon has not attracted much attention in the scientific community. Redundant discrete wavelet transform (RDWT) is derived by eliminating the downsampling operation. RDWT enjoys the attractive merit of translation invariance. RDWT shares the same time-frequency pattern with that of DWT. The discrete delta impulse function is used to test the time-frequency response of DWT and RDWT in wavelet subspaces. The results show that DWT is very sensitive to the translation of delta impulse function, while RDWT keeps the decomposition results unchanged. This conclusion has also been verified again in decomposition of actual EEG signals. In conclusion, to avoid possible distortions of features caused by translation sensitivity in DWT, we recommend the use of RDWT with more stable performance in BCI research and clinical applications.

scSE-NL V-Net: A Brain Tumor Automatic Segmentation Method Based on Spatial and Channel "Squeeze-and-Excitation" Network With Non-local Block

Intracranial tumors are commonly known as brain tumors, which can be life-threatening in severe cases. Magnetic resonance imaging (MRI) is widely used in diagnosing brain tumors because of its harmless to the human body and high image resolution. Due to the heterogeneity of brain tumor height, MRI imaging is exceptionally irregular. How to accurately and quickly segment brain tumor MRI images is still one of the hottest topics in the medical image analysis community. However, according to the brain tumor segmentation algorithms, we could find now, most segmentation algorithms still stay in two-dimensional (2D) image segmentation, which could not obtain the spatial dependence between features effectively. In this study, we propose a brain tumor automatic segmentation method called scSE-NL V-Net. We try to use three-dimensional (3D) data as the model input and process the data by 3D convolution to get some relevance between dimensions. Meanwhile, we adopt non-local block as the self-attention block, which can reduce inherent image noise interference and make up for the lack of spatial dependence due to convolution. To improve the accuracy of convolutional neural network (CNN) image recognition, we add the "Spatial and Channel Squeeze-and-Excitation" Network (scSE-Net) to V-Net. The dataset used in this paper is from the brain tumor segmentation challenge 2020 database. In the test of the official BraTS2020 verification set, the Dice similarity coefficient is 0.65, 0.82, and 0.76 for the enhanced tumor (ET), whole tumor (WT), and tumor core (TC), respectively. Thereby, our model can make an auxiliary effect on the diagnosis of brain tumors established.

Evolutionary Dynamics of Division of Labor Games for Underwater Searching Tasks

Division of labor in self-organized groups is a problem of both theoretical significance and application value. Many application problems in the real world require efficient task allocation. We propose a model combining bio-inspiration and evolutionary game theory. This research model theoretically analyzes the problem of target search in unknown areas for multi-robot systems. If the robot’s operating area is underwater, the problem becomes more complicated due to its information sharing restrictions. Additionally, it drives strategy updates and calculates the fixed probability of relevant strategies, using evolutionary game theory and the commonly used Fermi function. Our study estimates the fixed probability under arbitrary selection intensity and the fixed probability and time under weak selection for the two-player game model. In the multi-player game, we get these results for weak selection, which is conducive to the coexistence of the two strategies. Moreover, the conducted simulations confirm our analysis. These results help to understand and design effective mechanisms in which self-organizing collective dynamics appears in the form of maximizing the benefits of multi-agent systems in the case of the asymmetric game.

Elite Directed Particle Swarm Optimization with Historical Information for High-Dimensional Problems

High-dimensional optimization problems are ubiquitous in every field nowadays, which seriously challenge the optimization ability of existing optimizers. To solve this kind of optimization problems effectively, this paper proposes an elite-directed particle swarm optimization (EDPSO) with historical information to explore and exploit the high-dimensional solution space efficiently. Specifically, in EDPSO, the swarm is first separated into two exclusive sets based on the Pareto principle (80-20 rule), namely the elite set containing the top best 20% of particles and the non-elite set consisting of the remaining 80% of particles. Then, the non-elite set is further separated into two layers with the same size from the best to the worst. As a result, the swarm is divided into three layers. Subsequently, particles in the third layer learn from those in the first two layers, while particles in the second layer learn from those in the first layer, on the condition that particles in the first layer remain unchanged. In this way, the learning effectiveness and the learning diversity of particles could be largely promoted. To further enhance the learning diversity of particles, we maintain an additional archive to store obsolete elites, and use the predominant elites in the archive along with particles in the first two layers to direct the update of particles in the third layer. With these two mechanisms, the proposed EDPSO is expected to compromise search intensification and diversification well at the swarm level and the particle level, to explore and exploit the solution space. Extensive experiments are conducted on the widely used CEC’2010 and CEC’2013 high-dimensional benchmark problem sets to validate the effectiveness of the proposed EDPSO. Compared with several state-of-the-art large-scale algorithms, EDPSO is demonstrated to achieve highly competitive or even much better performance in tackling high-dimensional problems.

Differential Elite Learning Particle Swarm Optimization for Global Numerical Optimization

Although particle swarm optimization (PSO) has been successfully applied to solve optimization problems, its optimization performance still encounters challenges when dealing with complicated optimization problems, especially those with many interacting variables and many wide and flat local basins. To alleviate this issue, this paper proposes a differential elite learning particle swarm optimization (DELPSO) by differentiating the two guiding exemplars as much as possible to direct the update of each particle. Specifically, in this optimizer, particles in the current swarm are divided into two groups, namely the elite group and non-elite group, based on their fitness. Then, particles in the non-elite group are updated by learning from those in the elite group, while particles in the elite group are not updated and directly enter the next generation. To comprise fast convergence and high diversity at the particle level, we let each particle in the non-elite group learn from two differential elites in the elite group. In this way, the learning effectiveness and the learning diversity of particles is expectedly improved to a large extent. To alleviate the sensitivity of the proposed DELPSO to the newly introduced parameters, dynamic adjustment strategies for parameters were further designed. With the above two main components, the proposed DELPSO is expected to compromise the search intensification and diversification well to explore and exploit the solution space properly to obtain promising performance. Extensive experiments conducted on the widely used CEC 2017 benchmark set with three different dimension sizes demonstrated that the proposed DELPSO achieves highly competitive or even much better performance than state-of-the-art PSO variants.

Comparative performance evaluation of island particle swarm algorithm applied to solve constrained and unconstrained optimization problems

Distributed evolutionary computation has been efficiently used, in last decades, to solve complex optimization problems. Island model (IM) is considered as a distributed population paradigm employed by evolutionary algorithms to preserve the diversification and, thus, to improve the local search. In this article, we study different island model techniques integrated in to particle swarm optimization (PSO) algorithm in order to overcome its drawbacks: premature convergence and lack of diversity. The first IMPSO approach consists in using the migration process in a static way to enhance the police migration strategy. On the other hand, the second approach, called dynamic-IMPSO, consists in integrating a learning strategy in case of migration. The last version called constrained-IMPSO utilizes a stochastic technique to ensure good communication between the sub-swarms. To evaluate and verify the effectiveness of the proposed algorithms, several standard constrained and unconstrained benchmark functions are used. The obtained results confirm that these algorithms are more efficient in solving low-dimensional problems (CEC’05), large-scale optimization problems (CEC’13) and constrained problems (CEC’06), compared to other well-known evolutionary algorithms.

Stochastic Cognitive Dominance Leading Particle Swarm Optimization for Multimodal Problems

Optimization problems become increasingly complicated in the era of big data and Internet of Things, which significantly challenges the effectiveness and efficiency of existing optimization methods. To effectively solve this kind of problems, this paper puts forward a stochastic cognitive dominance leading particle swarm optimization algorithm (SCDLPSO). Specifically, for each particle, two personal cognitive best positions are first randomly selected from those of all particles. Then, only when the cognitive best position of the particle is dominated by at least one of the two selected ones, this particle is updated by cognitively learning from the better personal positions; otherwise, this particle is not updated and directly enters the next generation. With this stochastic cognitive dominance leading mechanism, it is expected that the learning diversity and the learning efficiency of particles in the proposed optimizer could be promoted, and thus the optimizer is expected to explore and exploit the solution space properly. At last, extensive experiments are conducted on a widely acknowledged benchmark problem set with different dimension sizes to evaluate the effectiveness of the proposed SCDLPSO. Experimental results demonstrate that the devised optimizer achieves highly competitive or even much better performance than several state-of-the-art PSO variants.

Self-Regulated Particle Swarm Multi-Task Optimization

Population based search techniques have been developed and applied to wide applications for their good performance, such as the optimization of the unmanned aerial vehicle (UAV) path planning problems. However, the search for optimal solutions for an optimization problem is usually expensive. For example, the UAV problem is a large-scale optimization problem with many constraints, which makes it hard to get exact solutions. Especially, it will be time-consuming when multiple UAV problems are waiting to be optimized at the same time. Evolutionary multi-task optimization (EMTO) studies the problem of utilizing the population-based characteristics of evolutionary computation techniques to optimize multiple optimization problems simultaneously, for the purpose of further improving the overall performance of resolving all these problems. EMTO has great potential in solving real-world problems more efficiently. Therefore, in this paper, we develop a novel EMTO algorithm using a classical PSO algorithm, in which the developed knowledge transfer strategy achieves knowledge transfer between task by synthesizing the transferred knowledges from a selected set of component tasks during the updating of the velocities of population. Two knowledge transfer strategies are developed along with two versions of the proposed algorithm. The proposed algorithm is compared with the multifactorial PSO algorithm, the SREMTO algorithm, the popular multifactorial evolutionary algorithm and a classical PSO algorithm on nine popular single-objective MTO problems and six five-task MTO problems, which demonstrates its superiority.

Empower parameterized generative adversarial networks using a novel particle swarm optimizer: algorithms and applications

In this paper, a novel parameterized generative adversarial network (GAN) is proposed where the parameters are introduced to enhance the performance of image segmentation. The developed algorithm is applied to the image-based crack detection problem on the thermal data obtained through the non-destructive testing process. A new regularization term, which contains three tunable hyperparameters, embedded into the objective function of the GAN in order to improve the contrast ratio of certain areas of the image so as to benefit the crack detection process. To automate the selection of the optimal hyperparameters of the GAN, a new particle swarm optimization (PSO) algorithm is put forward where a neighborhood-based velocity updating strategy is developed for the purpose of thoroughly exploring the problem space. The proposed PSO-based GAN algorithm is shown to 1) work well in detecting cracks on the thermal data generated by the eddy current pulsed thermography technique; and 2) outperforms other conventional GAN algorithms.

Identifying the Phenotypic and Temporal Heterogeneity of Knee Osteoarthritis: Data From the Osteoarthritis Initiative

Objective: Previous studies discussing phenotypic and temporal heterogeneity of knee osteoarthritis (KOA) separately have fatal limitations that either clustering patients with similar severity or assuming all knees have a single common progression pattern, which are unreliable. This study tried to uncover more reliable information on phenotypic and temporal heterogeneity of KOA. Design: Data were from Osteoarthritis Initiative database. Six hundred and seventy-eight unilateral knees that have greater Kellgren and Lawrence (KL) grade than the contralateral knees at baseline and in all follow-up 48 months were included. Measurements of biomarkers at baseline were chosen. Subtype and Stage Inference model (SuStaIn) was applied as a subtype-progression model to identify subtypes, subtype biomarker progress sequences and stages of KOA. Results: This study identified three subtypes which account for 15, 61, and 24% of knees, respectively. Each subtype has distinct subtype biomarker progress sequence. For knees with KL grade 0/1, 2, 3, and 4, they have different distributions on stage and 26, 53, 89, and 95% of them are strongly assigned to subtypes. When assessing whether a knee has KL (grade ≥ 2), subtypes and stages from subtypes-progression model (SuStaIn) are significantly better fitting than those from subtypes-only (mixture of Gaussians) (likelihood ratio = 105.59, p = 2.2 × 10^-16) or stages-only (SuStaIn where setting c = 1) (likelihood ratio = 58.04, p = 2.57 × 10^-14) model. Stages in subtypes-progression model has greater β than stages-only model. Subtypes from subtypes-progression model have no statistical significance. Conclusions: For subtypes-progression model, stages contain more complete temporal information and subtypes are closer to real OA subtypes.

Research on the Construction and Application of Breast Cancer-Specific Database System Based on Full Data Lifecycle

Relying on the Biomedical Big Data Center of West China Hospital, this paper makes an in-depth research on the construction method and application of breast cancer-specific database system based on full data lifecycle, including the establishment of data standards, data fusion and governance, multi-modal knowledge graph, data security sharing and value application of breast cancer-specific database. The research was developed by establishing the breast cancer master data and metadata standards, then collecting, mapping and governing the structured and unstructured clinical data, and parsing and processing the electronic medical records with NLP natural language processing method or other applicable methods, as well as constructing the breast cancer-specific database system to support the application of data in clinical practices, scientific research, and teaching in hospitals, giving full play to the value of medical big data of the Biomedical Big Data Center of West China Hospital.

Gaussian Process Autoregression for Joint Angle Prediction Based on sEMG Signals

There is uncertainty in the neuromusculoskeletal system, and deterministic models cannot describe this significant presence of uncertainty, affecting the accuracy of model predictions. In this paper, a knee joint angle prediction model based on surface electromyography (sEMG) signals is proposed. To address the instability of EMG signals and the uncertainty of the neuromusculoskeletal system, a non-parametric probabilistic model is developed using a Gaussian process model combined with the physiological properties of muscle activation. Since the neuromusculoskeletal system is a dynamic system, the Gaussian process model is further combined with a non-linear autoregressive with eXogenous inputs (NARX) model to create a Gaussian process autoregression model. In this paper, the normalized root mean square error (NRMSE) and the correlation coefficient (CC) are compared between the joint angle prediction results of the Gaussian process autoregressive model prediction and the actual joint angle under three test scenarios: speed-dependent, multi-speed and speed-independent. The mean of NRMSE and the mean of CC for all test scenarios in the healthy subjects dataset and the hemiplegic patients dataset outperform the results of the Gaussian process model, with significant differences (p < 0.05 and p < 0.05, p < 0.05 and p < 0.05). From the perspective of uncertainty, a non-parametric probabilistic model for joint angle prediction is established by using Gaussian process autoregressive model to achieve accurate prediction of human movement.

Diagnosis of Patellofemoral Pain Syndrome Based on a Multi-Input Convolutional Neural Network With Data Augmentation

Patellofemoral pain syndrome (PFPS) is a common disease of the knee. Despite its high incidence rate, its specific cause remains unclear. The artificial neural network model can be used for computer-aided diagnosis. Traditional diagnostic methods usually only consider a single factor. However, PFPS involves different biomechanical characteristics of the lower limbs. Thus, multiple biomechanical characteristics must be considered in the neural network model. The data distribution between different characteristic dimensions is different. Thus, preprocessing is necessary to make the different characteristic dimensions comparable. However, a general rule to follow in the selection of biomechanical data preprocessing methods is lacking, and different preprocessing methods have their own advantages and disadvantages. Therefore, this paper proposes a multi-input convolutional neural network (MI-CNN) method that uses two input channels to mine the information of lower limb biomechanical data from two mainstream data preprocessing methods (standardization and normalization) to diagnose PFPS. Data were augmented by horizontally flipping the multi-dimensional time-series signal to prevent network overfitting and improve model accuracy. The proposed method was tested on the walking and running datasets of 41 subjects (26 patients with PFPS and 15 pain-free controls). Three joint angles of the lower limbs and surface electromyography signals of seven muscles around the knee joint were used as input. MI-CNN was used to automatically extract features to classify patients with PFPS and pain-free controls. Compared with the traditional single-input convolutional neural network (SI-CNN) model and previous methods, the proposed MI-CNN method achieved a higher detection sensitivity of 97.6%, a specificity of 76.0%, and an accuracy of 89.0% on the running dataset. The accuracy of SI-CNN in the running dataset was about 82.5%. The results prove that combining the appropriate neural network model and biomechanical analysis can establish an accurate, convenient, and real-time auxiliary diagnosis system for PFPS to prevent misdiagnosis.