Pathological images hold significant importance for disease diagnosis. When employing artificial intelligence deep learning for pathological image segmentation, numerous challenges arise. For example, difficulties in data collection and annotation, substantial individual variations affecting training, and the lack of interpretability in model decisions, which leads to low levels of physician trust. This study proposes the MSDAUnet segmentation method. Firstly, an image denoising and enhancement module composed of a Dynamic Residual Attention Network (DRAN) and an image enhancement method based on Improved Color Histogram Equalization (MCHE) is constructed to remove image noise and improve image clarity. Then, a Dual Attention Module (DAM) is proposed, which connects the Squeeze-andExcitation Block (SE Block) and the Spatial Attention Module (SAM) in series to extract information from both the channel and spatial dimensions and obtain key features. Finally, the Atrous Spatial Pyramid Pooling (ASPP) module is introduced to obtain multi-scale information.The combination of these modules is used for automatic pathological image segmentation. Compared with the traditional and typical UNet model, the segmentation effect of MSDAUNet is more excellent. On the Monash University dataset, its IoU index reaches$\mathbf{7 2. 7 \%}$, nearly$\mathbf{7 \%}$higher than UNet, and the DSC index is 84.9 %, also about 7 % higher than UNet. It vigorously promotes the development of medical imaging processing technology and provides more accurate AI assistance for medical decision-making.

Artificial intelligence has become an indispensable element in modern clinical diagnostics, offering strong potential for assisting in tumor assessment. Gliomas, among the most malignant brain tumors, are difficult to delineate precisely because of their irregular geometry and indistinct tumor-tissue boundaries. To enhance diagnostic reliability, this study presents a Glioma Diagnostic Decision-Making System (GDDMS) incorporating a Feature Fusion Bridge (FFB) within a Transformer-based segmentation framework. The FFB enables multi-scale integration of encoder features, effectively coupling global context with localized structural details to refine tumor boundary detection. Comprehensive experiments demonstrate that GDDMS achieves a Dice coefficient of 0.892, outperforming other comparative methods. These findings suggest that the system can provide dependable segmentation support and improve diagnostic efficiency in clinical glioma evaluation.

AI medical imaging diagnosis enables physicians to rapidly acquire and analyze image information using deep learning techniques. Consequently, it holds a significant position in medical decision-making assistance. Specifically, the complexity and large scale of digital pathology images necessitate accurate recognition of cell arrangement, size, and shape, which aids physicians in identifying cancerous regions. However, existing medical image segmentation techniques often fail to deliver sufficiently detailed results in unknown target domains, resulting in the blurring of cell nucleus boundaries. In order to introduce more display-like information to solve the problem of obscure cell nucleus boundaries, this study proposes an accurate recognition method (UNW) for cell nucleus recognition in medical decision-making systems. It solves the problem of the distribution difference between the source domain and the unknown target domain by inserting feature center alignment (FCA) and feature distribution alignment (FDA) modules into the encoder and decoder. UNW performs instance normalization (IN) and instance whitening (IW) on the feature images to better identify the feature detail information, which results in more distinct boundaries between the cell nucleus and other tissues. Experimental results on various backbone networks show that our method can obtain more accurate decision results. Among them, the IOU reaches 0.704, which outperforms existing models, while the FCA and FDA maintain the segmentation ability of the model in the face of test data that is inconsistent with the distribution of the training data.

Abstract Artificial intelligence decision systems play an important supporting role in the field of medical information. Medical image analysis is an important part of decision systems and an even more important part of medical diagnosis and treatment. The wealth of cellular information in histopathological images makes them a reliable means of diagnosing tumors. However, due to the large size, high resolution, and complex background structure of pathology images, deep learning methods still have various difficulties in the recognition of pathology images. Based on this, this study proposes a two‐stage continuous improvement‐based approach for pathology image recognition in medical decision systems. For pathology images with complex backgrounds, normalization and enhancement is performed to remove the effects of noise color, and light‐dark inconsistencies on the segmentation network. The continuous refinement PSP Net (CRPSPNet) is then designed for accurate recognition of the pathology images. CRPSPNet is divided into two stages: Pyramid Scene Parsing Network segmentation to obtain coarse segmentation results; and continuous refinement model refines the results of the first stage. Experiments using more than 1,000 osteosarcoma pathology images have shown that the method gives more accurate results with fewer computer resources and processing time than traditional optimization models. Its Intersection over Union achieves 0.76.

