Hyperspectral small target detection (HSTD) is a promising pixel-level detection task. However, due to the low contrast and imbalance number between the target and background spatially and high dimensions spectrally, it is a challenging one. To address these issues, this work proposes a representation learning-based graph and generative network for hyperspectral small target detection. The model builds a fusion network through frequency representation for HSTD, where the novel architecture incorporates irregular topological data and the spatial-spectral feature to improve its representation ability. Firstly, a graph convolutional network (GCN) module better models the non-local topological relationship between samples to represent the hyperspectral scene’s underlying data structure. The mini-batch-training pattern of the GCN decreases the high computational cost of building an adjacency matrix for high-dimensional data sets. In parallel, the generative model enhances the differentiation reconstruction and the deep feature representation ability with respect to the target spectral signature. Finally, a fusion module compensates for the extracted different types of HS features and integrates their complementary merits for hyperspectral data interpretation while increasing detection and background suppression capabilities. Experiments on different hyperspectral data sets demonstrate the advantages of the proposed architecture.

This work considers the task of representation learning on the attributed relational graph (ARG). Both the nodes and edges in an ARG are associated with attributes/features allowing ARGs to encode rich structural information widely observed in real applications. Existing graph neural networks offer limited ability to capture complex interactions within local structural contexts, which hinders them from taking advantage of the expression power of ARGs. We propose Motif Convolution Module (MCM), a new motif-based graph representation learning technique to better utilize local structural information. The ability to handle continuous edge and node features is one of MCM’s advantages over existing motif-based models. MCM builds a motif vocabulary in an unsupervised way and deploys a novel motif convolution operation to extract the local structural context of individual nodes, which is then used to learn higher-level node representations via multilayer perceptron and/or message passing in graph neural networks. When compared with other graph learning approaches to classifying synthetic graphs, our approach is substantially better in capturing structural context. We also demonstrate the performance and explainability advantages of our approach by applying it to several molecular benchmarks.

The prediction of drug--target interactions is always a key task in the field of drug redirection. However, traditional methods of predicting drug--target interactions are either mediocre or rely heavily on data stacking. In this work, we merged heterogeneous graph information and obtained effective node information and substructure information based on mutual information in graph embeddings. We then learned high quality representations for downstream tasks, and proposed an end--to--end auto--encoder model to complete the task of link prediction. Experimental results show that our method outperforms several state--of--art models. The model can achieve the area under the receiver operating characteristics (AUROC) curve of 0.959 and area under the precise recall curve (AUPR) of 0.848. We found that the mutual information between the substructure and graph--level representations contributes most to the mutual information index in a relatively sparse network. And the mutual information between the node--level and graph--level representations contributes most in a relatively dense network.

Indoor scene recognition has great significance for intelligent applications such as mobile robots, location-based services (LBS) and so on. Wherever we are or whatever we do, we are under a specific scene. The human brain can easily discern a scene with a quick glance. However, for a machine to achieve this purpose, on one hand, it often requires plenty of well-annotated data which is time-consuming and labor-intensive. On the other hand, it is hard to learn effective visual representations due to large intra-category variation and inter-categories similarity of indoor scenes. To solve these problems, in this paper, we adopted an unsupervised visual representation learning method which can learn from unlabeled data with a Siamese Convolutional Neural Network (Siamese ConvNet) and graph-based constraints. Specifically, we first mined relationships between unlabeled samples with a graph structure. And then, these relationships can be used as supervision for representation learning with a Siamese network. In this method, firstly, a k-NN graph would be constructed by taking each image as a node in the graph and its k nearest neighbors are linked to form the edges. Then, with this graph, cycle consistency and geodesic distance would be considered as criteria for positive and negative pairs mining respectively. In other words, by detecting cycles in the graph, images with large differences but in the same cycle can be considered as same category (positive pairs). By computing geodesic distance instead of Euclidean distance from one node to another, two nodes with large geodesic distance can be regarded as in different categories (negative pairs). After that, visual representations of indoor scenes can be learned by a Siamese network in an unsupervised manner with the mined pairs as inputs. In order to evaluate the proposed method, we tested it on two scene-centric datasets, MIT67 and Places365. Experiments with different number of categories have been conducted to excavate the potential of proposed method. The results demonstrated that semantic visual representations for indoor scenes can be learned in this unsupervised manner. In addition, with the learned visual representations, indoor scene recognition models trained with the learned representations and a few of labeled samples can achieve competitive performance compared to the state-of-the-art approaches.

Background. The Stanford Health Assessment Questionnaire-Disability Index (HAQ) is widely used to measure functional ability in persons with Rheumatoid Arthritis (RA). The instrument was developed with limited involvement from persons with RA, and their perception of the instrument has not been studied in depth. The aim of this study was to explore how persons with RA experience the use of the HAQ in care. Methods. Forty persons with RA were purposefully recruited to participate in semi-structured interviews. The interviews were then analyzed qualitatively using thematic analysis. Results. The participants questioned the relevance of the HAQ but nevertheless experienced that the instrument had a profound effect on their understanding of health and how care is delivered. The analysis resulted in three themes: Problems with individual items, meaning of the summative score, and effects on care and health perceptions. Conclusions. To make the HAQ relevant to persons with RA, it needs to be revised or to include an option to select items most meaningful to the respondent. To ensure relevance, the HAQ update should preferably be co-created by researchers, clinicians and persons with RA.

The realm of natural language processing has always been fascinated by the intricacies of sentence semantics. The emergence of context-aware word representations, especially from pre-trained models like ELMO and BERT, has revolutionized several semantic tasks including but not limited to, question answering, text categorization, and sentiment analysis. Despite these advancements, the integration of supplementary knowledge, particularly syntactic, to augment semantic comprehension in models remains an area ripe for exploration. This paper introduces the Syntactic Enhancement Network (SEN), a pioneering method for synergizing syntactic elements with established pre-trained language models. Our approach encompasses a dual-phase evaluation: initially, we delve into the syntactic augmentation of both RNN-based and Transformer-based language models; subsequently, we test our SEN's proficiency in two specific domains: the task of sentence completion and the extraction of biological relationships. The results are striking, with SEN achieving a stellar 91.2% accuracy in sentence completion—surpassing baseline models by a substantial 37.8%. In the context of biological relation extraction, SEN demonstrates competitive prowess with a 75.1% F1 score.

The present grievous situation of the tuberculosis disease can be improved by efficient case management and timely follow-up evaluations. With the advent of digital technology this can be achieved by quick summarization of the patient-centric data. The aim of our study was to assess the effectiveness of the ODK Scan paper-to-digital system during testing period of three months. A sequential, explanatory mixed-method research approach was employed to elucidate technology use. Training, smartphones, application and 3G enabled SIMs were provided to the four field workers. At the beginning, baseline measures of the data management aspects were recorded and compared with endline measures to see the impact of ODK Scan. Additionally, at the end, users’ feedback was collected regarding app usability, user interface design and workflow changes. 122 patients’ records were retrieved from the server and analysed for quality. It was found that ODK Scan recognized 99.2% of multiple choice bubble responses and 79.4% of numerical digit responses correctly. However, the overall quality of the digital data was decreased in comparison to manually entered data. Using ODK Scan, a significant time reduction is observed in data aggregation and data transfer activities, however, data verification and form filling activities took more time. Interviews revealed that field workers saw value in using ODK Scan, however, they were more concerned about the time consuming aspects of the use of ODK Scan. Therefore, it is concluded that minimal disturbance in the existing workflow, continuous feedback and value additions are the important considerations for the implementing organization to ensure technology adoption and workflow improvements.

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.

Despite the existing effective treatment methods, tuberculosis (TB) is the second most deadly infectious disease globally, its carriers in the latent and active phases accounting for more than 20% of the world population. An effective method to control TB and reduce the mortality is regular population screening and diagnosis of the latent form of TB in order to take preventive and curative measures. Numerous methods allow diagnosing TB and directly detecting Mycobacterium tuberculosis (M.tb) biomarkers, including M.tb DNA, proteins, and specific metabolites, as well as antibodies produced by the host immune system in response to M.tb. PCR, ELISA, immunofluorescence and immunochemical analyses, flow cytometry, and other methods allow the detection of M.tb biomarkers or the host immune response to M.tb by recording the optical signal of fluorescent or colorimetric dyes included in the diagnostic tools. Current research in biosensors is aimed at increasing the sensitivity of detection, which can be achieved by using brighter and more photostable optical tags containing fluorescent quantum dots. Here, we review current methods for detection of M.tb biomarkers using optical sensor systems, primarily quantum dot–based nanosensors, and summarize M.tb biomarkers whose detection can be made significantly more sensitive by using quantum dot–based nanosensors.

