Search

Traditional federated learning faces challenges such as high communication costs, structural heterogeneity,and insufficient privacy protection. To address these issues, this paper proposes a federated learning evolutionary algorithm that applies sparse evolutionary training algorithm to reduce communication costs and integrates local differential privacy protection for participants’ privacy. Additionally, it utilizes the NSGA-Ⅲ algorithm to optimize the network structure and sparsity of the global federated learning model, adjusting the relationship between data availability and privacy protection. This achieves a balance between the effectiveness, communication costs, and privacy of the global federated learning model. Experimental results under unstable communication environments demonstrate that, on the MNIST and CIFAR-10 datasets, compared to the solution with the lowest error rate using the FNSGA-Ⅲ algorithm, the proposed algorithm improves communication efficiency by 57. 19% and 52. 17%, respectively. The participants also achieved（3. 46, 10-4） and（6. 52, 10-4）-local differential privacy. This algorithm can effectively reduce communication costs and protect participant privacy without significantly compromising the accuracy of the global model. [ABSTRACT FROM AUTHOR]

In view of the problems of data sparsity and the diversity in academic paper recom-mender systems,based on CONVNCF, this paper proposed an algorithm of convolution with word and heterogeneous information network for academic paper recommendation ( WN -APR) . Firstly, WN -APR algorithm learned user and paper' s diverse features from different semantics to alleviate the sparsity problem. Then it designed an outer product fusing way to seamlessly combine user features with paper features. Replacing of 2D CNN, this algorithm applied 3 D convolution to mine the influence of different features on the performance. Finally, it modified the BPR loss function to enhance diversity in recommendations. Experimental results on CiteULike-a and CiteULike-t datasets show that WN-APR improves the performance of accuracy and diversity over the baseline models. [ABSTRACT FROM AUTHOR]

To improve the accuracy of defect detection in bank note sorting and decrease the effects of cracks and scratches of bank note on detecting, a new algorithm based on wavelet decomposition is proposed, in which affine transform and wavelet transform are applied to bank note image registration and the edge information is extracted by Kirsch operator, while the defect feature is extracted from edge intensity differential. The bank note image is divided into several fixed size subzones, in each of which the defect feature is calculated to judge the degree of contamination. The experimental results reveal that the proposed feature extraction method is robust to the gray intensity change in each subbone, and obtains high recognition rate and high stability. This method has already been used in practical bank note sorting system. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of East China University of Science & Technology is the property of Journal of East China University of Science & Technology Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In order to solve the problems of the current art circulation information is not transparent and the centralized trading authority is asymmetric, this paper proposed a art blockchain certificate traceability model based on three chains. First, in view of the large amount of data in a single piece of artwork information, this paper proposed a blockchain-based symmetric searchable encryption algorithm, and used the interplanetary file system to securely store artwork circulation records on-chain and off-chain. Secondly, for the characteristics of the increasing effective data of artwork information, this paper proposed a blockchain-based inverted fast query and traceability algorithm to help data users realize fast traceability and positioning. At the same time, this paper proposed for the first time that the false information alliance chain stores false art circulation records to realize the processing of false information. Finally, experiments verify the feasibility of the model for big data security storage and fast query traceability. Experiments show that the model is feasible and the query method is efficient. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of China Pulp & Paper is the property of China Pulp & Paper Magazines Publisher and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In view of the problem of fuzziness of rating and tag in traditional collaborative filtering algorithms,this paper used trapezoidal fuzzy number to describe the mapping relationship between rating and satisfaction.The algorithm considered the impact of sparseness of the rating,constructed a new trapezoidal fuzzy rating model to determine the similarity based on fuzzy rating,analyzed the degree of membership between the tag and the item,and constructed a fuzzy item-tag matrix to measure the similarity based on the degree of tag membership.Finally,it used the improved scoring prediction strategy to estimate the score.The experimental results on the MovieLens dataset show that the proposed algorithm improves the prediction accuracy while suppressing the cold start of the project,alleviating the problems of fuzziness and sparseness,which indicates the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

