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.

：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, 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

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.

Underwater image often exhibit detail blurring and color distortion due to light scattering, impurities, and other influences, obscuring essential textures and details. This presents a challenge for existing super-resolution techniques in identifying and extracting effective features, making high-quality reconstruction difficult. This research aims to innovate underwater image super-resolution technology to tackle this challenge. Initially, an underwater image degradation model was created by integrating random subsampling, Gaussian blur, mixed noise, and suspended particle simulation to generate a highly realistic synthetic dataset, thereby training the network to adapt to various degradation factors. Subsequently, to enhance the network's capability to extract key features, improvements were made based on the symmetrically structured Blind Super-Resolution Generative Adversarial Network (BSRGAN) model architecture. An attention mechanism based on energy functions was introduced within the generator to assess the importance of each pixel, and a weighted fusion strategy of adversarial loss, reconstruction loss, and perceptual loss was utilized to improve the quality of image reconstruction. Experimental results demonstrate that the proposed method achieved significant improvements in Peak Signal-to-Noise Ratio (PSNR) and Underwater Image Quality Measure (UIQM) by 0.85 dB and 0.19, respectively, significantly enhancing the visual perception quality and indicating its feasibility in super-resolution applications.

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.

Drug repositioning (also called drug repurposing) is a strategy for identifying new therapeutic targets for existing drugs. This approach is of great importance in pharmacology as it is a faster and cheaper way to develop new medical treatments. In this paper, we present, to our knowledge, the first application of multiplex-heterogeneous network embedding to drug repositioning. Network embedding learns the vector representations of nodes, opening the whole machine learning toolbox for a wide variety of applications including link prediction, node labelling or clustering. So far, the application of network embedding for drug repositioning focused on heterogeneous networks. Our approach for drug repositioning is based on multiplex-heterogeneous network embedding. Such method allows the richness and complexity of multiplex and heterogeneous networks to be projected in the same vector space. In other words, multiplex-heterogeneous networks aggregate different multi-omics data in the same network representation. We validate the approach on a task of link prediction and on a case study for SARS-CoV2 drug repositioning. Experimental results show that our approach is highly robust and effective for finding new drug-target associations.

The adapted Posner spatial cue-target paradigm was used to explore the relationship between exogenous temporal attention caused by rhythm and endogenous and exogenous spatial attention. The study was divided into two experiments. In Experiment 1, 33 participants used arrow cues to orient endogenous spatial attention and rhythm to orient exogenous temporal attention. In Experiment 2, with 29 participants, exogenous spatial attention was directed by highlighting the cue box. Exogenous temporal attention was directed by rhythm. Experiment 1 indicated that RTs were faster for attended targets than the unattended. The main effect of temporal attention was significant, with RTs being faster for synchrony and late compared to early. RTs were faster for late compared to synchrony. The main effect of stimulus repetition was significant, with faster RTs for targets when the rhythmic cue consisted of five compared to four. The interaction between spatial attention and temporal attention was not significant. Experiment 2 demonstrated that exogenous spatial attention only exhibited IOR under early four stimulus repetitions. The main effect of temporal attention was significant, with RTs being faster for synchrony and late compared to early. The main effect of stimulus repetition was significant, with faster RTs for targets when the rhythmic cue consisted of five compared to four. The interaction between spatial attention and temporal attention was significant. The results indicated that rhythmic temporal attention supported foreperiod effects. Exogenous temporal attention and endogenous spatial attention independently affect behavior, while exogenous temporal attention and exogenous spatial attention mutually influenced behavior.

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.

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.

Satellite communication is expected to play a vital role in realizing Internet of Remote Things (IoRT) applications. This article considers an intelligent reflecting surface (IRS)-assisted downlink low Earth orbit (LEO) satellite communication network, where IRS provides additional reflective links to enhance the intended signal power. We aim to maximize the sum-rate of all the terrestrial users by jointly optimizing the satellite’s precoding matrix and IRS’s phase shifts. However, it is difficult to directly acquire the instantaneous channel state information (CSI) and optimal phase shifts of IRS due to the high mobility of LEO and the passive nature of reflective elements. Moreover, most conventional solution algorithms suffer from high computational complexity and are not applicable to these dynamic scenarios. A robust beamforming design based on graph attention networks (RBF-GAT) is proposed to establish a direct mapping from the received pilots and dynamic network topology to the satellite and IRS’s beamforming, which is trained offline using the unsupervised learning approach. The simulation results corroborate that the proposed RBF-GAT can achieve approximate performance compared to the upper bound with low complexity.

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.

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.

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.

The stability and optimal control for an SIS epidemic model with demographics and heterogeneous control strategies (immunization and quarantine) on complex networks are investigated. The epidemic threshold, disease-free and endemic equilibria are derived. Then, global asymptotical stability about the two equilibria are studied based on different methods. Furthermore, the optimal control issue about the system is also considered. We obtain the existence and uniqueness of the optimal control and optimal control tactics. Some numerical simulations were conducted to illustrate and supplement the theoretical results. Meanwhile, the effects of the combination of various immunization and quarantine schemes are studied and also compared with the optimal control strategies.

The demand for precise indoor localization services is steadily increasing. Among various methods, fingerprint-based indoor localization has become a popular choice due to its exceptional accuracy, cost-effectiveness, and ease of implementation. However, its performance degrades significantly as a result of multipath signal attenuation and environmental changes. In this paper, we propose an indoor localization method based on fingerprints using self-attention and long short-term memory (LSTM). By integrating a self-attention mechanism and LSTM network, the proposed method exhibits outstanding positioning accuracy and robustness in diverse experimental environments. The performance of the proposed method is evaluated under two different experimental scenarios, which involve 2D and 3D moving trajectories, respectively. The experimental results demonstrate that our approach achieves an average localization error of 1.76 m and 2.83 m in the respective scenarios, outperforming the existing state-of-the-art methods by 42.67% and 31.64%.

Recently deep cross-modal hashing networks have received increasing interests due to its superior query efficiency and low storage cost. However, most of existing methods concentrate less on hash representations learning part, which means the semantic information of data cannot be fully used. Furthermore, they may neglect the high-ranking relevance and consistency of hash codes. To solve these problems, we propose a Self-Attention and Adversary Guided Hashing Network (SAAGHN). Specifically, it employs self-attention mechanism in hash representations learning part to extract rich semantic relevance information. Meanwhile, in order to keep invariability of hash codes, adversarial learning is adopted in the hash codes learning part. In addition, to generate higher-ranking hash codes and avoid local minima early, a new batch semi-hard cosine triplet loss and a cosine quantization loss are proposed. Extensive experiments on two benchmark datasets have shown that SAAGHN outperforms other baselines and achieves the state-of-the-art performance.

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.

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.

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.

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.

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.