This paper investigates the integration of Graph Neural Networks (GNNs) and incremental learning for blockchain applications, with a focus on fraud detection, anomaly detection, and smart contract verification. By leveraging graph structure exploitation, GNNs can propagate information across nodes, reducing label dependency. Incremental learning enhances the model's adaptability to evolving blockchain networks, allowing continual learning without full retraining. Together, these technologies provide a scalable, efficient solution for improving security, performance, and adaptability in decentralized financial systems and smart contract environments.

With the exponential growth of internet usage and mobile devices, the volume of user behavior data has surged, offering significant opportunities and challenges for businesses. This paper explores user behavior analysis in the context of big data, highlighting its pivotal role in driving innovation and strategic decision-making. We begin by discussing the importance of user behavior data and reviewing technological advancements such as machine learning, natural language processing, and data mining that enable deep insights into user behavior. Through a case study on linguistic analysis in livestreaming e-commerce, we demonstrate how text-mining techniques can correlate linguistic characteristics with sales performance, providing actionable marketing insights. We further explore the broader business applications, including personalized recommendations, user portraits, product design, and strategic decision-making. Technical and ethical challenges, such as data integration, privacy concerns, and algorithmic bias, are also addressed. The paper concludes with a discussion on future trends, such as AI and ML advancements, edge computing, IoT proliferation, and ethical AI frameworks, poised to shape user behavior analysis. Our findings underscore the transformative potential of user behavior data in enhancing business operations and user experiences, providing recommendations for future research focused on real-time analytics, privacy-preserving techniques, and ethical implications of data-driven decisions.

The paradigm of leveraging code as a dataset has recently gained traction, offering innovative solutions in domains such as automated commit message generation, pull request description automation, and program repair mechanisms. Consider the challenge in generating commit messages: traditional methods treat source code as a mere token sequence, applying neural machine translation models. This approach, however, overlooks the critical syntactic structures inherent in programming languages, which could offer deeper insights and improved accuracy. Building upon prior research, specifically the Code2Seq framework, which utilized Abstract Syntax Tree (AST) structural data for source code representation to automate method name generation, this paper extends and refines this concept. We introduce "CSR", a novel methodology adapted to represent code edits effectively. This paper investigates the impact of employing syntactic structure, focusing on the classification of code edits. Drawing inspiration from Code2Seq, "CSR" utilizes AST's structural properties, particularly the paths connecting leaf nodes, to enhance the task of code edit classification. This approach is rigorously evaluated on two distinct datasets, comprising fine-grained syntactic edits. Our comprehensive experiments reveal that incorporating syntactic structures does not significantly outperform simpler methodologies. While methods like Code2Seq and our proposed "CSR" show potential, our findings highlight that there is considerable scope for improvement and refinement before such techniques can be universally applied for learning representations of code edits. We anticipate that our findings will spark further research in this field, paving the way for more effective use of syntactic structures in code representation.

This study examines the contribution of early executive functions (EFs) in the association between fluency in reading and arithmetic. Kindergarten children (N = 1,185) were assessed on Executive Functions skills and on reading and arithmetic fluency in Grade 1 and Grade 3. The analysis revealed that beyond the connection within each domain there is a unidirectional effect between fluency measures, with Grade 1 reading fluency significantly influencing the development of arithmetic fluency in Grade 3. Furthermore, the findings indicate that kindergarten EFs significantly contribute to arithmetic fluency at both time points and to reading fluency in the first grade. Early EF skills also emerged as a mediator of associations between fluency performance in reading and arithmetic, suggesting that the influence of EFs extends beyond individual academic domains. These findings have implications for understanding the cognitive mechanisms that underlie the relations between these academic skills.

Graph neural networks (GNNs) build on the success of deep learning models by extending them for use in graph spaces. Transfer learning has proven extremely successful for traditional deep learning problems: resulting in faster training and improved performance. Despite the increasing interest in GNNs and their use cases, there is little research on their transferability. This research demonstrates that transfer learning is effective with GNNs, and describes how source tasks and the choice of GNN impact the ability to learn generalisable knowledge. We perform experiments using real-world and synthetic data within the contexts of node classification and graph classification. To this end, we also provide a general methodology for transfer learning experimentation and present a novel algorithm for generating synthetic graph classification tasks. We compare the performance of GCN, GraphSAGE and GIN across both the synthetic and real-world datasets. Our results demonstrate empirically that GNNs with inductive operations yield statistically significantly improved transfer. Further we show that similarity in community structure between source and target tasks support statistically significant improvements in transfer over and above the use of only the node attributes.

This research investigates the application of Fused Filament Fabrication (FFF) in producing WC-10Co hardmetals, focusing binder formulations and understanding its influence on extrusion force and the influence of printing variables on green density of the samples. By examining the interplay between different binder compositions and backbone contents, the study aims to enhance the mechanical properties of the sintered parts while reducing defects inherent in the printing process. Evidence suggested that formulated feedstocks influenced the hardness of the sintered hardmetal, not due to microstructural changes but to macrostructural responses like macro defects introduced during printing, debinding and sintering of the samples. The results demonstrate the critical role of PP-MA content in improving part density and sintered hardness, suggesting the need for specific thermal debinding protocols tailored to each feedstock. The study provides insights into the formulation of feedstocks for hardmetal FFF, proposing a path toward refining manufacturing processes for better quality and performance of 3D printed hardmetal components.

This paper proposes a Grouped Contrastive Learning of self-supervised Sentence Representation (GCLSR), which can learn an effective and meaningful representation of sentences. Previous works maximize the similarity between two vectors to be the objective of contrastive learning, suffering from the high-dimensionality of the vectors. In addition, most previous works have adopted discrete data augmentation to obtain positive samples and directly employed contrastive framework of computer vision to perform contrastive training, which could hamper contrastive training because text data is discrete and sparse compared with image data. To address those issues, we propose a grouped contrastive learning framework, i.e., GCLSR, which divides the high-dimensional feature vector into several groups and respectively computes the groups’ contrastive losses to make use of more local information, eventually obtaining a more fine-grained sentence representation. In addition, in GCLSR, we design a new self-attention mechanism and a continuous as well as partial word vector augmentation (PWVA). For the discrete and sparse text data, the usage of self-attention could help model focus the informative words by measuring the importance of every word in a sentence. By using the PWVA, GCLSR can obtain high-quality positive samples used for contrastive learning. Experimental results demonstrate that our proposed GCLSR achieves an encouraging result on the challenging datasets of the standard semantic textual similarity (STS) task and transfer task.

The ability to decode words accurately at an early age strongly predicts reading competence later on. Decoding-challenged children may find it difficult to understand texts, which might impede their overall academic development. Strong word decoding skills accelerate the process of learning vocabulary and grammar rules in a variety of languages. The paper aimed to collect relevant literature regarding word decoding ability in the world of the language acquisition process. Policymakers and educators will be greatly impacted by realizing how crucial word decoding is to language learning. Providing targeted interventions for struggling readers, encouraging a positive reading culture, and explicitly teaching phonological and orthographic abilities are all essential components of effective reading education. Promoting decoding proficiency also requires making sure that people have access to excellent reading materials and tools. In order to enable learners to become great readers and communicators across linguistic and cultural boundaries, educators and policymakers should prioritize phonemic awareness from an early age and use effective teaching methodologies.

Employing phonemic awareness in language development can lead to transformative educational outcomes. Having mastered this skill, students have a good foundation in language comprehension, writing, and reading, which increases their chances of academic achievement. This change can affect entire classrooms and schools, fostering a culture of literacy and academic performance, rather than just a select few students. The aim of the study is to gather literature that offers substantial information about this topic based on the facts presented. The overwhelming body of research points to the benefits of teaching phonemic awareness in early childhood education. The foundation of transformative education is phonemic awareness, which fosters fundamental language and reading skills. This profound effect emphasizes how crucial phonemic awareness is to the teaching process. Educators can use phonemic awareness to boost students' language development and create a transformative learning environment by putting these guidelines into practice.

