Diabetes is caused by insulin deficiency or impaired biological action, and long-term hyperglycemia leads to a variety of tissue damage and dysfunction. Therefore, the early prediction of diabetes and timely intervention and treatment are crucial. This paper proposes a robust framework for the prediction and diagnosis of type 2 diabetes (T2DM) to aid in diabetes applications in clinical diagnosis. The data-preprocessing stage includes steps such as outlier removal, missing value filling, data standardization, and assigning class weights to ensure the quality and consistency of the data, thereby improving the performance and stability of the model. This experiment used the National Health and Nutrition Examination Survey (NHANES) dataset and the publicly available PIMA Indian dataset (PID). For T2DM classification, we designed a convolutional neural network (CNN) and proposed a novel attention-oriented convolutional neural network (SECNN) through the channel attention mechanism. To optimize the hyperparameters of the model, we used grid search and K-fold cross-validation methods. In addition, we also comparatively analyzed various machine learning (ML) models such as support vector machine (SVM), logistic regression (LR), decision tree (DT), random forest (RF), and artificial neural network (ANN). Finally, we evaluated the performance of the model using performance evaluation metrics such as precision, recall, F1-Score, accuracy, and AUC. Experimental results show that the SECNN model has an accuracy of 94.12% on the NHANES dataset and an accuracy of 89.47% on the PIMA Indian dataset. SECNN models and CNN models show significant improvements in diabetes prediction performance compared to traditional ML models. The comparative analysis of the SECNN model and the CNN model has significantly improved performance, further verifying the advantages of introducing the channel attention mechanism. The robust diabetes prediction framework proposed in this article establishes an effective foundation for diabetes diagnosis and prediction, and has a positive impact on the development of health management and medical industries.
Given their intricate nature and inherent ambiguity, sarcastic texts often mask deeper emotions, making it challenging to discern the genuine feelings behind the words. The proposal of the sarcasm detection task is to assist us with more accurately understanding the true intention of the speaker. Advanced methods, such as deep learning and neural networks, are widely used in the field of sarcasm detection. However, most research mainly focuses on sarcastic texts in English, as other languages lack corpora and annotated datasets. To address the challenge of low-resource languages in sarcasm detection tasks, a zero-shot cross-lingual transfer learning method is proposed in this paper. The proposed approach is based on prompt learning and aims to assist the model with understanding downstream tasks through prompts. Specifically, the model uses prompt templates to construct training data into cloze-style questions and then trains them using a pre-trained cross-lingual language model. Combining data augmentation and contrastive learning can further improve the capacity of the model for cross-lingual transfer learning. To evaluate the performance of the proposed model, we utilize a publicly accessible sarcasm dataset in English as training data in a zero-shot cross-lingual setting. When tested with Chinese as the target language for transfer, our model achieves F1-scores of 72.14% and 76.7% on two test datasets, outperforming the strong baselines by significant margins.
In recent years, incorporating tax mechanisms into evolutionary game theory has become a popular research focus. However, previous studies often failed to simultaneously consider the coexistence of heterogeneity in tax collection and distribution. In this article, we introduce a heterogeneous tax mechanism and apply it to the reward model of the traditional public goods game. Surprisingly, changes in reward costs have little impact on defectors, primarily influencing competition within cooperative strategies. We explain the reason for this phenomenon through the individual's strategy transfer probabilities. Another important finding is that rewarding cooperators is always available despite their number being few at lower tax rates. It is because when rewarding cooperators face unfavorable situations, global tax becomes a key factor in maintaining their survival. Finally, the robustness of the model is verified.
The intelligent tongue control system is of great significance for assisting the independent life of patients with a limb disability. In order to more accurately control the assisted living equipment of incompetent patients and solve the power-loss problem of the intelligent tongue control system, this research designs a non-invasive pressure sensor array for tongue touch signal detection in the oral cavity and proposes a tongue control system based on RSIC-V edge computing. The system converts the tongue touch pressure data into specific control instructions on the edge of the RSIC-V chip and transmits them to the receiver, thus reducing the transmission of data. This study takes control of the wheelchair motor as the test object. In the experiment, the speed response time test, the center click task, and the power consumption experiment are carried out, whose results show that the adaptive fuzzy PID control algorithm has good robustness in the system; when the DC motor with a given speed of 750 r/min reaches the steady state, its rise time is 0.108 s and the adjustment time is 0.59 s. The dynamic power consumption of the non-intrusive intraoral stand-alone tongue control system proposed in this paper is found to be 3.745 MW, which is 11.5% lower than the total power consumption of the sTD system.
The widespread presence of sarcasm in social media presents significant challenges to sentiment analysis and public opinion monitoring, making accurate sarcasm detection particularly important. Recently, studies have found that graph-based methods can effectively overcome the limitations of sarcasm methods in modeling syntactic and emotional information. However, existing approaches often consider dependency relationships between nodes as homogeneous, and directly aggregating all edge information during the graph learning process can introduce noise. To address these issues, we propose a novel framework based on the graph convolutional network for sarcasm detection. This framework effectively improves the ability of sarcasm detection by modeling the heterogeneity of dependencies and introducing a noise suppression mechanism. Specifically, when constructing dependency graphs, we account for the importance of node distances and dependency types. To reduce the impact of noise, we extract robust feature representations using a denoising autoencoder. Then, a parameterized mechanism is applied to penalize sparse edges, suppressing the interference of irrelevant edge information. To evaluate the performance of the proposed model, we conducted experiments on three datasets of different scales, achieving F1-scores of 84.97%, 71.11%, and 83.83% respectively. The proposed model outperforms other baseline models across all metrics, demonstrating outstanding performance.
The pinning control of complex networks is a hot topic of research in network science. However, most studies on pinning control ignore the impact of external interference on actual control strategies. To more comprehensively evaluate network synchronizability via pinning control in the attack–defense confrontation scenario, the paper constructs an attacker-defender game model. In the model, the attacker needs to control nodes in the network as much as possible. The defender will do their best to interfere with the attacker’s control of the network. Through a series of experiments, we find that the random attack strategy is always the dominant strategy of the attacker in various equilibriums. On the other hand, the defender needs to constantly change dominant strategy in equilibrium according to the set of defense strategies and cost constraints. In addition, scale-free networks with different network metrics can also influence the payoff matrix of the game. In particular, the average degree of the network has an obvious impact on the attacker’s payoff. Moreover, we further verify the correctness of the proposed attacker-defender game through a simulation based on the specific network synchronization dynamics. Finally, we conduct a sensitivity analysis in different network structures, such as the WS small-world network, the ER random network, and the Google network, to comprehensively evaluate the performance of the model.