Medical images play a significant part in biomedical diagnosis, but they have a significant feature. The medical images, influenced by factors such as imaging equipment limitations, local volume effect, and others, inevitably exhibit issues like noise, blurred edges, and inconsistent signal strength. These imperfections pose significant challenges and create obstacles for doctors during their diagnostic processes. To address these issues, we present a pathology image segmentation technique based on the multiscale dual attention mechanism (MSDAUnet), which consists of three primary components. Firstly, an image denoising and enhancement module is constructed by using dynamic residual attention and color histogram to remove image noise and improve image clarity. Then, we propose a dual attention module (DAM), which extracts messages from both channel and spatial dimensions, obtains key features, and makes the edge of the lesion area clearer. Finally, capturing multiscale information in the process of image segmentation addresses the issue of uneven signal strength to a certain extent. Each module is combined for automatic pathological image segmentation. Compared with the traditional and typical U‐Net model, MSDAUnet has a better segmentation performance. On the dataset provided by the Research Center for Artificial Intelligence of Monash University, the IOU index is as high as 72.7%, which is nearly 7% higher than that of U‐Net, and the DSC index is 84.9%, which is also about 7% higher than that of U‐Net.

Telematics technology development offers vehicles a range of intelligent and convenient functions, including navigation and mapping services, intelligent driving assistance, and intelligent traffic management. However, since these functions deal with sensitive information like vehicle location and driving habits, it is crucial to address concerns regarding information security and privacy protection. Federated learning (FL) is highly suitable for addressing such problems due to its characteristics, in which a client does not need to share private data and upload model parameters to a parameter server via the network. This results in the establishment of a federated vehicle network (FVN). As a distributed paradigm, the efficiency of communication is crucial in federated learning as it impacts all aspects of the FVN. This paper introduces a parameter freezing algorithm based on historical information to reduce the data transferred between the client and the parameter server in each round of communication, thus minimizing the communication overhead of federated learning. Additionally, we propose using a particle swarm algorithm to allocate network bandwidth to each vehicle based on the packet sizes sent by each vehicle (i.e., the non-freezing parameters) to minimize the communication latency in each FL round. Furthermore, due to the high time complexity of the particle swarm algorithm, we employ it to generate training data for training a transformer model with fast response and sufficient accuracy, thereby accelerating the bandwidth allocation process. Through extensive experiments, we prove the feasibility of our approach and its efficiency in improving communication in federated learning.

As the segment of diseased tissue in PET images is time-consuming, laborious and low accuracy, this work proposes an automated framework for PET image screening, denoising and diseased tissue segmentation. First, taking into account the characteristics of PET images, the framework uses a differential activation filter to select whole-body images containing lesion tissue. Second, a new neural network containing residual connections which has powerful generalization performance compared with normal FCN network is proposed for PET image reconstruction and denoising. Finally, in the segmentation of lesion tissues, a custom clustering algorithm based on the density is used to distinguishe the lesion tissue part from the normal tissue. Tests on real medical PET images show that the whole automated framework has good performance and time cost in PET lesion image screening, image denoising and lesion tissue segmentation compared with other algorithms. The framework shows promising scientific study and application prospects.

Digital pathology images' extensive cellular information provide a trustworthy foundation for tumor diagnosis. With the aid of computer-aided diagnostics, pathologists can locate crucial information more quickly. The cascade structure refines the segmentation results by utilizing its multi-task and multi-stage characteristics. However, cascade-based models require downsampling and cropping of patches during the inference process due to the ultra-high resolution and complex structure of pathology images. This not only increases the cost and computation time but also results in the loss of cellular details and corrupts the global contextual information. This study proposes a Digital Pathology Image Assistance Program (CRSDPI) for medical decision-making systems that is based on continuous improvement. After locating the region of interest using the maximum inter-class variance method, the pictures are preprocessed to account for the impacts of staining inconsistencies and sensitivity variations on the model's performance. Ultimately, we create a two-phase continuously refined segmentation network (TCRNet) by combining an enhanced continuous refinement model with a coarse segmentation network built on a pyramid scene parsing network. The coarse segmentation network introduces an auxiliary loss term to speed up convergence, and the refined model introduces an implicit function to reduce computational cost and reconstruct more details. The TCRNet model refines the target by successively aligning the features without the need to take cascading decoder operations after encoder. Experiments conducted on digital pathology images of breast cancer and osteosarcoma demonstrate the superior prediction accuracy and computational speed of our strategy.