To solve the problem of identifying similar questions in examination database, an algorithm for question similarity identification is proposed in this paper. By introducing domain words to the improvement of the word similarity model in HowNet, a model for question similarity identification is proposed to make the same or similar questions be identified and cut off automatically. This method improves the accuracy of identification compared with other methods. By combining merits of the random selection with those of the backtracking method, a new algorithm of generating papers automatically based on question similarity identification is proposed. It can guarantee the quality of papers. Test results show that the accuracy of question similarity identification of this method is 96% , which approaches to that of manual identification. This method can cut off similar questions not only of the same type, but also of different types. Finally, this method has been applied to the on-line examination of C programming language. [ABSTRACT FROM AUTHOR]

This paper proposed an electronic voting scheme based on one-time ring signature and blockchain to solve the problems of the current e-voting system in terms of anonymity, transparency and open vote-counting. This paper introduced one-time ring signature, blockchain and stealth address technology. The one-time ring signature technology solved the problem of voter anonymity, repeated voting and public verification. The blockchain technology could ensure the openness and transparency of the e-voting system. The one-time ring signature technology could ensure no one or institution could obtain the voting intermediate result before the voting ends. In order to improve the efficiency of vote-counting,it used the method of key sharing to improve the vote-counting algorithm. Through security and performance analysis, the scheme conforms to the basic security standards of an electronic voting system. [ABSTRACT FROM AUTHOR]

The digital trunking system has the characteristics that the calling mode is mainly group calling and the communication mode is mostly half duplex. For the problem that the traditional user classification method couldn't meet the classification requirements of digital cluster users, this paper proposed a digital cluster user classification method based on improved RFM model. Firstly, it introduced the average speech duration attribute to establish the recency vitality speak (RVS) model. Then, it used the analytic hierarchy process to determine the weight of each parameter in the model. Finally, it used the K-means + + clustering algorithm to classify digital cluster users. The simulation result shows that, by using the user classification method proposed in this paper, the accuracy of digital cluster user classification can reach more than 87. 9% . [ABSTRACT FROM AUTHOR]

Copyright of China Pulp & Paper is the property of China Pulp & Paper Magazines Publisher and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of China Pulp & Paper is the property of China Pulp & Paper Magazines Publisher and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Forest Engineering is the property of Forest Engineering Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of China Pulp & Paper is the property of China Pulp & Paper Magazines Publisher and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

For the security problem of the spread of digital image and the digital image encryption from plaintext and too depend on the chaotic systems, this paper proposed a digital image encryption and monitoring algorithm combined with plaintext-related chaotic mapping and SHA-256. The algorithm used the SHA-256 algorithm to calculate the hash value as record to monitor the spread of digital image. Lorenz chaotic mapping generated the corresponding cryptogram by using forward diffusion, associated plaintext scrambling and backward diffusion to encrypt the digital image. The results show that the algorithm can resist many attacks and achieve the security and concealment of image propagation. [ABSTRACT FROM AUTHOR]

Copyright of Telecommunication Engineering is the property of Telecommunication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of China Pulp & Paper is the property of China Pulp & Paper Magazines Publisher and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of China Pulp & Paper is the property of China Pulp & Paper Magazines Publisher and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

With the development of Internet of things technology, intelligent terminals of the Internet of things have gained popularity. At present, there are many security vulnerabilities in the firmware of the Internet of things terminal, and it is very inconvenient to use manual methods to detect the vulnerabilities of the Internet of things terminal equipment. The intelligent fuzzing technology based on genetic algorithms is mainly used, and the firmware to be tested is automatically tested using random variation data. Aiming at the low efficiency of the existing fuzzing technology based on genetic algorithms, this paper proposes an intelligent fuzzing model based on multiple reinforcement learning algorithms. In this model, reinforcement learning algorithms are used to optimize the mutation operator selection strategy of fuzzing and the code coverage of fuzzing is improved by intelligently selecting different mutation operators for different test cases. This paper compares the performance of DDQN, DDPG, TRPO, and PPO algorithms in the model through comparative experiments on LAVA datasets and traditional fuzzing methods. The results show that in the fuzzing environment, there are significant differences in the performance of different algorithms for different target programs and the fuzzing method based on reinforcement learning is obviously superior to the traditional fuzzing method, proving the proposed model' s availability and effectiveness. [ABSTRACT FROM AUTHOR]

