ABSTRACT Purpose: Tongue image analysis for disease diagnosis is an ancient traditional non-invasive diagnosis technique widely used by traditional medicine practitioners. Deep Learning based multi-label disease detection models offer tremendous potential to clinical decision support systems, by facilitating preliminary diagnosis. Methods: In this work, we propose a multi-label disease detection pipeline, where in observation and analysis of tongue images captured and received via smartphones assist in predicting the health status of an individual. All images are voluntarily given by subjects consulting collaborating physicians. Images thus acquired are first and foremost classified either into a diseased or a normal category by a 5-fold cross-validation algorithm using a convolution neural network (MobileNetV2) model for binary classification. Once the diseased label is predicted, the image is used to diagnose multiple diseases using the prediction algorithm based on DenseNet121. Results: Average accuracy of 93 % was achieved in classifying diseased from normal healthy tongue by detection model with MobileNetV2 architecture. Multilabel disease classification produced more than 90% accurate results for the seven class labels considered. Conclusion: AI based image analysis shows promising results and an extensive dataset could provide further improvements to this approach. Rather than employing high-cost sophisticated image capturing setup, experimenting with smartphone images opens opportunity to provide preliminary health status to individuals on smartphone prior to further line of treatment and diagnosis.

Selecting road networks in cartographic generalization has consistently posed formidable challenges, driving research towards the application of intelligent models. Despite previous efforts, the accuracy and connectivity preservation in these studies, particularly when dealing with road types of similar sample sizes, still warrant improvement. To address these shortcomings, we introduce a Heterogeneous Graph Attention Network (HAN) for road selection, where feature masking method is initially utilized to assess the significance of road features. Concentrating on the most relevant features, two meta-paths are introduced within the HAN framework: one for aggregating features of the same road type within the first-order neighborhood, emphasizing local connectivity, and another extending this aggregation to the second-order neighborhood, capturing a broader spatial context. For a comprehensive evaluation, we introduce a set of metrics considering both quantitative and qualitative aspects of the road network. Compared to traditional neural networks, our HAN model demonstrates superior accuracy and F1-score, particularly for road types with comparable samples. Additionally, it enhances the overall connectivity of the selected network. In summary, our HAN-based method provides an advanced solution for road network selection, surpassing previous approaches in terms of accuracy and connectivity preservation.

This paper presents the Advanced Syntactic-Graph Convolutional Model (ASGCM), a pioneering approach in Aspect-Based Sentiment Analysis (ABSA) that integrates syntactic dependency features within a graph convolution framework. ASGCM stands out for its novel use of dependency edge encoding and tag-based graph convolutions, providing a fine-grained analysis of sentiments associated with specific aspects in text. This model meticulously captures the intricacies of syntactic structures, thereby offering enhanced precision in sentiment analysis. Notably, ASGCM incorporates a dual-layer graph convolution system: one layer processes syntactic dependencies (edges), while the other interprets semantic roles (tags), ensuring a comprehensive understanding of both structural and contextual elements in text. We rigorously tested ASGCM on multiple datasets, including both English and Chinese languages, and our findings reveal a significant improvement in sentiment classification accuracy compared to existing models. The versatility of ASGCM makes it a robust tool for diverse linguistic environments, setting a new standard for ABSA methodologies.

：Non-Euclidean data, such as social networks, and citation relationships between documents, has node information and structural information. Graph Convolutional Network(GCN) can automatically learn node features and association information between nodes. The core ideology of the graph convolutional network is to aggregate node information by using edge information, thereby generating a new node feature. In the process of updating node features, there are two core influencing factors. One is the number of neighboring nodes of the central node, the other is the contribution of the neighboring nodes to the central node. Due to the previous GCN methods not simultaneously considering the numbers and different contributions of neighboring nodes to the central node, we design the Adaptive Attention Mechanism(AAM). To further enhance the representational capability of the model, we utilize Multi-Head Graph Convolution(MHGC). Finally, we adopt cross-entropy(CE) loss function to describe the difference between the predicted results of node categories and the ground truth (GT). Combined with backpropagation, this ultimately achieves accurate node classification. Based on AAM, MHGC and CE, we contrive the novel Graph Adaptive Attention Network (GAAN). Experiments show that the classification accuracy has achieved outstanding performances on Cora, Citeseer and Pubmed datasets.

In recent years, there has been significant growth in the ubiquity and popularity of three dimensional(3D) point clouds, with an increasing focus on the classification of 3D point clouds. To extract richer features from point clouds, many researchers have turned their attention to various point set regions and channels within irregular point clouds. However, this approach has limited capability in attending to crucial regions of interest in 3D point clouds and may overlook valuable information from neighboring features during feature aggregation. Therefore, this paper proposes a novel 3D point cloud classification method based on global attention and adaptive graph convolution. The method consists of two main branches: the first branch com-putes attention masks for each point, while the second branch employs adaptive graph convolu-tion to extract global features from the point set. It dynamically learns features based on point interactions, generating adaptive kernels to effectively and precisely capture diverse relationships among points from different semantic parts. Experimental results demonstrate that the proposed model achieves 93.8% in overall accuracy and 90.8% in average accuracy on the ModeNet40 dataset.

With the development of deep learning, several Graph Neural Networks (GNN)-based approaches have been utilized for text classification. However, GNNs encounter challenges in capturing contextual text information within a document sequence. To address this, a novel text classification model RB-GAT is proposed by combining RoBERTa-BiGRU embedding and a multi-head Graph ATtention Network (GAT). First, the pre-trained RoBERTa model is exploited to learn word and text embeddings in different contexts. Second, the Bidirectional Gated Recurrent Unit (BiGRU) is employed to capture long-term dependencies and bidirectional sentence information from the text context. Next, the multi-head graph attention network is applied to analyze this information, which serves as a node feature for the document. Finally, the classification results are generated through a Softmax layer. Experimental results on three benchmark datasets demonstrate that our method can achieve an accuracy of 71.48%, 98.45%, and 80.32% on Ohsumed, R8, and MR, which is superior to the existing nine text classification approaches.

The root system plays an irreplaceable role in plant growth. Its improvement can increase crop productivity. However, such system is still mysterious for us. The underlying mechanism has not been fully uncovered. The investigation on proteins related to the root system is an important means to complete this task. In the previous time, lack of root-related proteins makes it impossible to adopt machine learning methods for designing efficient models for the discovery of novel root-related proteins. Recently, a public database on root-related proteins was set up and machine learning methods can be applied in this field. In this study, we proposed a machine learning based model, named Graph-Root, for identification of root-related proteins. The features derived from protein sequences and one network were extracted, where the former features were processed by graph convolutional neural network and multi-head attention, and the later features abstracted the linkage between proteins. These features were fed into the fully connected layer to make prediction. The 5-fold cross-validation and independent tests suggested its good performance. It also outperformed the only one previous model, SVM-Root. Furthermore, the importance of each feature type and component in the proposed model was investigated.

We present a case of adult-onset systemic chronic active EBV disease (CAEBV) in a 40-year-old woman with chronic HBV hepatitis. Initial symptoms resembled a viral illness, progressing to recurrent fever, transaminitis, and anasarca. Investigations revealed high-level EBV viremia and an abnormal T-cell population in liver and bone marrow, indicative of CAEBV. Liver biopsy showed CD3+ T-cells lacking TCRbeta and displaying dim/negative CD5, with elevated EBV-infected T-cells. Next-generation sequencing identified rare variants in CREBBP, SPEN, TP73, and PLCG2, suggesting potential contributions to disease pathogenesis. This case underscores diagnostic challenges and management complexities of adult-onset CAEBV, particularly with underlying chronic HBV infection. Genomic profiling offers crucial insights into the molecular landscape of rare lymphoid malignancies, highlighting the importance of personalized treatment strategies. The distinct immunophenotypic features underscore the heterogeneity in EBV-associated T-cell LPDs, urging further research for optimized clinical management

Research on image-inpainting tasks has mainly focused on enhancing performance by augmenting various stages and modules. However, this trend does not consider the increase in the number of model parameters and operational memory, which increases the burden on computational resources. To solve this problem, we propose a Parametric Efficient Image InPainting Network (PEIPNet) for efficient and effective image-inpainting. Unlike other state-of-the-art methods, the proposed model has a one-stage inpainting framework in which depthwise and pointwise convolutions are adopted to reduce the number of parameters and computational costs. To generate semantically appealing results, we selected three unique components: spatially-adaptive denormalization (SPADE), dense dilated convolution module (DDCM), and efficient self-attention (ESA). The SPADE was adopted to conditionally normalize activations according to the mask to distinguish between damaged and undamaged regions. The DDCM was employed at every scale to overcome the gradient-vanishing obstacle and gradually fill-in pixels by capturing global information along the feature maps. The ESA was utilized to obtain clues from unmasked areas by extracting long-range information. In terms of efficiency, our model has the lowest operational memory compared with other state-of-the-art methods. Both qualitative and quantitative experiments demonstrate the generalized inpainting of our method on three public datasets: Paris StreetView, CelebA, and Places2.

Identification of plants is a challenging task which aims to identify the family, genus, and species level according to morphological features. Automated deep learning-based computer vision algorithms are widely used for identifying plants and can help users to narrow down the possibilities. However, numerous morphological similarities between and within species make the classification difficult. In this paper, we tested a custom convolution neural network (CNN) and vision transformer (ViT) based models using the PyTorch framework to classify plants. We used a large dataset of 88K and 16K images for classifying plants at genus and species levels respectively. Our results show that for classifying plants at the genus level, ViT models perform better compared to CNN-based models ResNet50 and ResNet-RS-420, and other state-of-the-art CNN-based models suggested in previous studies on a similar dataset. The ViT model achieved top accuracy of 83.3% for classifying plants at the genus level. ViT models also perform better for classifying plants at the species level compared to CNN-based models ResNet50 and ResNet-RS-420, with a top accuracy of 92.5%. We show that the correct set of augmentation techniques plays an important role in classification success.

Plato defined a quality as “some degree of perfection” [49]. Studies on quality have unveiled the internal and external quality factors [17] that significantly impact product quality [4]. Internal factors are invisible to the end customer and are dependent on overall work organisation by the development team [17]. This work organisation is called “the process” [11],[33]. In this article, we will discuss how to address the drone-dedicated software development process to support system verification and ensure product quality by supporting quality characteristics and therefore increase software development awareness and control. We will discuss the process's influence on overall work activities and relationships between those activities by addressing the software development process utilised in the drone-dedicated GNSS-denied navigation system development project. The result was observable after three weeks of starting the software development. It was focused on better team awareness, faster task completion, lower number of development mistakes, and better and faster change response than we observed in other projects that didn’t follow the predefined process.

Convolutional neural networks (CNN) have attracted much attention as a commonly used method for hyperspectral image (HSI) classification in recent years, however, CNNs can only be applied to Euclidean data and have limitations in dealing with relationships due to the limitations of local feature extraction. However, each pixel of a hyperspectral image contains a set of spectral bands that are correlated and interact with each other, and the methods used to process Euclidean data cannot effectively obtain these correlations. In contrast, the graph convolutional network (GCN) can be used in non-Euclidean data, but usually leads to oversmoothing and ignoring local detail features due to the need for superpixel segmentation processing to reduce computational effort. To overcome the above problems, we constructed a network a fusion network based on GCN and CNN, which contains two branches: a graph convolutional network based on superpixel segmentation and a convolutional network with added attention mechanism. The graph convolu-tional branch can extract the structural features and capture the relationships between the nodes, and the convolutional branch can extract the detailed features in the local fine region. Owing to the fact that the features extracted from the two branches are different, the classification performance can be improved by fusing the complementary features extracted from the two branches. To vali-date the proposed algorithm, experiments were conducted on three widely used datasets, namely Indian Pines, Pavia University, and Salinas, and the overall accuracy of 98.78% was obtained in the Indian Pines dataset, and the overall accuracy of 98.99% and 98.69% was obtained in the other two datasets. The results showed that the proposed fusion network can obtain richer features and achieve high classification accuracy.

The primary goal of picture compression is to reduce the amount of unused image data while still storing or transmitting it in a format that is appropriate. The compression of raw binary data is quite different from the compression of a picture, and these differences may be rather substantial. In light of this, compression is often regarded as an essential technique for the purposes of both data storage an d transmission in order to mitigate the excessive amounts of data that are generated by these images. In order to transmit enormous datasets, particularly for the purposes of telemedicine and teleradiology, one needs a significant amount of storage capacity as well as an expansive network. As a result, compression is an important aspect of medical imaging. In addition to the importance of compression, the quality of the photos themselves is also an essential factor in the success of analysis. In addition to this, the amount of time necessary to compress the photographs before sending them should be reduced.

Multi-floor environments are usually ignored while designing an autonomous robot for indoor cleaning applications. However, for efficient operation in such environments, the ability of a robotic platform to traverse staircases is crucial. Staircase detection and localization is highly important for planning the traversal on staircases. This paper describes a deep learning approach using Convolutional Neural Networks (CNNs) based Robot Operation System (ROS) to staircase detection and localization. We use an object detection network to detect staircases in images. We also localize these staircases using a contour detection algorithm to detect the target point, a point close to the center of the first step, and the angle of approach to the target point. Experiments are performed with data obtained from images captured on different types of staircases at different view points/angles. Results show that the approach is very accurate in identifying the presence of the staircase in the working environment and is also able to locate the target point with good accuracy.

