In this paper we formally define the hierarchical clustering network problem (HCNP) as the problem to find a good hierarchical partition of a network. This new problem focuses on the dynamic process of the clustering rather than on the final picture of the clustering process. To address it, we introduce a new hierarchical clustering algorithm in networks, based on a new shortest path betweenness measure. To calculate it, the communication between each pair of nodes is weighed by the importance of the nodes that establish this communication. The weights or importance associated to each pair of nodes are calculated as the Shapley value of a game, named as the linear modularity game. This new measure, (the node-game shortest path betweenness measure), is used to obtain a hierarchical partition of the network by eliminating the link with the highest value. To evaluate the performance of our algorithm, we introduce several criteria that allow us to compare different dendrograms of a network from two point of view: modularity and homogeneity. Finally, we propose a faster algorithm based on a simplification of the node-game shortest path betweenness measure, whose order is quadratic on sparse networks. This fast version is competitive from a computational point of view with other hierarchical fast algorithms, and, in general, it provides better results.

Using the orbit decomposition, a new enumerative polynomial P(x) is introduced for abstract (simplicial) complexes of a given type, e.g., trees with a fixed number of vertices or triangulations of the torus with a fixed graph. The polynomial has the following three useful properties. (I) The value P(1) is equal to the total number of unlabeled complexes (of a given type). (II) The value of the derivative P'(1) is equal to the total number of nontrivial automorphisms when counted across all unlabeled complexes. (III) The integral of P(x) from 0 to 1 is equal to the total number of vertex-labeled complexes, divided by the order of the acting group. The enumerative polynomial P(x) is demonstrated for trees and then is applied to the triangulations of the torus with the vertex-labeled complete four-partite graph G = K_{2,2,2,2}, in which specific case P(x) = x^{31}. The graph G embeds in the torus as a triangulation, T(G). The automorphism group of G naturally acts on the set of triangulations of the torus with the vertex-labeled graph G. For the first time, by a combination of algebraic and symmetry techniques, all vertex-labeled triangulations of the torus (twelve in number) with the graph G are classified intelligently without using computing technology, in a uniform and systematic way. It is helpful to notice that the graph G can be converted to the Cayley graph of the quaternion group Q_8 with the three imaginary quaternions i, j, k as generators.

In this paper, we propose a robust video understanding model for activity recognition by learning the actor’s pair-wise correlations and relational reasoning, exploiting spatial and temporal information. In order to measure the similarity between the pair appearances and construct an actor relations map, the Zero Mean Normalized Cross-Correlation (ZNCC) and the Zero Mean Sum of Absolute Differences(ZSAD) is proposed to allow the Graph Convolution Network (GCN) to learn how to distinguish group actions. We recommend that MNASNet be used as the backbone to retrieve features. Experiments show a 38.50% and 23.7% reduction in training time in the 2-stage training process along with a 1.52% improvement in accuracy against traditional methods.

Based on the Graph Model of Conflict Resolution (GMCR), a two-stage decision framework is developed to reveal the essence of brownfield incidents and facilitate the resolution of brownfield conflicts caused by the incidents. More particularly, the forward GMCR is utilized in Stage I, the negotiation stage, to simulate the evolution of a brownfield conflict (BC) and predict its potential resolution via stability analysis. If no acceptable equilibrium can be obtained, the BC progresses into Stage II, the third-party-intervention stage, where the inverse GMCR is used to assist a third party in intervening the conflict to achieve a desirable outcome. To illustrate the practicality of this framework, a recent BC occurred in Changzhou, China, is taken as a case study. Invaluable insights are provided through the computation and investigation of the corresponding preference relationships.

In the study of QSAR/QSPR, due to high degree of predictability of pharmaceutical properties, the eccentric-connectivity index has very important place among the other topological descriptors, In this paper, we compute the exact formulas of eccentric-connectivity index and its corresponding polynomial, total eccentric-connectivity index and its corresponding polynomial, first Zagreb eccentricity index, augmented eccentric-connectivity index, modified eccentric-connectivity index and its corresponding polynomial for a class of phosphorus containing dendrimers.

The objective was to explore the contributions and limitations of structure learning methods within an epidemiological analysis of real-world data. The specific aim was to use these networks to identify determinants of access to healthcare among various social factors. We analyzed data from the 2010 wave of the SIRS cohort, which included a sample of 3,006 adults from the Paris region, France. Healthcare utilization, encompassing both direct and indirect access, was the primary outcome. Candidate determinants included health status, demographic characteristics, and socio-cultural and economic positions. We employed a dual approach: a non-automated epidemiological method (initial expert-knowledge network and logistic regression models) and structure-learning techniques based on several algorithms, with and without knowledge con-straints. We compared the results based on the presence, direction, and strength of specific links within the produced network. Although the interdependencies and relative strengths identified by approaches were similar, the structure-learning algorithms detected fewer associations with the outcome than the non-automated method. Relationships between variables were sometimes incorrectly oriented when using a purely data-driven approach. Structure learning algorithms can be valuable in exploratory stages, helping to generate new hypotheses or mining novel databases. However, results should be validated against prior knowledge and supplemented with additional confirmatory analyses.

In the field of recommender systems, difficult negative samples that are easily misclassified by classifiers have higher learning value. In order to solve the problem that the existing graph convolutional network lacks the exploration of negative sampling strategy, a multivariate sampling based on graph convolution collaborative filtering recommendation model was proposed. Firstly, part of the information in the positive sample was injected into the negative sample, and the high quality difficult negative sample was selected by the inner product method. Then, contrastive learning is used to maximize the similarity between the difficult negative samples and the positive samples, so that the difficult negative samples are as close to the positive samples as possible in the feature space. Ultimately, a multi-task approach was employed to concurrently enhance both the recommendation supervision task and the contrastive learning task. To validate the effectiveness of our approach, we conducted comparative evaluations utilizing three publicly accessible datasets. The experimental outcomes indicate that our proposed model surpasses the baseline model in terms of performance.

This work addresses the analysis and characterization of deadlocks in discrete-event systems modeled by labeled Petri nets (LPNs) with undistinguishable and unobservable transitions. To provide a solution for the notorious problem, it is essential to present an effective characterization such that deadlock control and synthesis are technically and methodologically possible. To this end, we introduce the notion of dangerous implicit vectors (DIVs) which implicitly threaten the system deadlock-freedom. The set of dead markings is divided into two subsets: dead basis markings (DBMs) and dangerous implicit markings (DIMs). An algorithm is designed to compute the sets of DIVs and DIMs at a given basis state of a system. Moreover, by virtue of linear algebraic equations, we formulate sufficient conditions to identify the existence of blocking markings in an LPN. Finally, an algorithm is developed to construct an observed graph that is a compact representation of the reachability graph of a Petri net with respect to the existence of dead reaches. At the end of this paper, experiment results that illustrate the correctness and effectiveness of the reported solution are presented.

Machine unlearning, the process of removing the influence of specific data points from trained machine learning models, has become increasingly important in light of modern data privacy regulations, such as the GDPR and the "right to be forgotten." This paper explores the challenges and solutions associated with implementing machine unlearning in three widely used neural network architectures: Convolutional Neural Networks (CNNs), Deep Neural Networks (DNNs), and Graph Neural Networks (GNNs). Each of these networks presents unique challenges due to their distinct architectures and learning processes. Techniques such as selective retraining, influence functions, and knowledge distillation have been proposed to address these challenges. The paper also introduces the concept of full parameter unlearning, which adjusts all trainable parameters using two key techniques: gradient ascent based on first-order information and Fisher information based on second-order information. These methods ensure comprehensive unlearning, but also introduce computational complexity. We discuss examples, potential solutions, and future research directions to make full parameter unlearning more scalable and efficient, thus providing a framework for balancing data privacy with model performance.

A mathematical procedure enabling the transformation of an arbitrary tessellation of a surface into a bi-colored complete graph is introduced. Polygons constituting the tessellation are represented by vertices of the graphs. Vertices of the graphs are connected by two kinds of links/edges, namely, by a green link, when polygons have the same number of sides, and by a red link, when the polygons have a different number of sides. This procedure gives rise to a semi-transitive, complete, bi-colored Ramsey graph. The Ramsey number was established as R_trans (3,3)=5. Shannon entropies of the tessellation and graphs are introduced. Ramsey graphs emerging from random Voronoi and Poisson Line tessellations were investigated. The limits ζ=lim┬(N→∞)⁡〖N_g/N_r 〗, where N is the total number of green and red seeds, N_g and N_r, were found ζ=0.272±0.001 (Voronoi) and ζ= 0.47±0.02 (Poisson Line). The Shannon Entropy for the random Voronoi tessellation was calculated as S= 1.690±0.001 and for the Poisson line tessellation as S =1.265±0.015.

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.

Air quality is one of the most concerning problems in major industrialized cities in the world. Prediction of future air quality is highly relevant to public health. In some big cities, multiple air quality measurement stations are deployed at different locations to monitor air pollutants, such as NO2, CO, PM 2.5 and PM 10, over time. At every monitoring time stamp t, we observe one station×feature matrix xt of the pollutant data, which represents a spatio–temporal process. Traditional methods on prediction of air quality typically use data from one station or can only predict a single pollutant (such as PM 2.5) at a time, which ignores the spatial correlation among different stations. Moreover, the air pollution data are typically highly nonstationary, We propose a de-trending graph convolutional LSTM (long short term memory) to continuously predict the whole station×feature matrix in the next 1 to 48 hours, which not only captures the spatial dependency among multiple stations by replacing an inner product with convolution, but also incorporates the de-trending signals (transform a nonstationary process to a stationary one by differencing the data) into our model. Experiments on the air quality data of the city Chengdu and multiple major cities in China demonstrate the feasibility of our method and show promising results.