AI tools provide individualized learning experiences tailored to specific language learners' requirements. Artificial intelligence-driven programs can customize lessons, exercises, and feedback by evaluating a learner's progress and determining strengths and shortcomings. This individualized method aids students in concentrating on their areas of weakness, thus improving their total language competency. This narrative literature review aims to gather relevant literature discussing AI tools as supplementary support in aiding a learner's language acquisition. Relevant studies stated that there are a lot of chances to improve learning outcomes when AI tools are used in language acquisition. Teachers who want to give their students more resources and help should consider including these tools in their lessons. To preserve the interpersonal and cultural components of language learning, it is imperative to strike a balance between the application of AI and conventional teaching techniques. AI tools are always accessible, providing assistance to learners whenever needed. This is especially helpful for individuals with unpredictable schedules or restricted access to conventional language learning materials.

This study innovates upon the field of dialog-driven query resolution (DDQR) utilizing knowledge graphs (KGs). Traditional methods in DDQR predominantly depend on fully supervised signals that presuppose the existence of perfect logical forms for queries. This reliance on gold logical forms for answer extraction is impractical in diverse real-world applications. When such forms are absent, contemporary methods, which lean on weak supervisory signals or employ heuristic and reinforcement strategies, recast DDQR as a knowledge graph path optimization problem. Despite the non-availability of gold logical forms, the rich conversational context provided by comprehensive dialog histories and domain-specific knowledge can be leveraged to optimize path selection in KGs effectively. We introduce an advanced method, termed CONVEX (CONVersational EXploration), which utilizes contrastive learning for path ranking. CONVEX addresses critical challenges by enabling learning under weak supervision and integrating the conversational context to enhance the representation quality for more effective path discrimination. Extensive evaluations of CONVEX on established benchmarks demonstrate its superiority across various metrics over current methods, notably improving Mean Reciprocal Rank (MRR) and Hit@5 by up to 20 and 36 percentage points respectively.

Incorporating knowledge graphs as auxiliary information to enhance recommendation systems can improve the representations learning of users and items. Recommendation methods based on knowledge graph can introduce user-item interaction learning into the item graph, focusing only on learning the node vector representations within a single graph; alternatively, they can treat user-item interactions and item graphs as two separate graphs and learn from each graph individually. Learning from two graphs has natural advantages in exploring original information and interaction information, but faces two main challenges: 1) in complex graph connection scenarios, how to adequately mine the self-information of each graph, and 2) how to merge interaction information from the two graphs while ensuring that user-item interaction information predominates. Existing methods do not thoroughly explore the simultaneous mining of self-information from both graphs and effective interaction information, leading to the loss of valuable insights. Considering the success of contrastive learning in mining self-information and auxiliary information, this paper proposes a dual-graph contrastive learning recommendation method based on knowledge graphs (KGDC) to explore a more accurate representations of users and items in recommendation systems based on external knowledge graphs. In the learning process within the self-graph, KGDC has strengthened and represented the information of different connecting edges in both graphs, and extracted the existing information more fully. In interactive information learning, KGDC reinforces the interaction relationship between users and items in the external knowledge graph, realizing the leading role of the main task. We have conducted a series of experiments on three standard datasets, and the results show that the proposed method can achieve better results.

The study introduces a novel method to identify potential citation manipulation in academic papers using perturbations of a deep embedding model, incorporating Graph Masked Autoencoders. This approach integrates textual information with graph connectivity evidence, resulting in a more sophisticated model of citation distribution. By training a deep network using partial data and reconstructing masked connections, the method leverages the inherent characteristics of central connections under network perturbations. Quantitative evaluations demonstrate its remarkable ability to pinpoint trustworthy citations in the analyzed data and raise concerns about potentially unreliable references due to potential manipulation.

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.

With the rapid development of Internet and the widely usage of smart devices, massive multimedia data are generated, collected, stored and shared on the Internet. This trend makes cross-modal retrieval problem become a hot issue in this years. Many existing works pay attentions on correlation learning to generate a common subspace for cross-modal correlation measurement, and others uses adversarial learning technique to abate the heterogeneity of multi-modal data. However, very few works combine correlation learning and adversarial learning to bridge the inter-modal semantic gap and diminish cross-modal heterogeneity. This paper propose a novel cross-modal retrieval method, named ALSCOR, which is an end-to-end framework to integrate cross-modal representation learning, correlation learning and adversarial. CCA model, accompanied by two representation model, VisNet and TxtNet is proposed to capture non-linear correlation. Beside, intra-modal classifier and modality classifier are used to learn intra-modal discrimination and minimize the inter-modal heterogeneity. Comprehensive experiments are conducted on three benchmark datasets. The results demonstrate that the proposed ALSCOR has better performance than the state-of-the-arts.

This paper presents a new method : HIVEC to learn latent vector representations of graphs in a manner that captures the semantic dependencies of sub-structures. The representations can then be used in machine learning algorithms for tasks such as graph classification, clustering etcetera. The method proposed is unsupervised and uses the information of co-occurrence of sub-structures. It introduces a notion of hierarchical embeddings that allows us to avoid repetitive learning of sub-structures for every new graph. As an alternative to deep learning methods, the edit distance similarity between sub-structures is also used to learn vector representations. We compare the performance of these methods against previous work.

In this paper, we propose a novel network representation learning model TransPath to encode heterogeneous information networks (HINs). Traditional network representation learning models aim to learn the embeddings of a homogeneous network. TransPath is able to capture the rich semantic and structure information of a HIN via meta-paths. We take advantage of the concept of translation mechanism in knowledge graph which regards a meta-path, instead of an edge, as a translating operation from the first node to the last node. Moreover, we propose a user-guided meta-path sampling strategy which takes users' preference as a guidance, which could explore the semantics of a path more precisely, and meanwhile improve model efficiency via the avoidance of other noisy and meaningless meta-paths. We evaluate our model on two large-scale real-world datasets DBLP and YELP, and two benchmark tasks similarity search and node classification. We observe that TransPath outperforms other state-of-the-art baselines consistently and significantly.

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.

In bioinformatics research, traditional machine learning methods have demonstrated efficacy in addressing Euclidean data. However, real-world data often encompasses non-Euclidean forms, such as graph data, which contain intricate structural patterns or high-order relationships that elude conventional machine-learning approaches. Representation learning seeks to derive valuable data representations from enhancing predictive or analytic tasks, capturing vital patterns and structures. This method has proven particularly beneficial in bioinformatics and biomedicine, as it effectively handles high-dimensional, sparse data, detects complex biological patterns, and optimizes predictive performance. In recent years, graph representation learning has become a popular research direction. It embeds graphs into a low-dimensional space while preserving the structural and attribute information of the graph, enabling better feature extraction for downstream tasks. This study extensively reviews representation learning advancements, particularly in the research of representation methods since the emergence of COVID-19. We begin with an analysis and classification of neural network-based language model representation learning techniques as well as graph representation learning methods. Subsequently, we explore their methodological innovations in the context of COVID-19, with a focus on the domains of drugs, public health, and healthcare. Furthermore, we discuss the challenges and opportunities associated with graph representation learning. This comprehensive review presents invaluable insights for researchers as it documents the development of COVID-19 and offers experiential lessons to preempt future infectious diseases. Moreover, this study guides future bioinformatics and biomedicine research methodologies.

An important indicator of human-related pollution in watersheds is dissolved oxygen (DO). The DO is highly dependent on both space and time characteristics of the watershed and is directly linked to eutrophication, which impairs the development of both the aquatic fauna and flora, also negatively impacting the water quality. Aspiring to reach a more accurate and precise forecasting approach to predict levels of DO, the present work proposes new graph-based and transformer-based deep learning models. The models were trained and validated for the Credit River Watershed, and the results were compared with both benchmarking and literature-found approaches. The proposed Graph Neural Network Sample and Aggregate (GNN-SAGE) model was the best-performing approach, reaching coefficient of determination (R2) and Root Mean Squared Error (RMSE) values of 97% and 0.34 ppm, respectively. The findings from the Shapley additive explanations (SHAP) indicated that the GNN-SAGE benefited from spatiotemporal information from the surrounding stations, improving the model’s results, and that temperature is a major input attribute for determining future DO levels. The results established that the proposed GNN-SAGE model stands as a state-of-the-art solution for DO forecasting, with potential for real-time water quality applications.