Aiming at the problems of inaccurate segmentation of long object and information loss of small object in real-time semantic segmentation algorithm, this paper proposes a lightweight multi-branch real-time semantic segmentation network based on BiseNetV2. The new auxiliary branch makes full use of spatial details and context information to cover the long object in the field of view. Meanwhile, in order to ensure the inference speed of the model, the asymmetric convolution is used in each stage of the auxiliary branch to design a structure with low computational complexity. In the multi-branch fusion stage, the alignment and fusion module is designed to provide guidance information for deep and shallow feature mapping, so as to make up for the problem of feature misalignment in the fusion of information at different scales, and thus reduce the loss of small target information. In order to further improve the model’s awareness of key information, a global context module is designed to capture the most important features in the input data. The proposed network uses NVIDIA GeForce RTX 3080 Laptop GPU experiment, on the road street view data set Cityscapes and CamVid average occurring simultaneously ratio reached 77.1% and 78.4% respectively, with running speed of 127 frames/s respectively and 112 frames/s. The experimental results show that the proposed algorithm can achieve real-time segmentation and improve the accuracy significantly, showing good semantic segmentation performance

Here we present a fast and highly scalable community structure preserving network module detection that recursively integrates graph sparsification and clustering. Our algorithm, called SparseClust, participated in the most recent DREAM community challenge on disease module identification, an open competition to comprehensively assess module identification methods across a wide range of biological networks.

Public transportation scheduling aims to optimize the allocation of transportation resources, enhance transportation efficiency, and increase passenger satisfaction, which is crucial for building a sustainable urban transportation system. As a complement to public transportation, shared bikes provide users with a solution for the last mile of travel, compensating for the lack of flexibility in public transportation and helping to improve its utilization rate. Due to the characteristics of shared bikes, such as peak usage periods in the morning and evening and significant fluctuations in demand across different areas, the optimization of shared bike dispatch can better meet user needs, thereby reducing vehicle vacancy rates and increasing operating revenue. Addressing this issue, this paper designs a comprehensive decision-making approach for spatio-temporal demand prediction and bike dispatch optimization. For demand prediction, we designed a T-GCN based bike demand prediction model. In terms of dispatch optimization, we considered factors such as dispatch capacity, distance restrictions, and dispatch costs, and designed an optimization solution based on genetic algorithms. Finally, this paper validates the approach using shared bike operating data, shows that T-GCN can effectively predict short-term demand for shared bikes. Meanwhile, the optimization model based on genetic algorithms provides a complete dispatch solution verifying the model’s effectiveness. The shared bike dispatch approach proposed in this paper, which combines demand prediction with resource scheduling. This scheme can also be extended to other transportation scheduling problems with uncertain demand, such as store replenishment delivery and intercity inventory dispatch.

Cyber security plays an important role to protect our computer, network, program and data from unauthorized access. Intrusion detection system (IDS) and intrusion prevention system (IPS) are two main categories of cyber security, designed to identify any suspicious activities present in inbound and outbound network packets and restrict the suspicious incident. Deep neural network plays a significant role in the construction of IDS and IPS. This paper highlights a novel IDS using optimized convolution neural network (CNN-IDS). An optimized CNNIDS model is an improvement over CNN which selects the best weighted model by considering the loss in every epoch. All the experiments have been conducted on the well known NSL-KDD dataset. Information gain has been used for dimensionality reduction. The accuracy of the proposed model is evaluated through optimized CNN for both binary and multiclass categories. Finally, a critical comparison has been performed with other general classifiers like J48, Naive Bayes, NB tree, Random forest, Multilayer Perceptron (MLP), Support Vector Machine (SVM), Recurrent Neural Network (RNN) and Convolution Neural Network(CNN). All the experimental results demonstrate that the optimized CNN-IDS model records the best recognition rate with minimum model construction time.

This paper proposes an interpretable geometry solution based on the formal language set of text and diagram. Geometry problems are solved by machines, which still poses challenges in natural language processing and computer vision. Significant progress promotes existing methods in the extraction of geometric formal languages. However, the neglect of the graph structure information in the formal language and the lack of further refinement of the extracted language set can lead to the poor effect of the theorem prediction and affect the accuracy in problem solving. In this paper, the formal language graph is constructed by the extracted formal language set and used to theorem prediction by graph convolutional network. So as to better extract the relationship set of diagram elements, an improved diagram parser was proposed. The test results indicate that the improved method has good results in solving the problem with interpretability geometry.

Sparse training (ST) aims to ameliorate deep learning by replacing fully connected artificial neural networks (ANNs) with sparse or ultra-sparse ones, such as brain networks are, therefore it might benefit to borrow brain-inspired learning paradigms from complex network intelligence theory. Here, we launch the ultra-sparse advantage challenge, whose goal is to offer evidence on the extent to which ultra-sparse (around 1% connection retained) topologies can achieve any leaning advantage against fully connected. Epitopological learning is a field of network science and complex network intelligence that studies how to implement learning on complex networks by changing the shape of their connectivity structure (epitopological plasticity). One way to implement Epitopological (epi- means new) Learning is via link prediction: predicting the likelihood of non-observed links to appear in the network. Cannistraci-Hebb learning theory inspired the CH3-L3 network automata rule for link prediction which is effective for general-purpose link prediction. Here, starting from CH3-L3 we propose Epitopological Sparse Meta-deep Learning (ESML) to apply Epitopological Learning to sparse training. In empirical experiments, we find that ESML learns ANNs with ultra-sparse hyperbolic (epi-)topology in which emerges a community layer organization that is meta-deep (meaning that each layer also has an internal depth due to power-law node hierarchy). Furthermore, we discover that ESML can in many cases automatically sparse the neurons during training (arriving even to 30% neurons left in hidden layers), this process of node dynamic removal is called percolation. Starting from this network science evidence, we design Cannistraci-Hebb training (CHT), a 4-step training methodology that puts ESML at its heart. We conduct experiments on 7 datasets and 5 network structures comparing CHT to dynamic sparse training SOTA algorithms and the fully connected counterparts. The results indicate that, with a mere 1% of links retained during training, CHT surpasses fully connected networks on VGG16, GoogLeNet, ResNet50, and ResNet152. This key finding is an evidence for ultra-sparse advantage and signs a milestone in deep learning. CHT acts akin to a gradient-free oracle that adopts CH3-L3-based epitopological learning to guide the placement of new links in the ultra-sparse network topology to facilitate sparse-weight gradient learning, and this in turn reduces the convergence time of ultra-sparse training. Finally, CHT offers the first examples of parsimony dynamic sparse training because, in many datasets, it can retain network performance by percolating and significantly reducing the node network size. Our code is available at: https://github.com/biomedical-cybernetics/Cannistraci-Hebb-training.

Agriculture is one of the indispensable fields for the survival of mankind. Potatoes also have a significant role in the field of agriculture. The quality and quantity of potatoes are significantly impacted by several diseases, such as early blight and late blight, and manual interpretation of these leaf diseases is time-consuming and inconvenient. Fortunately, leaf appearance is used to detect diseases in potato plants. Productivity will considerably rise if the infections are detected early. Different types of image processing methods and machine learning methods are used for early recognition of those diseases from leaf images so that the product losses are decreased significantly. For the incredible and marvelous performance of CNN, it is the most popular deep learning method that is used immensely for the recognition of leaf diseases from images. Several pretrained deep learning models, such as VGG16, ResNet50, InceptionV3, MobileNetV2, Xception, and a deep learning model developed using CNN, are employed for potato leaf disease classification and recognition on the same dataset. The transfer learning technique is applied to the pretrained model and the data augmentation technique is applied to the Proposed CNN model for potato disease classification from leaf samples. Compared to pretrained models, the proposed CNN model offers the lowest loss and highest accuracy for potato leaf disease detection while using fewer parameters and layers. It achieves the best performance with a test accuracy of 99.33% compared to other Pretrained models used in the diagnosis of potato leaf disease.

Graft injury affects over 50% of liver transplant (LT) recipients, but non-invasive biomarkers to diagnose and guide treatment are currently limited. We aimed to develop a biomarker of graft injury by integrating serum metabolomic profiles with clinical variables. Serum from 55 LT recipients with biopsy confirmed metabolic-dysfunction associated steatohepatitis (MASH), T-cell mediated rejection (TCMR) and biliary complications was collected and processed using a combination of LC-MS/MS assay. The metabolomic profiles were integrated with clinical information using a multi-class Machine Learning (ML) classifier. The efficacy of the model was assessed through the evaluation of the Out-of-Bag (OOB) error estimate. Our ML model yielded an overall accuracy of 79.66% with an OOB estimate of the error rate at 19.75%. The model exhibited a maximum ability to distinguish MASH, with an OOB error estimate of 7.4% compared to 22.2% for biliary and 29.6% for TCMR. The metabolites serine and serotonin emerged as the topmost predictors. When predicting binary outcomes using 3 models: Biliary (biliary vs. rest), MASH (MASH vs. rest) and TCMR (TCMR vs. rest), the AUCs were 0.882, 0.972 and 0.96 respectively. Our ML tool integrating serum metabolites with clinical variables shows promise as a non-invasive, multi-class serum biomarker of graft pathology.

Convolutional Neural Networks (CNNs) present drawbacks for modeling geometric transformations, such as scaling and rotation, caused by the convolution operation’s locality. Deformable convolution (DCON), a mechanism that substitutes standard convolution, increasing the receptive field to capture relevant features, is a promising approach to solve this drawback and improve the robustness of CNNs. However, the optimal way to replace the standard convolution with its deformable counterpart in a CNN model is unclear. In this study, we clarify this aseveration by conducting several experiments using deformable convolutions applied in the layers that conform a small four-layer CNN model. We also use deformable convolutions on the four-layers of several ResNet CNNs with depths 18, 34, 50, and 101. The models were tested in binary balanced classes with 2D data for image classification: Cats & Dogs, EyesPACS, Spyders & Chickens, and Shapes. After this testing, we evaluated DCON in 3D data for action recognition: UCF101 and Human2 (a dataset we compiled to control movement, clothing and background). The contribution of this research lies in a guideline to use DCON. It can be summarized as follows: if DCON is used on the first layers of the proposal of model (with simple features), the computational resources expressed as the quantity of Flops will tend to increase and produce bigger misclassification than the standard CNN. However, if the DCON is used at the end layers, the quantity of Flops used in the training and testing will decrease, and the classification accuracy will improve by up to 20% about the base model. Moreover, it gains robustness when using deformable convolutions because it can adapt to the region of interest. Also, the best kernel size of the DCON is three. It showed better results than size five. In the last case, the quantity of Flops increase quadratically, but their performance does not increase significantly. With these results, we propose a guideline to use the DCON and contribute to understanding the impact of DCON on the robustness of CNNs.

Dynamic sparse training is an effective strategy to alleviate the training and inference demands of artificial neural networks. However, current sparse training methods face a challenge in achieving high levels of sparsity while maintaining performance comparable to that of their fully connected counterparts. The Cannistraci-Hebb training (CHT) method produces an ultra-sparse advantage compared to fully connected training in various tasks by using a gradient-free link regrowth method, which relies solely on the network topology. However, its rigid selection based on link prediction scores may lead to epitopological local minima, especially at the beginning of the training process when the network topology might be noisy and unreliable. In this article, we introduce the Cannistraci-Hebb training soft rule (CHTs), which applies a flexible approach to both the removal and regrowth of links during training, fostering a balance between exploring and exploiting network topology. Additionally, we investigate the network topology initialization using several approaches, including the bipartite scale-free and bipartite small-world network models. Empirical results show that CHTs can surpass the performance of fully connected networks with MLP architecture by using only 1% of the connections (99% sparsity) on the MNIST, EMNIST, and Fashion MNIST datasets and can provide remarkable results with only 0.1% of the links (99.9% sparsity). In some MLPs for image classification tasks, CHTs can reduce the active neuron network size to 20% of the original nodes (neurons), demonstrating a remarkable ability to generalize better than fully connected architectures, reducing the entire model size. This represents a relevant result for dynamic sparse training. Finally, we present evidence from larger network models such as Transformers, with 10% of the connections (90% sparsity), where CHTs outperform other prevalent dynamic sparse training methods in machine translation tasks.

Parasomnias are a group of sleep disorders characterized by abnormal and unpleasant motor, verbal or behavioral events that occur during sleep or during transitions between wake and sleep states. They disrupt sleep and can have a detrimental impact on the individual experiencing them. Our goal was to identify types of parasomnias and their prevalence in the post-secondary student population and to explore students' coping strategies for parasomnias they found distressing. Seventy-seven post-secondary students completed the 21-item Munich Parasomnia Screening (MUPS) frequency scale. They also rated, on a 10-point scale, how disturbing each parasomnia was. Not only did 92% percent of students report at least one parasomnia, but our results also indicate that the vast majority of students experienced more than one parasomnia. This led us to investigate the likelihood of the co-occurrence of different parasomnias. With respect to the level of subjectively experienced distress, the most prevalent parasomnias were not always the more disturbing ones. Coded open-ended responses about what students do about the disturbing parasomnias indicate that grounding strategies and physical manipulation of one’s body were the most common, although most participants indicated that in spite of distress, they do nothing to cope. In conclusion, our study found a strikingly high prevalence of parasomnias in this sample of young adults and a lack of knowledge about effective means of dealing with these.