Delay-based congestion control has drawn a lot of attention in both academics and industry recently. Specifically, the Copa algorithm proposed in NSDI can achieve consistent high performance under various network environments and has already been deployed on Facebook. In this paper, we theoretically analyze Copa and reveal its large queuing delay and poor fairness issue under certain conditions. The root cause is that Copa fails to achieve its expected behaviors, i.e., clear the bottleneck buffer occupancy periodically. Moreover, we also reveal that the pathological competitive mode of Copa fails to guarantee friendliness. To address these issues, we propose Copa+, which enhances Copa with a parameter adaptation mechanism and an optimized competitive mode. Designed based on our theoretical analysis, Copa+ can adaptively clear the bottleneck buffer occupancy and become friendly to Cubic in the competitive mode. As a result, Copa+ inherits the advantages of Copa but achieves lower queuing delay and better fairness under different environments, as confirmed by real-world experiments and simulations. Specifically, Copa+ has the highest average throughput over different Internet links among different cloud nodes, compared to Cubic, BBR, PCC Vivace, Remy, and Indigo. Meanwhile, Copa+ has an 8.1% increase in throughput and similar low queuing delay compared to Copa. Moreover, Copa+ achieves 14.6% lower queuing delay and 2.4% higher throughput compared to Sprout over emulated cellular links.

Abstract The network transmission speed has been greatly improved, thanks to the power of 5G technology. The millisecond‐level communication delay has made a qualitative leap in communication quality. However, the sharp increase in the number of nodes connected to the internet has resulted in an explosion of traffic. Ensuring stable network transmission in the face of large data volumes has become an urgent problem to be solved. Existing research mainly optimizes for low data volumes of nodes, and cannot dynamically adapt to node transmission load to cope with explosive growth. This is because the node's cache is always at a high level, which causes community communication to be blocked. To address this issue, the authors have designed an effective data communication community establishment scheme. By adding a data information flow (DIF) attribute to each user and using the dynamic feedback adjustment (DFA) mechanism, the authors can combine the entire communication community and control the user's data information flow concentration at a relatively low level. This degree of optimization ensures that the user node maintains a relatively stable state for fast communication. The authors design an effective data communication community establishment scheme. By adding a data information flow (DIF) attribute to each user, using the dynamic feedback adjustment mechanism and combining the entire communication community, the user's data information flow concentration is controlled at a relatively low level.

Abstract Due to the improvement in computing power and the development of computer technology, deep learning has pene‐trated into various fields of the medical industry. Segmenting lesion areas in medical scans can help clinicians make accurate diagnoses. In particular, convolutional neural networks (CNNs) are a dominant tool in computer vision tasks. They can accurately locate and classify lesion areas. However, due to their inherent inductive bias, CNNs may lack an understanding of long‐term dependencies in medical images, leading to less accurate grasping of details in the images. To address this problem, we explored a Transformer‐based solution and studied its feasibility in medical imaging tasks (OstT). First, we performed super‐resolution reconstruction on the original MRI image of osteosarcoma and improved the texture features of the tissue structure to reduce the error caused by the unclear tissue structure in the image during model training. Then, we propose a Transformer‐based method for medical image segmentation. A gated axial attention model is used, which augments existing architectures by introducing an additional control mechanism in the self‐attention module to improve segmentation accuracy. Experiments on real datasets show that our method outper‐forms existing models such as Unet. It can effectively assist doctors in imaging examinations.