In different fields in our life, like physics, coding theory and computer science, graph labeling dramas an vital role and appears in many applications. A labeling of a graph is a map which assign each element in with a positive integer number. An edge irregular total -labeling is a function such that where and are weights for any two distinct edges. In this case, has total edge irregularity strength (TEIS) if is minimum. In our paper, we defined a new type of graphs called a triple star snake graph and star snake graph . Also, we investigated TEIS for a triple star snake graph . After that, we generalized the results for star snake graph .

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.

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

When an aircraft malfunctions, quickly and accurately identifying the faulty unit is essential for ensuring normal operation. Unfortunately, maintenance engineers often struggle to acquire the necessary fault-related knowledge due to poor management and utilization of aircraft fault documents. To address this issue, we introduce knowledge graph technology into the field of aircraft fault diagnosis, exploring its construction and application for effective knowledge management. Our work starts by analyzing the critical knowledge elements required for aircraft fault diagnosis and designing a schema layer for fault knowledge graphs. We then we then combine deep learning and heuristic rules to extract fault knowledge from both structured and unstructured data, enabling the construction of aircraft fault knowledge graphs. Finally, we develop a fault question-answering system based on fault knowledge graphs that can accurately give solutions to questions posed by maintenance engineers. Our practice demonstrates that knowledge graphs provide an effective means of managing aircraft fault knowledge, assisting engineers in locating fault reasons accurately and quickly.

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

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

Rigid-body visual tracking is an active research field with many practical applications including visual surveillance and intelligent transport system. In this paper, we define a new problem domain, called visual growth tracking, to track different parts of an object that grow non-uniformly over space and time for application in image-based plant phenotyping. The paper introduces a novel method to detect and track each leaf of a plant for automated leaf stage monitoring. The method has four phases: optimal view selection, plant architecture determination, leaf tracking and generation of a leaf status report. The proposed method uses a graph theoretic approach to reliably detect and track individual leaves by overcoming the challenge of leaf-losses based on temporal image sequence analysis for automatically generating the leaf status report containing the following phenotypes, i.e., the emergence timing of each leaf, total number of leaves present at any time, the day on which a particular leaf stopped growing, and the length and relative growth rate of individual leaves. The proposed method demonstrates high accuracy in detecting leaves and tracking them through the early vegetative stages of maize plants based on experimental evaluation on a publicly available benchmark dataset.

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.

The topological index is a numerical quantity based on the characteristics of various invariants or molecular graph. For ease of discussion, these indices are classified according to their logical derivation from topological invariants rather than their temporal development. Degree based topological indices depends upon the degree of vertices. This paper computes Zagreb polynomials and redefined first, second and third Zagrebindices of Bismuth Tri-Iodide chains and sheets.

The topological index is a numerical quantity based on the characteristics of various invariants or molecular graph. For ease of discussion, these indices are classified according to their logical derivation from topological invariants rather than their temporal development. Degree based topological indices depends upon the degree of vertices. This paper computes degree based topological indices of Bismuth Tri-Iodide chains and sheets with the help of M-polynomial.

In the context of crowds innovation and the generative design driven by big language models, the personalized requirements has become the best engine for innovative design. The exploration of personalized requirements has become a key in significantly improving product innovation, concepts feasibility, and design interaction efficiency. To mine a large number of vague and unexpressed implicit requirements of personalized products, a domain knowledge graph-based method is proposed in this research. First, based on the classical theory of design science, the characteristics and categories of personalized implicit requirements are analyzed. Next, in order to improve the practicability and construction efficiency of the domain knowledge graph, a more informative ontology is constructed, and better performing NLP models are proposed. Then, a series of mining methods based on knowledge graph are proposed for the personalized implicit requirements of different categories. Finally, A platform was developed based on the technical solution proposed in this study, and an example verification was conducted in the field of electromechanical engineering. The efficiency improvement of the training model proposed in the research was analyzed, and the practicality of implicit requirement mining methods were discussed.

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.

This paper initiates the study of the mathematical aspects of the ad-hoc Lanzhou index. If G is a graph with the vertex set {x1,⋯,xn}, then the ad-hoc Lanzhou index of G is defined by Lz¯(G)=∑i=1ndi(n−1−di)2, where di represents the degree of the vertex xi. Several identities for the ad-hoc Lanzhou index, involving some existing topological indices are established. The problems of finding graphs with the extremum values of the ad-hoc Lanzhou index from the following sets of graphs are also attacked: (i) set of all connected ξ-cyclic graphs of a fixed order, (ii) set of all connected molecular ξ-cyclic graphs of a fixed order, (iii) set of all graphs of a fixed order, (iv) set of all connected molecular graphs of a fixed order.

There has been a great deal of research in the area of using graph engines and graph databases to model network traffic and network attacks, but the novelty of this research lies in visually or graphically representing the Reconnaissance Tactic (TA0043) of the MITRE ATT&CK framework. Using the newly created dataset, UWF-Zeekdata22, based on the MITRE ATT&CK framework, patterns involving network connectivity, connection duration, and data volume were found and loaded into a graph environment. Patterns were also found in the graphed data that match the Reconnaissance as well as other tactics captured by UWF-Zeekdata22. The Star motif was particularly useful in mapping the Reconnaissance tactic. The results of this paper show that graph databases/graph engines can be essential tools for understanding network traffic and trying to detect network intrusions before they happen. Finally, an analysis of the run-time performance of the reduced dataset used to create the graph databases showed that the reduced datasets performed better than the full dataset.

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.

This article aims to solve the problem of robust supervision of a reverse osmosis desalination system (RO-DS) with two models, external model and bond graph model. The structure of an industrial system from the point of view of the external model operates according to several modes of operation (degraded and normal). For this external model, we cannot locate the faults since we are talking about a global operation of the system. The possible solution for the development of research was to use the multidisciplinary model called bond graph. This model by its graphic nature and using a unified language makes it possible to model the industrial system element by element from where it helps the user not only to detect the faults but also to locate them when they appear in the system. The results suggest that the use of the bond graph model for alarm 02 is a reverse osmosis error (RO1); these phenomena are readable on the bond graph model and can be quantified by equations. The equation of the model of this reverse osmosis (RO1) is found in the residual equations (r5, r6 and r7), so that these residues will be sensitive to this rupture. The possible solution during research development was to use the bond graph model to supplement information with physical knowledge and to locate faults. This article also describes the operating safety (by minimizing false alarms and non-detections as well as delays in fault detection) of the desalination system by using the bond graph model described in Linear Fractional Transformation (LFT) form for enable it to manage the robust supervision of a desalination system. An approach based on (LFT-BG) is developed to monitor tank leakage (Cu) and reverse osmosis (RO1 and RO2) faults or valve level (V1 and V2) closures and membrane clogging reverse osmosis (Rm1 and Rm2) that can occur in the reverse osmosis desalination system (RO-DS).

For the first time, We do fuzzification the concept of domination in crisp graph on a generalization of fuzzy graph by using membership values of vertices, α-strong edges and edges. In this paper, we introduce the first variation on the domination theme which we call vertex domination. We determine the vertex domination number γ_v for several classes of t-norm fuzzy graphs which include complete t-norm fuzzy graph, complete bipartite t-norm fuzzy graph, star t-norm fuzzy graph and empty t-norm fuzzy graph. The relationship between effective edges and α-strong edges is obtained. Finally, we discuss about vertex dominating set of a fuzzy tree with respect to a t-norm ⨂ by using the bridges and α-strong edges equivalence.

The problem of quantifying the vulnerability of graphs has received much attention nowadays, especially in the field of computer or communication networks. In a communication network, the vulnerability measures the resistance of the network to disruption of operation after the failure of certain stations or communication links. If we think of a graph as modeling a network, the average lower 2-domination number of a graph is a measure of the graph vulnerability and it is defined by ${\gamma }_{2av}\left(G\right)=\frac{1}{\left|V\left(G\right)\right|}{\sum }_{v\in V\left(G\right)}{\gamma }_{2v}\left(G\right)$, where the lower 2-domination number, denoted by ${\gamma }_{2v}\left(G\right)$, of the graph G relative to v is the minimum cardinality of 2-domination set in G that contains the vertex v. In this paper, the average lower 2-domination number of wheels and some related networks namely gear graph, friendship graph, helm graph and sun flower graph are calculated. Then, we offer an algorithm for computing the 2-domination number and the average lower 2-domination number of any graph G.

We propose the Ramsey approach for the analysis of behavior of isolated mechanical systems containing interacting particles. The total momentum of the system in the frame of the center of masses is zero. The mechanical system is described by the Ramsey, bi-colored, complete graph. Vectors of momenta of the particles pi serve as the vertices of the graph. We start from the graph representing the system in the frame of the center of masses, the momenta of the particles in this system are pcmi. If (pcmi(t)∙pcmj(t))≥0 is true, vectors of momenta of the particles numbered i and j are connected with the red link; if (pcmi(t)∙pcmj(t))<0 takes place, the vectors of momenta are connected with the green link. Thus, the complete, bi-colored graph emerges. Consider the isolated system built of six interacting particles. According to the Ramsey Theorem, the graph inevitably comprises at least one monochromatic triangle. The coloring procedure is invariant relatively rotations/translations of frames; thus, the graph representing the system contains at least one monochromatic triangle in any of frames emerging by rotation/translation of the original frame. This gives rise to the novel kind of a mechanical invariant. Similar coloring is introduced for the angular momenta of the particles. However, the coloring procedure is sensitive to Galilean/Lorenz transformations. Extensions of the suggested approach are discussed.