Background: Antibiotic resistance is an urgent issue everywhere in the globe. It is necessary to look into new sources of antibiotics to address this issue. Aim of the study: studying the purification of Corallopyronin B from various soil conditions in Egypt, as well as the antibacterial effectiveness of Corallopyronin B in preclinical animal testing and randomized human clinical trials phases 1/2. Type of the study: Screening experimental study. Methodology: Several soil conditions in Egypt were examined to create bacterial isolates that generated the antibiotic chemical Corallopyronin B. Using reversed-phase HPLC, Myxopyronin B was purified. The test antibiotic's minimum inhibitory concentration( MIC) and in vitro antibacterial activity were ascertained using the paper disc diffusion assay and the broth microdilution technique. Furthermore, in stages 1/2 of randomized clinical trials including human and animal models, pharmacokinetics, adverse drug reactions, and the in vivo antibacterial spectrum were discovered. Results: The soil bacterial isolate Corallococcus coralloides DSM 2259, which was grown on a Casein yeast peptone( CYP) plate, produced Corallopyronin B from its culture supernatant. At MICs more than 100 mcg/ml, the test antibiotic inhibited the growth of many Gram -ve bacteria, including Escherichia coli, while also preventing the growth of numerous Gram +ve bacteria, with MICs ranging from 1 to 10 mcg/ml. Eukaryotic cells, on the other hand, including those in humans and fungi, were unharmed. The test antibiotic was shown to have a bactericidal effect by inhibiting bacterial DNA-dependent RNA polymerase( RNLP). In phases 1/2 of randomized human clinical trials, when 600 mg of the dose per 70 kg of body weight was administered SC, the Cmax was 8.6 mcg/ml at Tmax 1 hour; T1/2 reached 136 min following first-order kinetics of elimination. It stopped acting around 6-7 hours after SC was administered. In the preclinical and randomized human clinical trial phases 1/2, less than 6 percent of experimental candidates had uncommon toxicity, which showed up as reduced bile flow. Protein binding with plasma albumin was detected which reached about 83%. Conclusion: The current work was noteworthy since it involved the production of the bactericidal antibiotic Corallopyronin B from Corallococcus coralloides DSM 2259 which was isolated from several soil environments in Egypt.

In heterogeneous networks, the random walks based on meta-path requires prior knowledge and lacks flexibility. And the random walks based on non-meta-path only considers the number of node types, but does not consider the influence of schema and topology between node types in real networks. To solve the above problems, this paper proposes a novel model HNE-RWTIC (Heterogeneous Network Embedding Based on Random Walks of Type & Inner Constraint). Firstly, to realize the flexible walks, we design a Type strategy, which is the node type selection strategy based on the co-occurrence probability of node types. Secondly, to achieve the uniformity of node sampling, we design an Inner strategy, which is the node selection strategy based on the adjacency relationship between nodes. The Type & Inner strategy can realize the random walks based on meta-path, the flexibility of the walks, and can sample the node types and nodes uniformly in proportion. Thirdly, based on the above strategy, a transition probability model is constructed; then, we obtain the nodes embedding based on the random walks and Skip-Gram. Finally, in classification and clustering tasks, we conducted a thorough empirical evaluation of our method on three real heterogeneous networks. Experimental results shown that F1-Score and NMI of HNE-RWTIC outperform state-of-the-art approaches.

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.

3D point cloud classification tasks have been a hot topic in recent years. Most existing point cloud processing frameworks lack context-aware features due to the deficiency of sufficient local feature extraction information. Therefore, we design an augmented sampling and grouping (ASG) module to efficiently obtain fine-grained features from the original point cloud. In particular, this method strengthens the domain near each centroid and makes reasonable use of the local mean and global standard deviation to mine point cloud’s local and global features. In addition to this, inspired by the transformer structure UFO-ViT in 2D vision tasks, we first try to use a linearly-normalized attention mechanism in point cloud processing tasks, investigating a novel transformer-based point cloud classification architecture UFO-Net. An effective local feature learning module is adopted as a bridging technique to connect different feature extraction modules. Importantly, UFO-Net employs multiple stacked blocks to better capture feature representation of the point cloud. Extensive ablation experiments on public datasets show that our method outperforms other state-of-the-art methods. For instance, our network performed with 93.7% overall accuracy on the ModelNet40 dataset, which was 0.5% higher than PCT. Our network also archived 83.8% overall accuracy on the ScanObjectNN dataset, which is 3.8% better than PCT.

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.

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.

Remote sensing technology is crucial for accurate rooftop detection, benefiting urban planning, disaster management, and solar resource estimation. This study employs Efficient Interactive Segmentation (EISEG) to enhance the efficiency of remote sensing image labeling, with a particular focus on rooftop detection. It is necessary to use modern technology because traditional manual labelling methods are labor-intensive and complicated. The study introduces a novel framework on deep learning semantic segmentation models, facilitating an efficient approach to rooftop identification using high-resolution UAV remote sensing datasets. Large dataset of labeled UAV rooftop building images, in which each superpixel region is assigned a binary label indicating rooftop presence. Advanced methods including Asymmetric Neural Network (ANN), Dual At-tention Network (DANet), PP-LiteSeg, and Deeplab3 are implemented for automatic rooftop detection due to their higher performance and advanced architectures. These models are executed on the Baidu deep learning platform PaddlePaddle, generating initial rooftop segmentation maps crucial for estimating photovoltaic resources. The ANN model emerges with the highest accuracy at 96%, followed by DANet at 95.09%, PP-LiteSeg at 94.54%, and Deeplab3 at 81.61%. The outcomes presenting efficient models for automated rooftop identification, and demonstrating the continuous need for improving deep learning techniques in smart and sustainable cities.