Background. Gene rearrangements affecting KMT2A are frequent in acute myeloid leukemia (AML) and are often associated with a poor prognosis. KMT2A gene fusions are often detected by chromosome banding analysis and confirmed by fluorescence in-situ hybridization. However, small intragenic insertions, termed KMT2A partial tandem duplication (PTD), are particularly challenging to detect using standard molecular and cytogenetic approaches. Methods. We have validated the use of a custom hybrid capture based next-generation sequencing (NGS) panel for comprehensive profiling of AML patients seen at our institution. This NGS panel targets the entire consensus coding DNA sequence of KMT2A; to deduce the presence of a PTD we used the relative ratio of KMT2A exons coverage. We sought to corroborate the KMT2A-PTD NGS results using (1) multiplex-ligation probe amplification (MLPA) and (2) optical genome mapping (OGM). Results. We analyzed 932 AML cases and identified 41 individuals harboring a KMT2A-PTD. MLPA, NGS and OGM confirmed the presence of a KMT2A-PTD in 22 of the cases analyzed where orthogonal testing was possible. Two false positive PTD calls by NGS could be explained by the presence of cryptic structural variants impacting KMT2A and interfering with PTD analysis. OGM revealed the nature of these previously undetected gene rearrangements in KMT2A, while MLPA yielded in-conclusive results. MLPA analysis for KMT2A-PTD is limited to exon 4, whereas NGS and OGM resolved KMT2A-PTD sizes and copy number levels. Conclusion. KMT2A-PTDs are complex gene rearrangements that cannot be fully ascertained using a single genomic platform. MLPA, NGS panels and OGM are complementary technologies applied in standard of care testing for AML patients. MLPA and NGS panels are designed for targeted copy number analysis; however, our results show that integration of concurrent genomic alterations is needed for accurate KMT2A-PTD identification. Unbalanced chromosomal rearrangements overlapping with KMT2A can interfere with the diagnostic sensitivity and specificity of copy number based KMT2A-PTD detection methodologies.

Deep learning methods have been widely used in PolSAR image classification. To learn the polarimetric information, many deep learning methods expect to learn high-level semantic features from original PolSAR data. However, only original data cannot learn multiple scattering features and complex structures for extremely heterogeneous terrain objects. In addition, deep learning methods always cause edge confusion due to the high-level features. To overcome these shortages, we propose a double-channel CNN network combined with an edge-preserving MRF model(DCCNN-MRF) for PolSAR image classification. Firstly, to combine complex matrix data and multiple scattering features together, a double-channel convolution network(DCCNN) is developed, which consists of a Wishart-based complex matrix and multi-feature subnetworks. The Wishart-based complex matrix network can learn the statistical characteristics and channel correlation well, and the multi-feature network can learn high-level semantic features well. Then, a unified network framework is designed to fuse two kinds of features to enhance advantageous features and reduce redundant ones. Finally, an edge preserving MRF model is designed to combine with the DCCNN network. In the MRF model, a sketch map-based edge energy function is designed by defining adaptive weighted neighborhood for edge pixels. Experiments are conducted on four real PolSAR data sets with different sensors and bands. Experimental results demonstrate the effectiveness of the proposed DCCNN-MRF method.

Human action recognition (HAR) based on skeleton data is a challenging yet important technique because of its wide range of applications in many fields, including patient monitoring, security surveillance, and observing human-machine interactions. Many algorithms that attempt to distinguish between many types of activities have been proposed. However, most practical applications require highly accurate detection of specific types of activities. In this study, a novel and highly accurate spatiotemporal graph autoencoder network for HAR based on skeleton data is proposed. Furthermore, an extensive study was conducted using different modalities. For this purpose, a spatiotemporal graph autoencoder that automatically learns spatial as well as temporal patterns from human skeleton datasets was built. The powerful graph convolutional network named GA-GCN, developed in this study, notably outperforms most of the existing state-of-the-art methods based on two common datasets, namely NTU RGB+D and NTU RGB+D 120 . On the first dataset, we achieved an accuracy of 92.3% and 96.7% based on the cross-subject and cross-view evaluations, respectively. On the other more challenging dataset (i.e. NTU RGB+D 120), GA-GCN achieved 88.8% and 90.4% based on the cross-subject and cross-set evaluation, respectively.

With the rapid development of Internet of Things (IoT)-based near-earth remote sensing technology, the problem of network intrusion for near-earth remote sensing systems has become more complex and large-scale. Therefore, it is essential to seek an intelligent, automated, and robust network intrusion detection method. In recent years, network intrusion detection methods based on graph neural networks (GNNs) have been proposed. However, there are still some practical issues with these methods. For example, they have not taken into consideration the characteristics of near-earth remote sensing systems, the state of the nodes, and the temporal features. Therefore, this article analyzes the characteristics of existing near-earth remote sensing systems and proposes a spatio-temporal graph attention network (N-STGAT) that considers the state of nodes. The proposed network applies spatiotemporal graph neural networks to the network intrusion detection of near-earth remote sensing systems and validates the effectiveness of the proposed method on the latest flow-based dataset.

Table detection is a preliminary step in extracting reliable information from tables in scanned document images. We present CasTabDetectoRS, a novel end-to-end trainable table detection framework that operates on Cascade Mask R-CNN, including Recursive Feature Pyramid network and Switchable Atrous Convolution in the existing backbone architecture. By utilizing a comparatively lightweight backbone of ResNet-50, this paper demonstrates that superior results are attainable without relying on pre and post-processing methods, heavier backbone networks (ResNet-101, ResNeXt-152), and memory-intensive deformable convolutions. We evaluate the proposed approach on five different publicly available table detection datasets. Our CasTabDetectoRS outperforms the previous state-of-the-art results on four datasets (ICDAR-19, TableBank, UNLV, and Marmot) and accomplishes comparable results on ICDAR-17 POD. Upon comparing with previous state-of-the-art results, we obtain a significant relative error reduction of 56.36%, 20%, 4.5%, and 3.5% on the datasets of ICDAR-19, TableBank, UNLV, and Marmot, respectively. Furthermore, this paper sets a new benchmark by performing exhaustive cross-datasets evaluations to exhibit the generalization capabilities of the proposed method.

With the rapid development of the Internet industry, the problem of information overload has arisen due to the abundance of information available online. Recommendation algorithms, as the core of recommendation systems, have been attracting much attention and are a hot topic of research for many experts and scholars. The classical recommendation algorithms are mainly divided into three major categories: collaborative filtering recommendation algorithms, content-based recommendation algorithms, and hybrid-based recommendation algorithms. Although these algorithms are widely used in various fields, with the proliferation of information, these traditional recommendation algorithms are no longer able to meet the needs of the times. To address this issue, recommendation systems have been developed to provide users with personalized and relevant information or products. Despite the wide use of recommendation algorithms, such as collaborative filtering, content-based filtering, and hybrid approaches, traditional recommendation algorithms have limitations and are no longer suitable for meeting the demands of the times. This paper proposes a new recommendation algorithm, SFRRG, that fuses structure and feature information in graph neural networks to improve the performance of the recommendation system in rating prediction. The effectiveness of the proposed algorithm is demonstrated through experiments on various data sets and compared with existing recommendation algorithms.

Graph visualization has evolved significantly over time, offering various methods to effectively represent complex data structures. This study introduces a novel force-directed algorithm for 3D data visualization, specifically tailored for commonly used datasets in linked data visualization. Leveraging the power of graph theory and methods, the algorithm aims to address the challenge of creating visually appealing and easily interpretable visualizations, which often necessitate advanced user interaction. By utilizing 3D space and the Unity Engine, the research successfully visualizes data and develops interactive visualizations, overcoming limitations of basic force-directed implementations. The main contribution of presented research is in the force-directed algorithm with springs and controlled placement as a visualization technique that combines the use of springs and attractive forces to stabilize a graph in a 3D environment. The combination of these two techniques also helps prevent the formation of a single large cluster within the graph, enhancing the overall visualization quality.

Underwater robotics equipped with visual detection systems have the function of detecting un-derwater artifacts, which is of great significance to deep-sea archaeology. Underwater artifacts are located in complex environments with poor imaging conditions, and the targets have chal-lenging problems such as breakage, stacking, and sediment burial, which causes the marine cul-tural target detection failures. To solve these problems, this paper proposes an underwater cul-tural target detection algorithm based on the deformable deep aggregation network model for underwater robotics exploration. To fully extract the target feature information of underwater targets in complex environments, this paper designs a multi-scale deep aggregation network with deformable convolutional layers. Besides, the BAM attention module is designed for fea-ture optimization, which enhances the potential feature information of the target while weak-ening the background interference information. Finally, the target prediction is achieved through feature fusion at different scales. The proposed algorithm has been extensively validat-ed and analyzed on the collected underwater artifact datasets, and the precision, recall, and mAP of the algorithm have reached 93.1%, 91.4%, and 92.8%, respectively. In addition, the present al-gorithm has been practically deployed on the underwater robotics. In the deep-sea tests, the ar-tifact detection frame rate reaches up to 19 fps, which satisfies the real-time target detection。

Grapes are a globally popular fruit, with grape cultivation worldwide being second only to citrus. This article focuses on the low efficiency and accuracy of traditional manual grading of red grape external appearance and proposes a small-sample red grape external appearance grading model based on transfer learning with convolutional neural networks (CNNs). Initially, the CNN transfer learning method was used to transfer the pre-trained AlexNet, VGG16, GoogleNet, InceptionV3, and ResNet50 network models on the ImageNet image dataset to the red grape image grading task. By comparing the classification performance of the CNN models of these five different network depths with fine-tuning, ResNet50 with a learning rate of 0.001 and a loop number of 10 was determined to be the best feature extractor for red grape images. Moreover, given the small number of red grape image samples in this study, different convolutional layer features output by the ResNet50 feature extractor were analyzed layer by layer to determine the effect of deep features extracted by each convolutional layer on SVM classification performance. This analysis helped to obtain a ResNet50+SVM red grape external appearance grading model based on the optimal ResNet50 feature extraction strategy. Experimental data showed that the classification model constructed using the feature parameters extracted from the 10th node of the ResNet50 network achieved an accuracy rate of 95.08% for red grape grading. These research results provide a reference for the online grading of red grape clusters based on external appearance quality and have certain guiding significance for the quality and efficiency of grape industry circulation and production.

To address the challenge of recognizing ship states accurately amidst the complexities of marine environments, this study proposes a novel ship state recognition approach leveraging a graph convolutional neural network (GCNN). Initially, the method extracts canonical and efficient ship motion trajectories from AIS data. Subsequently, a state recognition network tailored for ship motion trajectories is devised and implemented employing graph convolution. Notably, the accuracy of this model is enhanced through the introduction of novel weights and optimization of the Adj parameter. Experimental evaluations conducted on a ship state dataset demonstrate significant performance improvements. Specifically, the proposed recognition network achieves a recognition accuracy of 98.3% for regulated ship trajectories, marking an impressive 8.4% enhancement over traditional convolutional neural networks. This advancement holds promise for enhancing ship state recognition accuracy across diverse maritime applications including maritime supervision, navigation safety, and ship management.

Mechanical equipment is composed of several parts, the interaction between the parts exists throughout whole life cycle leads to the widespread phenomenon of fault coupling and the diagnosis of independent faults cannot meet the requirements of the health management of mechanical equipment under actual working conditions. In this paper, the topological structure of graph neural network is used to describe the correlation of coupling faults and multiple fault types are regarded as network nodes respectively. The fault features are fused and extracted by graph convolution to achieve the classification of coupling faults. In this paper, dynamic vertexes are defined in data topology and the parameters of DIGNN classification model are optimized by changing the fault type of dynamic vertexes during training stage. The data is loaded into dynamic vertexes for classification and analysis during testing stage. The one-dimensional vibration data is converted into two-dimensional time-frequency domain data by wavelet transform making the input features of the model interpretable to reduce the uncertainty of model training. The data topology is then fed into DIGNN for fault classification, and GCN's node aggregation gives interpretability to each layer of network data processing. The method proposed in this paper can realize accurate diagnosis of independent faults on the data set, and can effectively judge the coupling mode of coupling faults, which is suitable for coupling fault analysis of mechanical equipment.