Ramsey theory enables re-shaping of the basic ideas of the quantum mechanics. Quantum observables, represented by linear Hermitian operators are seen as the vertices of the graph. Relation of commutation define coloring of the edges linking the vertices: if the operators commute, they are connected with the red link; if they do not commute they are connected with the green link. Thus, a bi-colored, complete, Ramsey graph emerges. According to the Ramsey theorem, complete, bi-colored graph built of six vertices, will inevitably contain at least one monochromatic triangle; in other words, the Ramsey number R(3,3)=6. In our interpretation, this triangle represents the triad of observables, which could or, alternatively, could not be established simultaneously in a given quantum system. The Ramsey approach to the quantum mechanics is illustrated with the numerous examples, including the motion of a particle in a centrally symmetrical field.

This study constructs a comprehensive line loss management evaluation knowledge graph, considering the impact of various factors such as power grid structure characteristics, equipment's physical parameters, power grid operation characteristics, electricity consumption features, and natural conditions. It establishes the association between line loss characteristics and line loss retrieval and configures the data source for line loss management evaluation indicators. Based on Principal Component Analysis (PCA), this study selects comprehensive evaluation indicators for line loss management, verifies the rationality of the indicators, and proposes an integrated evaluation method for municipal power grid line loss management. A full-process composite evaluation method based on DEMATEL-Entropy Weight-TOPSIS is constructed, and the accuracy of the evaluation method is verified through ablation experiments. The TOPSIS analysis method is applied to empirical research on cross-sectional data from a city in Guangxi from 2012 to 2022 to validate the evaluation system's effectiveness, scientific nature, and objectivity. The case analysis shows that the line loss evaluation index system established in this paper effectively reduces the redundancy of line loss data and can objectively and rationally reflect the actual status of line loss management work, serving as a basis for decision-making in future line loss management evaluations.

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.

The article outlines a creative approach by fusing ideas from fuzzy contractions, graph mappings, and Kannan mappings to create a brand-new notion known as "Kannan-graph-fuzzy contraction." This combination of concepts makes it possible to create a unique framework for resolving real-world issues controlled by nonlinear models. It is anticipated that using Kannan-graph-fuzzy contractions will offer a fresh approach to discussing solution existence in situations where these ideas overlap. This strategy might have a significant impact on a lot of real-world applications, proving how practical multidisciplinary techniques are for tackling issues in the real world originating from technology and engineering. The article includes several illustrated examples based on computer simulations, making the results more explicit.

Drug-target affinity (DTA) prediction is crucial for understanding molecular interactions and aiding drug discovery and development. While various computational methods have been proposed for DTA prediction, their predictive accuracy remains limited, failing to delve into the structural nuances of interactions. With increasingly accurate and accessible structure prediction of targets, we developed a novel deep learning model, named S2DTA, to accurately predict DTA by fusing sequence and structural knowledge of drugs, targets, and pockets using heterogeneous models based on graph and semantic networks. Experimental findings underscored that complex feature representations imparted negligible enhancements to the model’s performance. However, the integration of heterogeneous models demonstrably bolstered predictive accuracy. In comparison to three state-of-the-art methodologies, the supremacy of S2DTA became strikingly apparent. It showcased a noteworthy 25.2% reduction in Mean Absolute Error (MAE) and an impressive 20.1% decrease in Root Mean Square Error (RMSE). Furthermore, S2DTA exhibited substantial advancements in other pivotal metrics, including Pearson Correlation Coefficient (PCC), Spearman, Concordance Index (CI), and R2. These metrics experienced remarkable increments of at least 19.6%, 17.5%, 8.1%, and a remarkable 49.4%, respectively. Finally, we conducted interpretability analysis on the effectiveness of S2DTA by bidirectional self-attention mechanism, fully proving that S2DTA is a valuable and accurate tool for predicting DTA. For further exploration, the source data and code repository can be accessed at https://github.com/dldxzx/S2DTA.

Using graph theory, computer aided motion, static force and power flow analysis of planetary gear mechanism is realized. The motion, static force and efficiency calculations of 6HP26 automatic transmission are carried out. Based on kinematic and static force analysis model, related matrices are acquired. Hence, kinematic and static force analysis of planetary gear mechanism is achieved. The link power can be determined by the link speed and torque. Power flow diagrams of each gear are acquired. The efficiency is calculated by transmission ratio method.

Drugs-drugs interactions(DDI) are entities composed of different chemical substructures (functional groups). In existing methods that predict drug–drug interactions based on the usage of substructures, each node is considered the center of a substructure, and adjacent nodes eventually become centers of similar substructures, resulting in redundancy. Furthermore, the significant differ- ences in structure and properties among compounds can lead to unrelated pairings, making it difficult to integrate information. This heterogeneity negatively affects the prediction results. To address these issues, we propose a drug–drug interaction prediction method based on substructure signature learning (DDI-SSL). This method extracts useful information from local subgraphs surrounding drugs and effectively utilizes substructures to assist in predicting drug side effects. Additionally, a deep clustering algorithm is used to aggregate similar substructures, allowing any individual subgraph to be reconstructed using this set of global signatures. Furthermore, we developed a layer-independent collaborative attention mechanism to model the mutual influence between drugs, generating signal strength scores for each class of drugs to mitigate noise caused by heterogeneity. Finally, we evaluated DDI-SSL on a comprehensive dataset and demonstrated improved performance in DDI prediction compared to state-of-the-art methods.

Hyperspectral image and LiDAR image fusion plays a crucial role in remote sensing by capturing spatial relationships and modeling semantic information for accurate classification and recognition. However, existing methods, like Graph Convolutional Networks (GCNs), face challenges in constructing effective graph structures due to variations in local semantic information and limited receptiveness to large-scale contextual structures. To overcome these limitations, we proposed a invariant attribute-driven binary bi-branch classification (IABC) method which is a unified network that combines binary Convolutional Neural Network (CNN) and GCN with invariant attributes. Our approach utilizes a joint detection framework that can simultaneously learn features from small-scale regular regions and large-scale irregular regions, resulting in an enhanced structured representation of HSI and LiDAR images in the spectral-spatial domain. This approach not only improves the accuracy of classification and recognition but also reduces storage requirements and enables real-time decision-making, which is crucial for effectively processing large-scale remote sensing data. Extensive experiments demonstrates the superior performance of our proposed method in hyperspectral image analysis tasks. The combination of CNNs and GCNs allows for accurate modeling of spatial relationships and effective construction of graph structures. Furthermore, the integration of binary quantization enhances computational efficiency, enabling real-time processing of large-scale data. Therefore, our approach presents a promising opportunity for advancing remote sensing applications using deep learning techniques.

The development of knowledge graphs for water resources as a tool for studying sustainable regional development is a relevant task, as the increasing deterioration of water bodies affects the ecology, economy of the country, as well as the health of the population living near water bodies. Solving this problem requires the development of water resource monitoring methods based on semantic data analysis is required to detect and track sources of pollution and provide recommendations to support decision-making. This research proposes a method of semantic analysis for modeling knowledge graphs and constructing rules that enable the integration of data from heterogeneous sources, semantic compatibility, support for reasoning and inference, facilitate queries and search, and represent knowledge in the field of water resource monitoring. As a result, an ontology based on the SWRL language is created, which enables the expression of complex relationships and derivation of new knowledge, SSN for interaction between the ontology and sensor data, and Time Ontology, which models and analyzes information related to temporal aspects.After populating the ontology and establishing logical connections, SPARQL queries are implemented to retrieve new knowledge about water resources.

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

The basic challenges of this work are twofold: demonstrating the dependence between the functional and topological qualities of partition networks and finding the simplest—with respect to algorithmic complexity—network elements. The study of these problems is based on finding the solution to an appropriate antagonistic vertex game. The results of the numerical simulations of antagonistic partition games demonstrate that the winner’s graphs are “almost always” dense and hyperenergetic compared to the loser’s graphs. These observations reveal that successful evolutionary mechanisms can be realized, in principle, by the simplest objects (such as viruses).

Nowadays, model checking is applied as an accurate technique to verify software systems. The main problem of model checking techniques is the state space explosion. This problem occurs due to the exponential memory usage by the model checker. In this situation, using meta-heuristic and evolutionary algorithms to search for a state in which a property is satisfied/violated is a promising solution. Recently, different evolutionary algorithms like GA, PSO, etc. are applied to find deadlock state. Even though useful, most of them are concentrated on finding deadlock. This paper proposes a fuzzy algorithm in order to analyze reachability properties in systems specified through GTS with enormous state space. To do so, we first extend the existing PSO algorithm (for checking deadlocks) to analyze reachability properties. Then, to increase the accuracy, we employ a Fuzzy adaptive PSO algorithm to determine which state and path should be explored in each step to find the corresponding reachable state. These two approaches are implemented in an open-source toolset for designing and model checking GTS called GROOVE. Moreover, the experimental results indicate that the hybrid fuzzy approach improves speed and accuracy in comparison with other techniques based on meta-heuristic algorithms such as GA and the hybrid of PSO-GSA in analyzing reachability properties.

