Graph Neural Networks (GNNs) are susceptible to adversarial injection attacks, potentially compromising the model integrity, reducing accuracy, and posing security risks. However, most of the current countermeasures focus on enhancing the robustness...
This paper presents a versatile approach to the synthesis and design of a bond graph model and a Kalman filter observer for an industrial back-support exoskeleton. Actually, the main purpose of developing a bond graph model is to investigate and unde...
This article investigates the issue of observer-based adaptive time-varying formation-containment tracking (TVFCT) for multi-agent systems (MASs) with bounded unknown input in directed graphs. By applying estimated statuses of neighboring agents, two...
Multiple unmanned aerial vehicles (Multi-UAV) systems have recently demonstrated significant advantages in some real-world scenarios, but the limited communication range of UAVs poses great challenges to multi-UAV collaborative decision-making. By co...
The health monitoring of CRF (circulation water) pumps is essential for prognostics and management in nuclear power plants. However, the operational status of CRF pumps can vary due to environmental factors and human intervention, and the interrelati...
This paper considers the solvability of several fundamental problems in asynchronous message-passing distributed systems in the presence of Byzantine processes using distributed algorithms. These problems are the following: mutual exclusion, global s...
This paper considers the problem of estimating the states in an unobservable power system, where the number of measurements is not sufficiently large for conventional state estimation. Existing methods are either based on pseudo-data that is inaccura...
This paper considers the observer-based leader–follower consensus problem of multi-agent systems with one-sided Lipschitz conditions and quadratic inner-boundedness nonlinearity. Based on the relative outputs of neighboring agents, an adaptive...
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...
In this paper, in order to describe complex network systems, we firstly propose a general modeling framework by combining a dynamic graph with hybrid automata and thus name it Dynamic Graph Hybrid Automata (DGHA). Then we apply this framework to mode...
Multi-Unmanned Aerial Vehicle (Multi-UAV) cooperative search represents a cutting-edge research direction in the field of unmanned aerial vehicle applications. The use of multi-UAV systems for low-altitude target search and area surveillance has beco...
People’s interactions with each other form the social relations in society. Understanding human social relations in the public space is of great importance for supporting the public administrations. Recognizing social relations through visual data ca...
The purpose of constructing onboard observation mission queues is to improve the execution efficiency of onboard tasks and reduce energy consumption, representing a significant challenge in achieving efficient global military reconnaissance and targe...
Earth observation satellite task scheduling research plays a key role in space-based remote sensing services. An effective task scheduling strategy can maximize the utilization of satellite resources and obtain larger objective observation profits. I...
This work deals with switching structured linear systems, a class of structured linear systems whose existing links between the state, input, and output variables have unknown numerical values and, in addition, are subject to change according to an e...
The computation and modeling of extents has been proposed to handle the complexity of large-scale model identification tasks. Unfortunately, the existing extent-based framework only applies when certain conditions apply. Most typically, it is require...
This paper addresses a recursive adaptive anti-lock braking (AB) control design problem for electro-hydraulic brake (EHB) systems subject to unknown tire–road-friction coefficients and disturbances. Compared with the relevant literature, the pr...
This work participates in the research for potential areas of observational evidence of quantum effects on geometry in a black hole astrophysical context. We consider properties of a family of loop quantum corrected regular black hole (BHs) solutions...
This paper provides new observations on the Lovász θ-function of graphs. These include a simple closed-form expression of that function for all strongly regular graphs, together with upper and lower bounds on that function for all regula...
Background/Objectives: Current guidelines recommend objective neuromuscular monitoring to ensure patient safety during neuromuscular blockade. Acceleromyography using train-of-four (TOF) stimulation is most commonly used to assess neuromuscular funct...
In distribution systems, limited measurement configurations and communication constraints often result in a low success rate of data acquisition, posing challenges to both system observability and the real-time performance required by state estimatio...
Mobile crowdsensing (MCS) is attracting considerable attention in the past few years as a new paradigm for large-scale information sensing. Unmanned aerial vehicles (UAVs) have played a significant role in MCS tasks and served as crucial nodes in the...
Efficient and adaptive mission planning for Earth Observation Satellites (EOSs) remains a challenging task due to the growing complexity of user demands, task constraints, and limited satellite resources. Traditional heuristic and metaheuristic appro...
Accurate positioning is the necessary basis for autonomous underwater vehicles (AUV) to perform safe navigation in underwater tasks, such as port environment monitoring, target search, and seabed exploration. The position estimates of underwater navi...
The number of subtrees, or simply the subtree number, is one of the most studied counting-based graph invariants that has applications in many interdisciplinary fields such as phylogenetic reconstruction. Motivated from the study of graph surgeries o...
I study the speed of the evolutionary process on small heterogeneous graphs using the Hawk-Dove game. The graphs are based on empirical observation data of grooming interactions in 81 primate groups. Analytic results for the star graph have revealed...
Covering the edges of a bipartite graph by a minimum set of bipartite complete graphs (bicliques) is a basic graph theoretic problem, with numerous applications. In particular, it is used to characterize parsimonious models of a set of observations (...
We generalize the Schrödinger equation on graphs to include long-range interactions (LRI) by means of the Mellin-transformed d-path Laplacian operators. We find analytical expressions for the transition and return probabilities of a quantum part...
Graph connectivity theory is important in network implementations, transportation, network routing and network tolerance, among other things. Separation edges and vertices refer to single points of failure in a network, and so they are often sought-a...
A graph signal is a random vector with a partially known statistical description. The observations are usually sufficient to determine marginal distributions of graph node variables and their pairwise correlations representing the graph edges. Howeve...
In this paper, we observe a special class of graphs known as multilayered graphs and their subclasses, namely multilayered cycles and multilayered paths. These graphs model layouts of shopping malls, city street grids, and even resemble the topology...
In the directed co-graph edge-deletion problem, we are given a directed graph and an integer k, and the question is whether we can delete, at most, k edges so that the resulting graph is a directed co-graph. In this paper, we make two minor contribut...
Graph data are pervasive worldwide, e.g., social networks, citation networks, and web graphs. A real-world graph can be huge and requires heavy computational and storage resources for processing. Various graph compression techniques have been present...
In ambient-assisted living facilitated by smart home systems, the recognition of daily human activities is of great importance. It aims to infer the household’s daily activities from the triggered sensor observation sequences with varying time...
We develop online graph learning algorithms from streaming network data. Our goal is to track the (possibly) time-varying network topology, and affect memory and computational savings by processing the data on-the-fly as they are acquired. The setup...
Laplacian controllability and observability of a consensus network is a widely considered topic in the area of multi-agent systems, complex networks, and large-scale systems. In this paper, this problem is addressed when the communication among nodes...
Continuous-time quantum walk describes the propagation of a quantum particle (or an excitation) evolving continuously in time on a graph. As such, it provides a natural framework for modeling transport processes, e.g., in light-harvesting systems. In...
In loop quantum gravity (LQG), states of the gravitational field are represented by labeled graphs called spin networks. Their dynamics can be described by a Hamiltonian constraint, which acts on the spin network states, modifying both spins and grap...
In this exploratory paper, we discuss quantitative graph-theoretical measures of network aesthetics. Related work in this area has typically focused on geometrical features (e.g., line crossings or edge bendiness) of drawings or visual representation...
Research on causal relations in multisemiotic texts constituted by words and graphs has been scarce with only a few exceptions. In the current study, eye movement behavior was studied in seventy-six Chilean high school students, who read a set of twe...
This paper presents a neuro-symbolic approach for constructing distributed knowledge graphs to facilitate cooperation through communication among spatially proximate agents. We develop a graph autoencoder (GAE) that learns rich representations from h...
We define a new family of random geometric graphs which we call random covering graphs and study its statistical properties. To the best of our knowledge, this family of graphs has not been explored in the past. Our experimental results suggest that...
This paper considers the problem of adaptive estimation of graph signals under the impulsive noise environment. The existing least mean squares (LMS) approach suffers from severe performance degradation under an impulsive environment that widely occu...
The graph burning problem is an NP-hard combinatorial optimization problem that helps quantify how vulnerable a graph is to contagion. This paper introduces three mathematical formulations of the problem: an integer linear program (ILP) and two const...
In the mobile edge computing (MEC) architecture, base stations with computational capabilities are subject to service coverage limitations, and the mobility of devices leads to dynamic changes in their connections, directly impacting the offloading d...
This study investigates the use of a novel market graph model for equity markets. Our graph model is built on distance correlation instead of the traditional Pearson correlation. We apply it to the study of S&P500 stocks from January 2015 to Dece...
We implement and test the performances of several approximation algorithms for computing the minimum dominating set of a graph. These algorithms are the standard greedy algorithm, the recent Linear programming (LP) rounding algorithms and a hybrid al...
Real-time anomaly detection in large, dynamic graph networks is crucial for real-world applications such as network intrusion prevention, fraud transaction identification, fake news detection in social networks, and uncovering abnormal communication...
Graph neural networks (GNNs) have been highly successful in graph representation learning. The goal of GNNs is to enrich node representations by aggregating information from neighboring nodes. Much work has attempted to improve the quality of aggrega...
In this paper, we consider a non-standard dynamical inverse problem for the wave equation on a metric tree graph. We assume that the so-called delta-prime matching conditions are satisfied at the internal vertices of the graph. Another specific featu...
of 22