Underwater image processing faces significant challenges due to the absorption and scattering of light as it travels through water. A self-supervised learning network based on the self-attention mechanism is proposed for underwater visual applications in this paper. The goal is to improve the effectiveness and stability of feature extraction from underwater images. By incorporating self-attention mechanism, the sensitivity of the original network architecture to degraded features of blurred underwater images is enhanced. The network proposed in this paper is trained using transfer learning and evaluated on various underwater image datasets. With distributive, quantitative, and qualitative advantages compared with other methods, experimental results have demonstrated that the algorithm presented shows a slighter decline in feature extraction ability for blurred images as the turbidity of water increases.

Vehicle re-identification research under surveillance cameras has yielded impressive results. However, the challenge of Unmanned Aerial Vehicle (UAV)-based vehicle re-identification (ReID) presents a high degree of flexibility, mainly due to complicated shooting angles, occlusions, low discrimination of top-down features, and significant changes in vehicle scales. To address this, we propose a novel Dual Mixing Attention Network (DMANet) to extract discriminative features robust to variations in viewpoint. Specifically, we first present a plug-and-play Dual Mixing Attention Module (DMAM) to capture pixel-level pairwise relationships and channel dependencies, where DMAM is composed of Spatial Mixing Attention (SMA) and Channel Mixing Attention (CMA). First, the original feature is divided according to the dimensions of spatial and channel to obtain multiple subspaces. Then, a learnable weight is applied to capture the dependencies between local features in the mixture space. Finally, the features extracted from all subspaces are aggregated to promote their comprehensive feature interaction. Moreover, the DMAM can be readily inserted into backbone networks at any depth to improve vehicle discrimination. The experiments show that the proposed structure gains a better performance compared with the representative methods in the UAV-based vehicle ReID task. Our code and models will be publicly released.

In recent years, researchers have paid increasing attention on hyperspectral image (HSI) classification using deep learning methods. To improve the accuracy and reduce the training samples, we propose a double-branch dual-attention mechanism network (DBDA) for HSI classification in this paper. Two branches are designed in DBDA to capture plenty of spectral and spatial features contained in HSI. Furthermore, a channel attention block and a spatial attention block are applied to these two branches respectively, which enables DBDA to refine and optimize the extracted feature maps. A series of experiments on four hyperspectral datasets show that the proposed framework has superior performance to the state-of-the-art algorithm, especially when the training samples are signally lacking.

Visual question answering (VQA) is receiving increasing attention from researchers in both the computer vision and natural language processing fields. There are two key components in the VQA task: feature extraction and multi-modal fusion. For feature extraction, we introduce a novel co-attention scheme by combining Sentence-guide Word Attention (SWA) and Question-guide Image Attention (QIA) in a unified framework. To be specific, the textual attention SWA relies on the semantics of the whole question sentence to calculate contributions of different question words for text representation. For the multi-modal fusion, we propose a “Cross-modal Multistep Fusion (CMF)” network to generate multistep features and achieve multiple interactions for two modalities, rather than focusing on modeling complex interactions between two modals like most current feature fusion methods. To avoid the linear increase of the computational cost, we share the parameters for each step in the CMF. Extensive experiments demonstrate that the proposed method can achieve competitive or better performance than the state-of-the-art.

This work presents a novel approach for the study of the movement of droplets on inclined surfaces under the influence of gravity and chemical heterogeneities. The developed numerical methodology uses data-driven modeling to extend the applicability limits of an analytically derived reduced-order model for the contact line velocity. More specifically, while the reduced-order model is able to capture the effects of the chemical heterogeneities to a satisfactory degree, it does not account for gravity. To alleviate this shortcoming, datasets generated from direct numerical simulations are used to train a data-driven model for the contact line velocity, which is based on the Fourier neural operator and corrects the reduced-order model predictions to match the reference solutions. This hybrid surrogate model, which comprises of both analytical and data-driven components, is then integrated in time to simulate the droplet movement, offering a speedup of five orders of magnitude compared to direct numerical simulations. The performance of this hybrid model is quantified and assessed in different wetting scenarios, by considering various inclination angles and values for the Bond number, demonstrating the accuracy of the predictions as long as the adopted parameters lie within the ranges considered in the training dataset.

Recently, methods to detect DoS and spoofing attacks that occur on in-vehicle networks using CAN Protocol are being studied through deep learning models such as CNN, RNN, and LSTM. These studies have produced significant results in the field of In-Vehicle Network attack detection using deep learning models. In addition, significant results are being achieved through research on applying time series-based deep learning models such as LSTM to detect DoS attacks and replay attacks occurring in in-drone networks by expanding them to drones using the UAVCAN protocol. In this paper, we conducted an experiment to detect in-drone network attacks through non-time series analysis using machine learning models and deep learning models, and through appropriate learning for each attack type, it can also be analyzed through non-time series analysis. The results showed that it was possible to detect attacks.

Retweet prediction is an important task related to different problems such as information spreading analysis, the automatic detection of fake news, social media monitoring, etc. In this study we explore the possibilities of retweet prediction based on heterogeneous data sources. In order to classify the tweet according to the amount of retweets, we combine features extracted from the multilayer network and the text. More specifically, we introduce a multilayer framework that proposes the multilayer network representation of Twitter. This formalism captures different users' actions and complex relationships as well as other key properties of communication on Twitter. We select a set of local network measures from each layer and construct a set of multilayer network features. In addition, we adopt a BERT-based language model, namely Cro-CoV-cseBERT to capture high-level semantics and structure of tweets as a set of text features. Then, we train six machine learning (ML) algorithms: random forest, multilayer perceptron, light gradient boosting machine, category embedding model, neural oblivious decision ensembles and attentive interpretable tabular learning model in the task of retweet prediction. We compare the performance of all six algorithms in three different setups (i) using only text features, (ii) using only multilayer network features and (iii) using both sets of features. We evaluate all setups in terms of standard evaluation measures i.e. precision, recall, F1-score and accuracy. For this task, we first prepare and use an empirical dataset of 199,431 tweets in the Croatian language posted during the period between January 1, 2020 and May 31, 2021. Our results indicate that by integrating multilayer network features with text features the prediction model would perform better than using just one set of features.

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.

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.