We present the real number system as a natural generalization of the natural numbers. First, we prove the co-finite topology, $Cof(\mathbb N)$, is isomorphic to the natural numbers. Then, we generalize these results to describe the continuum $[0,1]$. Then we prove the power set $2^{\mathbb Z}$ contains a subset isomorphic to the non-negative real numbers, with all its defining structure of operations and order. Finally, we provide two different constructions of the entire real number line. We see that the power set $2^{\mathbb N}$ can be given the defining structure of $\mathbb R$. The constructions here provided give simple rules for calculating addition, multiplication, subtraction, division, powers and rational powers of real numbers, and logarithms. The supremum and infimum are explicitly constructed by means of a well defined algorithm that ends in denumerable steps. In section 5 we give evidence our construction of $\mathbb N$ and $\mathbb R$ are canonical; these constructions are as natural as possible. In the same section, we propose a new axiomatic basis for analysis. In the last section we provide a series of graphic representations and physical models that can be used to represent the real number system. We conclude that the system of real numbers is completely defined by the order structure of $\mathbb N$.}

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.

In this paper, we review metaheuristic optimization techniques for machine learning with Graph Neural Networks (GNNs), focusing on two major categories: single-solution-based and population-based metaheuristics. We provide an in-depth analysis of Genetic Algorithms (GA) and Particle Swarm Optimization (PSO), highlighting their effectiveness in optimizing GNN hyperparameters. By exploring the strengths and weaknesses of these methods, we aim to provide insights into their application and performance in enhancing the efficiency and accuracy of GNN models. We will also review the similarities of supervised learning and metaheuristic solutions.

Technological advancements and evolving government regulations are driving the adoption of construction equipment powered by renewable energy sources, aiming to significantly reduce emissions. Electrifying non-road mobile machinery (NRMM), particularly self-propelled Rough-Terrain Variable Reach Trucks (RTVRT) with telescopic booms, presents stability challenges. Replacing diesel engines with electric motors and battery packs shifts the centre of gravity, necessitating precise load capacity determinations via load charts to ensure safe operation. This paper introduces a virtual model developed using multi-physic modelling with Bond Graph methodology. The model encompasses crucial components, including the chassis, rear axle, telescopic boom, attachment fork, and wheels, requiring three-dimensional treatment for spatial dynamics resolution. An illustrative example, supported by experimental data, demonstrates the model's capabilities. Special focus is placed on calculating ground wheel reaction forces and hydraulic self-leveling of the attachment fork. Numerical results validate the BG-3D simulation model of the telehandler with 20-Sim as a promising tool for estimating stability limits with satisfactory precision and predicting dynamic behavior across various operating conditions. Moreover, the paper explores potential extensions of the model, such as integrating the virtual vehicle model with a platform of variable inclination in subsequent phases which aims to evaluate telehandler longitudinal and lateral stability, aligning with the ISO 22915 standard and operator safety.

Countless disasters have resulted from climate change, causing severe damage to infrastructure and the economy. These disasters have significant societal impacts, necessitating mental health services for the millions affected. To prepare for and respond effectively to such events, it is crucial to understand people's emotions and the life incidents they experience both before and after a disaster strikes. In this case study, we mined the emotions and life incidents expressed on Twitter during the 2017 Hurricane Harvey. Between August 20 and August 30, we collected a dataset of approximately 400,000 public tweets related to the storm. Using a BERT-based model, we predicted the emotions associated with each tweet. Following emotion prediction, we applied various natural language processing techniques to analyze the content of the tweets, aiming to uncover the 'topics' discussed alongside specific 'emotions.' To efficiently identify these topics, we utilized the Latent Dirichlet Allocation (LDA) technique for topic modeling, which allowed us to bypass manual content analysis and extract meaningful patterns from the data. However, rather than stopping at topic identification, we further refined our analysis by integrating Graph Neural Networks (GNN) and Large Language Models (LLM). The GNN was employed to generate embeddings and construct a similarity graph of the tweets, which was then used to optimize clustering. This step ensured that related tweets were accurately grouped together based on their content and context. Subsequently, we used an LLM to automatically generate descriptive names for each event cluster. This advanced approach allowed us to identify and label life incidents automatically, providing a nuanced understanding of the key issues faced by the community during the hurricane. The results revealed significant emotional shifts as the hurricane reached its most devastating phase. These shifts coincided with pressing concerns and demands from the population, such as evacuation plans, animal safety, safety updates, public policy, help requests, flood impacts, and the spread of fake news. By combining GNN and LLM for automatic event name prediction, our study not only mapped out the emotions but also accurately categorized the specific life incidents that were most relevant during the disaster, offering critical insights for disaster preparedness and response strategies.

This study aims to refine our understanding of evolutionary processes, particularly as they apply to complex organisms, using an innovative graph-based simulation approach. We model the topological evolution of simple (5-node ring graph) and complex (20-node dense random graph) organisms over 10 generations, applying different mutation rates to reflect biological realities. Our results provide intriguing insights into the potentially different evolutionary dynamics at play in simple versus complex organisms. While simple organisms demonstrate high topological flexibility and rapid adaptability, aligning with classical evolutionary models, complex organisms exhibit a surprising degree of structural stability. This stability persists even under mutation rates that would typically drive significant changes in simpler systems. The simulation highlights an important consideration: the intricate, interdependent networks characteristic of complex organisms may create a form of evolutionary buffering. This buffering could modulate the impact of random mutations and natural selection – processes that are cornerstones of evolutionary theory. Our findings suggest that the high degree of complexity in advanced life forms may necessitate a more nuanced view of how evolutionary processes operate across different levels of biological organization. Furthermore, the emergence of new structural motifs in simple organisms, contrasted with the relative conservation in complex topologies, indicates that evolutionary mechanisms may manifest differently across the spectrum of biological complexity. This observation invites a more detailed exploration of how evolutionary principles apply to diverse life forms.These results contribute to the ongoing refinement of evolutionary theory, especially in its application to complex organisms. They suggest that additional mechanisms, such as constrained mutations, epigenetic changes, or higher-order organizational principles, may play significant roles alongside random mutations and natural selection in the evolution of complex life forms.

The accurate diagnosis and effective treatment of mental health disorders such as depression remain challenging owing to the complex underlying causes and varied symptomatology. Traditional information extraction methods struggle to adapt to evolving diagnostic criteria such as the Diagnostic and Statistical Manual of Mental Disorders fifth edition (DSM-5) and to contextualize rich patient data effectively. This study proposes a novel approach for enhancing information extraction from mental health data by integrating medical knowledge graphs and large language models (LLMs). Our method leverages the structured organization of knowledge graphs specifically designed for the rich domain of mental health combined with the powerful predictive capabilities and zero-shot learning abilities of LLMs. This research enhances the quality of knowledge graphs through entity linking and demonstrates superiority over traditional information extraction techniques, making a significant contribution to the field of mental health. It enables a more fine-grained analysis of the data and the development of new applications. Our approach redefines the manner in which mental health data are extracted and utilized. By integrating these insights with existing healthcare applications, the groundwork is laid for the development of real-time patient monitoring systems. The performance evaluation of this knowledge graph highlights its effectiveness and reliability, indicating significant advancements in automating medical data processing and depression management.

In order to make full use of the complementarity of existing navigation systems to improve the navigation and positioning accuracy, this paper investigates the visual/INS integrated navigation system based on the factor graph optimization (FGO) algorithm. In the traditional visual/INS integrated navigation system, there is often the problem of image blurring due to the rapid change of light and shadow captured by the vision sensor and the attitude change of the carrier, which leads to the decrease of the positioning accuracy of the combined navigation system. Therefore, this paper firstly introduces Retinex algorithm and BID algorithm to carry out the design of image de-blurring method; then implements the visual/INS integrated navigation algorithm based on the factor graph optimization method; finally, the experimental scheme is designed, comparative experiments are carried out, and the researched method is verified by using the public dataset. The experimental results show that the combined navigation algorithm realized in this paper has high accuracy, and its positioning accuracy is improved by 40% compared with visual positioning.

This study examines the causal relationships between interest rates in the Korean financial market using a vector error correction model (VECM) and a Bayesian network. The Bayesian network, a novel approach in this context, identifies two distinct transmission channels: one led by call rates (reflecting monetary policy) and another by 10-year Treasury bond yields (reflecting fiscal policy). While the call rate channel aligns with traditional views, affecting bank lending rates, corporate bond spreads, and commercial paper rates, the 10-year Treasury yield channel highlights a separate fiscal policy transmission mechanism, influencing commercial paper rates indirectly through 30-year Treasury yields and directly impacting merchant bank lending rates. This finding suggests that fiscal intervention could potentially interfere with monetary policy, emphasizing the need for coordinated macroeconomic policy measures. The study also emphasizes the role of 10-year Treasury bonds as a benchmark in the Korean bond market, reflecting medium- to long-term economic outlooks and serving as the underlying asset for various derivatives.

An automatic recognizing system of white blood cells can assist hematologists in the diagnosis of many diseases, where accuracy and efficiency are paramount for computer-based system. In this paper, we present a new image processing system to recognize the five types of white blood cells in peripheral blood with marked improvement in efficiency when juxtaposed against mainstream methods. The prevailing deep learning segmentation solutions often utilize millions of parameters to extract high-level image features and neglect the incorporation of prior domain knowledge, which consequently consume substantial computational resources and increase the risk of overfitting, especially when limited medical image samples are available for training. To address these challenges, we propose a novel memory-efficient strategy that exploits graph structures derived from the images. Specifically, we introduce a lightweight superpixel-based Graph Neural Network (GNN) and break new ground by introducing superpixel metric learning to segment nucles and cytoplasm. Remarkably, our proposed segmentation model (SMGNN) achieves state-of-the-art segmentation performance while utilizing at most 10000$\times$ less than the parameters compared to existing approaches. The subsequent segmentation-based cell type classification processes show satisfactory results that such automatic recognizing algorithms are accurate and efficient to execeute in hematological laboratories.

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.