There is a considerable amount of research in online social networks, most of which focuses on the structural analysis of social graphs. The interpersonal relationships of social networks, especially friend circle, can solve the cold start and sparsity problems, and through the relationship between social networks can effectively recommend users' favorite items (items), such as music , videos, brands/products, preferred tags, location, services, etc. User relationships in social networks are diverse and there are many different perspectives on different social networks. Associations among users can form multi-layered composite networks, and multi-layered social networks present new challenges and opportunities. Different relationships can influence users' preferences to different degrees, which in turn affects their behavior. Therefore, fusing multiple social networks is an effective way to improve recommendation. Although some studies have started to address multiple social network recommendations, simple linear superposition cannot reflect the coupling and nonlinear association between multiple social networks. In this paper, we propose a graph neural network recommendation model under social relationships based on this background. We first propose to compute the 2nd order collaborative signals and their intensities directly from the neighboring matrix for updating the node embedding of the graph convolution layer. Secondly by embedding historical evaluations, various social networks constituting different dimensions, the attention integration of user preferences by different social networks is achieved, and its effectiveness and scalability are demonstrated in theoretical derivation and experimental validation. The theoretical derivation and experimental validation demonstrate its effectiveness and scalability.

We study L_2-approximation problems in the weighted Hilbert spaces in the worst case setting. Three interesting weighted Hilbert spaces appear in this paper, whose weights are equipped with two positive parameters $\ga_j$ and $\az_j$ for $j=1,\,2,\dots,\,d$. We consider the worst case error of algorithms that use finitely many arbitrary continuous linear functionals. We discuss the exponential convergence-(t,s)-weak tractability (EC-(t,s)-WT) of these L_2-approximation problems under the absolute or normalized error criterion. In particular, we obtain the sufficient and necessary conditions for EC-(1,1)-WT and EC-(t,1)-WT with t

The European Green Deal poses a two-pronged challenge for the automotive industry: migrating to solutions based in light structures, requiring light weight concepts and light materials, while at the same time avoiding dependence towards the importation of these advanced materials. Aluminium alloys are lightweight and cost-effective materials that can successfully cover the requirements of many structural applications, however their production requires from bauxite and other Critical Raw Materials (CRM), such as Si and Mg. Aluminium alloys are fully recyclable, but scrap is usually contaminated and its use is related to an increment of impurities, tramp element and undesired inclusions. Traditionally, the use of secondary alloys has been restricted to low performance applications. The present work analyses the effect that the use of scrap has in the quantity of inclusions present in the alloy and in other properties relevant for the material processing. The study was carried out for common alloys belonging to 3 of the most common aluminium processes used in the car manufacturing industry: High Pressure Die Casting (HPDC) (EN AC-43500), extrusion (6063) and sheet metal forming (5754 and 6181). Reference alloy were mixed with different level of scrap (0, 20, 40, 60, 80 and 100%) trying to keep the chemical composition as unaffected as possible. The inclusions level of the alloy was characterized with the Prefil Foot-printer® test. In addition, the obtained materials, after being cast in an open mould, were subjected to metallographic characterization. Relevant properties to assess the formability quality of the alloys for the corresponding transforming process, were obtained: flowability test for HPDC alloy and high temperature compression for extrusion alloys. The results obtained suggest that the number of inclusions present in the melt highly increase with the amount of scrap used to produce the alloy. These inclusions are also related with an important lost of flowability, but do not have a noticeable impact on microstructure.

Extensive growth in the volume of irregular brain cells is known as brain tumor. Human brain is surrounded by stiff skull. There are various issues that occur due to the growth of any tumor inside this restricted space. The malignant and benign are two main categories of the brain tumor. The skull is pressurized to enlarge from inside in case of growth of any benign or malignant tumor. This tumor leads to harm in brain and it may be dangerous to life also. The brain tumor is divided into two kinds - primary or secondary. The brain tumor detection techniques have various phases. In this paper, comparative study of CNN with GLCM approach and superpixel based spectral clustering is done tumor. This work takes into account metrics like accuracy, sensitivity and specificity for drawing the comparison between both the techniques.

Healthcare professionals constantly face situations that reflect ecosystems’ degradation. These can negatively affect their mental health. Research suggests that hope and resilience can play an important role in this scenario, since they are related to/predict mental health in highly heterogeneous samples (considering geography, age, profession, health, etc.). In this context, the aims of the present study are: to characterize and explore the relationship between hope, resilient coping and mental health of Portuguese healthcare professionals. Using Google Forms, 276 healthcare professionals answered to the GHQ-28, the (adult) Trait Hope Scale, and the Brief Resilient Coping Scale (cross-sectional study). The minimum and maximum possible scores were reached, with the exception of the maximum score of GHQ-28-Total. Regarding Hope, 19.6% scored below the midpoint (M=43.46, SD=11.97); 29.3% revealed low resilience (M=14.93, SD=4.05); and the average of 4 of the 5 Mental Health scores (exception: Severe Depression) indicates the probability of a psychiatric case. Hope correlated with Social Dysfunction and GHQ-28-Total; resilient coping proved to be a (weak) predictor of 4 of the 5 GHQ-28 indicators (exception: Severe depression). The results support the need to promote the sample's mental health, hope and resilient coping. They also suggest that stimulating resilient coping may contribute to improving healthcare professionals’ mental health.

Proteomics research has become one of the most important topics in the fields of life science and natural science. At present, research on protein–protein interaction networks (PPINs) mainly focuses on detecting protein complexes or function modules. However, existing approaches are either ineffective or incomplete. In this paper, we investigate function module detection mechanisms in PPIN, including open databases, existing detection algorithms and recent solutions. After that, we describe the proposed solution based on simplified swarm optimization (SSO) algorithm and gene ontology knowledge. The proposed solution implements SSO algorithm for clustering proteins with similar function, and imports biological gene ontology knowledge for further identifying function complexes and improving detection accuracy. Furthermore, we use four different categories of species dataset for experiment: Fruitfly, Mouse, Scere, and Human. The testing and analysis result show that the proposed solution is feasible, efficient and could achieve a higher accuracy of prediction than existing approaches.

(1) Background: Multiple alterations of cellular metabolism have been documented in experimental studies of autosomal dominant polycystic kidney disease (ADPKD) and are thought to contribute to its pathogenesis. (2) Methods: To elucidate the molecular pathways and transcriptional regulators associated with the metabolic changes of renal cysts in ADPKD, we compared global gene expression data from human PKD1 renal cysts, minimally cystic tissues (MCT) from the same patients, and healthy human kidney cortical tissue samples. (3) Results: We found PKD1 renal cysts displayed the Warburg effect with gene pathway changes favoring increased cellular glucose uptake and lactate production, instead of pyruvate oxidation. Additionally, mitochondrial energy metabolism was globally depressed, associated with downregulation of gene pathways related to fatty acid oxidation (FAO), branched-chain amino acid (BCAA) degradation, the Krebs cycle, and oxidative phosphorylation (OXPHOS) in renal cysts. Activation of mTORC1 and its two target proto-oncogenes, HIF-1α and MYC, was predicted to drive the expression of multiple genes involved in the observed metabolic reprogramming (e.g., GLUT3, HK1/HK2, ALDOA, ENO2, PKM, LDHA/LDHB, MCT4, PDHA1, PDK1/3, MPC1/2, CPT2, BCAT1, NAMPT); indeed, their predicted expression patterns were confirmed by our data. Conversely, we found AMPK inhibition was predicted in renal cysts. AMPK inhibition was associated with decreased expression of PGC-1α, a transcriptional coactivator for transcription factors PPARα, ERRα, and ERRγ, all of which play a critical role in regulating oxidative metabolism and mitochondrial biogenesis. (4) Conclusions: These data provide a comprehensive map of metabolic pathway reprogramming in ADPKD and highlight nodes of regulation that may serve as targets for therapeutic intervention.

We revise the definition of graph operations in [WDK2018] and adapt correspondingly the construction of graph term algebras. As a first contribution to a prospective research field Universal Graph Algebra, we generalize some basic concepts and results from algebras to graph algebras. To tackle this generalization task, we revise and reformulate traditional set-theoretic definitions, constructions and proofs in Universal Algebra by means of more category-theoretic concepts and constructions. Especially, we generalize the concept generated subalgebra and prove that all monomorphic homomorphisms between graph algebras are regular. Derived graph operations are the other main topic. After an in depth analysis of terms as representations of derived operations in traditional algebras, we identify three basic mechanisms to construct new graph operations out of given ones: parallel composition, instantiation, and sequential composition. As a counterpart of terms, we introduce graph operation expressions with a structure as close as possible to the structure of terms. We show that the three mechanisms allow us to construct for any graph operation expression a corresponding derived graph operation in any graph algebra.

This study explores fault-tolerant consensus in leader-following heterogeneous multi-agent systems, focusing on actuator failures in uncrewed aerial vehicles (UAVs) and uncrewed ground vehicles (UGVs). An optimization-based fault-tolerant consensus algorithm is proposed. The algorithm utilizes the Euler-Lagrange formula to ensure system consistency under actuator failures, with the Lyapunov stability theory proving the asymptotic stability of the consistency error. The algorithm is applied to heterogeneous multi-agent systems of UAVs and UGVs to derive optimal fault-tolerant consensus control laws for each vehicle type. Simulation experiments give evidence for the feasibility of the proposed control strategy.

The interest in the Spark Plasma Sintering (SPS) technique has continuously increased over the last few years. This article shows the possibility of the development of a SPS device used for material processing and synthesis both in both scientific and industrial applications. This work presents an example of processing Arc-Meleted (half-Heusler, cobalt triantimonide) and SHS-synthesized semiconductors (bismuth telluride) materials with SPS device. The system functionalities expansion is presented, showing the possible way of increasing the information amount obtained about SPS processes and using the SPS apparatus for conducting synthesis of materials and increasing reproducibility and accuracy of process parameters control.

With the improvement of software copyright protection awareness, code obfuscation technology plays a crucial role in protecting key code segments. As the obfuscation technology becomes more and more complex and diverse, it has spawned a large number of malware variants, which make it easy to evade the detection of anti-virus software. Malicious code detection mainly depends on binary code similarity analysis. However, the existing software analysis technologies are difficult to deal with the growing complex obfuscation technologies. To solve this problem, this paper proposes a new obfuscation-resilient program analysis method, which is based on the data flow transformation relationship of the intermediate representation and the graph network model. In our approach, we first construct the data transformation graph based on LLVM IR. Then, we design a novel intermediate language representation model based on graph networks, named DFSGraph, to learn the data flow semantics from DTG. DFSGraph can detect the similarity of obfuscated code by extracting the semantic information of program data flow without deobfuscation. Extensive experiments prove that our approach is more accurate than existing deobfuscation tools when searching for similar functions from obfuscated code.

Laser-targeted weeding methods further enhance the sustainable development of green agriculture, with one key technology being the improvement of weed localization accuracy. Here, we propose an improved YOLOv8 instance segmentation based on bidirectional feature fusion and deformable convolution (BFFDC-YOLOv8-seg) to address the challenges of insufficient weed localization accuracy in complex environments with resource-limited laser weeding devices. Initially, by training on extensive datasets of plant images, the most appropriate model scale and training weights are determined, facilitating the development of a lightweight network. Subsequently, the introduction of the Bidirectional Feature Pyramid Network (BiFPN) during feature fusion effectively prevents the omission of weeds. Lastly, the use of Dynamic Snake Convolution (DSConv) to replace some convolutional kernels enhances flexibility, benefiting the segmentation of weeds with elongated stems and irregular edges. Experimental results indicate that the BFFDC-YOLOv8-seg model achieves a 4.9% increase in precision, an 8.1% increase in recall rate, and a 2.8% increase in mAP50 value to 98.8% on a vegetable weed dataset compared to the original model. It also shows improved mAP50 over other typical segmentation models such as Mask R-CNN, YOLOv5-seg, and YOLOv7-seg by 10.8%, 13.4%, and 1.8%, respectively. Furthermore, the model achieves a detection speed of 24.8 FPS on the Jetson Orin nano standalone device, with a model size of 6.8MB that balances between size and accuracy. The model meets the requirements for real-time precise weed segmentation, suitable for complex vegetable field environments and resource-limited laser weeding devices.

With the rapid development of technology and the advancement of Internet technology, various social networking platforms are gradually coming into people's view and occupying a higher and higher position. In the recommendation scenario, the user-item interaction naturally forms a bipartite heterogeneous graph structure and with the development of graph embedding and graph neural network technologies based on deep learning to process graph domain information, the combination of graph information and recommendation systems shows strong research potential and application prospects. The methodological improvement of the recommendation algorithm based on collaborative filtering takes advantage of the nature that user-items can form a bipartite graph in the recommendation scenario. The existing methods still have some shortcomings. The methods that only use weights or convolutional recurrent neural networks to implicitly model different historical behaviors lack explicit modeling of video switching relationships in serialized behaviors. The user's interest is changing all the time, so it is not possible to recommend based on the user's history, and it is necessary to consider both the long-term and short-term interest of the user according to the video content in order to achieve accurate recommendation of short videos. In this paper, we design a recommendation model based on graph neural network, which models users' long-term and short-term interests by two vector propagation methods, respectively.

The key issue in the post-genomic era is how to systematically describe the association between small molecule transcripts or translations inside cells. With the rapid development of high-throughput “omics” technologies, the achieved ability to detect and characterize molecules with other molecule targets opens up the possibility of investigating the relationships between different molecules from a global perspective. In this article, a Molecular Associations Network(MAN) is constructed and comprehensively analyzed by integrating the associations among miRNA, lncRNA, protein, drug, and disease, in which any kind of potential associations can be predicted. More specifically, each node in MAN can be represented as a vector by combining two kinds of information including the attributes of the node itself (e.g. sequences of ncRNAs and proteins, semantics of diseases and molecular fingerprints of drugs) and the manner of the node in the complex network (associations with other nodes). Random Forest classifier is trained to classify and predict new interactions or associations between biomolecules. In the experiment, the proposed method achieves a superb performance with 0.9735 AUC in 5-fold cross-validation, which show that the proposed method can provide new insight for exploration of the molecular mechanisms of disease and valuable clues for disease treatment.

