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.

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.

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

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 rapid developments that have been made in computer vision and computer technology, semantic segmentation of high-resolution images has emerged as a mainstream and challenging task. The, segmentation of water areas remains a complex task due to the similar features between water areas or between water areas and other land objects. Meanwhile, since coastlines and riverbanks are typically presented in irregular shapes, it is difficult to obtain the categories of pixels at boundaries. This paper proposed the use of a Water-Land Boundary Attention Network (WLBANet) to improve the accuracy of pixels at boundaries between water and land. This network also reinforced the performance of contextual information extraction into distinguishing between water areas and other land objects. To prove the validity of this proposed network, WLBANet was performed on the Water Land Dataset (WLD), which is also by this paper, and which contains water areas and other land objects categories. The results demonstrates that the proposed method has significant effectiveness.

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

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

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.

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.

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

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

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.

The AUC-ROC is a widespread measure to assess the performance of a binary classification model across various discrimination thresholds. Yet, it is not apt for unbalanced class problems and is misleading for early retrieval. For instance, link prediction in complex networks is an unbalanced early retrieval problem, whose goal is to offer a ranking of the nonobserved network links, prioritizing a small cohort of positive links (for which we are sure the labels are reliable) on top of a list largely populated by unlabeled links (for which the labels are uncertain). Differently from binary classification, here the evaluation focuses on how the predictor prioritizes the positive class, because the negative class does not exist and is replaced by an unlabeled class. For decades, scholars have been investigating the necessity to correct and to generalize the AUC-ROC to work for both unbalanced classification and early retrieval evaluation, this is requested in many applied domains of computational science. Here we propose the area under the magnified ROC (AUC-mROC), a new measure that adjusts the standard AUC-ROC to work for unbalanced early retrieval problems such as link prediction. Finally, we introduce the area under the generalized ROC (AUC-gROC), which unifies both AUC-mROC and AUC-ROC to provide a universal and reliable evaluation measure that can work for both classification and early retrieval problems, regardless of class proportion.This discovery represents a critical achievement, culminating in success after decades of contentious research. Its solution promises to significantly impact various domains within applied computational science.

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.

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.

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.

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.

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.

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

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

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.

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.

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

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.

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.

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.

Many studies utilize sensors to measure foot plantar pressure and analyze gait patterns, often focusing on assessing weight-bearing symmetry or asymmetry compared to control groups. However, a critical question arises: does the selection of the control group significantly impact study outcomes? Does chronic low back pain affect foot plantar pressure measurements? This experimental study involved 23 participants, including healthy individuals and those without foot disorders but with chronic low back pain. Dynamic foot pressure measurements were conducted using the Ortopiezometr, and data were analyzed using the "Steps" program. Participants were divided into two groups: Group 1 comprised completely healthy individuals, while Group 2 consisted of individuals without foot problems but with moderate chronic low back pain. The findings highlight a prevalence of energy release in the forefoot sensors compared to the hindfoot for both the right and left legs in most cases. Even among healthy volunteers, achieving perfect symmetry in the maximum values on the sensors for the right and left feet was a challenge. Results showed no statistically significant differences in energy released on specific sensors or duration of gait phases between the groups. Essentially, this suggests that foot pressure patterns are comparable between healthy individuals and those with low back pain. The use of sensor-equipped inserts for pedobarographic examinations indicates that, in cases of degenerative changes in the lumbar and sacral spine without accompanying acute pain, gait patterns resemble those of the healthy population.

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.

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

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

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

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

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

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

Focusing on the problem of identifying and classifying aero-engine models, this paper measures the infrared spectrum data of aero-engine hot jets using a telemetry Fourier transform infrared spectrometer. Simultaneously, infrared spectral data sets with the six different types of aero-engines are created. For the purpose of classifying and identifying infrared spectral data, a CNN architecture based on the continuous wavelet transform peak seeking attention mechanism (CWT-AM-CNN) is suggested. This method calculates the peak value of middle wave band by continuous wavelet transform, and the peak data is extracted by the statistics of the wave number locations with high frequency. Attention mechanism is used for the peak data, and the attention mechanism is weighted to the feature map of the feature extraction block. The training set, vali-dation set and prediction set are divided in the ratio of 8:1:1 for the infrared spectral data sets. For three different data sets, CWT-AM-CNN proposed in this paper is compared with the classical classifier algorithm based on CO2 feature vector and the popular AE, RNN and LSTM spectral processing networks. The prediction accuracy of the proposed algorithm in the three data sets is as high as 97%, and the lightweight network structure design not only guarantees high precision, but also has a fast running speed, which can realize the rapid and high-precision classification of the infrared spectral data of the aero-engine hot jets.

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.

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.

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.

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.

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.

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, 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 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, showing 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.

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.

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

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.

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.

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.

Traditional 3D reconstruction models have consistently encountered a challenge: attaining high recall of object edges while preserving precision. In this paper, we introduce a post-processing method Multi-Head Attention Refiner (MA-R) aimed at tackling this challenge by integrating a multi-head attention mechanism within the U-Net style refiner module. The 3D reconstruction model applying this method demonstrates excellence in parsing intricate image details, resulting in significant enhancement of boundary predictions and increased recall rates. In our experiments, our method significantly enhances the reconstruction performance of Pix2Vox++ when multiple images are utilized as input. Specifically, it achieves an enhanced Intersection Over Union score of approximately 1.1% compared to the original Pix2Vox++ model when 16-view images are employed.

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

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

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

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