The growth rate in academic and scientific publications increased very fast. Researchers must choose a good representative and significant literature in publications, which has become challenging worldwide. Usually, the paper citation number indicates this paper's potential influence and importance. However, this standard metric of citation numbers cannot be used as a measurement to judge the popularity and significance of the recently published papers. To address this challenge, this paper presents an effective prediction method called FutureCite to predict the future citation level of research articles. FutureCite combines machine learning with text and graph mining techniques, leveraging their abilities in classification, datasets in-depth analysis, and feature extraction. FutureCite aims to predict future citation levels of research articles applying a multilabel classification approach. FutureCite can extract significant semantic features and capture the interconnection relationships found in scientific articles during feature extraction using textual content, citation networks, and metadata as feature resources. Our goal is to contribute to the advancement of substantial effective approaches impacting the citation counts in scientific publications by enhancing the precision of future citations. We conducted several experiments using a comprehensive publication dataset to evaluate our method and determine the impact of using a variety of machine learning algorithms. FutureCite demonstrated its robustness and efficiency and showed promising results based on different evaluation metrics. Using the FutureCite model has significant implications in improving the researchers' ability to determine targeted literature for their research and better understand the potential impact of research publications.

This paper investigates the use of Physics-Informed Neural Networks (PINNs) in active learning cycles. We defined two scenarios: one semi-supervised and the other fully supervised. PINNs emphasize the integration of physical laws into neural networks to improve the predictive performance of vanilla neural networks and to enhance the efficiency of traditional methods for solving partial differential equations (PDEs). Key contributions include adapting existing computational frameworks to enable the use of Graph Neural Networks for solving problems that require the calculation of gradients on unstructured triangle meshes, a query strategy focusing on the physical loss, and a comparative analysis of this strategy against random sampling across both defined scenarios. This work establishes a foundation for future research aimed at expanding the application of Physics-Informed Graph Neural Networks (PIGNN) using active learning and addressing real-world problems in fluid dynamics and electrodynamics.

Indoor positioning based on the received signal strength (RSS) of the WiFi signal has become the most popular solution for indoor localization. In order to realize the rapid deployment of indoor localization systems, solutions based on crowdsourcing have been proposed. However, compared to conventional methods, crowdsourced RSS values are more erroneous and can result in large localization errors. To mitigate the negative effect of the erroneous measurements, a graph-based semi-supervised learning (G-SSL) method is used to exploit the correlation between the RSS values at nearby locations to estimate an optimal RSS value at each location. Before using the G-SSL method, the Linear Regression (LR) algorithm is proposed to solve the device diversity problem in crowdsourcing system. Since the spatial distribution of the APs is sparse, the Compressed Sensing (CS) method is applied to precisely estimate the location of the APs. Based on the location of the APs and a simple signal propagation model, the RSS difference between different locations is calculated and used as an additional constraint to improve the performance of G-SSL. Furthermore, to exploit the sparsity of the weights used in the G-SSL, we use the CS method to reconstruct these weights more accurately and make a further improvement on the performance of the G-SSL. Experimental results show improved results in terms of the smoothness of the radio map and the localization accuracy.

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

Against the background of the sky, imaging and perception of aircraft are cru- cial. Among these, the location of aircrafts is not a very difficult problem in general, because that deep learning algorithms and object detection models based on convolutional neural network(CNN) are ever-evolving. In order to have a better identification of various aircrafts, or to accurately locate different types of flying targets in the sky, it becomes significant to distinguish and recognize different types of aircrafts. One question is that, distinguishing and recognizing between sub-categories of aircrafts pose great challenges. Although fine-grained recognition focuses on exploring and studying such problems, aircrafts under different sub-categories and granularities lead us to rethink the application of features. We noticed that features in swin-transformer demonstrates the under- standing and processing of images, fully showcasing the encoding and indexing of information. Through this research and proposed approach, we discovered a better understanding of features encoding and use, which are inspired by the feature encoding and computation in swin-transformer. In our paper, our ap- proach has achieved effects on features encoded graphically, manifested from the architecture design and convolutional neural network computation, and outper- forms other famous fine-graiend classification models on this issue. Not only approach we proposed has demonstrated superior performance in fine-grained aicraft classification, but also the mechanisms of the feature encoding under different sample space partitions is revealed for this issue, which provides a re- search for the representation of aircraft fineness characteristics. The relationship between representation orientation of aircraft feature information under various grained divisions, shows that the recognition of different categories according to man-made, such as aircraft, can be achieved by means of the feature represen- tations studied in this paper, for more specific defined classification tasks and various man-made targets partition criteria, which may influences the princi- ple of design for calculation and feature extraction in fine-grained classification models.

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

This paper proposes an enhanced Quantum Key Distribution (QKD) protocol by incorporating a Three-Dimensional Angular Momentum Representation (3D AMR) to address vulnerabilities inherent in traditional two-dimensional polarization states-based systems. The 3D AMR method expands the state space, potentially increasing security against sophisticated quantum attacks. We present a theoretical and computational framework that transitions from the conventional two-dimensional polarization to a three-dimensional angular momentum space, which inherently increases the complexity and security of the quantum states used in QKD.

Few-shot fine-grained image classification (FSFGIC) methods refer to machine learning methods which aim to classify images (e.g., bird species, flowers, and airplanes) belonging to subordinate object categories of the same entry-level category with only a few samples. It is worth to note that feature representation learning is used not only to represent training samples, but also to construct classifiers for performing various FSFGIC tasks. In this paper, starting from the definition of FSFGIC, a taxonomy of feature representation learning for FSFGIC is proposed. According to this taxonomy, we discuss key issues on FSFGIC (including data augmentation, local or/and global deep feature representation learning, class representation learning, and task specific feature representation learning). The existing popular datasets and evaluation standards are introduced. Furthermore, a novel classification performance evaluation mechanism is designed with a 0.95 confidence interval for judging whether the classification accuracy obtained by a certain specified method is good or bad. Moreover, current challenges and future trends of feature representation learning on FSFGIC are elaborated.

Global Earth Observation (EO) is becoming increasingly important in understanding and addressing critical aspects of life on our planet about environmental issues, natural disasters, sustainable development and others. EO plays a key role in making informed decisions on applying or reforming land use, responding to disasters, shaping climate adaptation policies etc. EO is also becoming a useful tool for helping professionals make the most profitable decisions, e.g., in real estate or the investment sector. Finding similarities in landscapes may provide useful information regarding applying contiguous policies, taking alike decisions or learning from best practices on events and happenings that have already occurred in similar landscapes in the past. However, current applications of similar landscape retrieval are limited by moderate performance and the need for time-consuming and costly annotations. We propose splitting the similar landscape retrieval task into a set of smaller tasks that aim at identifying individual concepts inherent to satellite images. Our approach relies on several models trained with Unsupervised Representation Learning (URL) on Google Earth images to identify these concepts. We show the efficacy of matching individual concepts for tackling the task of retrieving similar landscape(s) to a user-selected satellite image with a proof-of-concept application of the proposed approach on the geographical territory of the Republic of Cyprus. Our results demonstrate the efficacy of breaking up the landscape similarity task into individual concepts closely related to remote sensing instead of trying to capture all concepts and image semantics with a single model like a single RGB semantics model.

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.

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

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.

Manual material handling (MMH) significantly impacts worker health and productivity, often leading to musculoskeletal disorders (MSDs) primarily in the lower back. As a novel assistive technology, exoskeletons may serve as ergonomic tools to mitigate these work-related MSDs. It is essential to examine exoskeletons from the users’ perspectives before their widespread implementation in occupational settings. This study investigates the effectiveness of a passive back-support exoskeleton (BExo) in reducing perceived physical exertion and improving ergonomic safety in manufacturing context. Twenty-two college students were recruited to perform MMH tasks in a controlled lab environment, both with and without the BExo, followed by completing a survey questionnaire on various aspects of the BExo. Using ANOVA, the study analyzed biomechanical exertion across various body parts and tasks. The findings indicate that the BExo substantially alleviates discomfort in the low back, shoulders and knees, thereby, enhancing ergonomic posture and reducing fatigue. These results underscore the potential of passive exoskeletons to boost workers’ safety and efficiency, providing valuable insights for future ergonomic strategies in industrial setting.

This paper introduces a novel method for accurately calculating the upper biomass of single trees using Light Detection And Ranging (LiDAR) point cloud data. The proposed algorithm involves classifying the tree point cloud into two distinct ones: the trunk point cloud and the crown point cloud. Each part is then processed using specific techniques to create a 3D model and determine its volume. The trunk point cloud is segmented based on individual stems, with each stem further divided into slices that are modeled as cylinders. On the other hand, the crown point cloud is analyzed by calculating its footprint and gravity center. The footprint is further divided into angular sectors, with each being used to create a rotating surface around the vertical line passing through the gravity center. All models are represented in a matrix format, simplifying the process of minimizing and calculating the tree’s upper biomass, consisting of crown biomass and trunk biomass. To validate the proposed approach, both terrestrial and airborne datasets are utilized. A comparison with existing algorithms in the literature confirms the effectiveness of the new method. The study shows that the proposed algorithm achieves an average fit between 0.01 m and 0.49 m for individual trees.