Copyright of Zhejiang Electric Power is the property of Zhejiang Electric Power Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Xi'an Polytechnic University is the property of Editorial Department of Journal of Xi'an Polytechnic University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of South China University of Technology (Natural Science Edition) is the property of South China University of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Chinese Journal of Liquid Crystal & Displays is the property of Chinese Journal of Liquid Crystal & Displays and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Remote Sensing is the property of Editorial Office of Journal of Remote Sensing & Science Publishing Co. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The existing NAS methods can not directly show the relationship between network models and candidate modules and the accuracy of model recognition. At the same time, many NAS methods have poor scalability and cannot extend their search strategies to arbitrary search space. In response to the above challenges, this paper proposes a visual module contribution neural architecture search method. In this paper, the concept of module contribution is first proposed, and the unified sampling principle in arbitrary search space is given by analyzing the dilemma of the contribution calculation process. Finally, the neural network architecture is generated through a dynamic network programming algorithm for specific constraints. Extensive experimental results demonstrate the effectiveness of the proposed algorithm. Using the CIFAR-10, CIFAR-100, and ImageNet16-120 datasets, the average accuracy on the NAS- Bench- 201 benchmark is 93.33%, 71.07%, and 42.69%, respectively. [ABSTRACT FROM AUTHOR]

The simple and efficient network structure of U-Net is widely used in medical image segmentation, and many scholars have made various researches on the U-Net structure. This paper elucidates in the following: firstly, the paper summarizes the key challenges of the U-Net network in the field of medical image segmentation; next, it elaborates the formats and characteristics of medical image datasets that are commonly used in the U-Net network; then, it summarizes the six improvement mechanism of U-Net: skip connection mechanism, generative adversarial network, residual connection mechanism, 3D-UNet, Transformer mechanism, and dense connecting mechanism. Finally, the paper discusses the relationship between these improvement mechanisms and commonly used medical data formats, and points out the ideas and directions for future improvement, so as to stimulate the unlimited potential of U-Net in medical image segmentation. [ABSTRACT FROM AUTHOR]

It is very important for autonomous driving vehicles to accurately detect objects such as vehicles and pedestrians on the road in real time. Aiming at the problems of missed detection and poor detection effect of small targets in the autonomous driving scene, this paper proposes an automatic driving target detection algorithm that improves the YOLOv7 algorithm. Firstly, it modifies the modules in the network to expand the receptive field, reduces the size of the receptive field module, and improves the speed of the model and enhances the ability to extract image feature information. Secondly, the paper introduces the BRA attention mechanism at the output of the backbone network to improve the model's ability to small target objects. Finally, it replaces the original CIOU loss function of the algorithm with the EIOU loss function to minimize the difference between the height and width of the predicted frame and the real frame, and speeds up the convergence of the model while achieving better positioning results. The experimental results show that: on the KITTI dataset, when the improved YOLOv7 algorithm performs target detection, its mAP reaches 94.7%, which is 3.1 percentage points higher than the original YOLOv7 algorithm, and it has achieved higher detection accuracy in small target object detection. It effectively improves the model's detection effect on small targets. [ABSTRACT FROM AUTHOR]

Image fusion currently plays an important role in the diagnosis of prostate cancer (PCa). Selecting and developing a good image fusion algorithm is the core task of achieving image fusion, which determines whether the fusion image obtained is of good quality and can meet the actual needs of clinical application. In recent years, it has become one of the research hotspots of medical image fusion. In order to make a comprehensive study on the methods of medical image fusion, this paper reviewed the relevant literature published at home and abroad in recent years. Image fusion technologies were classified, and image fusion algorithms were divided into traditional fusion algorithms and deep learning (DL) fusion algorithms. The principles and workflow of some algorithms were analyzed and compared, their advantages and disadvantages were summarized, and relevant medical image data sets were introduced. Finally, the future development trend of medical image fusion algorithm was prospected, and the development direction of medical image fusion technology for the diagnosis of prostate cancer and other major diseases was pointed out.