Osteosarcoma is the most common malignant bone tumor with a high degree of malignancy and misdiagnosis rates. Pathological images are crucial for its diagnosis. However, underdeveloped regions currently lack sufficient high-level pathologists, leading to uncertain diagnostic accuracy and efficiency. Existing research on pathological image segmentation often neglects the differences in staining styles and lack of data, without considering medical backgrounds. To alleviate the difficulty in diagnosing osteosarcoma in underdeveloped areas, an intelligent assisted diagnosis and treatment scheme for osteosarcoma pathological images, ENMViT, is proposed. ENMViT utilizes KIN to achieve normalization of mismatched images with limited GPU resources and uses traditional data enhancement methods, such as cleaning, cropping, mosaic, Laplacian sharpening, and other techniques to alleviate the issue of insufficient data. A multi-path semantic segmentation network combining Transformer and CNN is used to segment images, and the degree of edge offset in the spatial domain is introduced into the loss function. Finally, noise is filtered according to the size of the connecting domain. This article experimented on more than 2000 osteosarcoma pathological images from Central South University. The experimental results demonstrate that this scheme performs well in each stage of the osteosarcoma pathological image processing, and the segmentation results' IoU index is 9.4% higher than the comparative models, demonstrating its significant value in the medical industry.

Osteosarcoma is one of the common malignant bone tumors, which is great harm to human health. Magnetic resonance imaging (MRI) is a common method for osteosarcoma detection because it can more clearly see the extent of lesions and the degree of invasion, with minimal damage to the human body. However, in developing countries or areas with less developed medical technology, due to the high cost of hardware equipment and the problem of image detection accuracy, the existing MRI image-assisted detection technology still has not achieved the expected application. Based on this, this study proposes an attention-based MRI image-assisted segmentation system for osteosarcoma (AIMSost). The results of the system segmentation can assist doctors to determine the tumor area and identify the tumor location. Among them, we design a segmentation method, which is based on the idea of AttendSeg. We design a new module to replace the original convolutional layer, and use residual network structure, LayerNorm, and Depth-Wise to reduce the number of parameters and operational complexity of the model. Experiments show that the DSC and IOU values of AIMSost are improved by more than 2.79% and 2.03%, respectively, compared with other models in the experiment. Our proposed method has not only higher segmentation accuracy, but also higher efficiency and a more lightweight model structure. The code for AIMSost is available online at https://github.com/gnafuog/AIMSost.git.

Copa is a delay-based congestion control algorithm proposed in NSDI recently. It can achieve consistent high performance under various network environments and has already been deployed in Facebook. In this paper, we theoretically analyze Copa and reveal its large queuing delay and poor fairness issue under certain conditions. The root cause is that Copa fails to clear the bottleneck buffer occupancy periodically as expected. Accordingly, Copa may get a wrong base RTT estimation and enter its competitive mode by mistake, leading to large delay and unfairness. To address these issues, we propose Copa+, which enhances Copa with a parameter adaptation mechanism and an optimized competitive mode entrance criterion. Designed based on our theoretical analysis, Copa+ can adaptively clear the bottleneck buffer occupancy for correct estimation of base RTT. Consequently, Copa+ inherits the advantages of Copa but achieves lower queuing delay and better fairness under different environments, as confirmed by the real-world experiments and simulations. Specifically, Copa+ has the highest throughput similar to Copa but 11.9% lower queuing delay over different Internet links among different cloud nodes, and achieves 39.4% lower queuing delay and 8.9% higher throughput compared to Sprout over emulated cellular links.

Abstract In order to improve transmission performance, opportunistic social networks are widely used in 5G mobile network communication for network congestion. However, transferring large amounts of data in an instant will lead to data redundancy problems, which will affect the transmission quality. The authors propose a method called user‐optimized data transmission scheduling based on edge community service in opportunistic social networks (ECSUO). This method constructs the edge community service model by introducing mobile edge computing into the opportunistic social network. Then several scheduling factors are set to coordinate the dynamic priority assessment. The simulation results show that ECSUO performs better than other classical opportunistic complex network algorithms in a variety of transmission quality evaluation indexes, and this method also has good applicability when applied to different transmission models.