The accurate identification of the primary tumor origin in metastatic cancer cases is crucial for guiding treatment decisions and improving patient outcomes. Copy Number Alterations (CNA) have emerged as valuable genomic markers for predicting the origin of metastases. This research article presents a comprehensive analysis of CNA-based prediction models in metastatic cancer. The study utilizes a dataset comprising CNA profiles from twenty different cancer types and employs advanced AI-based techniques for prediction. The research workflow consists of two models. The first is convolution network-based, while the other is a multi-stage model. In the first stage, a RELU model is developed to differentiate between 16 cancer types, considering their CNA, chromosome location, strand, and overall location. The second stage involves building specialized models to detect differences between cancer types within the same location or organs, such as brain lower-grade glioma and glioblastoma multiforme. Both generalized models achieve an overall accuracy of over 90%, while the specialized models achieve an accuracy of approximately 95% with minimal loss values. The results demonstrate the potential of AI-based approaches utilizing CNA data for improved diagnosis and personalized treatment strategies in metastatic cancer. This research establishes a solid foundation for future advancements in the field, paving the way for more effective and targeted approaches in metastatic cancer management.

Constructing new graph from the graph's parameters and related notions in the way that, the study on the new graph and old graph in their parameters could be facilitated. As graph, new graph has some characteristics and results which are related to the structure of this graph. For this purpose, regular graph is considered so the internal relation and external relation on this new graph are studied. The kind of having same number of edges when this number is originated by common number of graphs like maximum degree, minimum degree, domination number, coloring number and clique number, is founded in the word of having regular graph

With the rapid growth of large language models (LLMs), there is increasing demand for memory and computation in LLMs. Recent efforts on post-training pruning of LLMs aim to reduce the model size and computation requirements, yet the performance is still sub-optimal. In this paper, we present a plug-and-play solution for post-training pruning of LLMs. The proposed solution has two innovative components: 1) Relative Importance and Activations (RIA), a new pruning metric that jointly considers the weight and activations efficiently on LLMs; and 2) Channel Permutation, a new approach to maximally preserve important weights under N:M sparsity. The two proposed components can be readily combined to further enhance the N:M semi-structured pruning of LLMs. Our empirical experiments show that RIA alone can already surpass all existing post-training pruning methods on prevalent LLMs, e.g., LLaMA ranging from 7B to 65B. Furthermore, N:M semi-structured pruning with channel permutation can even outperform the original LLaMA2-70B on zero-shot tasks, together with practical speed-up on specific hardware. Our code is available at: https://github.com/biomedical-cybernetics/Relative-importance-and-activation-pruning

Background: Patients undergoing brain tumor resection experience changes to their neurocognitive abilities, many of which can be difficult to predict. We hypothesized that changes in brain connectivity could predict changes in neurocognitive functioning, demonstrating the potential for brain connectivity aware surgical planning to provide enhanced outcomes for patients. Methods: Patients underwent functional and diffusion MR scanning and neuropsychological testing before tumor resection and two weeks post-resection. Using this functional and diffusion imaging, we measured changes in the topology of the functional and structural graph networks, respectively. From the neuropsychological testing scores, we derived a composite score that describes a patient’s overall level of neurocognitive functioning. We then used a multiple linear regression model to test if structural and functional connectivity measures could predict changes in composite scores. Results: Twenty-one subjects completed imaging and neuropsychological evaluation both before and after surgery. The multiple linear regression model showed that changes in functional local efficiency were inversely correlated with changes in composite score (p

This research addresses the formidable challenge of achieving precise trajectory tracking for autonomous vehicle formations in uncertain environments. It introduces an adaptive control system tailored for autonomous vehicles, with a primary focus on ensuring prescribed performance in trajectory tracking within a leader-follower formation paradigm. The system incorporates a guidance law that allows the leader vehicle to dynamically adjust desired yaw angles and speeds for follower vehicles based on the established reference trajectory, enhancing tracking accuracy and responsiveness to environmental changes. To address practical external disturbances, the study utilizes Radial Basis Function Neural Networks (RBFNN) in conjunction with second-order filters for error approximation. This approach is further strengthened by a carefully formulated adaptive law. The innovative integration of a barrier Lyapunov function with the backstepping method significantly enhances the system’s adaptability and robustness, ensuring trajectory tracking performance meets predetermined standards. Simulation results illustrate the control system’s adept handling of various external disturbances, consistently maintaining trajectory tracking errors within predefined limits. This underscores the system’s potential to markedly enhance the operational reliability and efficiency of autonomous vehicle formations in unpredictable environmental conditions.

Network Function Virtualization (NFV) allows for the dynamic provisioning of Virtualized Network Functions, adapting services to the complex and real-time network environment for enhanced network performance. Despite the benefits of NFV, virtual network functions (VNFs) migration and the energy consumption pose significant challenges due to the dynamic nature of the physical network, especially in the edge-cloud continuum network. Currently, people tackle this challenge by predicting the network traffic and then proactively migrating the VNFs using the predicted values. There are two challenges here. First, when SFCs belong to different network service providers, the historical network traffic data is held by the service providers, and they are reluctant to share the historical data due to privacy concerns. Without the historical network traffic data of each SFC, the resource provider that owns the underlying network cannot effectively predict the network traffic; in addition, without the feedback of the migration results of the underlying physical network, the network traffic prediction will be difficult to match the needs of the physical network. In this manuscript, we solve the problem of network traffic prediction in the NFV-based edge-cloud continuum network for multiple network service providers. We aim to improve migration performance and reduce energy consumption while ensuring resource and latency requirements. To protect the privacy of each network service provider, we apply an FL algorithm. After that, to improve the migration performance, we tailor the loss function. In the loss function, factors such as the number of migrations, the number of migration failures, and the energy consumption of the NFV-based edge-cloud continuum network are added. Additionally, to obtain the results of the SFC migration, we develop a mathematical model for the problem of multiple network service providers in the NFV-based network. The effectiveness of our algorithm is evaluated through extensive simulations, and the results show a significant reduction in the number of migrated nodes and energy consumption while improving the SFC acceptance ratio compared to state-of-the-art schemes which only use the difference between predicted and actual flows to define the loss function.

Background and Objectives: Knee osteoarthritis (KOA) is a degenerative disease that is targeting continuously people of different ages, but especially the elderly population, the number of which tends to increase continuously at the global level. Apart from age, excess weight can influence the evolution of the disease, with obesity being associated with a weak inflammation stage, and an imbalance between pro-inflammatory and anti-inflammatory cytokines. The present work aimed to identify specific biomarkers alike ACRP-30, IL-10, TNF-α, and IL-6 in synovial fluid and correlate them with patients’ clinical data. Materials and Methods: 24 subjects with KOA and over 50 years of age are involved in the present study. All patients performed a supine X-ray at the target knee. Ultrasound was performed using an ESAOTE MyLab Omega (ESAOTE Spa, Italy) ultrasound device and a 6-19 MHz linear array transducer. Results: The obtained results highlighted a significant correlation between age and adiponectin level (p=0.0451, r=-0.412). Also, the IL-10 values are lower in cases where the intensity of the pain is more pronounced (p=0.0405, r=-0.421). In addition, analyzing the data by gender, it was observed that in the case of males, stiffness is more related to age (p=0.0079, r=0.7993), compared to women (p=0.0203, r=0.6223). In the case of women, the progression of the disease tends to increase more intensively total WOMAC score’s values (p=0.00031, r=0.8342), compared with men (p=0.0289, r=7013). Regarding interleukins and BMI, significant correlations were observed only in the case of men. Conclusions: A significant correlation between age and adiponectin, and adiponectin and IL-6, suggests that advanced age may contribute to adiponectin reduction. Comparing men with women, it was observed that men's age is more related to rigidity, and IL-6 and IL-10 are directly correlated to BMI and women seem to be more sensitive to pain and stiffness.

This paper introduces an innovative approach to lipreading, leveraging a web application designed to generate subtitles for videos where the speaker's mouth is visible and a comprehensive literature review that precedes the discussion, encompassing a thorough examination of various lipreading methods employed over the past decade. Our method employs a powerful deep learning model, featuring a 3D-convolution network and bidirectional LSTM, enabling accurate sentence-level predictions based solely on visual lip movements. With an impressive accuracy of 97%, our model is trained using pre-segmented lips regions, transformed into animated GIFs for effective pre-training. This work stands as a significant contribution to the evolving landscape of lipreading research, offering a practical and accurate solution for real-world applications.

Graph Neural Networks (GNNs) are powerful models capable of managing intricate connections in non-Euclidean data, such as social networks, physical systems, chemical structures, and communication networks. Despite their effectiveness, the large-scale and complex nature of graph data demands substantial computational resources and high performance during both training and inference stages, presenting significant challenges, particularly in the context of embedded systems. Recent studies on GNNs have investigated both software and hardware solutions to enhance computational efficiency. Earlier studies on Deep Neural Networks (DNNs) have indicated that methods like reconfigurable hardware and quantization are beneficial in addressing these issues. Unlike DNN research, studies on efficient computational methods for GNNs are less developed and require more exploration. This survey reviews the latest developments in quantization and FPGA-based acceleration for GNNs, showcasing the capabilities of reconfigurable systems (often FPGAs) to offer customized solutions in environments marked by significant sparsity and the necessity for dynamic load management. It also emphasizes the role of quantization in reducing both computational and memory demands through the use of fixed-point arithmetic and streamlined vector formats. This paper concentrates on low-power, resource-limited devices over general hardware accelerators and reviews research applicable to embedded systems. Additionally, it provides a detailed discussion of potential research gaps, foundational knowledge, obstacles, and prospective future directions.

Considering that emotional events diversify as one ages, this study formulates the Salient Episodic Memory Aggregation Hypothesis, which claims that aging induces homogenization of episodic memory and consequently increases the salience of emotional episodes. To test this hypothesis, the study focused on sadness episodic memory and conducted a web-based survey and a combined analysis consisting of natural language processing, machine learning, and network graph analysis. A sample of 2,954 adults aged between their 20s and over 70s participated in this study. They were asked to describe a sad event they had experienced and assess the psychological properties of the recalled episodes. After isolating and lemmatizing episodic words using natural language processing, vocabulary frequency was counted for each generation, and network graph analysis based on machine learning was performed to compare the structures of sadness episodes between generations. As a result, there were mainly two types of episodic words for which frequencies either declined or increased with age. The network structures of episodic words for the older generations possessed higher proximity (shortest path length) to higher concentrations of episodic words. These findings support the current hypothesis, indicating that the nature of sadness episodes differ between generations, and that older people have more aggregated episodic memory structures.

Ligand-based virtual screening (LBVS) is a promising approach for rapid and low-cost screening of potentially bioactive molecules in the early stage of drug discovery. Compared with traditional similarity-based machine learning methods, deep learning frameworks for LBVS can more effectively extract high-order molecule structure representations from molecular fingerprints or structures. However, the 3D conformation of a molecule largely influences its bioactivity and physical properties, and has rarely been considered in previous deep learning-based LBVS methods. Moreover, the relative bioactivity benchmark dataset is still lacking. To address these issues, we introduce a novel end-to-end deep learning architecture trained from molecular conformers for LBVS. We first extracted molecule conformers from multiple public molecular bioactivity data and consolidated them into a large-scale bioactivity benchmark dataset, which totally includes millions of endpoints and molecules corresponding to 954 targets. Then, we devised a deep learning-based LBVS called EquiVS to learn molecule representations from conformers for bioactivity prediction. Specifically, graph convolutional network (GCN) and equivariant graph neural network (EGNN) are sequentially stacked to learn high-order molecule-level and conformer-level representations, followed by attention-based deep multiple-instance learning (MIL) to aggregate these representations and then predict the potential bioactivity for the query molecule on a given target. We conducted various experiments to validate the data quality of our benchmark dataset, and confirmed EquiVS achieved better performance compared with 10 traditional machine learning or deep learning-based LBVS methods. Further ablation studies demonstrate the significant contribution of molecular conformation for bioactivity prediction, as well as the reasonability and non-redundancy of deep learning architecture in EquiVS. Finally, a model interpretation case study on CDK2 shows the potential of EquiVS in optimal conformer discovery. The overall study shows that our proposed benchmark dataset and EquiVS method have promising prospects in virtual screening applications.

Graph theory plays significant role in every field of science as well as technology. Every situation can be articulated in terms of suitable graphs by using various approaches of graph theory. Considering the recent pandemic in the world and the precautions taken for prevention of the COVID 19, it is the most appropriate way to exercise the graph models with theoretical as well as practical aspects to control this epidemic. This paper defines the variable set, variable graphs and their types with respect to variable vertex sets and variable edge sets. Depending upon the nature of the pandemic, there are four types of Virus graphs. Virus graph I and III are not so perilous for all living beings. Although, Virus graphs II and IV are extremely hazardous for the harmony of the world. In view of different aspects for expand of pandemic, growth types of virus graphs are divided in 1-1, 1-P and 1-all growth types. The COVID19 initially was in Virus graph-I type, but presently it is in Virus graph-II types. We present the table involving the number of infected people after n days with respect to different values of P and growth rates with I0 = 100. Moreover, the country wise starting dates of stages of the virus graph-I and II are specified. The concept of cut sets is applicable for prevention of COVID19 and the whole world is using the same analogy.

Complexity science studies physical phenomena that cannot be explained by the mere analysis of the single units of a system but requires to account for their interactions. A feature of complexity in connected systems is the emergence of mesoscale patterns in a geometric space, such as groupings in bird flocks. These patterns are formed by groups of points that tend to separate from each other, creating mesoscale structures. When multidimensional data or complex networks are embedded in a geometric space, some mesoscale patterns can appear respectively as clusters or communities, and their geometric separability is a feature according to which the performance of an algorithm for network embedding can be evaluated. Here, we introduce a framework for the definition and measure of the geometric separability (linear and nonlinear) of mesoscale patterns by solving the travelling salesman problem (TSP), and we offer experimental evidence on embedding and visualization of multidimensional data or complex networks, which are generated artificially or are derived from real complex systems. For the first time in literature the TSP’s solution is used to define a criterion of nonlinear separability of points in a geometric space, hence redefining the separability problem in terms of the travelling salesman problem is an innovation which impacts both computer science and complexity theory.

Link prediction is to complete the missing links in the network or to predict the generation of new links according to the current network structure information, which is very important for mining and analyzing the evolution of the network such for construction and analysis of logical architecture in 6G network. Link prediction algorithms based on node similarity need predefined similarity functions, which is highly hypothetical and only applies to specific network structures without generality. To solve this problem, this paper proposes a link prediction algorithm based on the subgraph of the target node pair. In order to automatically learn the graph structure characteristics, the algorithm firstly extracts the h-hop subgraph of the target node pair, and then predicts whether the target node pair will be linked according to the subgraph. Experiments on seven real data sets show that the link prediction algorithm based on target node pair subgraph is suitable for various network structures and superior to other link prediction algorithms.

Vision-based tactile sensors (VBTS) have become the de facto method of giving robots the ability to obtain tactile feedback from their environment. Unlike other solutions to tactile sensing, VBTS offers high spatial resolution feedback without compromising on instrumentation costs or incurring additional maintenance expenses. However, conventional cameras used in VBTS have a fixed update rate and output redundant data, leading to computational overhead downstream. In this work, we present a neuromorphic vision-based tactile sensor (N-VBTS) that employs observations from an event-based camera for contact angle prediction. Particularly, we design and develop a novel graph neural network, dubbed TactiGraph, that asynchronously operates on graphs constructed from raw N-VBTS streams exploiting their spatiotemporal correlations to perform predictions. Although conventional VBTS uses an internal illumination source, TactiGraph is reported to perform efficiently in both scenarios, with and without an internal illumination source. Rigorous experimental results revealed that TactiGraph achieved a mean absolute error of 0.62∘ in predicting the contact angle and was faster and more efficient than both conventional VBTS and other N-VBTS, with lower instrumentation costs. Specifically, N-VBTS requires only 5.5% of the compute-time needed by VBTS when both are tested on the same scenario.

Polycentric governance, as conceptualized by the Nobel Laureate Elinor Ostrom, has been widely celebrated as a promising approach to fostering inclusive innovation ecosystems in the Global South. By emphasizing the coordination of multiple decision-making centers and the engagement of diverse stakeholders, polycentric systems are believed to enhance the inclusivity and responsiveness of innovation processes, crucial for addressing societal challenges and promoting equitable development. However, this article argues that the theoretical and practical application of polycentric governance may not adequately address the inherent power structures and complexities within inclusive innovation ecosystems. Drawing on critical analysis, empirical evidence, and complementary theoretical perspectives, this paper interrogates the limitations of polycentric governance and proposes a more nuanced, multidimensional framework for inclusive innovation governance in the context of the Global South.

Artificial intelligence (AI) is a current trend in computer science, which extends itself its amazing capacities to other technologies such as mechatronics and robotics. Going beyond technological applications, the philosophy behind AI is that there is a vague and potential convergence of artificial manufacture and natural world although the limiting approach may be still very far away, but why? The implicit problem is that Darwin theory of evolution focuses on natural world where breeding conservation is the cornerstone of the existence of creature world but there is no similar concept of breeding conservation in artificial world whose things are created by human. However, after developing for a long time until now, AI issues an interesting concept of generation in which artifacts created by computer science can derive their new generations inheriting their aspects / characteristics. Such generated artifacts make us look back on offsprings by the process of breeding conservation in natural world. Therefore, it is possible to think that AI generation, which is a recent subject of AI, is a significant development in computer science as well as high-tech domain. AI generation does not help us to reach near biological evolution even in the case that AI can combine with biological technology but, AI generation can help us to extend our viewpoint about Darwin theory of evolution as well as there may exist some uncertain relationship between man-made world and natural world. Anyhow AI generation is a current important subject in AI and there are two main generative models in computer science: 1) generative model that applies large language model into generating natural language texts understandable by human and 2) generative model that applies deep neural network into generating digital content such as sound, image, and video. This technical report focuses on deep generative model (DGM) for digital content generation, which is a short summary of approaches to implement DGMs. Researchers can read this work as an introduction to DGM with easily understandable explanations.