To address the problems of insufficient semantic fusion between text and questions and the lack of consideration of global semantic information encountered in machine reading comprehension models, we proposed a machine reading comprehension model called BERT_hybrid based on BERT and hybrid attention mechanism. In this model, BERT is utilized to separately map the text and questions into the feature space. Through the integration of Bi-LSTM, attention mechanism, and self-attention mechanism, the proposed model achieves comprehensive semantic fusion between text and questions. The probabilities distribution of answers is computed using Softmax. Experimental results on the public dataset DuReader demonstrate that the proposed model achieves improvements in BLEU-4 and ROUGE-L scores compared to existing models. Furthermore, to validate the effectiveness of the proposed model design, we analyze the factors influencing the model’s performance.

Multimodal emotion classification (MEC) involves analyzing and identifying human emotions by integrating data from multiple sources, such as audio, video, and text. This approach leverages the complementary strengths of each modality to enhance the accuracy and robustness of emotion recognition systems. However, one significant challenge is effectively integrating these diverse data sources, each with unique characteristics and levels of noise. Additionally, the scarcity of large, annotated multimodal datasets in Bangla limits the training and evaluation of models. In this work, we unveiled a pioneering multimodal Bangla dataset, MAViT-Bangla (Multimodal Audio Video Text Bangla dataset). This dataset, comprising 1002 samples across audio, video, and text modalities, is a unique resource for emotion recognition studies in the Bangla language. It features emotional categories such as anger, fear, joy, and sadness, providing a comprehensive platform for research. Additionally, we developed a framework for emotion recognition that employs a cross-modal attention mechanism among unimodal features. This mechanism fosters the interaction and fusion of features from different modalities, enhancing the model’s ability to capture nuanced emotional cues. The effectiveness of this approach was demonstrated by achieving an F1-score of 0.64, a significant improvement over unimodal methods.

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

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.

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.

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.)

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

With the development of deep learning, the Super-Resolution (SR) reconstruction of microscopic images has improved significantly. However, the scarcity of microscopic images for training, the underutilization of hierarchical features in original Low Resolution (LR) images, and the high-frequency noise unrelated with the image structure generated during reconstruction process are still challenges in the Single Image Super-Resolution (SISR) field. Faced with these issues, we first collected sufficient microscopic images through Motic, a company engaged in the design and production of optical and digital microscopes, to establish a dataset. Secondly, we proposed a Residual Dense Attention Generative Adversarial Network (RDAGAN). The network comprises a generator, an image discriminator, and a feature discriminator. The generator includes a Residual Dense Block (RDB) and a Convolutional Block Attention Module (CBAM), focusing on extracting the hierarchical features of the original LR image. Simultaneously, the added feature discriminator enables the network to generate high-frequency features pertinent to the image’s structure. Finally, we conducted experimental analysis and compared our model with six classic models. Compared with the best model, our model improved PSNR and SSIM by about 1.5dB and 0.2, respectively.

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.

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.

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.

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

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

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

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.

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

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.

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.

Real-time object detection remains a pivotal topic in the realm of computer vision. Balancing the accuracy and speed of object detectors poses a formidable challenge for both academic researchers and industry practitioners. While recent transformer-based models have showncase the prowess of the attention mechanism, delivering remarkable performance improvements over CNNs, their computational demands can hinder their effectiveness in real-time detection tasks. In this paper, we elect to use YOLOX as our robust starting point and introduce a series of effective enhancements, culminating in a new high-performance detector named YOLOAX. To further exploit the power of the attention mechanism, we devise multi-dimensional attention-based modules that activate CNNs, emphasizing the most pertinent regions and bolstering the capacity to learn the most informative image representations from feature maps. Moreover, we introduce a novel leading label assignment strategy called STA, along with a groundbreaking loss function named GEIOU Loss, to further refine our detector's performance. We provide extensive ablation studies on the COCO and PASCAL VOC 2012 detection datasets to validate our proposed methods. Remarkably, our YOLOAX is trained solely on the MS-COCO dataset from scratch, without leveraging any prior knowledge, which achieves an impressive 54.2% AP on the COCO 2017 test set while maintaining a real-time speed of 72.3 fps, surpassing YOLOX by a significant margin of 3.0% AP. Our source code and pre-trained models are openly accessible at https://github.com/KejianXu/yoloax.

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.

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

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

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

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.

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

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.

To enhance the safety of power grid operations, this study proposes a high-precision short-term photovoltaic power prediction method that integrates information from surrounding pho-tovoltaic stations and the Conv-LSTM-ATT model. In the deep learning prediction model, not only is numerical weather prediction (NWP) data from the target photovoltaic station used as input features, but also highly correlated features from nearby photovoltaic stations are incor-porated. The research begins by analyzing the correlation between irradiance and power se-quences, along with distance factors, to calculate a composite similarity index between the target and other regional photovoltaic stations. Stations with high similarity indices are then selected as data sources. Subsequently, Bayesian optimization techniques are employed to find the optimal data fusion ratios. Ultimately, using the selected data, power prediction mod-eling is conducted via the Conv-LSTM-ATT deep neural network. Experimental results con-firm the superiority of the proposed model, which demonstrates higher predictive accuracy compared to three other classical models. The data fusion strategy determined by Bayesian optimization significantly enhances prediction accuracy, reducing the root mean square error (RMSE) of the test set by 20.04%, 28.24%, and 30.94% for three weather types, respectively.

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

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

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

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

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".