Adaptive filtering methods based on least-mean-square (LMS) error criterion have been commonly used in auscultation to reduce ambient noise. For non-Gaussian signals containing pulse components, such methods are prone to weights misalignment. Unlike the commonly used variable step-size methods, this paper introduced linear preprocessing to address this issue. The role of linear preprocessing in improving the denoising performance of the normalized least-mean-square (NLMS) adaptive filtering algorithm was analyzed. It was shown that, the steady-state mean square weight deviation of the NLMS adaptive filter was proportional to the variance of the body sounds and inversely proportional to the variance of the ambient noise signals in the secondary channel. Preprocessing with properly set parameters could suppress the spikes of body sounds, and decrease the variance and the power spectral density of the body sounds, without significantly reducing or even with increasing the variance and the power spectral density of the ambient noise signals in the secondary channel. As a result, the preprocessing could reduce weights misalignment, and correspondingly, significantly improve the performance of ambient-noise reduction. Finally, a case of heart-sound auscultation was given to demonstrate how to design the preprocessing and how the preprocessing improved the ambient-noise reduction performance. The results can guide the design of adaptive denoising algorithms for body sound auscultation.

To assist grassroots sonographers in accurately and rapidly detecting intussusception lesions from children's abdominal ultrasound images, this paper proposes an improved YOLOv8n children's intussusception detection algorithm, called EMC-YOLOv8n. Firstly, the EfficientViT network with a cascaded group attention module was used as the backbone network to enhance the speed of target detection. Secondly, the improved C2fMBC module was used to replace the C2f module in the neck network to reduce network complexity, and the coordinate attention (CA) module was introduced after each C2fMBC module to enhance attention to positional information. Finally, experiments were conducted on the self-built dataset of intussusception in children. The results showed that the recall rate, average detection accuracy (mAP@0.5) and precision of the EMC-YOLOv8n algorithm improved by 3.9%, 2.1% and 0.9%, respectively, compared to the baseline algorithm. Despite slightly increased network parameters and computational load, significant improvements in detection accuracy enable efficient completion of detection tasks, demonstrating substantial economic and social value.

Cardiovascular disease (CVD) is one of the leading causes of death worldwide. Heart sound classification plays a key role in the early detection of CVD. The difference between normal and abnormal heart sounds is not obvious. In this paper, in order to improve the accuracy of the heart sound classification model, we propose a heart sound feature extraction method based on bispectral analysis and combine it with convolutional neural network (CNN) to classify heart sounds. The model can effectively suppress Gaussian noise by using bispectral analysis and can effectively extract the features of heart sound signals without relying on the accurate segmentation of heart sound signals. At the same time, the model combines with the strong classification performance of convolutional neural network and finally achieves the accurate classification of heart sound. According to the experimental results, the proposed algorithm achieves 0.910, 0.884 and 0.940 in terms of accuracy, sensitivity and specificity under the same data and experimental conditions, respectively. Compared with other heart sound classification algorithms, the proposed algorithm shows a significant improvement and strong robustness and generalization ability, so it is expected to be applied to the auxiliary detection of congenital heart disease.

Temporomandibular joint disorder (TMD) is a common oral and maxillofacial disease, which is difficult to detect due to its subtle early symptoms. In this study, a TMD intelligent diagnostic system implemented on edge computing devices was proposed, which can achieve rapid detection of TMD in clinical diagnosis and facilitate its early-stage clinical intervention. The proposed system first automatically segments the important components of the temporomandibular joint, followed by quantitative measurement of the joint gap area, and finally predicts the existence of TMD according to the measurements. In terms of segmentation, this study employs semi-supervised learning to achieve the accurate segmentation of temporomandibular joint, with an average Dice coefficient (DC) of 0.846. A 3D region extraction algorithm for the temporomandibular joint gap area is also developed, based on which an automatic TMD diagnosis model is proposed, with an accuracy of 83.87%. In summary, the intelligent TMD diagnosis system developed in this paper can be deployed at edge computing devices within a local area network, which is able to achieve rapid detecting and intelligent diagnosis of TMD with privacy guarantee.