Land cover mapping provides spatial information on the physical properties of the Earth’s surface, for various classes of wetlands, artificial surface and constructions, vineyards, water bodies, etc. Having reliable information on land cover is crucial to developing solutions to a variety of environmental problems such as destruction of important wetlands/forests, and loss of fish and wildlife habitats. This has made land cover mapping one of the most widespread application areas in remote sensing computational imaging. However, due to the differences between modalities in terms of resolutions, content, and sensors, integrating complementary information that multi-modal remote sensing imagery exhibits into a robust and accurate system still remains challenging, and classical segmentation approaches generally do not give satisfactory results for land cover mapping. In this paper, we propose a novel dynamic deep network architecture, AMM-FuseNet, that promotes the use of multi-modal remote sensing images for the purpose of land cover mapping. The proposed network exploits the hybrid approach of the Channel Attention mechanism and Densely Connected Atrous Spatial Pyramid Pooling (DenseASPP). In the experimental analysis, in order to to verify the validity of the proposed method, we test AMM-FuseNet applied to four datasets whilst comparing it to the 6 state-of-the-art models of DeepLabV3+, PSPNet, UNet, SegNet, DenseASPP, and DANet. In addition, we also demonstrate the capability of AMM-FuseNet under minimal training supervision (reduced number of training samples) compared to the state-of-the-art, achieving less accuracy loss even for the case with 1/20 of the training samples.

In the present, the growth of digitization and worldwide communications make OCR systems of exotic languages a very important task. In this paper, we attempt to develop an OCR system for one of these exotic languages with a unique script, Amharic. Motivated by the recent success of the Attention mechanism in Neural Machine Translation (NMT), we extend the attention mechanism for Amharic text-image recognition. The proposed model consists of CNNs and attention embedded recurrent encoder-decoder networks that are integrated following the configuration of the seq2seq framework. The attention network parameters are trained in an end-to-end fashion and the context vector is injected, with the previously predicted output, at each time steps of decoding. Unlike the existing OCR model that minimizes the CTC objective function, the new model minimizes the categorical cross-entropy loss. The performance of the proposed attention-based model is evaluated against the test dataset from the ADOCR database which consists of both printed and synthetically generated Amharic text-line images and achieved promising results with a CER of 1.54% and 1.17% respectively.

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.

As Heterogeneous Wireless Sensor Network (HWSN) fulfill the requirements of researchers in the design of real life application to resolve the issues of unattended problem. But, the main constraint face by researchers is energy source available with sensor nodes. To prolong the life of sensor nodes and hence HWSN, it is necessary to design energy efficient operational schemes. One of the most suitable routing scheme is clustering approach, which improves stability and hence enhances performance parameters of HWSN. A novel solution proposed in this article is to design energy efficient clustering protocol for HWSN, to enhance performance parameters by EECPEP-HWSN. Propose protocol is designed with three level nodes namely normal, advance and super node respectively. In clustering process, for selection of cluster head we consider three parameters available with sensor node at run time, i.e., initial energy, hop count and residual energy. This protocol enhance the energy efficiency of HWSN, it improves performance parameters in the form of enhance energy remain in the network, force to enhance stability period, prolong lifetime and hence higher throughput. It is been found that proposed protocol outperforms than LEACH, DEEC and SEP with about 188, 150 and 141 percent respectively.

Machinery degradation assessment can offer meaningful prognosis and health management in-formation. Although numerous machine prediction models based on artificial intelligence have emerged in recent years, they still face a series of challenges: (1) Many models continue to rely on manual feature extraction. (2) Deep learning models still struggle with long sequence prediction tasks. (3) Health indicators are inefficient for remaining useful life (RUL) prediction with cross-operational environments when dealing with high-dimensional datasets as inputs. This research proposes a health indicator construction methodology based on a transformer self-attention transfer network (TSTN). This methodology can directly deal with the high-dimensional raw dataset and keep all the information without missing when the signals are taken as the input of the diagnosis and prognosis model. First, we design an encoder with a long-term and short-term self-attention mechanism to capture crucial time-varying information from a high-dimensional dataset. Second, we propose an estimator that can map the embedding from the encoder output to the estimated degradation trends. Then, we present a domain dis-criminator to extract invariant features from different machine operating conditions. The case studies with the FEMTO-ST bearing dataset and the Monte Carlo method for RUL prediction during the degradation process are conducted. The experiment results fully exhibited the signif-icant advantages of the proposed method compared to other state-of-the-art techniques.

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.

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

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.

This paper proposed a three-layer distributed simulation network architecture: 1. Distributed virtual simulation network, 2. Perception and control sub-network, and 3. Collaborative communication service network. This simulation architecture runs on a distributed platform. The platform can provide a unique virtual scenario and several simulation services to verify the individual robot system's basic perception, control, and planning algorithms and the distributed collaborative algorithms of heterogeneous multi-robot systems. Furthermore, we designed a simulation experiment scenario for classical heterogeneous robot systems such as unmanned aerial vehicles (UAVs) and unmanned ground vehicles (UGVs). At last, We gave a rough estimation model of the bandwidth.

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.

The composites of heteropolyacids (H3PW12, H3PMo12) incorporated into amine-functionalized silica materials, were used for the first time as heterogeneous catalysts in the valorisation of glycerol (a large waste from biodiesel industry) by acetalization reaction with acetone. The polyoxotungstate catalyst H3PW12@AptesSBA-15 presented higher catalytic efficiency than the phosphomolybdate, with 97% of conversion with 97% of solketal selectivity, after 60 min at 25 °C, or 91% of glycerol conversion and the same selectivity, after 5 min, performing the reaction at 60 ºC. A relation of catalytic performance and acidity of the catalyst is here presented. Furthermore, the stability of the solid catalyst was investigated and discussed.