In the design of real-world networks, researchers evaluate various structural parameters to assess vulnerability, including connectivity, toughness, and tenacity. Recently, the tightness metric has emerged as a potentially superior vulnerability measure, although many related theorems remain unknown due to its novelty. Harary graphs, known for their maximum connectivity, are an important class of graph models for network design. Prior work has evaluated the vulnerability of three types of Harary graphs using different parameters, but the tightness metric has not been thoroughly explored. This article aims to calculate the tightness values for all three types of Harary graphs. First, it will attempt to calculate the lower bound for the value of the tightness parameter in Harary graphs using existing lemmas and theorems. Then, by presenting new lemmas and theorems, we will try to find the exact value or upper bound for this parameter in Harary graphs. For the first type of Harary graph, the tightness is precisely determined, while for the second and third types, upper bounds are provided due to structural complexity. The lemmas, theorems, and proof methods presented in this research may be used to calculate other graph and network parameters. However, the newness of the tightness parameter means that further research is needed to fully characterize its properties.

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.

The objective of person re-identification (ReID) tasks is to match a specific individual across different times, locations, or camera viewpoints. The prevalent issue of occlusion in real-world scenarios affects image information, rendering the affected features unreliable. The difficulty and core challenge lie in how to effectively discern and extract visual features from human images under various complex conditions, including cluttered backgrounds, diverse postures, and the presence of occlusions. Some works have employed pose estimation or human keypoint detection to construct graph-structured information to counteract the effects of occlusions. However, this approach introduces new noise due to issues such as the invisibility of keypoints. Our proposed module, in contrast, does not require the use of additional feature extractors. Our module employs multi-scale graph attention for the reweighting of feature importance. This allows features to concentrate on areas genuinely pertinent to the re-identification task, thereby enhancing the model's robustness against occlusions. To address these problems, a model that employs multi-scale graph attention to re-weight the importance of features is proposed in this study, significantly enhancing the model’s robustness against occlusions. Our experimental results demonstrate that, compared to baseline models, the method proposed herein achieves a notable improvement in mAP on occluded data sets, with increases of 0.5%, 31.5%, and 12.3% in mAP scores.

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.

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

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.

Functional Connectivity analysis using Electroencephalography signals is common. The EEG signals are converted to networks by transforming the signals into a correlation matrix and analyzing the resulting networks. Here, four learning models, namely, Logistic Regression, Random Forest, Support Vector Machine, and Recurrent Neural Networks, are implemented on the correlation matrix data to classify them either on their psychometric assessment or the effect of therapy; The EEG data is trail-based/event-related. The classifications based on RNN provided higher accuracy( 74-88%) than the other three models( 50-78%). Instead of using individual graph features, a correlation matrix provides an initial test of the data. When compared with the time-resolved correlation matrix, it offered a 4-5% higher accuracy. The time-resolved correlation matrix is better suited for dynamic studies here; it provides lower accuracy when compared to the correlation matrix, a static feature.

The report details out programming approach for automating warehouse using Answer Set Programming.

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 modern world where research is taking a huge leap, the collaboration network between authors is also expanding, increasing the probability of different authors coming together to work on the same project, same research paper making them co-authors. In coauthorship, link prediction is used to anticipate new interactions between its members that are likely to occur in the future. Researchers have concentrated their efforts on studying and suggesting methods for providing effective reviews for authors who can collaborate on a scientific endeavor. In order to provide a precise link prediction, a graph database approach is proposed in this paper using nodes to determine most possible co-authors in future. In order to forecast the connections, we preprocessed the data set for the maximum relative contents. A supervised learning approach is used to execute the solution, which includes random forest classifier and logistic regression. The first findings of our technique reveal that the total of two author node’s research collaboration indices has the greatest influence on the performance of supervised link prediction than that of the traditional approach, which stimulates us to conduct further study on employing such a forecast.

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

In cold-climate regions, road salt is used as a de-icer for winter road maintenance. The applied road salt melts ice and snow on roads, being washed off through storm sewer systems into nearby urban streams, harming the freshwater ecosystem. Addressing the gap in the knowledge regarding the use of deep learning approaches for urban stream water quality forecasting, the present work discusses our implementation of a “Graph Neural Network” - “Sample and Aggregate” (GNN-SAGE) model for forecasting chloride concentrations in the Credit River in Ontario, Canada. The proposed GNN-SAGE is compared to other models, including a Deep Neural Network based transformer (DNN-Transformer) and a benchmarking persistence model for 6 hours forecasting horizon. Ac-cording to the results, the GNN-SAGE model surpasses other models in providing accurate predic-tions of chloride concentrations within the assessed prediction window. Also, a SHAP analysis provides insight into the variables that influence the model’s forecasting, showing the impact of the spatiotemporal neighbouring data from the network and the seasonality variables on the model’s result. The GNN-SAGE model shows potential for use in real-time forecasting of water quality in urban streams, aiding in the development of regulatory policies to protect the vulnerable freshwater ecosystems in urban areas.

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

Finite element discretizations of problems in computational physics often rely on hand-generated initial mesh and adaptive mesh refinement (AMR) to preferentially resolve regions containing important features during simulation. We propose Adaptnet, a Graph Neural Networks (GNNs) framework for learning mesh generation and adaptation. The model is composed of two GNNs: the first one, Meshnet, learns mesh parameters commonly used in open-source mesh generators, to generate an initial mesh from a Computer Aid Design (CAD) file; while the second one, Graphnet, learns mesh-based simulations to predict the components of an Hessian-based metric to perform anisotropic mesh adaptation. Our approach is tested on structural (Deforming plate - Linear elasticity) and fluid mechanics (Flow around cylinders - steady-state Stokes) problems. Our results show it can accurately predict the dynamics of the system and adapt the mesh accordingly. The adaptivity of the model supports learning resolution-independent dynamics and can scale to more complex state spaces at test time.

Scientific progress is increasingly dependent on knowledge in computation-ready forms. In the life sciences, among others, many scientists therefore extract and structure knowledge from the literature. In a process called manual curation, they enter knowledge into spreadsheets, or into databases where it serves their and many others' research. Valuable as these curation efforts are, the range and detail of what can practically be captured and shared remains limited, because of the constraints of current curation tools. Many important contextual aspects of observations described in literature simply do not fit in the form defined by these tools, and thus cannot be captured. Here we present the design of an easy-to-use, general-purpose method and interface, that enables the precise semantic capture of virtually unlimited types of information and details, using only a minimal set of building blocks. Scientists from any discipline can use this to convert any complex knowledge into a form that is easily readable and meaningful for both humans and computers. The method VSM forms a universal and high-level language for encoding ideas, and for interacting with digital knowledge.

In this paper we discuss a problem of generalization of binomial distributed triangle, that is sequence A287326 in OEIS. The main property of A287326 that it returns a perfect cube n as sum of n-th row terms over k; 0 ≤ k ≤ n−1 or 1 ≤ k ≤ n, by means of its symmetry. In this paper we have derived a similar triangles in order to receive powers m = 5; 7 as row items sum and generalized obtained results in order to receive every odd-powered monomial n^2m+1; m ≥ 0 as sum of row terms of corresponding triangle. In other words, in this manuscript are found and discussed the polynomials D_m(n,k) and U_m(n,k), such that, when being summed up over k in some range with respect to m and n returns the monomial n^2m+1.

In this paper, we introduce a way of representing a given mapping as the sum of odd and even mappings. Then, by using this representation, we investigate the stability of various forms for the general nonic functional equation.

AI research and implementations are growing, and so are the risks associated with AI (Artificial Intelligence) developments, especially when it’s difficult to understand exactly what they do and how they work, both at a localized level, and at deployment, in particular when distributed and on a large scale. Governments are pouring massive funding to promote AI research and education, yet research results and claims, as well as the effectiveness of educational programmes, can be difficult to evaluate given the limited reproducibility of computations based on ML (machine learning) and poor explainability, which in turn limits the accountability of the systems and can cause cascading systemic problems and challenges including poor reproducibility, reliability, and overall lack of trustworthiness. This paper addresses some of the issues in Knowledge Representation for AI at system level, identifies a number of knowledge gaps and epistemological challenges as root causes of risks and challenges for AI, and proposes that neurosymbolic and hybrid KR approaches can serve as mechanisms to address some of the challenges. The paper concludes with a postulate and points to related and future research

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.