Mobile Mapping System (MMS) plays a crucial role in generating high-precision 3D maps for various applications. However, the traditional MMS that uses tilted LiDAR (light detection and ranging) has limitations in capturing complete information of the environment. To overcome these limitations, we propose a panoramic vision-aided Cartographer simultaneous localization and mapping (SLAM) system for MMS, named "PVL-Cartographer". The proposed system integrates multiple sensors to achieve accurate and robust localization and mapping. It contains two sub-systems, early fusion and middle fusion. In the early fusion, range-maps are created from LiDAR points in a panoramic image space, facilitating the incorporation of visual features. The SLAM system works with both visual features with and without augmented ranges. In the middle fusion, a pose graph combines camera and LiDAR nodes, with IMU (Inertial Measurement Unit) data providing constraints between each node. Extensive experiments in challenging outdoor scenarios demonstrate the effectiveness of the proposed SLAM system in producing accurate results, even in conditions with limited features. Overall, our proposed PVL Cartographer system offers a robust and accurate solution for MMS localization and mapping.

Clustering algorithms for multi-database mining (MDM) rely on computing $(n^2-n)/2$ pairwise similarities between $n$ multiple databases to generate and evaluate $m\in[1, (n^2-n)/2]$ candidate clusterings in order to select the ideal partitioning which optimizes a predefined goodness measure. However, when these pairwise similarities are distributed around the mean value, the clustering algorithm becomes indecisive when choosing what database pairs are considered eligible to be grouped together. Consequently, a trivial result is produced by putting all the $n$ databases in one cluster or by returning $n$ singleton clusters. To tackle the latter problem, we propose a learning algorithm to reduce the fuzziness in the similarity matrix by minimizing a weighted binary entropy loss function via gradient descent and back-propagation. As a result, the learned model will improve the certainty of the clustering algorithm by correctly identifying the optimal database clusters. Additionally, in contrast to gradient-based clustering algorithms which are sensitive to the choice of the learning rate and require more iterations to converge, we propose a learning-rate-free algorithm to assess the candidate clusterings generated on the fly in a fewer upper-bounded iterations. Through a series of experiments on multiple database samples, we show that our algorithm outperforms the existing clustering algorithms for MDM.

In this paper, we observe that if X is a set and (Bin(X), □) is the semigroup of binary systems on X, then its center ZBin(X) consists of the locally-zero-semigroups and that these can be modeled as (simple) graphs and conversely. Using this device we show that we may obtain many results of interest concerning groupoids by reinterpreting graph theoretical properties and at the same time results on graphs G may be obtained by considering them as elements of centers of the semigroups of binary systems (Bin(X), □) where X = V(G), the vertex set of G.

Social recommendation is almost as the integration of the business platform and social platform, and gradually become a top in recommendation system. Social recommendation algorithm solves the problem of cold start and data sparseness for traditional commodity, while the internal structure of the relationship graph in social relations has not been fully excavated. This paper proposes two models of Micro Relation Transfer Model and Macro Relation Transfer Model of social relations, and applies the social relations transfer models into the social recommendation system. A relationship graph is built from the relationship between customers on the Internet. Micro Relation Transfer Model establishes the transfer activation function by calculating the relationship between the two customers using the similarity of interests set. Micro Relation Transfer Model spreads the relationship of friends by calculating the proportion of common neighbors held by the customer's social relations. In order to effectively control the transmission range and effect of social relations graph, we introduce pruning algorithm based on Monte Carlo Decision Tree convergence algorithm. The experimental results show that SRRTC algorithm enhances the success rate and stability significantly.

Course recommendation is an important service of Intelligent tutoring systems (ITS), the rapid development of large-scale online courses has generated a substantial amount of learning process data for online learning platforms, providing valuable support for understanding learners' interests and preferences. However, despite made considerable achievements, there are still unresolved challenges:(1) Current research neglects the sequential relationship between the course learners learn. (2) It does not take advantage of the differences in learners' interest in different courses during the knowledge dissemination process. To overcome these challenges, we propose an innovative solution called PGDB (Preference-aware graph diffusion network and BiLSTM) for course recommendation. Specifically, we analyze learners' preferences for courses and relational paths using a relation-aware multi-head attention network, learn the semantic diversity of different contexts, effectively distinguish the difference of learners' interest in different courses in the process of knowledge transmission. In addition, the temporal preference modeling module employs a bi-directional long short-term memory network to mine learners' interest evolution patterns, generating learner-dependent representations, efficient use of the sequential relationship between the courses taken by learners. Experimental results on real datasets demonstrate that the proposed model greatly exceeds the performance of the most recent baseline models, thereby validating the model's effectiveness.

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.

Electroencephalography (EEG) signals are the primary source for discriminating the preictal from the interictal stage, enabling early warnings before the seizure onset. The epileptic seizure prediction models face significant challenges due to data scarcity, diversity, and privacy. This paper proposes a three-tier architecture for epileptic seizure prediction associated with the Federated Learning (FL) model that enhances the capability by utilizing the significant amount of seizure patterns from globally distributed patients with data privacy. The determination of the preictal state is influenced by global and local model-assisted decision-making by modeling the two-level edge layer. Integrating the Spiking Encoder (SE) with Graph Convolutional Neural Network (Spiking-GCNN) works as the local model trained using the bi-timescale approach. Each local model utilizes the aggregated seizure knowledge from the different medical centers through FL and determines the preictal probability in the coarse-grained personalization. The Adaptive Neuro-Fuzzy Inference System (ANFIS) is utilized in fine-grained personalization to recognize epileptic seizure patients by examining the outcomes of the FL model, heart rate variability features, and patient-specific clinical features. The proposed seizure prediction is evaluated using benchmark datasets by comparing them with the existing works to demonstrate the potential results.

The accurate prediction of molecular properties such as lipophilicity and aqueous solubility are of great importance and pose challenges in several stages of the drug discovery pipeline. Machine learning methods like graph-based neural networks (GNNs) have shown exceptionally good performance in predicting these properties. In this work, we introduce a novel GNN architecture, called directed edge graph isomorphism network (D-GIN). It is composed of two distinct sub-architectures (D-MPNN, GIN) and achieves an improvement in accuracy over its sub-architectures employing various learning, and featurization strategies. We argue that combining models with different key aspects help make graph neural networks deeper and simultaneously increase their predictive power. Furthermore, we address current limitations in assessment of deep-learning models, namely, comparison of single training run performance metrics, and offer a more robust solution.

Social media platforms are entirely an undeniable part of the lifestyle from the past decade. Analyzing the information being shared is a crucial step to understand humans behavior. Social media analysis is aiming to guarantee a better experience for the user and risen user satisfaction. But first, it is necessary to know how and from which aspects to compare users with each other. In this paper, an intelligent system has been proposed to measure the similarity of Twitter profiles. For this, firstly, the timeline of each profile has been extracted using the official Twitter API. Then, all information is given to the proposed system. Next, in parallel, three aspects of a profile are derived. Behavioral ratios are time-series-related information showing the consistency and habits of the user. Dynamic time warping has been utilized for comparison of the behavioral ratios of two profiles. Next, Graph Network Analysis is used for monitoring the interactions of the user and its audience; for estimating the similarity of graphs, Jaccard similarity is used. Finally, for the Content similarity measurement, natural language processing techniques for preprocessing and TF-IDF for feature extraction are employed and then compared using the cosine similarity method. Results have presented the similarity level of different profiles. As the case study, people with the same interest show higher similarity. This way of comparison is helpful in many other areas. Also, it enables to find duplicate profiles; those are profiles with almost the same behavior and content.

We introduce the Open Research Knowledge Graph Agriculture Named Entity Recognition (the ORKG Agri-NER) corpus and service for contribution-centric scientific entity extraction and classification. The ORKG Agri-NER corpus is a seminal benchmark for the evaluation of contribution-centric scientific entity extraction and classification in the agricultural domain. It comprises titles of scholarly papers that are available as Open Access articles on a major publishing platform. We describe the creation of this corpus and highlight the obtained findings in terms of the following features: 1) a generic conceptual formalism focused on capturing scientific entities in agriculture that reflect the direct contribution of a work; 2) a performance benchmark for named entity recognition of scientific entities in the agricultural domain by empirically evaluating various state-of-the-art sequence labeling neural architectures and transformer models; and 3) a delineated 3-step automatic entity resolution procedure for the resolution of the scientific entities to an authoritative ontology, specifically AGROVOC that is released in the Linked Open Vocabularies cloud. With this work we aim to provide a strong foundation for future work on the automatic discovery of scientific entities in the scholarly literature of the agricultural domain.