Pedestrian object detection plays a significant role in intelligent systems such as intelligent traffic and monitoring. Traditional machine learning methods on pedestrian detection have shown various drawbacks, \eg{} low accuracy, slow speed, \etc The Convolutional Neural Network (CNN) based object detection algorithms have demonstrated remarkable advantages in the field of pedestrian detection. However, the mainstream CNNs still face the problems of slow speed and low detection accuracy, especially on small and occluded targets from aerial perspective. In this paper, we propose Multi-Scale Attention YOLO (MSA-YOLO) detection algorithm to address the above issues. MSA-YOLO includes a Squeeze, Excitation and Cross Stage Partial (SECSP) channel attention module for CNNs to extract richer pedestrian features with a small number of extra parameters. It also contains a multi-scale prediction module to capture the information among different pedestrian scales, which can recognize the small objects with higher accuracy and significantly reduce the missed detection. To sufficiently evaluate our proposed model, we manually collect and annotate a new benchmark dataset, Luoyang Pedestrian Dataset \footnote{The dataset can be downloaded through this anonymous link: \url{https://drive.google.com/drive/folders/13po1FX7Qk5RDgb60-dzOi74cq_kqDJtM?usp=sharing} }, which has much more sample annotations, features, scenes and image view angles than the existing benchmark datasets. In addition, the images in our dataset have higher resolution than most of benchmark pedestrian detection datasets, which can provide more detailed features of pedestrians and thus improve the model performance. When tested on Luoyang Pedestrian Dataset, our proposed MSA-YOLO algorithm significantly outperform the most commonly used baseline models with almost the same model size. This shows the efficiency of our proposed model. (The code and new dataset will be released to the public later.)

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.

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.

Using traditional methods based on detection rules written by human security experts, there is a significant challenge in accurately detecting many network threats that are increasingly becoming sophisticated. In order to deal with the limitation of the traditional methods, network threat detection techniques utilizing artificial intelligence technologies such as machine learning are being extensively studied. Research has also been conducted on analyzing various string patterns in network packet payloads through natural language processing techniques to detect attack intent. However, due to the nature of packet payloads containing binary data as well as text data, a new approach is needed that goes beyond typical natural language processing techniques. In this paper, we study a token extraction method optimized for payloads using n-gram and byte pair encoding techniques. Furthermore, we generate embedding vectors that can understand the context of the packet payload using algorithms such as Word2Vec and FastText. We also compute the embedding of various header data associated with packets, such as IP addresses and ports. Given the combination of these features, we ensemble a text 1D-CNN and a multi-head attention network in a novel fashion. We validated the effectiveness of our classification technique with the CICIDS2017 open dataset and over half a million data collected by The Education Cyber Security Center (ECSC) currently operating in South Korea. The proposed model showed remarkable progress compared to previous studies, demonstrating a highly accurate classification performance with an F1-Score of 0.998. Our model can also preprocess and classify 150,000 network threats per minute to help security agents in the field divert their time to analyzing more complex attack patterns.

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.

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.

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.

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.

The problem of optimal scheduling in a system with parallel queues and a single server has been extensively studied in the queueing theory. However, such systems have mostly been studied by assuming homogeneous attributes of arrival and service processes, or in heterogeneous case a Markov random process was usually assumed. In this paper, we explore the possibility of combining simulation and neural network paradigms for optimal scheduling in a heterogeneous system with an arbitrary inter-arrival and service time distributions. The service of any queue by the server is exhaustive. Further routing of the server after the queue has been emptied is as instructed by the trained neural network. Any change in the queue that currently has a server is accompanied by a switching cost. The simulated annealing optimization algorithm which is used to optimize the parameters of the neural network was adapted for numerically evaluated average cost function. A Markov decision problem was formulated for the corresponding markovian queueing system to verify the results of solving the optimization problem. In addition to comparing the actual values of the average cost, the parameter values of the neural network trained on the optimal control policy of the Markov model are also used to determine the domains of parameters required for the simulated annealing defined on a finite discrete domain. Numerical analysis shows the effectiveness of this approach. Moreover, a comparison of the results for different distributions illustrates the insensitivity of the optimal control policy to the shape of the distributions for the same two first moments. Thus, the optimal control policy for an exponential model can be used as a suboptimal one for the general system.

Measuring pulmonary nodules accurately can help with early diagnosis of lung cancer, which can improve a patient’s chances of survival. Many methods for segmenting nodules have been developed, but they all rely on input from radiologists in the form of a 3D volume of interest (VOI) or use a constant region of interest (ROI) and only consider the presence of nodule within the given VOI. These approaches limit the networks’ ability to detect nodules outside the given VOI and can also include unnecessary structures in the VOI, leading to potentially inaccurate segmentation. In this work, we propose a novel approach for 3D lung nodule segmentation by using 2D region of interest (ROI) inputted from radiologist or computer-aided detection (CADe) system. Particularly, we design a dual-encoder-based hard attention network (DEHA-Net) which incorporates the full slice of thoracic computed tomography scan along with the ROI mask to produce an accurate segmentation mask of lung nodule in the given slice. The proposed architecture exploits the adaptive region of interest (A-ROI) algorithm to automatically investigates the penetration of lung nodule into surrounding slices while eliminating the need to drawing separate ROIs in each slice. Further, the framework performs the multi-view analysis, i.e., in sagittal and coronal views, to improve the segmentation performance. The proposed scheme has been rigorously evaluated on the lung image database consortium and image database resource initiative (LIDC/IDRI) dataset and an extensive analysis of results have been performed. The quantitative analysis shows that the proposed method not only improves the existing state-of-the-art in term of dice score but also, significantly robust against the different types, shape and dimensions of lung nodules.

The valorization of the large amount of crude glycerol formed from biodiesel industry, is of primordial necessity. One possible direction with high interest to the biorefiniery sector is the production of fuel additives as solketal, though the acetalization of glycerol with acetone. This is a chemical process that conciliates high sustainability and economic interest, since solketal contributes to the fullfilment of a Circular Economy Model through its use in biodiesel blends. The key to guarantee high efficiency and high sustainability for solketal production is the use of a recovery and recyclable heterogeneous catalyst. Some examples are already reported in the literature (first example in 2012), and this review intends to conciliate the information spreaded in this topic and established the most important reacional parameters and the main catalytic characteristics strategies to achieve high solketal production in short reaction time.

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.

For the traditional indoor visible light communication heterogeneous network switching algorithm is only concerned with the research of vertical switching algorithm, however, the research of horizontal vertical collaborative switching combined with multi-carrier modulation technology is seldom mentioned, based on the above, this paper proposes a horizontal-vertical collaborative switching strategy based on the residency time of the communication blind area. Firstly, we use asymmetrically clipped optical OFDM (ACO-OFDM) for signal processing to reduce the bit error rate (BER) of the system by reducing the multipath interference generated during signal transmission.Secondly, the BER is used to determine the communication blind area and to calculate its dwell time. Finally, the threshold time is set as the channel interruption time in the communication blind zone, and the horizontal-vertical cooperative switching is performed by comparing with the dwell time. The simulation results show that the average network throughput is 195.28Mbps, and the average number of handovers is 1.35. Compared with instant vertical handover (IVHO) scheme and dwell vertical handover (DVHO) scheme, the average network throughput is improved by 37.21% and 28.45%, respectively, and the average switching times are reduced by 28.05% and 5.27%, respectively.

In the remote sensing domain, it is crucial to complete semantic segmentation on the raster images, e.g., river, building, forest, etc, on raster images. A deep convolutional encoder--decoder (DCED) network is the state-of-the-art semantic segmentation method for remotely sensed images. However, the accuracy is still limited, since the network is not designed for remotely sensed images and the training data in this domain is deficient. In this paper, we aim to propose a novel CNN for semantic segmentation particularly for remote sensing corpora with three main contributions. First, we propose applying a recent CNN called a global convolutional network (GCN), since it can capture different resolutions by extracting multi-scale features from different stages of the network. Additionally, we further enhance the network by improving its backbone using larger numbers of layers, which is suitable for medium resolution remotely sensed images. Second, "channel attention'' is presented in our network in order to select the most discriminative filters (features). Third, "domain-specific transfer learning'' is introduced to alleviate the scarcity issue by utilizing other remotely sensed corpora with different resolutions as pre-trained data. The experiment was then conducted on two given datasets: (i) medium resolution data collected from Landsat-8 satellite and (ii) very high resolution data called the ISPRS Vaihingen Challenge Dataset. The results show that our networks outperformed DCED in terms of $F1$ for 17.48% and 2.49% on medium and very high resolution corpora, respectively.

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.

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.

This paper proposes an active-reactive power collaborative scheduling model with cluster division for the flexible distributed energy resources (DERs) of smart building system to resolve the high complexity of centralized optimal scheduling of massive dispersed DERs in the distribution network. Specifically, the optimization objective of each cluster is to minimize the operational cost, the power loss cost, and penalty cost for the flexibility deficiency, and the second-order cone-based branch flow method is utilized to convert the power flow equations into the linearized cone constraints, reducing the nonlinearity and heavy computation burden of the scheduling model. Customized virtual battery models for the building-integrated flexible DERs are developed to aggregate the power characteristics of flexible resources while quantifying their regulation capacities with time-shifting power and energy boundaries. Moreover, a cluster division algorithm considering the module degree index based on the electrical distance and flexible balance contribution index is formulated for cluster division to achieve the information exchange and energy interaction in the distribution network with high proportion of building-integrated flexible DERs. Comparative studies have demonstrated the superior performance of the proposed methodology on the economic merits and voltage regulation.

Microscopic vision plays an important role in automated micro-assembly. However, some uncertain factors in the assembly process, such as occlusion and stains can lead to the mistakes of feature extraction. Herein, to solve the problem, the deep learning techniques are introduced into the feature recognition tasks, focusing on the attention mechanism and visualizing CNNs for DL-based microscopic vision. The main contributions are summarized as follows: The CBAM attention mechanism is combined with the YOLOv5 algorithm to improve the accuracy and robustness of feature extraction. The micropart feature occlusion experiment results show that at 70% occlusion degree, YOLOV5-CBAM can reach 97.9% [email protected], which is 4.6% higher than the original one. Visualization analysis of DL-based model is conducted using Grad-CAM to make the decision result more transparent and avoid potential visual detection risks during assembly. The heatmap matching degree between GT area and high-light area is increased by 27.81% on average, which further verify the effectiveness of attention mechanism in micropart feature localization. Additionally, micropart surface stain and droplet quality classification models based on ResNet50 are trained to replace the manual sorting. The visual results are consistent with human eye discernment and judgement, confirming the reliability of parts and droplets sorting.

The learning equations of an ANN are presented, giving an extremely concise derivation based on the principle of backpropagation through the descendent gradient. Then, a reflection is developed on the dual attention network that applies the learning equations and coordinates subnetworks toward purposeful behaviors. Speculation is made on possible developments of functionalities that could provide additional skills and at the same time shed light on competencies typical of ``natural intelligence".

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.

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.

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.

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.

Considering characteristics of high river density, special underlying surface in plain river network region, and municipal drainage system function, river network drainage unit model is proposed, which is defined as a region surrounded by main river or embankment. Flood storage variety and control projects regulation of small rivers in each unit is simulated. With drainage catchment as an object, according to its drainage capacity, simplified municipal drainage model was developed. Coupling river network drainage unit model, simplified municipal drainage model and 2D flood routing model, urban flood analysis model for plain tidal river network region was developed, which could be applied to analyzing flood from upstream river, storm surge and local rainfall. Demonstration research was carried out in Puxi flood protected area in Shanghai.

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.

In today’s fast paced, attention-demanding society, executive functions and attentional resources are often taxed. Individuals need ways to sustain and restore these resources. We first review the concepts of attention and restoration, as instantiated in Attention Restoration Theory (ART). ART emphasizes the role of nature in restoring attention. We then discuss essentials of experiments on the causal influences of nature. Next, we expand the concept of ART to include modern, designed environments. We propose a wider perspective termed attentional ecology, in which attention behavior is viewed within a larger system involving the human and their interactions over time with environmental demands. When the ecology is optimal, mental functioning can be a positive “flow” that is productive, sustainable for the individual, and sometimes creative.

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}$.

M-polynomial of different molecular structures helps to calculate many topological indices. A topological index of graph G is a numerical parameter related to G which characterizes its molecular topology and is usually graph invariant. In the field of quantitative structure-activity (QSAR) quantitative structure-activity structure-property (QSPR) research, theoretical properties of the chemical compounds and their molecular topological indices such as the Zagreb indices, Randic index, Symmetric division index, Harmonic index, Inverse sum index, Augmented Zagreb index, multiple Zagreb indices etc. are correlated. In this report, we compute closed forms of M-polynomial, first Zagreb polynomial and second Zagreb polynomial of Octagonal network. From the M-polynomial we recover some degree-based topological indices for Octagonal network. Moreover, we give a graphical representation of our results.

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.

One of the most crucial elements in deeply understanding humans on a psychological level is manifested through facial expressions. The analysis of a human behavior can be informed by their facial expressions, making it essential to employ indicators such as expression (Expr), valence-arousal (VA), and action units (AU). In this paper, we introduce the method proposed in the Challenge of the 6th Workshop and Competition on Affective Behavior Analysis in-the-wild (ABAW) at CVPR 2024. Our proposed method utilizes the multi-modal Aff-wild2 dataset, which is splitted into spatial and audio modalities. For the spatial data, we extract features using a SimMiM model that was pre-trained on a diverse set of facial expression data. For the audio data, we extract features using a WAV2VEC model. To fusion the extracted spatial and audio features, we employed the cascaded cross-attention mechanism of a transformer.

Neurodegeneration is a major problem in neuroscience and medicine as it causes and worsens many neurological and psychiatric disorders. It involves gradual loss of neurons at different levels of the brain, affecting cognition, emotion, behavior, consciousness, and attention. Understanding the causes and consequences of neurodegeneration is crucial for identifying the risk factors, biomarkers, and treatments. However, the current therapies are mostly symptomatic and ineffective. Therefore, new and innovative methods, such as noninvasive brain stimulation (NIBS), are needed to modulate brain activity and plasticity in a safe and reversible manner. This field is rapidly developing, with a focus on exploring new clinical applications, mechanisms, and combinations of NIBS and drugs. This special issue covers the latest progress and challenges in the study of neurodegeneration in cognitive impairment and mood disorders from the experimental, clinical, and translational perspectives. It addresses the complexity and diversity of these conditions, the lack of disease-modifying treatments, the ethical and practical issues of conducting research in vulnerable and diverse populations, the integration and interpretation of data from multiple sources and modalities, and the development and validation of novel methods such as NIBS, artificial intelligence, and drug repurposing. Collaborative efforts among various stakeholders are needed to improve our knowledge and treatment of neurodegeneration underlying cognitive impairment and mood disorders.

For a graph G, let P(G, λ) be its chromatic polynomial. Two graphs G and H are said to be chromatically equivalent if P(G,λ) = P(H,λ). A graph is said to be chromatically unique if no other graph shares its chromatic polynomial. In this paper, chromatic polynomial of the necklace graph N_n, for n ≥ 2 has been determined. It is further shown that N₃ is chromatically unique.

We present a Deep Learning generative model specialized to work with graphs with a regular geometry. It is build on a Variational Autoencoder framework and employs Graph convolutional layers in both encoding and decoding phases. We also introduce a pooling technique (ReNN-Pool), used in the encoder, that allows to downsample graph nodes in a spatially uniform and highly interpretable way. In the decoder, a symmetrical un-pooling technique is used to retrieve the original dimensionality of graphs. Performance of the model are tested on the standard Sprite benchmark dataset, a set of 2D images of video game characters, adequately transforming images data into graphs, and on the more realistic use-case of a dataset of cylindrical-shaped graph data that describe the distributions of the energy deposited by a particle beam in a medium.

Optical backbone networks constitute the fundamental infrastructure employed today by network operators to deliver services to users. As network capacity is a key factor influencing optical network performance, it is important to understand how topological and physical properties impact its behavior and to have the capability to estimate its value. In this context, we propose here a method to evaluate the network capacity that relies on the optical reach to account for physical layer aspects, in conjunction with constrained routing techniques for traffic routing. As this type of routing can lead to traffic blocking, particularly due to the limitation on the number of wavelengths per fiber, we also propose a fiber assignment algorithm designed to deal with this problem. We apply this method to a set of randomly generated networks using a modified Waxman model, and for a network with 60 nodes, in a scenario without blocking, we obtain capacities of about 2.5 Pbit/s for a symbol rate of 64 Gbaud and about 5 Pbit/s for a symbol rate of 128 Gbaud. Remarkably, this duplication in the total network capacity is achieved by an increase in the total fiber length of only about 51%.

This paper presents control algorithms enabling autonomous heterogeneous trucks to drive in platoons. Heterogeneous trucks imply that the hardware information (e.g., truck length, break, accelerator, or engine) of a truck may be distinct from that of another truck. We define a platoon as a collection of trucks where a manually driven truck (leader truck) is followed by several automatically controlled following trucks. The proposed approach is to make every autonomous truck keep following the leader's trajectory while maintaining a designated distance from its predecessor truck. As far as we know, this paper is unique in developing both lateral maneuver and speed control considering a platoon of heterogeneous trucks. The efficiency of the proposed approach is verified using simulations.

Amid the swift progression of the global automobile industry, the aspiration for lightweight vehicle design has surfaced as a crucial approach to boost fuel efficiency and curtail environmental impact. The objective of this study revolves around achieving holistic optimization of vehicle structure via detailed scrutiny of vehicle process characteristics, amalgamated with a Back Propagation neural network (BPNN) optimized by a genetic algorithm (GA) and a topology optimization (TO) method.The process initiates with an examination of the vehicle's technical characteristics, succeeded by an optimization protocol that couples GA with BPNN. This exhaustive optimization procedure derives the best-fit values of design parameters and identifies the globally optimal lightweight design approach. Subsequently, a comprehensive structural optimization is actualized by modifying the topological distribution of the structure.A simulation experiment of the conceptual car body beam skeleton is conducted as a conclusive step, and the anti-collision capacity of the car body beam skeleton is assessed by measuring deformation intrusion. The findings reveal that in the vehicle topology optimization, a comparative analysis of pre and post-optimization results indicates an improved topological density across diverse sections. The topological density of the vehicle's frontal structure escalates from 0.75 to 0.8. Following optimization, the stiffness assessment records a marginal increase (within the range of 0.02–0.05), implying that the lightweight design does not compromise the general rigidity of the structure.The optimized body structure manifests superior crashworthiness in the crash test: the deformation intrusion diminishes by 27% in front-end collisions. In side impacts, the deformation and intrusion at critical points are reduced by 13.15% to 10% respectively. The comprehensive method proposed herein proves to be an efficient strategy to actualize the lightweight design of vehicles.

The application of artificial intelligence to point-of-care testing (POCT) disease detection has become a hot research field, in which breath detection which detects the patient's exhaled VOCs combined with sensor arrays of Convolutional Neural Network (CNN) algorithms as a new lung cancer detection is attracting more researchers' attention. However, due to low accuracy, high complexity computation and large number of parameters make the CNN algorithms difficult transplant to the embedded system of POCT devices. A lightweight neural network (LTNet) in this work is proposed to deal with this problem, and meanwhile, achieve high-precision classification of acetone and ethanol gases, which are respiratory markers for lung cancer patients. Compared to currently popular lightweight CNN models such as EfficientNet, LTNet has fewer parameters (32K) and its training weight size is only 0.155 MB. LTNet achieved an overall classification accuracy of 99.06% and 99.14% in the own mixed gas dataset and the University of California (UCI) dataset, which are both higher than that of the five existing models’, and it also offers the shortest training (844.38s and 584.67s) and inference time (23s and 14s) in the same validation set. Compared to the existing CNN models, LTNet is more suitable for resource-limited POCT devices.

This paper proposes two max-pooling engines, named the RTB-MAXP engine and the CMB-MAXP engine, with a scalable window size parameter for FPGA-based convolutional neural network (CNN) implementation. The max-pooling operation for the CNN can be decomposed into two stages, i.e., a horizontal axis max-pooling operation and a vertical axis max-pooling operation. These two one-dimensional max-pooling operations are performed by tracking the rank of the values within the window in the RTB-MAXP engine and cascading the maximum operations of the values in CMB-MAXP engine. Both the RBM-MAXP engine and the CMB-MAXP engine were implemented using VHSIC Hardware Description Language (VHDL) and verified by simulations. They have been employed for and tested in our CNN accelerator targeting at the CNN model YOLOv4-CSP-S-Leaky for object detection.

To efficiently use its finite resources, the visual system selects for further processing only a subset of the rich sensory information. Visual masking and spatial attention control the information transfer from visual sensory-memory to visual short-term memory. There is still a debate whether these two processes operate independently or interact, with empirical evidence supporting both arguments. However, recent studies pointed out that earlier studies showing significant interactions between common-onset masking and attention suffered from ceiling and/or floor effects. Our review of previous studies reporting metacontrast-attention interactions revealed similar artifacts. Therefore, we investigated metacontrast-attention interactions by using an experimental paradigm in which ceiling/floor effects were avoided. We also examined whether metacontrast masking is differently influenced by endogenous and exogenous attention. We analyzed mean absolute-magnitude of response-errors and their statistical distribution. Our results support the hypothesis that metacontrast and endogenous/exogenous attention are largely independent with negligible likelihood for interactions. Moreover, statistical modeling of the distribution of response-errors suggests weak interactions modulating the probability of “guessing” behavior for some observers in both types of attention. Nevertheless, our data suggest that any joint effect of attention and metacontrast can be adequately explained by their independent and additive contributions.

This paper describes a polynomial time algorithm for solving graph isomorphism and automorphism. We introduce a new tree data structure called Walk Length Tree. We show that such tree can be both constructed and compared with another in polynomial time. We prove that graph isomorphism and automorphism can be solved in polynomial time using Walk Length Trees.

Intense climate change and rapid urbanization have increased the risk of urban flooding, seriously affecting urban economic and social stability. Enhancing the urban flood resilience (UFR) has required a new solution to cope with urban flood disasters. In this study, taking Yingtan city as an example, a system of indicators for evaluating UFR was constructed, with 17 representative indicators, comprising three subsystems: socio-economic, ecological and infrastructural. A hybrid (FAHP-EWM)-TOPSIS model was applied, to develop an index-based measurement to compare and evaluate UFR, and Gray Relational Analysis (GRA) was used to discover the main factors affecting UFR. In addition, the natural discontinuous method was innovatively used to divide the UFR grade interval into levels, and the grade change was evaluated based on the TOPSIS method. The results showed that (1) from 2010 to 2022, the UFR in Yingtan City increased by 80.69%, and the factors affecting UFR are highly correlated with urban infrastructure development. However, the ecological resilience in the subsystem showed a fluctuating downward trend, because of the influence of the surface area of lakes and rivers. (2) The grades of UFR for Yingtan City increased from Level III (2010 and 2016) to Level IV (2022), with local financial expenditures and the age structure of the population being the main factors currently limiting the development of UFR. The study provides a theoretical basis for the construction of an indicator system for assessing the UFR of Yingtan and proposes practical improvement directions for UFR.

Anomaly detection and segmentation aim at distinguishing abnormal images from normal images and further localizing the anomalous regions. Feature reconstruction based method has become one of the mainstream methods for this task. This kind of method has two assumptions: (1) The features extracted by neural network is a good representation of the image. (2) The autoencoder solely trained on the features of normal images cannot reconstruct the features of anomalous regions well. But these two assumptions are hard to meet. In this paper, we propose a new anomaly segmentation method based on feature reconstruction. Our approach mainly consists of two parts: (1) We use a pretrained vision transformer (ViT) to extract the features of the input image. (2) We design a self-attention autoencoder to reconstruct the features. We regard that the self-attention operation which has a global receptive field is beneficial to the methods based on feature reconstruction both in feature extraction and reconstruction. The experiments show that our method outperforms the state-of-the-art approaches for anomaly segmentation on the MVTec dataset. It is both effective and time-efficient.

Fine chemicals are produced in small annual volume batch processes (often <10,000 tonnes per year), with a high associated price (usually > $10/kg). As a result of their usage in the production of speciality chemicals, in areas including agrochemicals, fragrances and pharmaceuticals, their necessity will remain high for the foreseeable future. This review article assesses current methods used to produce fine chemicals with heterogeneous catalysts, including both well-established methods as well as newer experimental methods. A wide range of methods utilising microporous and mesoporous catalysts has been explored, including their preparation and modification before use in industry. Their potential drawbacks, as well as benefits, have been analysed, with their feasibility compared to newer, recently emerging catalysts. The field of heterogeneous catalysis for fine chemical production is a dynamic and ever-changing area of research. This deeper insight into catalytic behaviour and material properties will produce more efficient, selective, and sustainable processes in the fine chemical industry. The findings from this article will provide an excellent foundation for further exploration and a critical review in this field of fine chemical production using micro- and mesoporous heterogeneous catalysts.

In this short review paper we have assembled the main characteristics of partial oxidation reactions (oxidative dehydrogenation and selective oxidation to olefins or oxygenates, as aldehydes and carboxylic acids and nitriles), as well as total oxidation, particularly for depollution, environmental issues and wastewater treatments. Both gas-solid and liquid-solid media have been considered with recent and representative examples within these fields. We have also discussed about their potential and prospective industrial applications. Particular attention has been brought to new raw materials stemming from biomass and to liquid-solid catalysts cases. This review paper also summarizes the progresses made in the use of unconventional activation methods for performing oxidation reactions, highlighting the synergy of these technologies with heterogeneous catalysis. Focus has been centered on usual catalysts activation methods but also on less usual ones, such as the use of ultrasounds, microwaves, grinding (mechanochemistry) and photo-activated processes, as well as their combined use.