Early diagnosis and treatment of colorectal polyps are crucial for preventing colorectal cancer. This paper proposes a lightweight convolutional neural network for the automatic detection and auxiliary diagnosis of colorectal polyps. Initially, a 53-layer convolutional backbone network is used, incorporating a spatial pyramid pooling module to achieve feature extraction with different receptive field sizes. Subsequently, a feature pyramid network is employed to perform cross-scale fusion of feature maps from the backbone network. A spatial attention module is utilized to enhance the perception of polyp image boundaries and details. Further, a positional pattern attention module is used to automatically mine and integrate key features across different levels of feature maps, achieving rapid, efficient, and accurate automatic detection of colorectal polyps. The proposed model is evaluated on a clinical dataset, achieving an accuracy of 0.9982, recall of 0.9988, F1 score of 0.9984, and mean average precision (mAP) of 0.9953 at an intersection over union (IOU) threshold of 0.5, with a frame rate of 74 frames per second and a parameter count of 9.08 M. Compared to existing mainstream methods, the proposed method is lightweight, has low operating configuration requirements, high detection speed, and high accuracy, making it a feasible technical method and important tool for the early detection and diagnosis of colorectal cancer.

Organoids are an in vitro model that can simulate the complex structure and function of tissues in vivo . Functions such as classification, screening and trajectory recognition have been realized through organoid image analysis, but there are still problems such as low accuracy in recognition classification and cell tracking. Deep learning algorithm and organoid image fusion analysis are the most advanced organoid image analysis methods. In this paper, the organoid image depth perception technology is investigated and sorted out, the organoid culture mechanism and its application concept in depth perception are introduced, and the key progress of four depth perception algorithms such as organoid image and classification recognition, pattern detection, image segmentation and dynamic tracking are reviewed respectively, and the performance advantages of different depth models are compared and analyzed. In addition, this paper also summarizes the depth perception technology of various organ images from the aspects of depth perception feature learning, model generalization and multiple evaluation parameters, and prospects the development trend of organoids based on deep learning methods in the future, so as to promote the application of depth perception technology in organoid images. It provides an important reference for the academic research and practical application in this field.

This study aims to optimize surface electromyography-based gesture recognition technique, focusing on the impact of muscle fatigue on the recognition performance. An innovative real-time analysis algorithm is proposed in the paper, which can extract muscle fatigue features in real time and fuse them into the hand gesture recognition process. Based on self-collected data, this paper applies algorithms such as convolutional neural networks and long short-term memory networks to provide an in-depth analysis of the feature extraction method of muscle fatigue, and compares the impact of muscle fatigue features on the performance of surface electromyography-based gesture recognition tasks. The results show that by fusing the muscle fatigue features in real time, the algorithm proposed in this paper improves the accuracy of hand gesture recognition at different fatigue levels, and the average recognition accuracy for different subjects is also improved. In summary, the algorithm in this paper not only improves the adaptability and robustness of the hand gesture recognition system, but its research process can also provide new insights into the development of gesture recognition technology in the field of biomedical engineering.

Impedance cardiography (ICG) is essential in evaluating cardiac function in patients with cardiovascular diseases. Aiming at the problem that the measurement of ICG signal is easily disturbed by motion artifacts, this paper introduces a de-noising method based on two-step spectral ensemble empirical mode decomposition (EEMD) and canonical correlation analysis (CCA). Firstly, the first spectral EEMD-CCA was performed between ICG and motion signals, and electrocardiogram (ECG) and motion signals, respectively. The component with the strongest correlation coefficient was set to zero to suppress the main motion artifacts. Secondly, the obtained ECG and ICG signals were subjected to a second spectral EEMD-CCA for further denoising. Lastly, the ICG signal is reconstructed using these share components. The experiment was tested on 30 subjects, and the results showed that the quality of the ICG signal is greatly improved after using the proposed denoising method, which could support the subsequent diagnosis and analysis of cardiovascular diseases.

