Osteosarcoma is one of the most common bone tumors that occurs in adolescents. Doctors often use magnetic resonance imaging (MRI) through biosensors to diagnose and predict osteosarcoma. However, a number of osteosarcoma MRI images have the problem of the tumor shape boundary being vague, complex, or irregular, which causes doctors to encounter difficulties in diagnosis and also makes some deep learning methods lose segmentation details as well as fail to locate the region of the osteosarcoma. In this article, we propose a novel boundary-aware grid contextual attention net (BA-GCA Net) to solve the problem of insufficient accuracy in osteosarcoma MRI image segmentation. First, a novel grid contextual attention (GCA) is designed to better capture the texture details of the tumor area. Then the statistical texture learning block (STLB) and the spatial transformer block (STB) are integrated into the network to improve its ability to extract statistical texture features and locate tumor areas. Over 80,000 MRI images of osteosarcoma from the Second Xiangya Hospital are adopted as a dataset for training, testing, and ablation studies. Results show that our proposed method achieves higher segmentation accuracy than existing methods with only a slight increase in the number of parameters and computational complexity.
As the Internet of Things (IoT) smart mobile devices explode in complex opportunistic social networks, the amount of data in complex networks is increasing. Large amounts of data cause high latency, high energy consumption, and low‐reliability issues when dealing with computationally intensive and latency‐sensitive emerging mobile applications. Therefore, we propose a task‐sharing strategy that comprehensively considers delay, energy consumption, and terminal reputation value (DERV) for this context. The model consists of a task‐sharing decision model that integrates latency and energy consumption, and a reputation value‐based model for the allocation of the computational resource game. The two submodels apply an improved particle swarm algorithm and a Lagrange multiplier, respectively. Mobile nodes in the complex social network are given the opportunity to make decisions so that they can choose to share computationally intensive, latency‐sensitive computing tasks to base stations with greater computing power in the same network. At the same time, to prevent malicious competition from end nodes, the base station decides the allocation of computing resources based on a database of reputation values provided by a trusted authority. The simulation results show that the proposed strategy can meet the service requirements of low delay, low power consumption, and high reliability for emerging intelligent applications. It effectively realizes the overall optimized allocation of computation sharing resources and promotes the stable transmission of massive data in complex networks.
In many countries, lung cancer is the chief cancer type, and the overall survival rate in 5 years remains at a low rate of 16.8%. Among lung cancer patients, the proportion of patients with non-small cell lung cancer (NSCLC) can reach 85%. Especially in developing countries, it has become a great challenge for doctors to diagnose efficiently because of the complex diagnostic process of NSCLC, a large number of patients, and limited medical resources. Based on the above situation, our main objective in this study is to construct an auxiliary Artificial Intelligence medical system for doctors to diagnose the NSCLC patients efficiently. In this research, we select the combination of Support Vector Machine (SVM) and Artificial Neural Network (ANN) to complete the classification and training tasks of the medical system. In this study, we trained and tested our decision model based on the data information of 12,186 patients in three hospitals in China. The results of this experiment show that the accuracy of our system has reached 88% when the amount of data reaches 4000, which is close to that of doctors.
1 November 2021 in International Journal of Machine Learning and Cybernetics
Social networks are very important information dissemination platforms. Messages in social networks are forwarded through encounters formed by moving nodes in opportunistic complexity network. However, with the gradual expansion of the network scale, the amount of data to be transmitted has increased dramatically, which has brought greater load to the entire network. In order to improve this transmission environment, this paper proposes a transmission mechanism that selects cooperative nodes based on the user’s interest. In communication, the degree of matching of node preferences is calculated, and highly matched nodes are selected for priority transmission. This method reduces the occupation of cache resources by redundant information in the network by filtering the message transmission mode of the cooperative nodes, and improves the space utilization of the message cache. Through the comparison of experiments and social network algorithms, this method improves the node’s cache utilization, reduces the data transmission delay, and improves the overall network efficiency.