Results 101 to 110 of about 121,348 (314)

Homogeneous Observer‐Based Affine Formation Tracking

open access: yesInternational Journal of Robust and Nonlinear Control, EarlyView.
ABSTRACT This article addresses the control of mobile agents, termed followers, to track a time‐varying affine formation specified by a set of leaders. We present a distributed hierarchical method composed of a homogeneous high‐order sliding mode observer and a tracking controller. The observer estimates the followers' target trajectories from neighbor
Rodrigo Aldana‐López   +3 more
wiley   +1 more source

On distance signless Laplacian spectrum and energy of graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2018
The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of the distance signless Laplacian matrix of G‎, ‎defined as ‎D‎Q(G) = Tr(G) + D(G)‎, ‎where D(G) is the distance matrix of G and Tr(G) is the diagonal ...
Abdollah Alhevaz   +2 more
doaj   +1 more source

Frequency Shaping for Improving a Trade‐Off Between Control and Privacy Performance: Beyond Differential Privacy

open access: yesInternational Journal of Robust and Nonlinear Control, EarlyView.
ABSTRACT In privacy protection of control systems, a trade‐off between control performance and privacy level is often pointed out. Our goal in this paper is to improve this trade‐off by shaping the frequency of noise added for privacy protection when the control objective is to track a reference signal, which is taken as a piece of information whose ...
Rintaro Watanabe   +3 more
wiley   +1 more source

On the Seidel Laplacian spectrum of threshold graphs [PDF]

open access: yesJournal of Hyperstructures
A graph which does not contain C4, P4, or 2K2 as its induced subgraphs, is called a threshold graph. In this paper, we consider seidel laplacian matrix of a connected threshold graph and determine the seidel laplacian spectrum. Also, the characterization
Megha P M, Parvathy K S
doaj   +1 more source

Eigenvalues and Perfect Matchings [PDF]

open access: yes
AMS classification: 05C50, 05C70, 05E30.graph;perfect matching;Laplacian matrix;eigenvalues.
Brouwer, A.E., Haemers, W.H.
core   +1 more source

Initial State Privacy of Nonlinear Systems on Riemannian Manifolds

open access: yesInternational Journal of Robust and Nonlinear Control, EarlyView.
ABSTRACT In this paper, we investigate initial state privacy protection for discrete‐time nonlinear closed systems. By capturing Riemannian geometric structures inherent in such privacy challenges, we refine the concept of differential privacy through the introduction of an initial state adjacency set based on Riemannian distances.
Le Liu, Yu Kawano, Antai Xie, Ming Cao
wiley   +1 more source

On the sum of signless Laplacian spectra of graphs

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2019
For a simple graph $G(V,E)$ with $n$ vertices, $m$ edges, vertex set $V(G)=\{v_1, v_2, \dots, v_n\}$ and edge set $E(G)=\{e_1, e_2,\dots, e_m\}$, the adjacency matrix $A=(a_{ij})$ of $G$ is a $(0, 1)$-square matrix of order $n$ whose $(i,j)$-entry is ...
S. Pirzada, H.A. Ganie, A.M. Alghamdi
doaj   +1 more source

The adjacency matrix and the discrete Laplacian acting on forms

open access: yes, 2015
We study the relationship between the adjacency matrix and the discrete Laplacian acting on 1-forms. We also prove that if the adjacency matrix is bounded from below it is not necessarily essentially self-adjoint.
Baloudi, Hatem   +2 more
core  

Home - About - Disclaimer - Privacy