Following the adoption of the Kunming-Montreal Global Biodiversity Framework (KM-GBF), with the Convention on Biological Diversity serving as its guiding treaty, the European Union (EU) has just reached an agreement on an EU Nature Restoration Regulation. This study carries out a systematic cross-walk between the restoration regulation and the KM-GBF, focusing on their implications for forest ecosystems. This paper identifies areas of alignment, divergence, and potential gaps related to habitat restoration, species protection, climate resilience, and the sustainable use of natural resources. The methodology adopts a grounded approach, starting with the 23 targets outlined in the KM-GBF and proceeding to the 28 articles set out in the restoration regulation. The results highlight the need for better alignment between the KM-GBF, the restoration regulation, and other forest-relevant EU policy instruments. The study stresses the need for a coherent and integrated EU policy approach that can address the diverse challenges and policy objectives facing forests. It concludes that amendments to the restoration regulation have significantly diluted its potential impact, limiting the EU Members States accountability and ability to meet KM-GBF goals and targets. It further stresses the need for strategies that can reconcile divergent EU policy pathways, support forest management and restoration efforts, while aligning with global biodiversity objectives.

Despite global efforts to improve vaccination coverage, the number of zero dose and under immunized children has increased in the African continent, particularly in Nigeria where more than 2.3 million unvaccinated children currently reside, making it the country with highest number of unvaccinated children on the African continent. It is thus imperative to identity barriers and facilitators of immunization in Nigeria with a view to formulate and design targeted interventions that can effectively bridge the immunization gap in Nigeria. In this review, we systematically mapped and summarized existing literature and data on key barriers to vaccine uptake, and facilitators influencing immunization practices in Nigeria. The electronic databases were systematically searched and articles that reported determinants of routine immunization uptake in Nigeria from inception of the databases up till October 2023 were included. The eligible articles were evaluated using a set of pre-defined criteria and the extracted data were analysed and visualized. This scoping review identified barriers spanning logistical, socio-economic, cultural, and healthcare system-related aspects, highlighting the need for a multi-pronged approach to address these challenges. While considerable progress has been made over the years, persistent barriers like distance between area of residence of caregivers and immunization centers, vaccine shortages, poor interpersonal relationship between healthcare workers and caregivers and cultural/religious influences persist. Lastly, collaborative efforts among stakeholders and communities remain paramount in ensuring improved routine immunization coverage across the Nigeria’s diverse socio-cultural landscape.

With recent advancements in network technology and spread of Internet, use of social network services and Internet of Things devices has flourished, leading to a continuous generation of large volumes of graph stream data, where changes, such as additions or deletions of vertices and edges occur over time. Additionally, owing to the need for efficient use of storage space and security requirements, graph stream data compression has become essential in various applications. Even though various studies on graph compression methods have been conducted, most of them do not fully reflect the dynamic characteristics of graph streams and complexity of large graphs. In this paper, we propose a compression scheme using provenance data to efficiently process and analyze large graph stream data. It obtains provenance data by analyzing graph stream data and builds a pattern dictionary based on this to perform dictionary-based compression. By improving the existing dictionary-based graph compression methods, it enables more efficient dictionary management through tracking pattern changes and evaluating their importance using provenance. Furthermore, it considers the relationships among sub-patterns using an FP-tree and performs pattern dictionary management that updates pattern scores based on time. Our experiments show that the proposed scheme outperforms existing graph compression methods in key performance metrics, such as compression rate and processing time.

In this paper we use the Mellin convolution theorem, which is related to Perron's formula. Also we introduce new explicit formulae for arithmetic function which generalize the explicit formulae of Weil for other arithmetic functions different from the Von-Mangoldt function.

Multimodal knowledge graph completion necessitates the integration of information from multiple modalities (such as images and text) into the structural representation of entities to improve link prediction. However, most existing studies have overlooked the interaction between different modalities. To address this issue, this paper proposed a Transformer-based knowledge graph link prediction model (MM-Transformer) that fuses multimodal features. Different modal encoders are employed to extract structural, visual and textual features, and hybrid key-value calculations are performed on features from different modalities based on the Transformer architecture. The similarities of textual tags to structural tags and visual tags are calculated and aggregated respectively, and multimodal entity representations are modeled and optimized to reduce the heterogeneity of the representations. Experimental results demonstrate that, compared to the current multimodal state-of-the-art methods, the proposed method achieves significant performance improvements in knowledge graph link prediction tasks. This proves that the proposed method effectively addresses the problem of multimodal feature fusion in knowledge graph link prediction tasks.

In GNSS/IMU integrated navigation systems, factors such as satellite occlusion and non-line-of-sight conditions can lead to degradation of satellite positioning results, Subsequently affecting the overall accuracy of the integrated navigation system. To address this issue and ef-fectively utilize historical pseudorange information from satellites, this paper proposes a graph optimization-based GNSS/IMU model with virtual constraints. These virtual constraints are con-structed using satellite ‘s position from previous time step, the rate of change of pseudoranges, and ephemeris data. This virtual constraint can serve as an alternative solution for individual satellites in case of signal anomalies, ensuring the integrity and continuity of the graph optimi-zation model. Additionally, this paper conducts an analysis of the graph optimization model constructed using these virtual constraints, comparing it with traditional integrated navigation graph optimization model, and analyzes and reconstructs the marginalization process based on these virtual constraints. The experimental results, compared with tightly coupled Kalman fil-tering and the original graph optimization method on a set of real-world data, demonstrate that the introduction of virtual pseudoranges maintains high positioning accuracy. The RMSE error between it and the original graph optimization remains within 5%, affirming the high feasibility of this approach.

In the famous medieval magical manual called Picatrix, the unknown author describes the phenomenon of magic with the term nigromantia. As is well known, the original meaning of the Greek term necromantia has a more concise meaning. It is used for a special kind of divination, i.e., divination through the parts of a cadaver and the conjured spirit of the dead. Seemingly in the Picatrix, no necromantic ritual can be found; moreover, the author stresses that his main goal is pious, i.e., to find the path leading to the ultimate source of the universe, the one and only God. In my paper, I show that on some pages of the Picatrix, there are traces of divinatory practices that may be connected to the original meaning of the term nigromantia. In the third book of the manual, descriptions of some interesting rituals attributed to the pagan Sabeans of Harran and their teacher, the god Hermes can be found. During the practices, the magician involved conjured spirits of the heavenly bodies and powers as well. Because of this, by looking closely at and analyzing the given text, it is possible to piece together a complex web of necromantic and demonic divinatory rituals.

Let be a power function $f_{r,M}(s)$ defined for every $s$ within the finite set $M$ as follows $$f_{r,M}(s)= \begin{cases} s^r, \ &s\in M,\\ 0, \ &\mathrm{otherwise}. \end{cases} $$ Let a discrete convolution of $f_{r,M}(s)$ be denoted as follows $\mathrm{Conv}_{r,M}[n]=(f_{r,M}*f_{r,M})[n]$. Let a real coefficients $A_{m,j}$ be given by the following recurrence $$ A_{m,j} = \begin{cases} 0, & \mathrm{if } \ j<0 \ \mathrm{or } \ j>m, \\ (2j+1)\binom{2j}{j} \sum_{d=2j+1}^{m} A_{m,d} \binom{d}{2j+1} \frac{(-1)^{d-1}}{d-j} B_{2d-2j}, & \mathrm{if } \ 0 \leq j < m, \\ (2j+1)\binom{2j}{j}, & \mathrm{if } \ j=m. \end{cases} $$ In this paper we show that for every $n>0$ the following odd-power identities involving coefficients $A_{m,j}$ and convolution transform $\mathrm{Conv}_{r,M}[n]$ hold $$ \begin{split} n^{2m+1}+1&=\sum_{r=0}^{m}A_{m,r}\mathrm{Conv}_{r,\mathbb{N}}[n],\\ n^{2m+1}-1&=\sum_{r=0}^{m}A_{m,r}\mathrm{Conv}_{r,\mathbb{Z}_{>0}}[n],\\ n^{2m+1}&=\sum_{r=0}^{m}A_{m,r}\sum_{k=1}^{n} k^r(n-k)^r\\ &=\sum_{r=0}^{m}A_{m,r}\sum_{k=0}^{n-1} k^r(n-k)^r. \end{split} $$