High-grade serous ovarian cancer has a high degree of malignancy, and at detection, it is prone to infiltration of surrounding soft tissues, as well as metastasis to the peritoneum and lymph nodes, peritoneal seeding, and distant metastasis. Whether recurrence occurs becomes an important reference for surgical planning and treatment methods for this disease. Current recurrence prediction models do not consider the potential pathological relationships between internal tissues of the entire ovary. They use convolutional neural networks to extract local region features for judgment, but the accuracy is low, and the cost is high. To address this issue, this paper proposes a new lightweight deep learning algorithm model for predicting recurrence of high-grade serous ovarian cancer. The model first uses ghost convolution (Ghost Conv) and coordinate attention (CA) to establish ghost counter residual (SCblock) modules to extract local feature information from images. Then, it captures global information and integrates multi-level information through proposed layered fusion Transformer (STblock) modules to enhance interaction between different layers. The Transformer module unfolds the feature map to compute corresponding region blocks, then folds it back to reduce computational cost. Finally, each STblock module fuses deep and shallow layer depth information and incorporates patient's clinical metadata for recurrence prediction. Experimental results show that compared to the mainstream lightweight mobile visual Transformer (MobileViT) network, the proposed slicer visual Transformer (SlicerViT) network improves accuracy, precision, sensitivity, and F1 score, with only 1/6 of the computational cost and half the parameter count. This research confirms that the proposed algorithm model is more accurate and efficient in predicting recurrence of high-grade serous ovarian cancer. In the future, it can serve as an auxiliary diagnostic technique to improve patient survival rates and facilitate the application of the model in embedded devices.

Atrial fibrillation (AF) is a life-threatening heart condition, and its early detection and treatment have garnered significant attention from physicians in recent years. Traditional methods of detecting AF heavily rely on doctor's diagnosis based on electrocardiograms (ECGs), but prolonged analysis of ECG signals is very time-consuming. This paper designs an AF detection model based on the Inception module, constructing multi-branch detection channels to process raw ECG signals, gradient signals, and frequency signals during AF. The model efficiently extracted QRS complex and RR interval features using gradient signals, extracted P-wave and f-wave features using frequency signals, and used raw signals to supplement missing information. The multi-scale convolutional kernels in the Inception module provided various receptive fields and performed comprehensive analysis of the multi-branch results, enabling early AF detection. Compared to current machine learning algorithms that use only RR interval and heart rate variability features, the proposed algorithm additionally employed frequency features, making fuller use of the information within the signals. For deep learning methods using raw and frequency signals, this paper introduced an enhanced method for the QRS complex, allowing the network to extract features more effectively. By using a multi-branch input mode, the model comprehensively considered irregular RR intervals and P-wave and f-wave features in AF. Testing on the MIT-BIH AF database showed that the inter-patient detection accuracy was 96.89%, sensitivity was 97.72%, and specificity was 95.88%. The proposed model demonstrates excellent performance and can achieve automatic AF detection.

The performance of a pulse oximeter based on photoelectric detection is greatly affected by motion noise (MA) in the photoplethysmographic (PPG) signal. This paper presents an algorithm for detecting motion oxygen saturation, which reconstructs a motion noise reference signal using ensemble of complete adaptive noise and empirical mode decomposition combined with multi-scale permutation entropy, and eliminates MA in the PPG signal using a convex combination least mean square adaptive filters to calculate dynamic oxygen saturation. The test results show that, under simulated walking and jogging conditions, the mean absolute error (MAE) of oxygen saturation estimated by the proposed algorithm and the reference oxygen saturation are 0.05 and 0.07, respectively, with means absolute percentage error (MAPE) of 0.05% and 0.07%, respectively. The overall Pearson correlation coefficient reaches 0.971 2. The proposed scheme effectively reduces motion artifacts in the corrupted PPG signal and is expected to be applied in portable photoelectric pulse oximeters to improve the accuracy of dynamic oxygen saturation measurement.

Sudden cardiac arrest (SCA) is a lethal cardiac arrhythmia that poses a serious threat to human life and health. However, clinical records of sudden cardiac death (SCD) electrocardiogram (ECG) data are extremely limited. This paper proposes an early prediction and classification algorithm for SCA based on deep transfer learning. With limited ECG data, it extracts heart rate variability features before the onset of SCA and utilizes a lightweight convolutional neural network model for pre-training and fine-tuning in two stages of deep transfer learning. This achieves early classification, recognition and prediction of high-risk ECG signals for SCA by neural network models. Based on 16 788 30-second heart rate feature segments from 20 SCA patients and 18 sinus rhythm patients in the international publicly available ECG database, the algorithm performance evaluation through ten-fold cross-validation shows that the average accuracy (Acc), sensitivity (Sen), and specificity (Spe) for predicting the onset of SCA in the 30 minutes prior to the event are 91.79%, 87.00%, and 96.63%, respectively. The average estimation accuracy for different patients reaches 96.58%. Compared to traditional machine learning algorithms reported in existing literatures, the method proposed in this paper helps address the requirement of large training datasets for deep learning models and enables early and accurate detection and identification of high-risk ECG signs before the onset of SCA.