Background: The hub-and-spoke model (HSM), offers a framework for efficient healthcare service delivery. This scoping review seeks to establish the implementation and effectiveness of the HSM in Antimicrobial Stewardship (AMS) programs. Methods: The Preferred Reporting Items for Systematic Reviews and Meta-Analyses Extension for Scoping Reviews (PRISMA-ScR) reporting guideline was followed. A systematic search was conducted in four electronic databases (PubMed, Medline, Cochrane library and Google scholar) from inception until January 2024. Studies where the HSM was used for delivering any AMS activity, intervention or action, were included. No study specific filters were applied and all populations, study designs and health settings were included. Data screening and selection was achieved using Rayyan. Three authors independently screened studies, with conflicts resolved by a fourth author. Data were narratively synthesized. Standard appraisal tools were impractical; however, critically evaluation of data collection and outcome reporting was ensured. Results: Out of 1,438 articles, three were included in the scoping review. The primary interventions utilising the HSM in AMS involved reducing antibiotic misuse, training healthcare professionals, case-based learning, establishing AMS programs, developing antibiograms, and formulating policies or guidelines pertinent to AMS. The studies demonstrated significant clinical improvements in AMS. Clinical outcomes from the studies include a significant reduction in antimicrobial usage and improved antibiotic management, with a notable decrease in days on antimicrobial therapy and increased antibiotic de-escalation. Key facilitators for AMS program success: tailored education, collaborative learning, strong leadership, strategic practices, and data-driven decisions. Key barriers: leadership challenges, change resistance, knowledge gaps, inadequate data systems, resource limitations, and technological constraints. Conclusion: The review identified a literature gap in HSM use for AMS programs. Further studies are needed to assess HSM's effectiveness, feasibility, and cost-effectiveness in AMS contexts.

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

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

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.

Background: Despite recent advancements, medical technology has not yet reached its peak. Precision medicine is growing rapidly, thanks to machine learning breakthroughs powered by increased computational capabilities. This article explores a deep-learning application for computer-aided diagnosis in dermatology. Methods: Using a custom model based on EfficientNetB3 and deep learning, we propose an approach for skin lesion classification that offers superior results with smaller, cheaper, and faster inference times compared to other models. The skin images dataset used for this research includes 8,222 files selected from the authors' collection and the ISIC2019 archive, covering six dermatological conditions. Results: The model achieved 95.4% validation accuracy on four categories—melanoma, basal cell carcinoma, benign keratosis-like lesions, and melanocytic nevi—using an average of 1,600 images per category. Adding two categories with fewer images (about 700 each)—squamous cell carcinoma and actinic keratoses—reduced the validation accuracy to 88.8%. The model maintained accuracy on new clinical test images taken under the same conditions as the training dataset. Conclusions: The custom model demonstrated excellent performance on the diverse skin lesions dataset, with significant potential for further enhancements.

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

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

A consistent theory of quantum entanglement requires that constituent single-particle states belong to the same Hilbert space, the coherent eigenstates of a complete set of operators in a given representation, defined with respect to a shared continuous parameterization. Formulating such eigenstates for a single relativistic particle with spin, and applying them to the description of many-body states, presents well-known challenges. In this paper, we review the covariant theory of relativistic spin and entanglement in a framework first proposed by Stueckelberg and developed by Horwitz, Piron, et.\ al. This approach modifies Wigner's method by introducing an arbitrary timelike unit vector $n^\mu$ on which one induces a representation of $SL(2,C)$, rather than induce on the spacetime momentum $p^\mu$. Generalizing this approach, we construct relativistic spin states on an extended phase space $\{(x^\mu,p^\mu),(\zeta^\mu,\pi^\mu)\}$, inducing a representation on the momentum $\pi^\mu$, thus providing a novel dynamical interpretation of the timelike unit vector $n^\mu = \pi^\mu / M$. Studying the unitary representations of the Poincar\'e group on the extended phase space allows us to define basis quantities for quantum states and develop the gauge invariant electromagnetic Hamiltonian in classical and quantum mechanics. We write plane wave solutions for free particles and construct stable singlet states, and relate these to experiments involving temporal interference, analogous to the spatial interference known from double slit experiments.

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 Eurasian grapevine (Vitis vinifera L.) is the most widely grown horticultural crop in the world and is important for the economy of many countries. In the wine production chain, grape varieties play an important role as they directly influence the authenticity and classification of the product. Identifying the different grape varieties is therefore fundamental for quality control and inspection activities, as well as for regulating production. Currently, ampelography and molecular analysis are the main approaches to identifying grape varieties. However, both methods have limitations. Ampelography is subjective and prone to errors and is experiencing enormous difficulties as ampelographers are increasingly scarce. On the other hand, molecular analyses are very demanding in terms of cost and time. In this scenario, Deep Learning (DL) and Machine Learning (ML) methods have emerged as a classification alternative to deal with the scarcity of ampelographs and avoid molecular analyses. In this study, the most recent and current methods for identifying grapevine varieties using DL classification-based approaches are presented through a systematic literature review. The classification pipeline of the 31 studies found in the literature was described, highlighting its pros and cons. Most of the studies used DL-based models trained with leaf images acquired in a controlled environment at a maximum distance of 1.2 metres to classify grape varieties. In addition, there is a large gap between practical applications and the datasets used: a great lack of varieties, limited data acquired in the field and a lack of tests on plants under adverse conditions. Potential directions for improving this area of research were also presented.

Self-sustained learning (SSL) is considered a crucial factor in promoting students’ long-term learning and development in a sustainable society. To deepen the understanding of SSL, especially in the context of learning English as a second language, the current study examined the influence of intercultural communicative skills, language mindset, and positive L2 self on SSL in English learning among 1,238 college students in China. The results showed that students not only had a strong language mindset, positive L2 self, and intercultural communicative skills but also scored higher in long-term self-sustained English learning. Findings from the Structural Equation Modeling indicated that both language mindset and intercultural communicative skills positively predicted positive L2 self and self-sustained English learning. Furthermore, language mindset and intercultural communicative skills had an indirect impact on self-sustained English learning through positive L2 self. These findings suggest that to promote English learners’ SSL, instructors should help facilitate students’ intercultural communicative skills and foster a growth language mindset, as well as positive language learning beliefs.

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

Introduced in 1967 by Lov\'{a}sz, graph exponentiation has received little attention over the past several decades. Since graph exponentiation produces large graphs and any graph can be constructed utilizing its adjacency matrix, we provide a four step linear construction algorithm that generates the adjacency matrix for the graph exponential.

The Randić index of a graph G is the sum of (dG(u)dG(v))−1/2 over all edges uv of G, where dG(u) denotes the degree of vertex u in G. In this paper, we investigate a few graph transformations that decrease Randić index of graph. By applying those transformations, we determine the minimum Randić index on tricyclic graphs, and characterize the corresponding extremal graphs.

: Biological networks such as protein interaction networks, gene regulation networks and metabolic pathways are examples of complex networks which are large graphs with small-world and scale-free properties. Analysis of these networks has a profound effect on our understanding the origins of life, health and disease states of organisms, and diagnose diseases to aid the search for remedial processes. In this review, we describe main analysis methods of biological networks using graph theory by first defining main parameters such as clustering coefficient, modularity and centrality. We then survey fundamental graph clustering methods and algorithms followed by the network motif search algorithms with the aim of finding repeating subgraphs in a biological network graph. A frequently appearing subgraph usually conveys a basic function carried out by that small network and discovering such a function provides an insight to the overall function of the organism. Lastly, we review network alignment algorithms that achieve to find similarities between two or more graphs representing biological networks. A conserved subgraph between the biological networks of organisms may mean a common ancestor and finding such relationship may help researchers derive ancestral relationships and predict the future evolution of organisms to enable designing new drugs. We conclude by the current challenging areas of biological network analysis using graph theory and parallel processing for high performance analysis