River bed materials serve multiple environmental functions as a habitat for aquatic invertebrates and fishes. At the same time, the particle size of the bed material reflects the tractive force of the flow regime in a flood and provides useful information for flood control. The traditional river bed particle size surveys, such as sieving, require time and labor to investigate river bed materials. The authors proposed a method to classify aerial images taken by unmanned aerial vehicle (UAV) using convolutional neural networks (CNN), our previous study showed that terrestrial riverbed material could be classified with high accuracy. In this study, we attempted to classify riverbed materials distributed in shallow waters where the bottom can be seen from UAVs. After training the CNN to classify the images with the same grain size as being in the same class even if the surface flow types taken overlapping the riverbed material were different, the total accuracy reached 90.3%. Moreover, the proposed method was applied to the wide-ranging area to determine the distribution of the particle size. In parallel, the microtopography was surveyed using Lidar-UAV, and the relationship between the microtopography and particle size distribution was discussed. In the steep section, coarse particles were distributed and formed a rapid. Fine particles were deposited on the upstream side of those rapids, where the slope had become gentler due to the damming. There was good agreement between the microtopographical trends and the grain size distribution.

This project designed a set of network security mechanisms for cloud applications in VANETs. At present, cloud computing is one of the government’s development priorities in the industry. We divide cloud into public, private, and hybrid clouds in this project. Vehicles or passengers can access road conditions or public transport information through the public cloud; public transportation can access current driving records and users can access relevant enterprise information on the private cloud and hybrid cloud is a combination of public and private clouds. Both cloud computing or VANETs require network and information security. At present, many researches on VANETs security only focus on message communication, and neglect information storage. Researches on cloud computing security only focus on information protection, and neglect user privacy and anonymity. This project designed a set of network and information security mechanisms in line with the requirements of Confidentiality, Authentication, Non-repudiation, Conditional Anonymity, and Conditional Untraceability. This project primarily needs to achieve the following: 1.an authentication mechanism to verify the identity of each other between the passenger and the vehicle and to verify the identity with Single Sign-On; 2. vehicle or user privacy and anonymity, which need to be able to replace the anonymous ID and related parameters for the vehicle or the user; 3. a private communication mechanism, which enables any vehicle or user to communicate privately; and 4. an information security encryption method, which can encrypt the information on a cloud server to avoid unauthorized access by internal personnel or hackers.

Abnormal connections in brain networks of healthy people always bring the problems of cognitive impairments and degeneration of specific brain circuits, which may finally result in Alzheimer’s disease (AD). Exploring the development of the brain from normal controls (NC) to AD is an essential part of human research. Although connections changes have been found in the development, the connection mechanism that drives these changes remain incompletely understood. The purpose of this study is to explore the connection changes in brain networks in the process from NC to AD, and uncover the underlying connection mechanism that shapes the topologies of AD brain networks. In particular, we propose a model named MINM from the perspective of topology-based mutual information to achieve our aim. MINM concerns the question of estimating the connection probability between two cortical regions with the consideration of both the mutual information of their observed network topologies and their Euclidean distance in anatomical space. In addition, MINM considers establishing and deleting connections, simultaneously, during the networks modeling from the stage of NC to AD. Experiment results show that MINM is sufficient to capture an impressive range of topological properties of real brain networks such as characteristic path length, network efficiency, and transitivity, and it also provides an excellent fit to the real brain networks in degree distribution compared to experiential models. Thus, we anticipate that MINM may explain the connection mechanism for the formation of the brain network organization in AD patients.

Among the various generalizations of persistent topology, the one based on rank functions and leading to indexing-aware functions appears to be particularly suited to catch graph-theoretical properties without the need for a simplicial construction and a homology computation. This paper defines and studies "simple" and "single-vertex" features in directed and undirected graphs, by which several indexing-aware persistence functions are produced, within the scheme of steady and ranging sets. The implementation of the "sink" feature and its application to trust networks provide an example of the ease of use and meaningfulness of the method.

Hepatitis C virus (HCV) is a major public health threat associated with serious clinical consequences worldwide. The WHO reports an estimated 58 million people globally living with chronic hepatitis C virus (HCV) infection, with 1.5 million new cases and over 350,000 deaths annually due to HCV-related diseases. Despite the existence of multiple diagnostic methods, the accessibility of diagnosis and treatment is often hindered across the continent by limited resources, insufficient healthcare infrastructure, and low public awareness of Hepatitis C virus Hepatitis C virus infection is a major public health concern in African countries, which have the highest prevalence rates of HCV in the world (1–26%). Egypt, African country which had the highest prevalence of Hepatitis C virus infection in the world. Its national hepatitis C elimination initiative emerges as an exemplary case of success an having screened over 60 million individuals, and treated more than 4 million, thereby markedly diminishing both the prevalence and incidence of the disease. The strategies employed by Egypt offer critical insights and adaptable frameworks for other African Countries facing analogous challenges. The Aim of this Review is to highlight the triumphs and hurdles of Egypt's approach, while also providing strategic guidance for African Countries to accelerate the journey towards the eradication of hepatitis C.

The central nervous system (CNS) is the final frontier in drug delivery because of the blood-brain barrier (BBB), which poses significant barriers to the access of most drugs to their targets. Kynurenic acid (KYNA), a tryptophan (Trp) metabolite, plays an important role in behavioral functions and abnormal KYNA levels have been observed in neuropsychiatric conditions. The current challenge lies in delivering KYNA to the CNS owing to its polar side chain. Recently, C-3 side chain modified KYNA analogs have been shown to cross the BBB; however, it is unclear whether they retain the biological functions of the parent molecule. This study examined the impact of KYNA analogs, specifically SZR-72, SZR-104, and the newly developed SZRG-21, on behavior. The analogs were administered intracerebroventricularly (i.c.v.), and their effects on the motor domain were compared with those of KYNA. Specifically, open field (OF) and rotarod (RR) tests were employed to assess motor activity and skills. SZR-104 increased horizontal exploratory activity in the OF test at a dose of 0.04 μmol/4 μL, while SZR-72 decreased vertical activity at doses of 0.04 and 0.1 μmol/4 μL. In the RR test, however, neither KYNA nor its analogs showed any significant differences in motor skills at either dose. Side chain modification affects affective motor performance and exploratory behavior, as the results show for the first time. In this study, we showed that KYNA analogs alter emotional components such as motor-associated curiosity and emotions. Consequently, drug design necessitates the development of precise strategies to traverse the BBB while paying close attention to modifications in their effects on behavior.

The electroencephalogram (EEG) is a record of brain activity. Brain Computer Interface (BCI) technology formed by the EEG signal has become one of the hotspots at present. How to extract the feature signal of EEG is the most basic research of BCI technology. In this paper, A new method of recognizing fatigue, conscious, concentrated state of human brain is proposed by the combination of discrete wavelet transform and the neural network based on EEG signal. First of all, the law signal is preprocessed by the wavelet denoising method because the law EEG signal contains a large number of high frequency noise, which is decomposed into multi-layer high frequency signal and low frequency signal. thus, δ wave, θ wave, α wave, β wave are obtained by the wavelet transform. And then, frequency band energy of the different wave is regards as the feature signal of EEG. In the experiment, the feature signal is classified by radial basic function (RBF) and annealed chaotic competitive learning network (ACCLN). RBF and ACCLN networks are trained with 500 sets of sample data and are tested by 100 sets of samples in different mental states. The experimental results show that the average accuracy of RBF network under three conditions are 88.75%, 88.25%, 88.5%, respectively, and the correct rate of ACCLN network is 97%, 98%, 98%, respectively.

Convolution forms one of the most essential operations for the FPGA-based hardware accelerator. However, the existing designs often neglect the inherent architecture of FPGA, which puts forward an austere challenge on hardware resource requirements. Even though some previous works have proposed approximate multipliers or convolution acceleration algorithms to deal with this issue, the inevitable accuracy loss and resource occupation easily lead to performance degradation. Toward this, we first propose two kinds of resource-efficient optimized accurate multipliers based on LUTs or carry chains. Then targeting FPGA-based platforms, a generic multiply-accumulate structure is constructed by directly accumulating the partial products produced by our proposed optimized radix-4 Booth multipliers without intermediate multiplication and addition results. Experimental results demonstrate that our proposed multiplier achieves a maximum 51% look-up-table (LUT) reduction compared to the Vivado area optimized multiplier IP. Furthermore, the convolutional process unit using the proposed structure achieves a 36% LUT reduction compared to existing methods. As case studies, the proposed method is applied to DCT transformer and LeNet to achieves hardware resource saving without loss of accuracy.

The way people innovate and create new ideas and bring them to the market is undergoing a fundamental change from closed innovation to open innovation. Why and how do firms perform open innovation? Firms’ open innovation is measured through the levels of firms’ joint patent applications. Next, we analyze network structures and characters of firms’ joint patent applications such as betweenness and degree centrality, structure hole, and closure. From this research, we drew conclusions as follows. First, the structure of collaboration networks has both direct and indirect effects on firms’ innovative performance. Second, in the process of joint patent applications, there is a long tail phenomenon in networks of joint patent applications. Third, the number of patents and International Patent Classification (IPC) subclasses together constitute a meaningful measure of the innovation performance of firms.

FV (finger vein) identification is a biometric identification technology that extracts the features of FV images for identity authentication. To address the limitations of CNN-based FV identification, particularly the challenge of small receptive fields and difficulty in capturing long-range dependencies, an FV identification method Let-Net(Large kernel and attention mechanism Network) was introduced, which combines local and global information. Firstly, Let-Net employs large kernels to broaden the receptive field and incorporates depthwise convolution with residual connections to reduce parameter count. Secondly, Let-Net integrates an attention mechanism to enhance the information flows in channels and spaces for more comprehensive and distinctive FV feature extraction. The experimental results on nine public datasets show that Let-Net has excellent identification performance, and the EER and accuracy rate on the FV_USM dataset can reach 0.04% and 99.77%. The parameter number and FLOPs of Let-Net are only 0.89M and 0.25G, which means that the time cost of training and reasoning of the model is low, and it is easier to deploy and integrate into various applications.

Although Lov\'{a}sz introduced the graph exponential $G^K$ in 1967, this product has received little attention. This paper focuses on the number of components in $G^K$ when exponent $K$ is a complete graph $K_n$. For a connected bipartite $G$, when $K$ is $K_2$, $G^{K_2}$ has three components; and when $K$ is $K_n$ with $n>2$, $G^{K_n}$ produces $\lceil\frac{n+1}{2}\rceil$ components. A connected $G$ with an odd cycle produces one component in $G^{K_n}$.

Delve into the dynamic realms of neuroscience, neurology, and psychiatry with this groundbreaking editorial, unveiling the intricate mechanisms of brain function and dysfunction. Explore the latest advancements in molecular biology, genetics, epigenetics, pharmacology, and neuroimaging that are revolutionizing our understanding of neurological and psychiatric disorders. Uncover the challenges and gaps in translating cutting-edge research into practical clinical applications, aiming to enhance the lives of patients and their families. Discover the pivotal role of neuroplasticity in reshaping the brain's adaptability throughout life, alongside the promising potential of non-invasive brain stimulation techniques like transcranial magnetic stimulation and transcranial direct current stimulation. Embark on a journey of innovation and collaboration as researchers and clinicians strive to bridge the gap between bench and bedside, offering hope for improved diagnosis, prevention, and treatment of complex neurological and psychiatric conditions. Join us in this exploration of transformative ideas and novel interventions that hold the key to a brighter future for individuals and society.

Color image binarization plays a pivotal role in image preprocessing work, significantly impacting subsequent tasks, particularly in text recognition. This paper concentrates on Document Image Binarization (DIB), aiming to separate a image into foreground (text) and background (non-text content). Through a thorough analysis of conventional and deep learning-based approaches, we conclude that prevailing DIB methods leverage deep learning technology. Furthermore, we explore the receptive fields pre- and post-network training to underscore the Transformer model's advantages. Subsequently, we introduce a lightweight model based on the U-Net structure, enhanced with the Mobile ViT module to better capture global information features in document images. Given its adeptness at learning both local and global features, our proposed model exhibits superior performance on two standard datasets (DIBCO2012 and DIBCO2017) compared to state-of-the-art methods. Notably, our proposed DIB method presents a straightforward end-to-end model devoid of additional image preprocessing or post-processing. Moreover, its parameter count is less than a quarter of the HIP'23 model, which achives best results on three datasets(DIBCO2012, DIBCO2017 and DIBCO2018). Finally, two sets of ablation experiments were conducted to verify the effectiveness of the proposed binarization model.