Abstract With the advent of the 5G era, people's demand for information and bandwidth is increasing. The signal source will mainly be high‐frequency radio waves with high bandwidth. However, the coverage of high‐frequency radio waves is very limited, which leads to the emergence of micro base stations. Opportunistic social networks are just suitable for this new transmission method, it is easy for users to simultaneously request content with high popularity in a short time, which will cause a heavy load on the micro base station and a high transmission delay. This paper establishes the community mechanism and proposes a user cache management and cooperative transmission mechanism (CMCT) based on edge community computing by using the predictability of users' requests for popular content. The free user equipment space is used to manage cache distribution through the edge community computing to perform cooperative transmission, thereby reducing the content delivery delay and the load of the micro base station. Simulation experiments show that the CMCT algorithm can reduce end‐to‐end delay and overhead, and improve data transmission efficiency.

Nowadays, the most common primary bone tumor is osteosarcoma, which mostly occurs in teenagers. A common diagnosis method is currently that doctors manually diagnose osteosarcoma in magnetic resonance imaging (MRI) images because it is nonradioactive and has no biological damage to brain tissue and more obvious performance in soft tissue components such as tumors, blood vessels, and muscles in MRI images. However, this method is labor-intensive and time-consuming work, and cannot guarantee the accuracy of the diagnostic results. Existing osteosarcoma MRI image segmentation methods either aim to model the global context to improve the inner consistency of objects, or multiscale feature fusion to refine the detail of objects along their boundaries, which all ignore the interaction between the body of the object and the object boundary. Therefore, this paper proposes a novel segmentation method for osteosarcoma MRI images based on DecoupleSegNet, which explores the relationship between body feature and edge feature. It can assist doctors in diagnosing osteosarcoma and improve their work efficiency. First, we warp the feature of MRI images through learning a flow field so we can make the object more consistent. We then make further work to optimize the resulting body feature and residual edge feature through explicitly sampling pixels from different parts under decoupled supervision. Through these steps, we finally obtain the final feature map with fine boundaries from the MRI image of osteosarcoma. We take a test by using more than 80,000 osteosarcoma MRI images obtained from three hospitals in China. We find that compared with existing osteosarcoma MRI image segmentation methods, our proposed method achieves 90.51 Intersection of Union % with few parameters on the test, outperforming other models. In the test, we prove that our proposed method has better accuracy and lower resource consumption.

In pace with the rapid growth of mobile communication technologies, such as 5G, the Internet of Things (IoT), as an emerging network standard, is gradually entering people’s daily lives. In this development situation, the specific applications of the IoT are reflected in the IoT systems. However, in such an open and complex environment, the nature of nodes that are easily accessible in the IoT system is unknowable. Therefore, how to use the social natures of nodes to detect the true nature of the nodes and construct a secure routing strategy is the key to the current research opportunistic social network (OSN). This article proposes a node social nature detection OSN routing scheme based on IoT system (NSND). The algorithm first proposes that there is a social relationship between nodes, and combines the characteristics of the social state of the nodes to give a formal definition of the node relationship. Then construct an OSN system to describe the types of nodes. Finally, various nodes are designed to affect the calculation method. Simulation experiments show that the NSND algorithm proposed in this article effectively utilizes the social nature of nodes. It can not only reduce the transmission impact of malicious nodes but also improve the activity of kind nodes. Its various network performance indicators are better than other algorithms.

According to statistics, in the 185 countries' 36 types of cancer, the morbidity and mortality of lung cancer take the first place, and non-small cell lung cancer (NSCLC) accounts for 85% of lung cancer (International Agency for Research on Cancer, 2018), (Bray et al., 2018). Significantly in many developing countries, limited medical resources and excess population seriously affect the diagnosis and treatment of alung cancer patients. The 21st century is an era of life medicine, big data, and information technology. Synthetic biology is known as the driving force of natural product innovation and research in this era. Based on the research of NSCLC targeted drugs, through the cross-fusion of synthetic biology and artificial intelligence, using the idea of bioengineering, we construct an artificial intelligence assisted medical system and propose a drug selection framework for the personalized selection of NSCLC patients. Under the premise of ensuring the efficacy, considering the economic cost of targeted drugs as an auxiliary decision-making factor, the system predicts the drug effectiveness-cost then. The experiment shows that our method can rely on the provided clinical data to screen drug treatment programs suitable for the patient's conditions and assist doctors in making an efficient diagnosis.