Every biological image contains quantitative data that can be used to test hypotheses about how patterns were formed, what entities are associated with one another, and whether standard mathematical methods inform our understanding of biological phenomena. In particular, spatial point distributions and polygonal tessellations are particularly amendable to analysis with a variety of graph theoretic, computational geometric, and spatial statistical tools such as: Voronoi Polygons; Delaunay Triangulations; Perpendicular Bisectors; Circumcenters; Convex Hulls; Minimal Spanning Trees; Ulam Trees; Pitteway Violations; Circularity; Clark-Evans spatial statistics; Variance to Mean Ratios; Gabriel Graphs; and, Minimal Spanning Trees. Furthermore, biologists have developed a number of empirically related correlations for polygonal tessellations such as: Lewis’s Law (the number of edges of convex polygons are positively correlated with the areas of these polygons): Desch’s Law (the number of edges of convex polygons are positively correlated with the perimeters of these polygons); and Errara’s Law (daughter cell areas should be roughly half that of their parent cells’ areas). We introduce a new Pitteway Law that the number of sides of the convex polygons in a Voronoi tessellation of biological epithelia is proportional to the minimal interior angle of the convex polygons as angles less than 90 degrees result in Pitteway violations of the Delaunay dual of the Voronoi tessellation.

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

Polyhedral cages (p-cages) describe the geometry of some families of artificial protein cages. We identify the p-cages made out of families of equivalent polygonal faces such that the faces of 1 family has 5 neighbours and P_1 edges, while those of the other family have 6 neighbours and P_2 edges. We restrict ourselves to polyhedral cages where the holes are adjacent to at most 4 faces. We characterise all the p-cages with a deformation of the faces, compared to regular polygons, not exceeding 10%.

The communication space allows for the exchange of information and ensures the movement of material flows and passenger flows. By communication space, we mean the movement of information and material flows of various natures based on transport systems, in this case, air transport systems. The direction and intensity of these flows to varying degrees reflect the main social and economic processes. Time series reflecting the intensity of passenger flows and cargo transportation over a given time horizon were selected as a source of information used for analysis. An information-theoretical measure based on the assessment of entropy transfer between time series elements is used as a research tool. Based on the obtained paired estimates of entropy transfer between the selected time series, an entropy transfer matrix is formed, which allows considering a set of time series as a communication system within the framework of system analysis. The resulting matrices are used to form entropy transfer graphs, which allow investigating the properties of time series based on directed graph analysis methods. The article examines examples of the analysis of the cognitive model of transportation, the analysis of the regional communication space, and the analysis of changes in the global communication field.

In this paper, we demonstrate a useful interaction between the theory of clique partitions, edge clique covers of a graph, and the spectra of graphs. Using a clique partition and an edge clique cover of a graph we introduce the notion of a vertex-clique incidence matrix for a graph and produce new lower bounds for the negative eigenvalues and negative inertia of a graph. Moreover, utilizing these vertex-clique incidence matrices, we generalize several notions such as the signless Laplacian matrix, and develop bounds on the incidence energy and the signless Laplacian energy of the graph. %The tight upper bounds for the energies of a graph and its line graph are given. More generally, we also consider the set $S(G)$ of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent. An important parameter in this setting is $q(G)$, and is defined to be the minimum number of distinct eigenvalues over all matrices in $S(G)$. For a given graph $G$ the concept of a vertex-clique incidence matrix associated with an edge clique cover is applied to establish several classes of graphs with $q(G)=2$.

Given several nonnegative matrices with a single pattern of allocation among their zero/nonzero elements, the average matrix should have the same pattern, too. This is the first tenet of the pattern-multiplicative average (PMA) concept, while the second one suggests the multiplicative (or geometric) nature of averaging. The original concept of PMA was motivated by the practice of matrix population models as a tool to assess the population viability from long-term monitoring data. The task has reduced to searching for an approximate solution to an overdetermined system of polynomial equations for unknown elements of the average matrix (G), hence to a nonlinear constrained minimization problem for the matrix norm. Former practical solutions faced certain technical problems, which required sophisticated algorithms but returned acceptable estimates. Fresh idea to use the eigenvalue approximation ensues also from the basic equation of averaging, which determines the exact value of λ1(G), the dominant eigenvalue of matrix G, too, and the corre-sponding eigenvector. These are bound by the well-known linear equations, which reduce the task to a standard problem of linear programing (LP). The LP approach is realized for 13 fixed-pattern matrices gained in a case study of Androsace albana, an alpine short-lived perennial, monitored on permanent plots during 14 years. A standard software routine reveals the unique exact solution, rather than an approximate one, to the PMA problem, which turns the LP approach into ‘’the best of versatile optimization tools”. The exact solution turns out to be peculiar in reaching zero bounds for certain nonnegative entries of G, which deserves a modified problem formulation separating the lower bounds from zero.

In this article, we investigate limitations of importing methods based on algorithmic information theory from monoplex networks into multidimensional networks (such as multilayer networks) that have a large number of extra dimensions (i.e., aspects). In the worst-case scenario, it has been previously shown that node-aligned multidimensional networks with non-uniform multidimensional spaces can display exponentially larger algorithmic information (or lossless compressibility) distortions with respect to their isomorphic monoplex networks, so that these distortions grow at least linearly with the number of extra dimensions. In the present article, we demonstrate that node-unaligned multidimensional networks, either with uniform or non-uniform multidimensional spaces, can also display exponentially larger algorithmic information distortions with respect to their isomorphic monoplex networks. However, unlike the node-aligned non-uniform case studied in previous work, these distortions in the node-unaligned case grow at least exponentially with the number of extra dimensions. On the other hand, for node-aligned multidimensional networks with uniform multidimensional spaces, we demonstrate that any distortion can only grow up to a logarithmic order of the number of extra dimensions. Thus, these results establish that isomorphisms between finite multidimensional networks and finite monoplex networks do not preserve algorithmic information in general and highlight that the algorithmic information of the multidimensional space itself needs to be taken into account in multidimensional network complexity analysis.

In scenarios such as natural disasters and military strike, it is common for unmanned aerial vehicles (UAVs) to form groups to execute reconnaissance and surveillance. To ensure the effectiveness of UAV communications, repeated resource acquisition issues and transmission mechanism design need to be addressed urgently. In this paper, we build an information interaction scenario in a Flying Ad-hoc network (FANET). The data transmission problem with the goal of throughput maximization is modeled as a coalition game framework. Then, a novel mechanism of coalition selection and data transmission based on group-buying is investigated. Since large-scale UAVs will generate high transmission overhead due to the overlapping resource requirements, we propose a resource allocation optimization method based on distributed data content. Comparing existing works, a data transmission and coalition formation mechanism is designed. Then the system model is classified into graph game and coalition formation game. Through the design of the utility function, we prove that both games have stable solutions. We also prove the convergence of the proposed approach with coalition order and Pareto order. Binary log-linear learning based coalition selection algorithm (BLL-CSA) is proposed to explore the stable coalition partition of system model. Simulation results show that the proposed data transmission and coalition formation mechanism can achieve higher data throughput than the other contrast algorithms.

We prove a version of Ekeland Variational Principle (EkVP) in a weighted graph $G$ and its equivalence to Caristi fixed point theorem and to Takahashi minimization principle. The usual completeness and topological notions are replaced with some weaker versions expressed in terms of the graph $G$. The main tool used in the proof is the OSC property for sequences in a graph. Converse results, meaning the completeness of graphs for which one of these principles holds is also considered.

In this work, a hybrid component Fault Detection and Diagnosis (FDD) approach for industrial sensor systems is established and analyzed, to provide a hybrid schema that combines the advantages and eliminates the drawbacks of both model-based and data-driven methods of diagnosis. Moreover, it shines the light on a new utilization of Random Forest (RF) together with model-based diagnosis, beyond its ordinary data-driven application. RF is trained and hyperparameter tuned using three-fold cross validation over a random grid of parameters using random search, to finally generate diagnostic graphs as the dynamic, data-driven part of this system. This is followed by translating those graphs into model-based rules in the form of if-else statements, SQL queries or semantic queries such as SPARQL, in order to feed the dynamic rules into a structured model essential for further diagnosis. The RF hyperparameters are consistently updated online using the newly generated sensor data to maintain the dynamicity and accuracy of the generated graphs and rules thereafter. The architecture of the proposed method is demonstrated in a comprehensive manner, and the dynamic rules extraction phase is applied using a case study on condition monitoring of a hydraulic test rig using time-series multivariate sensor readings.

In this work, A hybrid component Fault Detection and Diagnosis (FDD) approach for industrial sensor systems is established and analyzed, to provide a hybrid schema that combines the advantages and eliminates the drawbacks of both model-based and data-driven methods of diagnosis. Moreover, spotting the light on a new utilization of Random Forest (RF) together with model-based diagnosis, beyond its ordinary data-driven application. RF is trained and hyperparameter tuned using 3-fold cross-validation over a random grid of parameters using random search, to finally generate diagnostic graphs as the dynamic, data-driven part of this system. Followed by translating those graphs into model-based rules in the form of if-else statements, SQL queries or semantic queries such as SPARQL, in order to feed the dynamic rules into a structured model essential for further diagnosis. The RF hyperparameters are consistently updated online using the newly generated sensor data, in order to maintain the dynamicity and accuracy of the generated graphs and rules thereafter. The architecture of the proposed method is demonstrated in a comprehensive manner, as well as the dynamic rules extraction phase is applied using a case study on condition monitoring of a hydraulic test rig using time series multivariate sensor readings.