The hybrid bond graph has been studied in depth for scalar bond graphs, but how does this translate to the multi-bond graph? Here, the controlled junction – used to model structural switching such as contact – is extended to the multi-bond case. This is a simple process, assuming that all bonds switch simultaneously (which makes physical sense). A controlled 0-junction is applied to multi-bond graph of a car, which can lose contact with the ground in cornering. Dynamic causality features, but this can be accommodated using an equational submodel in 20-Sim (in a manner similar to that used with scalar bond graphs). The junction is proposed for subsequent work to develop a validated multi-body dynamics car model in cornering.

This article explores the intricate dynamics of complexity and emergence through the lens of a graphical model representing hippocampal functions. Utilizing a series of overlapping curves that intersect at varying degrees and frequencies, we create a visual metaphor for the sophisticated processes to store information observed in the hippocampus. This model not only depicts the spatial and frequency-related interactions of these curves but also illustrates the emergent patterns that arise from these interactions. These patterns exemplify the principles of complexity and emergence, where the collective behavior of simple elements results in intricate and unexpected outcomes. This graphical representation serves as a bridge between the abstract mathematical concepts of complexity theory and the tangible biological processes observed in neuroscience. By drawing parallels to the hippocampus, known for its role in memory formation and spatial navigation, the article sheds light on how complex systems, such as neural networks, exhibit properties that are more than just the sum of their parts. The model thus offers a unique perspective on understanding complex systems, not only in neuroscience but in broader scientific inquiries where complexity and emergent phenomena are pivotal.

The Collatz conjecture, a longstanding mathematical puzzle, posits that, regardless of the starting integer, iteratively applying a specific formula will eventually lead to the value 1. This paper introduces a novel approach to validate the Collatz conjecture by leveraging the binary representation of generated numbers. Each transition in the sequence is predetermined using the Collatz conjecture formula, yet the path of transitions is revealed to be intricate, involving alternating increases and decreases for each initial value. The study delves into the global flow of the sequence, investigating the behavior of the generated numbers as they progress toward the termination value of 1. The analysis utilizes the concept of probability to shed light on the complex dynamics of the Collatz conjecture. By incorporating probabilistic methods, this research aims to unravel the underlying patterns and tendencies that govern the convergence of the sequence. The findings contribute to a deeper understanding of the Collatz conjecture, offering insights into the inherent complexities of its trajectories. This work not only validates the conjecture through binary representation but also provides a probabilistic framework to elucidate the global flow of the sequence, enriching our comprehension of this enduring mathematical mystery.

VSM is a recently introduced method for entering and displaying any type of knowledge, in a form that is both semantically precise for computation and intuitive for human understanding. VSM is the combination of a new semantic model, and the design for a dedicated user interface to support it. Here we present the implementation of this user interface, as a sophisticated HTML-element, <vsm-box>, that can be embedded in any web-based curation app. We show how developers can use it for biocuration projects, customize it to particular end-user needs, and contribute to its growth. Vsm-box is open-source at https://github.com/vsmjs/vsm-box under the AGPL license, as a JavaScript (ES6) Vue.js web-component that runs in all modern web browsers. It is the capstone of the Vsmjs organization at https://github.com/vsmjs that groups its supporting modules. Extensive supplementary material on VSM and vsm-box is available at https://vsmjs.github.io.

Scene classification plays an important role in the intelligent processing of high-resolution satellite (HRS) remotely sensed image. In HRS image classification, multiple features, e.g. shape, color, and texture features, are employed to represent scenes from different perspectives. Accordingly, effective integration of multiple features always results in better performance compared to methods based on a single feature in the interpretation of HRS image. In this paper, we introduce a multi-task joint sparse and low-rank representation model to combine the strength of multiple features for HRS image interpretation. Specifically, a multi-task learning formulation is applied to simultaneously consider sparse and low-rank structure across multiple tasks. The proposed model is optimized as a non-smooth convex optimization problem using an accelerated proximal gradient method. Experiments on two public scene classification datasets demonstrate that the proposed method achieves remarkable performance and improves upon the state-of-art methods in respective applications.

The rapid expansion of Bangladesh's financial infrastructure, coupled with the increasing digitization of banking services, underscores the critical importance of cybersecurity. Machine learning and deep learning methodologies have emerged as potent tools in combating cyber threats such as intrusion, malware, and fraud. By harnessing artificial intelligence and data-driven analysis, these techniques enable real-time scrutiny of vast banking data, facilitating proactive defense against cyberattacks. Bangladesh's evolving financial landscape, characterized by governmental digitalization initiatives and a national financial inclusion strategy, heightens the imperative for robust cybersecurity measures. This paper explores the application of machine learning and deep learning techniques in bolstering banking cybersecurity within the context of Bangladesh's burgeoning digital economy.

The proliferation of fake news on social media platforms poses significant challenges to information authenticity and public trust. In this study, the impact of various word embedding techniques on the performance of both machine learning and deep learning models for fake news detection is systematically evaluated. The comprehensive TruthSeeker dataset, which spans over a decade of labeled news articles and social media posts, is utilized. Three popular word embedding techniques are analyzed: TF-IDF, Word2Vec, and FastText. These embeddings were tested with multiple machine learning classifiers, including logistic regression, naive Bayes, K-nearest neighbors, support vector machines, multilayer perceptrons, decision trees, and random forests, as well as deep learning models, specifically convolutional neural networks (CNNs). Among machine learning models, the Support Vector Machine (SVM) with TF-IDF achieved the highest accuracy of 99.03%, precision of 98.92%, recall of 99.15%, and F1 score of 99.03%. The Multilayer Perceptron (MLP) also demonstrated strong performance with Word2Vec, reaching an accuracy of 95.24%, precision of 94.95%, recall of 95.50%, and F1 score of 95.07%. For deep learning models, CNNs combined with TF-IDF embeddings showed outstanding results, achieving an accuracy of 98.99%, precision of 98.56%, recall of 99.48%, and F1 score of 99.02%. These results highlight the critical role of word embeddings in enhancing model accuracy and reliability in misinformation detection.

The continuous flowing spacetime forms a spacetime group G, one of its fundamental groups is the Poincare group PO(1,3), and the matter and interaction fields are representations of its intrinsic spacetime group. As a kind of quantized space-time unit, space-time group elements generate both space-time manifolds and matter. Matter and fields are aggregates of the quantum space-time within them and determine their type: the Lorentz group SO(1,3) represents a rotating spacetime corresponding to visible matter and the translation group P^1,3 represents a translational spacetime corresponding to dark matter and dark energy. The aggregation mode of space-time degrees of freedom in matter reveals that charge conjugation symmetry is the inverse symmetry of internal time of charged particles, and the external parity breaking of neutrinos is also due to their internal spatial aggregation mode.

This paper is motivated by three main assumptions: (1) The currently dominant forms of knowledge representation (natural language text, formulas, graphics) are suboptimal to facilitate knowledge transfer between control engineering sub-fields and into potential application domains. (2) Formal knowledge representation (in general) is a promising supplementary approach, but (3) the established technologies so far have failed to be significantly adopted for formal representation of control engineering knowledge. Thus, after briefly reviewing existing representation methods, we introduce our own approach: The Python based imperative representation of knowledge (PyIRK) and its application to formulate the Ontology of Control Systems Engineering (OCSE). One of its main features is the possibility to represent the actual content of definitions and theorems as nodes and edges of a knowledge graph, which is demonstrated by selected elements from Lyapunov theory. While the approach is still experimental, the formalization already allows to apply methods of automated quality assurance and a semantic search mechanism. The current feature set of the framework is demonstrated on various examples before directions for further developments are discussed.

The evolution of sentence representation learning, especially with parse tree encoders, has shown remarkable progress. Traditional approaches predominantly rely on recursive encoding of tree structures, which impedes parallel processing capabilities. Additionally, these methods often overlook the significance of dependency tree arc labels. To overcome these limitations, we introduce the Syntax-Enhanced Transformer (SET), incorporating a novel dual-attention mechanism that integrates relation-focused attention alongside traditional self-attention. This design effectively encodes both dependency and spatial positional relationships within sentence dependency trees. Our approach innovatively incorporates syntactic information into the Transformer framework without compromising its inherent parallelizability. The SET demonstrates superior or comparable performance to contemporary methods across various sentence representation tasks, significantly enhancing computational efficiency.

Using classical clinical observations, we first outline an elementary conceptual model for the Mind Representation System, then move to a more elaborate mathematical model that refers to discrete cofibration with enriched fibers.