Osteosarcoma is a malignant bone tumor commonly found in adolescents or children, with high incidence and poor prognosis. Magnetic resonance imaging (MRI), which is the more common diagnostic method for osteosarcoma, has a very large number of output images with sparse valid data and may not be easily observed due to brightness and contrast problems, which in turn makes manual diagnosis of osteosarcoma MRI images difficult and increases the rate of misdiagnosis. Current image segmentation models for osteosarcoma mostly focus on convolution, whose segmentation performance is limited due to the neglect of global features. In this paper, we propose an intelligent assisted diagnosis system for osteosarcoma, which can reduce the burden of doctors in diagnosing osteosarcoma from three aspects. First, we construct a classification-image enhancement module consisting of resnet18 and DeepUPE to remove redundant images and improve image clarity, which can facilitate doctors' observation. Then, we experimentally compare the performance of serial, parallel, and hybrid fusion transformer and convolution, and propose a Double U-shaped visual transformer with convolution (DUconViT) for automatic segmentation of osteosarcoma to assist doctors' diagnosis. This experiment utilizes more than 80,000 osteosarcoma MRI images from three hospitals in China. The results show that DUconViT can better segment osteosarcoma with DSC 2.6% and 1.8% higher than Unet and Unet++, respectively. Finally, we propose the pixel point quantification method to calculate the area of osteosarcoma, which provides more reference basis for doctors' diagnosis.

Osteosarcoma is the most common malignant osteosarcoma, and most developing countries face great challenges in the diagnosis due to the lack of medical resources. Magnetic resonance imaging (MRI) has always been an important tool for the detection of osteosarcoma, but it is a time-consuming and labor-intensive task for doctors to manually identify MRI images. It is highly subjective and prone to misdiagnosis. Existing computer-aided diagnosis methods of osteosarcoma MRI images focus only on accuracy, ignoring the lack of computing resources in developing countries. In addition, the large amount of redundant and noisy data generated during imaging should also be considered. To alleviate the inefficiency of osteosarcoma diagnosis faced by developing countries, this paper proposed an artificial intelligence multiprocessing scheme for pre-screening, noise reduction, and segmentation of osteosarcoma MRI images. For pre-screening, we propose the Slide Block Filter to remove useless images. Next, we introduced a fast non-local means algorithm using integral images to denoise noisy images. We then segmented the filtered and denoised MRI images using a U-shaped network (ETUNet) embedded with a transformer layer, which enhances the functionality and robustness of the traditional U-shaped architecture. Finally, we further optimized the segmented tumor boundaries using conditional random fields. This paper conducted experiments on more than 70,000 MRI images of osteosarcoma from three hospitals in China. The experimental results show that our proposed methods have good results and better performance in pre-screening, noise reduction, and segmentation.

Lung cancer has the highest mortality rate among all malignancies. Non-micro pulmonary nodules are the primary manifestation of early-stage lung cancer. If patients can be detected with nodules in the early stage and receive timely treatment, their survival rate can be improved. Due to the large number of patients and limited medical resources, doctors take a longer time to make a diagnosis, which reduces efficiency and accuracy. Besides, there are no suitable approaches for developing countries. Therefore, we propose a 2.5D-based cascaded multi-stage framework for automatic detection and segmentation (DS-CMSF) of pulmonary nodules. The first three stages of the framework are used to discover lesions, and the latter stage is used to segment them. The first locating stage introduces the classical 2D-based Yolov5 model to locate the nodules roughly on axial slices. The second aggregation stage proposes a candidate nodule selection (CNS) algorithm to locate further and reduce redundant candidate nodules. The third classification stage uses a multi-size 3D-based fusion model to accommodate nodules of varying sizes and shapes for false-positive reducing. The last segmentation stage introduces multi-scale and attention modules into 3D-based UNet autoencoder to segment the nodular regions finely. Our proposed framework achieves 95.95% sensitivity and 89.50% CPM for nodules detection on the LUNA16 dataset, and 86.75% DSC for nodules segmentation on the LIDC-IDRI dataset. Moreover, our approach also achieves the accuracy-complexity trade-off, which can effectively realize the auxiliary diagnosis of pulmonary nodules in developing countries.