One of the industries with the fastest rate of growth is healthcare, and this industry's enormous data requires extensive cloud storage. The cloud may offer some protection, but there is no assurance that data owners can rely on it for refuge and privacy amenities. Therefore, it is essential to offer security and privacy protection. Increased customer satisfaction with security and privacy preservation is crucial since healthcare big data and its sources are stored in the cloud and contain increasingly private and sensitive information. However, maintaining privacy and security in an untrusted green cloud environment is difficult, thus the data owner should have complete data control. A new work SecPri-BGMPOP(security and privacy of Boost graph Convolutional Network -Pinpointing-Optimization Performance) is suggested that can offer a solution that involves several different steps in order to handle the numerous problems relating to security and protecting privacy. Initially Boost Graph Convolutional Network Clustering (BGCNC) algorithm, which reduces computational complexity in terms of time and memory measurements, is first applied to the input dataset to begin the clustering process. Second, enlarge by employing a piece of the magnifying bit string to generate a safe key, pinpointing based encryption avoids amplify leakage even if a rival or attacker decrypts the key or asymmetric encryption. Finally, to determine the accuracy of the method, an optimal key was created using a meta-heuristic algorithmic framework called Hybrid fragment horde bland lobo Optimization (HFHBLO). Our proposed method currently kept in a cloud environment, allowing analytics users to utilize it without risking their privacy or security.

The technical capabilities of modern Industry 4.0 and Industry 5.0 are rather vast and growing exponentially daily. The present-day Industrial Internet of Things (IIoT) combines manifold underlying technologies that require real-time interconnections and communications among heterogeneous devices. Smart cities are established with sophisticated designs and control for seamless Machine-to-Machine (M2M) communication to optimize resources, costs, performances, and energy distribution. All the sensory devices within a building interact to maintain a sustainable climate for residents and intuitively optimize the energy distribution to optimize energy production. However, it encompasses quite a few challenges for devices that lack compatible and interoperable designs. Conventional solutions are restricted to limited domains or rely on engineers to design and deploy translators for each pair of ontologies. This is a costly process in terms of engineering efforts and computational resources. The issue persists that a new device with a different ontology must be integrated into an existing IoT network. We propose a self-learning model that can determine the taxonomy of devices given their ontology meta-data and structural information. The model finds matches between two distinct ontologies using the Natural Language Processing (NLP) approach for learning linguistic contexts. Then, by visualizing the ontology network as a knowledge graph, it is possible to learn the structure of the meta-data and understand the device's message formulation. Finally, it can align entities of both ontology graphs similar in context and structure. Furthermore, the model performs dynamic M2M translation without requiring extra engineering or hardware efforts.

This paper presents a limited scope dynamic probabilistic risk assessment (D-PRA) on the survivability of commercial of the shelf (COTS) drones tasked with surveilling areas with varying radiation levels after a nuclear accident. The D-PRA is based on a discrete-dynamic event tree (D-DET) approach, which couples with the OpenEPL error propagation framework to model sequences leading to Loss of Mission (LOM) scenarios due to component failures in the drone’s navigation system. Radiation effects are simulated by calculating the total ionizing dose (TID) against the permissible limit per component, and errors are propagated within the electronic hardware and software blocks to quantify navigation system availability per radiation zone. The proposed methods are integrated into the traditional event tree/fault tree approach and the most vulnerable components are radiation-hardened (RAD-HARD) to the extent specified by a predefined mission success criterion. The results demonstrate the usefulness of the proposed approach in performing trade studies for incorporating COTS components into RAD-HARD drone designs.

This paper presents a novel approach to demonstrate the Collatz Conjecture, an unsolved problem in mathematics stating that all positive integers will eventually converge to 1 when subjected to a recursive sequence of operations. We introduce Algebraic Inverse Trees (AITs), innovative data structures that characterize relationships within the Collatz sequence by tracing inverse transformations back to the origin. Leveraging properties unveiled through this inverted representation, including absence of non-trivial cycles and guaranteed convergence of paths, we construct a topological framework to formally prove that all trajectories invariably lead to 1 under the Collatz iterative process. This modern technique provides not only the machinery to manifest a rigorous proof, but also grants intuitive insights into the deep complexity of this notorious yet elementary conjecture.

The purpose of water treatment through ultraviolet (UV) radiation is to interrupt the development and multiplication of microorganisms by preventing their growth and reproduction.Ultraviolet treatment has become a very affordable solution to produce clean water of optimal quality in regions where access to drinking water is essential. The experimental water treatment unit is powered by a photovoltaic (PV) source. It incorporates a discharge lamp used to generate ultraviolet radiation, which is harnessed to address bacteriological issues related to water quality. This lamp is continuously powered by a photovoltaic (PV) source through an inverter and an electronic ballast. The water treatment system also includes a motor pump designed to draw contaminated water from the input reservoir, a flow control valve to adjust flow rates as needed, and a filter aimed at enhancing the quality of the contaminated water. The water circulates between the input reservoir (contaminated water) and the output reservoir (treated water) through the UV lamp. The relationship between the intensity of the UV lamp and the water flow rate can ensure an adequate water quality.

Chatbots have gained widespread popularity for their task automation capabilities and consistent availability in various domains, including education. However, their ability to adapt to the continuously evolving and dynamic nature of knowledge is limited. This research investigates the implementation of an internet wizard to enhance the knowledge base of an open-domain question-answering chatbot. The proposed approach leverages search engines, particularly Google, and its features, including feature snippets, knowledge graph, and organic search, in conjunction with data science and natural language models. This mechanism empowers the chatbot to dynamically access the extensive and up-to-date knowledge available on the web, enabling the provision of real-time and pertinent answers to user queries sourced from web documents. A pilot study in a higher education context evaluated the chatbot's mechanism and features, confirming its proficiency in generating responses across a broad range of educational and non-educational topics. Positive feedback and high user satisfaction validate these findings. Notably, the chatbot's dynamic feature of retrieving related or follow-up questions from search engines significantly enhances student engagement and facilitates exploration of supplementary information beyond the curriculum.

Maintaining a healthy cyber society is a big challenge due to the users’ freedom of expression and behaving. It can be solved by monitoring and analyzing the users’ behavior and taking proper actions towards them. This research aims to present a platform that monitors the public content on Twitter by extracting tweet data. After maintaining the data, the users’ interactions are analyzed using Graph Analysis methods. Then the users’ behavioral patterns are analyzed by applying Metadata Analysis, in which the timeline of each profile is obtained; also, the time-series behavioral features of users are investigated. Then in the Abnormal Behavior Detection Filtering component, the interesting profiles are selected for further examinations. Finally, in the Contextual Analysis component, the contents will be analyzed using natural language processing techniques; A binary text classification model (SVM + TF-IDF with 88.89% accuracy) for detecting if the tweet is related to crime or not. Then, a sentiment analysis method is applied to the crime-related tweets to perform aspect-based sentiment analysis (DistilBERT + FFNN with 80% accuracy); because sharing positive opinions about a crime-related topic can threaten society. This platform aims to provide the end-user (Police) suggestions to control hate speech or terrorist propaganda.

The teaching of mathematics at the Faculty of Military Technology of the University of Defense in the first two years of the five-year Military master’s degree is divided into the teaching of students in four specializations: Military Technologies – Mechanical, Military Technologies – Electrical, Military Geography and Cartography, and Cybersecurity. The article discusses the previous five-year experience in teaching the subjects Mathematics I, Mathematics II, Mathematics III, and Graph theory for the specialization in Cybersecurity, that the author of the paper gained while teaching, as a guarantor of these four subjects. The article provides an overview of the topics that are covered, typical exam assignments, and an evaluation of the results of the semester exams in the five years since the accreditation of the Cybersecurity specialization was granted.

Various factors, such as uncertainty of component parameters and uncertainty of sensor meas-urement values, contribute to the difficulty of fault detection in the landing gear retrac-tion/extension hydraulic system. In this paper, we introduce linear fractional transformation technology and uncertainty analysis theory for the construction of the diagnostic bond graph of the landing gear retraction/extension hydraulic system. In this way, interval analytical redundancy relations and fault signature matrix can be derived. Using the fault signature matrix, existing faults of the system can be preliminarily detected and isolated. Additionally, interval analytical re-dundancy relations can be used to detect system faults in detail, and cases analysis can be carried out to determine if the actuator is externally or internally leaky, and if the landing gear selector valve is reversing stuck. Compared to the traditional analytical redundancy relations, this method takes into account the negative factors of uncertainty; and compared to the traditional absolute diagnostic threshold, the interval diagnostic threshold is more accurate and sensitive.