Brain-computer interface (BCI) based on steady-state visual evoked potential (SSVEP) have attracted much attention in the field of intelligent robotics. Traditional SSVEP-based BCI systems mostly use synchronized triggers without identifying whether the user is in the control or non-control state, resulting in a system that lacks autonomous control capability. Therefore, this paper proposed a SSVEP asynchronous state recognition method, which constructs an asynchronous state recognition model by fusing multiple time-frequency domain features of electroencephalographic (EEG) signals and combining with a linear discriminant analysis (LDA) to improve the accuracy of SSVEP asynchronous state recognition. Furthermore, addressing the control needs of disabled individuals in multitasking scenarios, a brain-machine fusion system based on SSVEP-BCI asynchronous cooperative control was developed. This system enabled the collaborative control of wearable manipulator and robotic arm, where the robotic arm acts as a "third hand", offering significant advantages in complex environments. The experimental results showed that using the SSVEP asynchronous control algorithm and brain-computer fusion system proposed in this paper could assist users to complete multitasking cooperative operations. The average accuracy of user intent recognition in online control experiments was 93.0%, which provides a theoretical and practical basis for the practical application of the asynchronous SSVEP-BCI system.

With the increasing of computer power and rapid expansion of biological data, the application of bioinformatics tools has become the mainstream approach to address biological problems. The accurate identification of protein function by bioinformatics tools is crucial for both biomedical research and drug discovery, making it a hot topic of research. In this paper, we categorize bioinformatics-based protein function prediction methods into three categories: protein sequence-based methods, protein structure-based methods, and protein interaction networks-based methods. We further analyze these specific algorithms, highlighting the latest research advancements and providing valuable references for the application of bioinformatics-based protein function prediction in biomedical research and drug discovery.

The binding of proteins and ligands is a crucial aspect of life processes. The calculation of the protein-ligand binding affinity (PLBA) offers valuable insights into protein function, drug screening targets protein receptors, and enzyme modifications. In recent years, artificial intelligence (AI) has experienced rapid advancements, becoming widely used in PLBA prediction. This is attributed to its robust feature extraction ability, superior algorithm accuracy, and speedy calculations. Our paper aims to provide a comprehensive overview of AI predication process, associated resources, application scenarios, challenges, and potential solutions, serving as a valuable reference for the relevant research endeavors.

In response to the issues of single-scale information loss and large model parameter size during the sampling process in U-Net and its variants for medical image segmentation, this paper proposes a multi-scale medical image segmentation method based on pixel encoding and spatial attention. Firstly, by redesigning the input strategy of the Transformer structure, a pixel encoding module is introduced to enable the model to extract global semantic information from multi-scale image features, obtaining richer feature information. Additionally, deformable convolutions are incorporated into the Transformer module to accelerate convergence speed and improve module performance. Secondly, a spatial attention module with residual connections is introduced to allow the model to focus on the foreground information of the fused feature maps. Finally, through ablation experiments, the network is lightweighted to enhance segmentation accuracy and accelerate model convergence. The proposed algorithm achieves satisfactory results on the Synapse dataset, an official public dataset for multi-organ segmentation provided by the International Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI), with Dice similarity coefficient (DSC) and 95% Hausdorff distance (HD95) scores of 77.65 and 18.34, respectively. The experimental results demonstrate that the proposed algorithm can enhance multi-organ segmentation performance, potentially filling the gap in multi-scale medical image segmentation algorithms, and providing assistance for professional physicians in diagnosis.