Abstract With the development of social media, social networks have become an important platform for people to share and communicate. In social network communication, when people carry mobile devices for data transmission, they need to find a definite transmission destination to ensure the normal conduct of information exchange activities. This is manifested in the process of data transmission by nodes, which requires analysis and judgment of surrounding areas, and finds suitable nodes for effective data classification and transmission. However, the node cache space in social networks is limited, and the process of waiting for the target node will cause end‐to‐end transmission delay. In order to improve such a transmission environment, this paper proposes a node trajectory prediction method named EDPPM algorithm. The EDPPM algorithm guarantees that nodes with high probability are given priority to obtain data information, which realized an effective data transmission mechanism. Through experiments and comparison of opportunistic transmission algorithms in social networks, such as Epidemic algorithm, Spray and Wait algorithm, and PRoPHET algorithm, the proposed scheme outperforms ProPhet by 47% in terms of cache utilization of nodes, 55% in terms of data transmission delay, and 32% in terms of network efficiency; compared with Epidemic by 53% in terms of cache utilization of nodes, 62% in terms of data transmission delay, and 47% in terms of network efficiency; same thing with regard to the Spray and wait by 27% in terms of cache utilization of nodes, 31% in terms of data transmission delay, and 17% in terms of network efficiency.

Abstract Wireless Sensor Network (WSN) has been widely used with its main characteristics of resilience, scalability, and mobility. However, the node battery capacity in WSN is limited. In addition, in scenes with emergencies such as forest ecological monitoring, data packets of wildfire emergencies have higher real‐time requirements than periodic normal data. Therefore, this paper proposes an energy‐efficient MAC protocol based on Receiver initiation and Multi‐Priority Backoff (RMP‐MAC). RMP‐MAC adopts the wake‐up matching mechanism initiated by the receiver. The sender adjusts its schedule according to the wake‐up information of the receiver to match the receiver, which reduces the energy consumption of idle listening. In addition, RMP‐MAC proposes a multi‐priority factor adaptive backoff mechanism based on event priority, node remaining energy level, and the number of data packets waiting in the transmission queue, ensuring the transmission of emergency data in the actual situation of forest ecological monitoring. Simulation experiments show that compared with PB‐MAC, AP‐MAC, and MPQ‐MAC, RMP‐MAC can reduce energy consumption by 20.22%, 12.47%, and 6.62% respectively. In addition, it has improved in the average collisions, network throughput, and average delay of packets.

Abstract The rapid development of the Internet of things has led to the explosive development of data in various fields. Traditional routing protocols cannot effectively handle the reception and transmission of data. This makes it difficult to exchange and transmit information in the Internet of things. Therefore, the choice of data transmission methods is particularly important. In order to solve this problem, this paper proposes a data transmission mechanism based on social relationships, namely, the mobile node social relationship quantification (MNSRQ) algorithm, which analyses the social relationship characteristics of mobile nodes in the Internet of things, extracts decision‐making features to study the dynamics of social relationship, then combines information entropy and fuzzy clustering theory to quantify the social relationship, and then selects the relay node with strong social relationship for data transmission. Theoretical analysis and experimental results show that the performance of the MNSRQ algorithm is better than previous studies. Compared with epidemic algorithm, ICMT algorithm, spray and wait algorithm, and EIMST algorithm, the MNSRQ algorithm can reduce end‐to‐end transmission delay and routing overhead while maintaining the life of the network, effectively reduce energy consumption during transmission, and maintain a high data transmission success rate, with a transmission success rate of 0.7–0.9.