Background Hokkaido is the northernmost, least populous, and coldest of the Japanese islands. It was the first prefecture to be affected by COVID-19, while Kanagawa is home to one of the most populous areas of Japan, namely the Tokyo metro area. The Japanese government responded early during the pandemic by identifying infected patients, contact tracing, and performing PCR analysis on anyone who was suspected of having been exposed to SARS-CoV-2. The government has also been publishing information about each individual who tested positive for the virus. Both Hokkaido and Kanagawa started recording COVID-19 cases in the winter of 2020 and have detailed records of thousands of patients, thus providing an invaluable resource for the transmission and behavior of the virus. Methods The current study analyzed the COVID-19 registry data from the Hokkaido and Kanagawa prefectures. The Hokkaido registry contained 1,269 cases (674 (53%) females and 595 (47%) males) recorded between February 14 and July 22, 2020. The Kanagawa registry had 3,123 cases (1,346 (43%) females and 1,777 (57%) males. The final data contained a total of 4,392 cases (2,020 (46%) females and 2,372 (54%) males). By leveraging the information on viral transmission paths available in the registry data, we performed exponential random graph model (ERGM) network analysis to examine demographic and symptomological homophilies of the SARS-CoV-2 viral transmission networks. Results We observed age, symptomatic, and asymptomatic homophilies in both prefectures. Furthermore, those patients who contracted the virus through secondary or tertiary contacts were more likely to be asymptomatic than those who contracted it from primary infection cases. The transmission networks showed that transmission occurred significantly in healthcare settings, as well as in families, although the size of the networks was small in the latter. Most of the transmissions stopped at the primary and secondary levels and no transmission beyond quaternary was observed. We also observed a higher level of asymptomatic transmission in Kanagawa than in Hokkaido. Conclusions Symptom homophilies are an important component of COVID-19 and suggest that nuanced genetic differences in the virus may affect its epithelial cell type range and can thus result in the diversity of symptoms seen in individuals infected by SARS-CoV-2. Moreover, environmental variables such as temperature and humidity may also be playing an important role in the overall pathogenesis of the virus.

In the realm of molecular science, intricate relationships between molecular structures and their biomedical and pharmacological characteristics have been revealed through empirical experiments. This exploration hinges on the application of numerical descriptors, known as Topological Indices, which illuminate the inherent properties of diverse molecular structures. With particular significance in the medical and pharmaceutical domains, these indices facilitate the prediction of biological features for new chemical compounds and drugs by quantifying weighted entropies. In the context of this paper, we delve into the concept of graph entropy, weaving it intricately with the topological properties of the crystalline framework of the copper oxide molecule, denoted as Cu\textsubscript{2}O$[i,j,t]$. Our primary objective is to unravel the mathematical symphony underlying the structural intricacies of Cu\textsubscript{2}O$[i,j,t]$ and to imbue it with the conceptual essence of entropy. We accomplish this through the computation of entropy, leveraging various topological indices, including weight. In addition to our analytical journey, we present a graphical comparison that juxtaposes the computed indices and entropies, shedding light on the interplay between mathematical analysis and the structural elegance of Cu\textsubscript{2}O$[i,j,t]$. This endeavor contributes to a deeper understanding of the material's multifaceted applications, spanning domains from chemical sensors to solar cells, photocatalysis, and batteries, where Cu\textsubscript{2}O's crystallographic structure plays a pivotal role.

Traffic shaping is a critical task in software-defined -IoT networks (SDN-IoTs) to efficiently manage network resources and ensure Quality of Service (QoS) for end-users. However, traditional traffic shaping approaches based on queuing theory or static policies may not be effective due to the dynamic and unpredictable nature of network traffic. In this paper, we propose a novel approach that leverages Graph Neural Networks (GNNs) and Multi-arm Bandit algorithms to dynamically optimize traffic shaping policies based on real-time network traffic patterns. Specifically, our approach uses a GNN model to learn and predict network traffic patterns and a Multi-arm Bandit algorithm to optimize traffic shaping policies based on these predictions. We evaluate the proposed approach on three different datasets, including a simulated corporate network (KDD Cup 1999), a collection of network traffic traces (CAIDA), and a simulated network environment with both normal and malicious traffic (NSL-KDD). The results demonstrate that our approach outperforms other state-of-the-art traffic shaping methods, achieving higher throughput, lower packet loss, and lower delay, while effectively detecting anomalous traffic patterns. The proposed approach offers a promising solution to traffic shaping in SDNs, enabling efficient resource management and QoS assurance

With the growth of air traffic demand in busy airspace, there is an urgent need for airspace sectorization to increase air traffic throughput and ease the pressure on controllers. The purpose of this paper is to develop a method framework that can perform airspace sectorization automatically, reasonably, which can be used as an advisory tool for controllers as an automatic system, especially for eliminating irregular sector shapes generated by simulated annealing algorithm (SAA) based on region growth method. Two graph cutting method, dynamic Monte Carlo method by changing location of flexible vertices (MC-CLFV) and Monte Carlo method by radius changing (MC-RC) were developed to eliminating irregular sector shapes generated by SAA in post-processing. The experimental results show that the proposed method framework of AS can automatically and reasonably generate sector design schemes that meet the design criteria. Our methodology framework and software can provide assistant design and analysis tools for airspace planners to design airspace, improve the reliability and efficiency of airspace design, and reduce the burden of airspace planners. In addition, this lays the foundation for reconstructing airspace with more intelligent method.

Creating self-learning algorithms, developing deep neural networks and improving other methods that "learn" for various areas of human activity is the main goal of the theory of machine learning. It helps to replace the human with a machine, aiming to increase the quality of production. The theory of artificial neural networks, which already have replaced the humans in problems of detection of moving objects, recognition of images or sounds, time series prediction, big data analysis and numerical methods remains the most dispersed branch of the theory of machine learning. Certainly, for each area of human activity it is necessary to select appropriate neural network architectures, methods of data processing and some novel tools from applied mathematics. But the universal problem for all these neural networks with specific data is the achieving the highest accuracy in short time. Such problem can be resolved by increasing sizes of architectures and improving data preprocessing, where the accuracy rises with the training time. But there is a possibility to increase the accuracy without time growing, applying optimization methods. In this survey we demonstrate existing optimization algorithms of all types, which can be used in neural networks. There are presented modifications of basic optimization algorithms, such as stochastic gradient descent, adaptive moment estimation, Newton and quasi-Newton optimization methods. But the most recent optimization algorithms are related to information geometry, for Fisher-Rao and Bregman metrics. This approach in optimization extended the theory of classic neural networks to quantum and complex-valued neural networks, due to geometric and probabilistic tools. There are provided applications of all introduced optimization algorithms, what delighted many kinds of neural networks, which can be improved by including any advanced approaches in minimization of the loss function. Afterwards, we demonstrated ways of developing optimization algorithms in further researches, engaging neural networks with progressive architectures. Classical gradient based optimizers can be replaced by fractional order, bilevel and, even, gradient free optimization methods. There is a possibility to add such analogues in graph, spiking, complex-valued, quantum and wavelet neural networks. Besides the usual problems of image recognition, time series prediction, object detection, there are many are other tasks for modern theory of machine learning, such as solving problem of quantum computations, partial differential and integro-differential equations, stochastic processes and Brownian motion, making decisions and computer algebra.

The influence and importance of research and development (R&D) for business sustainability have gained increasing interests, especially in the high-tech sector. However, the efforts of R&D might cause complex and mixed impacts on the financial results considering the associated expenses. Thus, this study aims to examine how R&D efforts may influence business to improve its financial performance considering the dual objectives: the gross and the net profitability. This research integrated a rough-set-based soft computing technique and multiple criteria decision-making (MCDM) methods to explore this complex and yet valuable issue. A group of public listed companies from Taiwan, all in the semiconductor sector, was analyzed as a case study. Initially, more than 30 variables were considered, and the adopted soft computing technique retrieved 14 core attributes—for the dual profitability objectives—to form the evaluation model. The importance of R&D for pursuing superior financial prospects is confirmed, and the empirical case demonstrates how to guide an individual company to plan for improvements to achieve its long-term sustainability by this hybrid approach.

Smart grid software interconnects multiple Engineering disciplines (power systems, communication, software and hardware technology, instrumentation, big data, etc.). The software architecture is an evolving concept in smart grid systems in which systematic architecture development is a challenging process. The architecture has to realize the complex legacy power grid systems and cope up with current Information and Communication Technologies (ICT). The distributed generation in smart grid environment expects the software architecture to be distributed and to enable local control. Smart grid architecture should also be modular, flexible and adaptable to technology upgrades. In this paper, the authors have made a comprehensive review on architecture for smart grids. An in depth analysis of layered and agent based architectures is presented and compared under various domains.

This paper offers a novel geometric and visual approach to the renowned Four Color Map Theorem and K5 non-planarity problem while unveiling their profound connection to the "kissing number" problem in 2D. We represent planar graphs through circles and tangents, simplifying complex structures and shedding light on these classic problems. Our proofs by contradiction, rooted in the kissing number concept, reveal that both the Four Color Map Theorem and K5 non-planarity are fundamentally linked, as they pivot around the concept of coloring. This study bridges the realms of geometry and graph theory, providing fresh insights and emphasizing the significance of the kissing number problem in various fields.

This paper introduces an innovative theoretical framework for quantum-inspired data embeddings, grounded in foundational concepts of quantum mechanics such as superposition and entanglement. This approach aims to advance semi-supervised learning in contexts characterized by limited labeled data by enabling more intricate and expressive embeddings that capture the underlying structure of the data effectively. Grounded in foundational quantum mechanics concepts such as superposition and entanglement, this approach redefines data representation by enabling more intricate and expressive embeddings. Emulating quantum superposition encodes each data point as a probabilistic amalgamation of multiple feature states, facilitating a richer, multidimensional representation of underlying structures and patterns. Additionally, quantum-inspired entanglement mechanisms are harnessed to model intricate dependencies between labeled and unlabeled data, promoting enhanced knowledge transfer and structural inference within the learning paradigm. In contrast to conventional quantum machine learning methodologies that often rely on quantum hardware, this framework is fully realizable within classical computational architectures, thus bypassing the practical limitations of quantum hardware. The versatility of this model is illustrated through its application to critical domains such as medical diagnosis, resource-constrained natural language processing, and financial forecasting—areas where data scarcity impedes the efficacy of traditional models. Experimental evaluations reveal that quantum-inspired embeddings substantially outperform standard approaches, enhancing model resilience and generalization in high-dimensional, low-sample scenarios. This research marks a significant stride in integrating quantum theoretical principles with classical machine learning, broadening the scope of data representation and semi-supervised learning while circumventing the technological barriers of quantum computing infrastructure.