3D city models are being extensively used in applications such as evacuation scenarios and energy consumption estimation. The main standard for 3D city models is the CityGML data model which can be encoded through the CityJSON data format. CityGML and CityJSON use polygonal modelling in order to represent geometries. True topological data structures have proven to be more computationally efficient for geometric analysis compared to polygonal modelling. In a previous study, we have introduced a method to topologically reconstruct CityGML models while maintaining the semantic information of the dataset, based solely on the combinatorial map (C-Map) data structure. As a result of the limitations of C-Map's semantic representation mechanism, the resulting datasets could suffer either from semantic information loss or the redundant repetition of them. In this article, we propose a solution for a more efficient representation of both geometry, topology and semantics by incorporating the C-Map data structure in the CityGML data model and implementing a CityJSON extension to encode the C-Map data. In addition, we provide an algorithm for the topological reconstruction of CityJSON datasets to append them according to this extension. Finally, we apply our methodology to three open datasets in order to validate our approach when applied to real-world data. Our results show that the proposed CityJSON extension can represent all geometric information of a city model in a lossless way, providing additional topological information for the objects of the model.

In the paper, by virtue of a Lévy–Khintchine representation and an alternative integral representation for the weighted geometric mean, the authors establish a Lévy–Khintchine representation and an alternative integral representation for the Toader–Qi mean. Moreover, the authors also collect an probabilistic interpretation and applications in engineering of the Toader–Qi mean.

With advancements in digital technologies such as 5G communications, big data, and cloud computing, the components of network operation systems have become increasingly complex, significantly complicating system monitoring and maintenance. Correspondingly, automated log anomaly detection has become a crucial means to ensure stable network operation and protect them from malicious attacks or failures. Conventional machine learning and deep learning methods assume consistent distributions between the training and testing data, adhering to a closed-set recognition paradigm. Nevertheless, in realistic scenarios, systems may encounter new anomalies that were not present in the training data, especially in log anomaly detection. Inspired by evidential learning, we propose a novel anomaly detector called LogEDL, which supervises training of the model through an evidential loss function. Unlike traditional loss functions, the evidential loss function not only focuses on correct classification, but also quantifies the uncertainty of predictions. This enhances the robustness and accuracy of the model in handling anomaly detection tasks, while achieving functionality similar to open-set recognition. To evaluate the proposed LogEDL method, we conduct extensive experiments on three datasets, i.e., HDFS, BGL, and Thunderbird, to detect anomalous log sequences. Experimental results demonstrate that our proposed LogEDL achieves state-of-the-art performance in anomaly detection.

Recent years have witnessed significant advances in reinforcement learning (RL), which has registered remarkable success in solving various sequential decision-making problems in machine learning. Most of the successful RL applications, e.g., the games of Go and Poker, robotics, and autonomous driving, involve the participation of more than one single agent, which naturally fall into the realm of multi-agent RL (MARL), a domain with a relatively long history, and has recently re-emerged due to advances in single-agent RL techniques. Although, typically, the communication protocol between agents is manually specified and not altered during training, recently, some papers have shown signs of trying to emerge a communication between agents on the one hand and, on the other hand, to understand what is exchanged between agents. So, there is a growing body of literature on this topic which includes qualitative and quantitative studies and the ones that apply mixed methods. This study presents the scoping review of the methodological strategies undertaken in a total of 16 research articles. The results present the critical appraisal of quantitative methods in terms of validity and reliability and for qualitative methods considering four trustworthiness factors. In the end, relevant insights are further explored with implications and reflections on how they can benefit one's research in the field.

The advancement of autonomous driving technology is becoming increasingly vital in the modern technological landscape, promising notable enhancements in safety, efficiency, traffic management, and energy use. Despite these benefits, conventional deep reinforcement learning algorithms often struggle to navigate complex driving environments effectively. To tackle this challenge, we propose a novel network called DynamicNoise, designed to significantly boost algorithmic performance by introducing noise into the Deep Q-Network (DQN) and Double Deep Q-Network (DDQN). Drawing inspiration from the NoiseNet architecture, DynamicNoise uses stochastic perturbations to improve the exploration capabilities of these models, leading to more robust learning outcomes. Our experiments demonstrate a 57.25% improvement in navigation effectiveness within a 2D experimental setting. Moreover, by integrating noise into the action selection and fully connected layers of the Soft Actor-Critic (SAC) model in the more complex 3D CARLA simulation environment, our approach achieved an 18.9% performance gain, substantially surpassing traditional methods. These results confirm that the DynamicNoise network significantly enhances the performance of autonomous driving systems across various simulated environments, regardless of their dimensionality and complexity, by improving their exploration capabilities rather than just their efficiency.

The success of near-infrared spectroscopy (NIRS) analysis hinges on the precision and robustness of the calibration model. Shallow learning (SL) algorithms like partial least squares discriminant analysis (PLS-DA) often fall short in capturing interrelationships between adjacent spectral variables, and the analysis results are easily affected by spectral noise, which dramatically limits the breadth and depth application of NIRS. Deep learning (DL) methods, with their capacity to discern intricate features from limited samples, are progressively integrated into NIRS. In this paper, two discriminant analysis problems including wheat kernels and Yali pears were used as examples, and several representative calibration models to research the robustness and effectiveness of the model. Additionally, this article proposed a near-infrared calibration model, which is based on gramian angular difference field and coordinate attention convolutional neural networks (G-CACNN). The research results show that, compared with SL, spectral preprocessing has a smaller impact on the analysis accuracy of consensus learning (CL) and DL, and the latter has the highest analysis accuracy in the modeling results of using the original spectrum. The accuracy of G-CACNN in two discrimination tasks is 98.48% and 99.39%, respectively. Finally, This research compared the performance of various models under noise to evaluate the robustness and noise resistance of the proposed method.

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.

Combinatoric measures of entropy capture the complexity of a graph, but rely upon the calculation of its independent sets, or collections of non-adjacent vertices. This decomposition of the vertex set is a known NP-Complete problem and for most real world graphs is an inaccessible calculation. Recent work by Dehmer et al. and Tee et al. identified a number of alternative vertex level measures of entropy that do not suffer from this pathological computational complexity. It can be demonstrated that they are still effective at quantifying graph complexity. It is intriguing to consider whether there is a fundamental link between local and global entropy measures. In this paper, we investigate the existence of correlation between vertex level and global measures of entropy, for a narrow subset of random graphs. We use the greedy algorithm approximation for calculating the chromatic information and therefore Körner entropy. We are able to demonstrate close correlation for this subset of graphs and outline how this may arise theoretically.

Advanced persistent threat (APT) attacks are sophisticated and organized attacks commonly motivated by political, financial, and strategic objectives. In order to comprehend their tactics, techniques, and procedures (TTP) and indicators, APT reports are valuable sources. While blue teams typically rely on server logs, firewall rules and user authorizations managed in database tables, attackers have a graph-based mindset. In this work, we propose a framework for discovering and evaluating APTs using graph-based algorithms. Cyber threat intelligence (CTI) was extracted from 40,358 pages of APT reports and transformed into a graph. Centrality, community, and similarity analyses were executed on the graph. As a result, critical and influential APT groups and indicators of compromise (IoC) were discovered. Similar attacks and APT groups were revealed. Analysis results were interpreted to create new strategic CTI that can be utilized in future security operations.

Multimodal remote sensing data classification can enhance the model’s ability to distinguish land features through multimodal data fusion. In this context, how to help models understand the relationship between multimodal data and target tasks is the focus of researchers. Inspired by human feedback learning mechanisms, causal reasoning mechanisms, and knowledge induction mechanisms, this paper integrates causal learning, reinforcement learning, and meta learning into a unified remote sensing data classification framework and proposed the causal meta-reinforcement learning (CMRL). First, based on feedback learning mechanisms, we have overcome the limitations of traditional implicit optimization of fusion features and customized a reinforcement learning environment for multimodal remote sensing data classification tasks. Through feedback interactive learning between agents and the environment, we help them understand the complex relationships between multimodal data and labels, thereby achieving full mining of multimodal complementary information. Second, based on the causal inference mechanism we designed causal distribution prediction action, classification reward, and causal intervention reward, capturing pure causal factors in multimodal data and cutting off false statistical associations between non-causal factors and class labels. Finally, based on the knowledge induction mechanism, we designed a bi-layer optimization mechanism based on meta-learning. By constructing a meta training task and meta validation task simulation model in the generalization scenario of unseen data, we helped the model induce cross-task shared knowledge, thereby improving its generalization ability for unseen multimodal data. The experimental results on multiple sets of multimodal datasets show that the proposed method achieved state-of-the-art performance in multimodal remote sensing data classification tasks.