OBJECTIVE: Accurate segmentation and partitioning of lesions in PET images provide computer-aided procedures and doctors with parameters for tumour diagnosis, staging and prognosis. Currently, PET segmentation and lesion partitioning are manually measured by radiologists, which is time consuming and laborious, and tedious manual procedures might lead to inaccurate measurement results. Therefore, we designed a new automatic multiprocessing scheme for PET image pre-screening, noise reduction, segmentation and lesion partitioning in this study. PET image pre-screening can reduce the time cost of noise reduction, segmentation and lesion partitioning methods, and denoising can enhance both quantitative metrics and visual quality for better segmentation accuracy. For pre-screening, we propose a new differential activation filter (DAF) to screen the lesion images from whole-body scanning. For noise reduction, neural network inverse (NN inverse) as the inverse transformation of generalized Anscombe transformation (GAT), which does not depend on the distribution of residual noise, was presented to improve the SNR of images. For segmentation and lesion partitioning, definition density peak clustering (DDPC) was proposed to realize instance segmentation of lesion and normal tissue with unsupervised images, which helped reduce the cost of density calculation and completely deleted the cluster halo. The experimental results of clinical data demonstrate that our proposed methods have good results and better performance in noise reduction, segmentation and lesion partitioning compared with state-of-the-art methods.

The measurement of cavum septum pellucidum is an important step in prenatal testing. However, this process is usually done manually, which is such a difficult and time-consuming task due to the attenuation and shadows of ultrasound images even for experienced sonographers. In this study, we propose a novel deep attention network to address this problem by segmenting and measuring the width of cavum septum pellucidum. The proposed network is based on U-net with three changes: a new channel attention module, increasing attention on relevant regions; VGGI I, adding the depth of encoder path to increase the receptive field; And post-processing to measure and diagnose the anomalies of cavum septum pellucidum. Experiments on a fetal ultrasound dataset demonstrated our proposed network achieved the highest precision of 79.5% and the largest Dice score of 77.5%. To demonstrate the generalization capacity, we also have been validated our model on the BraTs 2017 dataset, obtaining an excellent performance with the Dice score of 91.5%.

With the development of 5G network and big data and the popularity of mobile intelligent devices, the opportunistic social network has been further developed. At present, several existing routing algorithms based on node similarity use the context information of the node to select the best relay node. However, most opportunistic social algorithms only consider the social properties of nodes and ignore the importance of the similarity of the moving trajectories of the nodes. The transmission opportunity of messages in the opportunity social network is generated by the movement of the nodes, so this feature must betaken into account in the designing of the routing algorithm. Therefore, this study proposes a routing algorithm based on the triangular fuzzy layer model and multi‐layer clustering for the opportunistic social network. In this study, the authors use the fuzzy analytic hierarchy process model to analyse the social similarity and trajectory similarity to determine the best message transmission node. This study compares the other four opportunistic social network routing algorithms in the simulation environment. In general, among the five routing algorithms, the transmission rate of the TFMC algorithm is the best. The average end‐to‐end delay and average network overhead are also the lowest.

With the development of big data, the authors have witnessed the great success of the mobile internet that the number of intelligent mobile devices (MDs) has increased dramatically and the data that needs to be transmitted grows exponentially. The traditional end‐to‐end communication mechanism in social networks is difficult to satisfy enormous communication demands. Therefore, opportunistic social networks proposed that message applications should choose relay nodes to perform effective data transmission processes. Currently, some routing algorithms that utilise contextual information associated with nodes need to handle heavy computing tasks and manage large numbers of messages, which usually results in higher network overhead and network latency. Furthermore, the computing power of MDs is usually limited, message carriers may not be able to quickly find the suitable relay node because of their insufficient computing power, resulting in higher network latency and network overhead. In this study, they construct a cooperative‐routing mechanism based on node classification and task allocation for opportunistic social networks. In their proposed strategy, the reliable relay nodes can be obtained by classifying nodes according to the social attributes of the nodes. The task of node classification will be uniformly assigned to other idle nodes according to their computing power.

In real network environment, nodes may acquire the communication destination during data transmission and find a suitable neighbor node to perform effective data classification transmission. This is similar to finding certain transmission targets during data transmission with mobile devices. However, the node cache space in networks is limited, and waiting for the destination node can also cause end‐to‐end delay. To improve the transmission environment, this study established Data Transmission Probability and Cache Management method. According to selection of high meeting probability node, cache space is reconstructed by node. It is good for nodes to improve delivery ratio and reduce delay. Through experiments and the comparison of opportunistic network algorithms, this method improves the cache utilization rate of nodes, reduces data transmission delay, and improves the overall network efficiency.