Bundle recommendation is provided to users by combining related items into a bundle, enhancing the user's shopping experience and increase the merchant's sales revenue. Despite the success of existing solutions based on Graph Neural Networks(GNN), there are still some significant challenges: (1)It is demanding to explicitly model multiple complex associations using standard graph neural networks. (2)Numerous additional nodes and edges are introduced to approximate higher-order associations. (3)The user-bundle historical interaction data is highly sparse. In this work, we propose a Global Structural Hypergraph Convolution model for Bundle Recommendation (SHCBR) to address the above problems. Specifically, we jointly incorporate multiple complex interactions between users, items, and bundles(three entities) into a relational hypergraph without introducing additional nodes and edges. Higher-order associations are already involved in the hypergraph structure which alleviate the training burden of neural networks and the dilemma of scarce data. In addition, we design a special matrix propagation rule that captures non-pairwise complex relationships between entities. Using item nodes as links, hypergraph convolution propagation between user and bundle nodes generates the learned representations. Experimental results on two real-world datasets demonstrate that SHCBR outperforms the state-of-the-art baselines by 11.07%-25.66\% on Recall and 16.81%-33.53% on NDCG. We publicly release the codes and datasets at https://github.com/Lxtdzh/SHCBR-master/.

Multi-task Gaussian processes (MTGPs) are a powerful approach for modeling structured dependencies among multiple tasks. Researchers on MTGPs have contributed to enhance this approach in various ways. Current MTGP methods, however, cannot model nonlinear task correlations in a general way. In this paper we address this problem. We focus on spectral mixture (SM) based kernels and propose an enhancement of this type of kernels, called multi-task generalized convolution spectral mixture (MT-GCSM) kernel. The MT-GCSM kernel can model nonlinear task correlations and mixtures dependency, including time and phase delay, not only between different tasks but also within a task at the spectral mixture level. Each task in MT-GCSM has its own generalized convolution spectral mixture kernel (GCSM) with a different number of convolution structures and all spectral mixtures from different tasks are dependent. Furthermore, the proposed kernel uses inner and outer full cross convolution between base spectral mixtures, so that the base spectral mixtures in the tasks are not necessarily aligned. Extensive experiments on synthetic and real-life datasets illustrate the difference between MT-GCSM and other kernels as well as the practical effectiveness of MT-GCSM.

In this paper, a relatively new hyper convolution spectra for characterization liquid, viscoelastic and solid samples is presented. Special attention is paid to the biophysical characterization of epithelial tissues and early detection of cancer of the skin, cervix, colon, and oral cavity. The method is based on the use of two types of white light, diffuse and polarized, from the same LED light sources. Based on the subtraction of the intensity values of these two lights and using the hyper convolution algorithm, the ratio of paired and unpaired electrons of tissue is obtained. This ratio correlates well with the state of the tissue: normal, irritating, precancerous, and cancerous. First, a proof-of-concept studies were performed, and later clinical studies on samples from one thousand two hundred fifteen people were performed. It showed that hyper Opto-Magnetic Imaging Spectroscopy (OMIS) can detect epithelial tissue cancers with an accuracy of 85-96%. Bearing in mind that the OMIS method also acquires the biophysical characteristics of the deeper skin layers (epidermis, basement membrane, dermis) by analysing convolution spectra of RGB channels of both diffuse and polarized white light, it is possible to apply this method in cosmetics (skin hydration, collagen, and elastin states, etc.). During OMIS applications, we noticed places where improvements could be made to increase method’s accuracy using advanced machine learning methodologies.

In recent years, graph neural networks (GNNs) have become a promising method for analyzing data structured in graph format. By considering connections between entities in a graph, GNNs are able to extract valuable insights. One notable variation of GNN is the graph attention network (GAT), which employs the attention mechanism and has demonstrated promising performance in various applications. However, its ability to incorporate feature information from nodes beyond the immediate neighborhood is limited, leading to degraded performance on heterophilic data. To address this limitation, this thesis proposes a novel attention-based model, namely the Directional Graph Attention Network (DGAT). This model combines the feature-based attention with the global directional information extracted from the graph topology, as inspired by the Directional Graph Network (DGN). A new class of Laplacian matrices is proposed and an existing theoretical result on DGN is extended. This extension bridges a gap in the literature. The experimental results presented in the thesis, based on nine real-world benchmarks and ten synthetic data sets, demonstrate the superiority of the proposed DGAT model compared to the GAT baseline model. Particularly on heterophilic data sets, DGAT showed a notable average increase of approximately 35% in node classification tasks across all heterophilic real-world data sets. In addition, DGAT outperforms GAT by an average margin of around 51% in all ten synthetic data sets with various levels of heterophily

Structured science summaries or research contributions using properties or dimensions beyond traditional keywords enhances science findability. Current methods, such as those used by the Open Research Knowledge Graph (ORKG), involve manually curating properties to describe research papers' contributions in a structured manner, but this is labor-intensive and inconsistent between the domain expert human curators. We propose using Large Language Models (LLMs) to automatically suggest these properties. However, it's essential to assess the readiness of LLMs like GPT-3.5, Llama 2, and Mistral for this task before application. Our study performs a comprehensive comparative analysis between ORKG's manually curated properties and those generated by the aforementioned state-of-the-art LLMs. We evaluate LLM performance through four unique perspectives: semantic alignment and deviation with ORKG properties, fine-grained properties mapping accuracy, SciNCL embeddings-based cosine similarity, and expert surveys comparing manual annotations with LLM outputs. These evaluations occur within a multidisciplinary science setting. Overall, LLMs show potential as recommendation systems for structuring science, but further finetuning is recommended to improve their alignment with scientific tasks and mimicry of human expertise.

The paper addresses the energy consumption minimization problem in wireless powered communication networks (WPCNs) and proposes a DT-SWIPT-assisted time allocation scheme, named DaTA, such that the wireless station can share the remaining energy after transmission to the HAP to those who have not transmitted to the HAP to minimize the energy consumption of the network. In addition to proposing a new frame structure, the paper also considers the SNR (Signal-to-Noise) constraint to guarantee that the HAP can successfully receive data from wireless stations. In the paper, the energy consumption minimization problem is formulated as a nonlinear programming model. We employ the SQP (Sequential Quadratic Programming) algorithm to figure out the optimal solution. Moreover, a heuristic method is proposed as well to obtain a near-optimal solution in a shorter time. Simulation results showed that the proposed scheme can have better performance than the related work in terms of energy consumption and energy efficiency.

We propose a neural-network-based watermarking method that introduces the quantized activation function that approximates the quantization of JPEG compression. Many neural-network-based watermarking methods have been proposed. Conventional methods have acquired robustness against various attacks by introducing an attack simulation layer between the embedding network and the extraction network. The quantization process of JPEG compression was replaced by the noise addition process in the attack layer of the conventional methods. In this paper, we propose a quantized activation function that can simulate the JPEG quantization standard as it is in order to improve the robustness against the JPEG compression. Our quantized activation function consists of several hyperbolic tangent functions and is applied as an activation function for neural networks. Our network was introduced in the attack layer of ReDMark proposed by Ahmadi et al. to compare it with their method. That is, the embedding and extraction networks had the same structure. We compared the usual JPEG compressed images and the images applying the quantized activation function. The results showed that a network with quantized activation functions can approximate JPEG compression with high accuracy. We also compared the bit error rate (BER) of estimated watermarks generated by our network with those generated by ReDMark. We found that our network was able to produce estimated watermarks with lower BERs than those of ReDMark. Therefore, our network outperformed the conventional method with respect to image quality and BER.

Graph databases (GDBs) are becoming increasingly popular across scientific disciplines, being highly suitable to store and connect complex heterogeneous data. In systems biology, they are used as a backend solution for biological data repositories, ontologies, networks, pathways, and knowledge graph (KG) databases. In this review, we analyse all publications using or mentioning graph databases retrieved from PubMed and PubMed Central full-text search, focusing on the top 16 available GDB technologies. Relevant publications are then categorised according to their domain and application. We detail different approaches and highlight advantages of outstanding resources, such as UniProtKB, Disease Ontology, and Reactome, which provide graph-based solutions. We discuss ongoing efforts of the systems biology community to standardise and harmonise KG creation and the maintenance of integrated resources. Outlining prospects, including the use of GDBs as a way of communication between biological data repositories, we conclude that efficient design, querying, and maintenance of GDBs will be key for knowledge generation in systems biology and other research fields with heterogeneous data.

Management of sarcomas in specialist centers delivers significant benefits. In much of the world specialists are not available and development of expertise is identified as a major need. However the terms ‘specialist’ or ‘expert’ center are rarely defined. Our objective is to offer a definition for patient advocates and a tool for healthcare providers to underpin improving the care of people with sarcoma. SPAGN developed a discussion paper for a workshop at the SPAGN 2023 Conference, attended by 75 delegates. A presentation to the Connective Tissue Oncology Society (CTOS) and further discussion led to this paper. Core Principles were identified that underlie specialist sarcoma care. The primary principle is the multi-disciplinary team discussing every patient, at first diagnosis and during treatment. Principles for optimal sarcoma management include accurate diagnosis followed by safe, high-quality treatment, with curative intent. These Principles are supplemented by Features describing areas of healthcare, professional involvement, and service provision and identifying further research and development needs. These allow for variations because of national or local policies and budgets. We propose the term ‘Sarcoma Intelligent Specialist Network’ to recognize expertise wherever it is found in the world. This provides a base for further discussion and local refinement.

Currently there are fewer depth models applied to pepper picking detection, while the existing generalized neural networks have problems such as large model parameters, long training time, and low model accuracy.In order to solve the above problems, this paper proposes a Yolo-chili target detection algorithm for chili pepper detection. First, the classical target detection algorithm yolov5 is used as a benchmark model, and an adaptive spatial feature pyramid structure combining the attention mechanism and the idea of multi-scale prediction is introduced to improve the model's detection effect on occluded peppers and small target peppers. Secondly, a three-channel attention mechanism module is introduced to improve the algorithm's long-distance recognition ability and reduce the interference of redundant testers. Finally, the quantized pruning method is used to reduce the model parameters and realize the lightweight processing of the model. Applying the method to the homemade chili pepper dataset, the AP value of chili pepper reaches 93.11%; the accuracy rate is 93.51% and the recall rate is 92.55%.The experimental results show that yolo-chili is able to achieve accurate and real-time pepper detection under complex orchards.

The airborne and satellite-based synthetic aperture radar enables the acquisition of high-resolution SAR oceanographic images in which even the outlines of ships can be identified. The detection of ship targets from SAR images has a wide range of applications, such as the military, where the dynamic grasp of enemy targets can help improve the early warning capability of naval defence, and the civilian detection of illegal fishing vessels can help improve the level of maritime management. Due to the density of ships in SAR images, the extreme imbalance between foreground and background clutter, and the diversity of target sizes, achieving lightweight and highly accurate multi-scale ship target detection remains a great challenge. To this end, this paper proposes an attention mechanism for multiscale receptive fields convolution block (AMMRF). AMMRF not only makes full use of the location information of the feature map to accurately capture the regions in the feature map that are useful for detection results, but also effectively captures the relationship between the feature map channels, so as to better learn the relationship between the ship and the background. Based on this, a new YOLOv7-based ship target detection method, You Only Look Once SAR Ship Identification (YOLO-SARSI), is proposed, which acquires the abstract semantic information extracted from the high-level convolution while retaining the detailed semantic information extracted from the low-level convolution. Compared to the deep learning detection methods proposed by previous authors, our model is more lightweight, only 18.43M. We examined the effectiveness of our method on two SAR image public datasets: the High-Resolution SAR Images Dataset (HRSID) and the Large-Scale SAR Ship Detection Dataset-v1.0 (LS-SSDD-V1.0). The results show that the average accuracy AP50 of the detection method YOLO-SARSI proposed in this paper on the HRSID and LS-SSDD-V1.0 datasets is 4.9% and 5% higher than that of YOLOv7, respectively.

Cerebrovascular and airway structures are tubular structures used for transporting blood and gases, respectively, providing essential support for the normal activities of the human body. Accurately segmenting these tubular structures is the basis of morphology research and patho-logical detection. Nevertheless, accurately segmenting these structures from images presents great challenges due to their complex morphological and topological characteristics. To address this challenge, this paper proposes a framework UARAI based on the U-Net multi-scale reverse at-tention network and sparse convolution network. The framework utilizes a multi-scale structure to effectively extract the global and deep detail features of vessels and airways. Further, it enhances the extraction ability of fine-edge features by a joint reverse attention module. In addition, the sparse convolution structure is introduced to improve the features' expression ability without increasing the model's complexity. Finally, the proposed training sample cropping strategy re-duces the influence of block boundaries on the accuracy of tubular structure segmentation. The experimental findings demonstrate that the UARAI-based metrics, namely Dice and IoU, achieve impressive scores of 90.31% and 82.33% for cerebrovascular segmentation and 93.34% and 87.51% for airway segmentation, respectively. Compared to commonly employed segmentation tech-niques, the proposed method exhibits remarkable accuracy and robustness in delineating tubular structures such as cerebrovascular and airway. These results hold significant promise in facilitating medical image analysis and clinical diagnosis, offering invaluable support to healthcare profes-sionals.