In the extraction of fetal electrocardiogram (ECG) signal, due to the unicity of the scale of the U-Net same-level convolution encoder, the size and shape difference of the ECG characteristic wave between mother and fetus are ignored, and the time information of ECG signals is not used in the threshold learning process of the encoder's residual shrinkage module. In this paper, a method of extracting fetal ECG signal based on multi-scale residual shrinkage U-Net model is proposed. First, the Inception and time domain attention were introduced into the residual shrinkage module to enhance the multi-scale feature extraction ability of the same level convolution encoder and the utilization of the time domain information of fetal ECG signal. In order to maintain more local details of ECG waveform, the maximum pooling in U-Net was replaced by Softpool. Finally, the decoder composed of the residual module and up-sampling gradually generated fetal ECG signals. In this paper, clinical ECG signals were used for experiments. The final results showed that compared with other fetal ECG extraction algorithms, the method proposed in this paper could extract clearer fetal ECG signals. The sensitivity, positive predictive value, and F1 scores in the 2013 competition data set reached 93.33%, 99.36%, and 96.09%, respectively, indicating that this method can effectively extract fetal ECG signals and has certain application values for perinatal fetal health monitoring.

To achieve non-contact measurement of human heart rate and improve its accuracy, this paper proposes a method for measuring human heart rate based on multi-channel radar data fusion. The radar data were firstly extracted by human body position identification, phase extraction and unwinding, phase difference, band-pass filtering optimized by power spectrum entropy, and fast independent component analysis for each channel data. After overlaying and fusing the four-channel data, the heartbeat signal was separated using frost-optimized variational modal decomposition. Finally, a chirp Z-transform was introduced for heart rate estimation. After validation with 40 sets of data, the average root mean square error of the proposed method was 2.35 beats per minute, with an average error rate of 2.39%, a Pearson correlation coefficient of 0.97, a confidence interval of [-4.78, 4.78] beats per minute, and a consistency error of -0.04. The experimental results show that the proposed measurement method performs well in terms of accuracy, correlation, and consistency, enabling precise measurement of human heart rate.

Magnetic resonance imaging (MRI) plays a crucial role in the diagnosis of ischemic stroke. Accurate segmentation of the infarct is of great significance for selecting intervention treatment methods and evaluating the prognosis of patients. To address the issue of poor segmentation accuracy of existing methods for multiscale stroke lesions, a novel encoder-decoder architecture network based on depthwise separable convolution is proposed. Firstly, this network replaces the convolutional layer modules of the U-Net with redesigned depthwise separable convolution modules. Secondly, an modified Atrous spatial pyramid pooling (MASPP) is introduced to enlarge the receptive field and enhance the extraction of multiscale features. Thirdly, an attention gate (AG) structure is incorporated at the skip connections of the network to further enhance the segmentation accuracy of multiscale targets. Finally, Experimental evaluations are conducted using the ischemic stroke lesion segmentation 2022 challenge (ISLES2022) dataset. The proposed algorithm in this paper achieves Dice similarity coefficient (DSC), Hausdorff distance (HD), sensitivity (SEN), and precision (PRE) scores of 0.816 5, 3.668 1, 0.889 2, and 0.894 6, respectively, outperforming other mainstream segmentation algorithms. The experimental results demonstrate that the method in this paper effectively improves the segmentation of infarct lesions, and is expected to provide a reliable support for clinical diagnosis and treatment.

Automatic detection of pulmonary nodule based on computer tomography (CT) images can significantly improve the diagnosis and treatment of lung cancer. However, there is a lack of effective interactive tools to record the marked results of radiologists in real time and feed them back to the algorithm model for iterative optimization. This paper designed and developed an online interactive review system supporting the assisted diagnosis of lung nodules in CT images. Lung nodules were detected by the preset model and presented to doctors, who marked or corrected the lung nodules detected by the system with their professional knowledge, and then iteratively optimized the AI model with active learning strategy according to the marked results of radiologists to continuously improve the accuracy of the model. The subset 5-9 dataset of the lung nodule analysis 2016(LUNA16) was used for iteration experiments. The precision, F1-score and MioU indexes were steadily improved with the increase of the number of iterations, and the precision increased from 0.213 9 to 0.565 6. The results in this paper show that the system not only uses deep segmentation model to assist radiologists, but also optimizes the model by using radiologists' feedback information to the maximum extent, iteratively improving the accuracy of the model and better assisting radiologists.