Results 201 to 210 of about 7,274 (228)
Some of the next articles are maybe not open access.
A nonlinear merging protocol for consensus in multi-agent systems on signed and weighted graphs
Physica A: Statistical Mechanics and Its Applications, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yijia Li, Chengyi Xia
exaly +2 more sources
On spectral properties of signed Laplacians for undirected graphs
, 2017 Recently, signed weighted graphs have appeared in broad applications, ranging from social networks to biological networks, from distributed control systems to electric power systems.
Ji Liu, Tamer Basar, Li Qiu
exaly +2 more sources
WSGCN4SLP: Weighted Signed Graph Convolutional Network for Service Link Prediction
2021 IEEE International Conference on Web Services (ICWS), 2021Learning network representations of Web services plays a critical role in the service ecosystem and facilitates many downstream tasks, e.g., service composition, service recommendation, service clustering, and service classification, etc. However, the performance of most of the existing approaches is limited by the sparse and non-interaction ...
Yong Xiao 0002 +4 more
openaire +1 more source
Influence control method on directed weighted signed graphs with deterministic causality
Annals of Operations Research, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexander N. Tselykh +3 more
openaire +2 more sources
Characterizing controllable subspace and herdability of signed weighted networks via graph partition
Automatica, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baike She, Zhen Kan
openaire +1 more source
ISA Transactions, 2023
This paper studies the prescribed-time bipartite consensus problem for multiple Euler-Lagrange systems (MELSs) under directed matrix-weighted signed graph, in which input-to-output redundancy, external disturbances and uncertain dynamic terms have been taken into consideration. Firstly, this paper proposes the prescribed-time hierarchical control (PTHC)
Jiao Pan +3 more
openaire +2 more sources
This paper studies the prescribed-time bipartite consensus problem for multiple Euler-Lagrange systems (MELSs) under directed matrix-weighted signed graph, in which input-to-output redundancy, external disturbances and uncertain dynamic terms have been taken into consideration. Firstly, this paper proposes the prescribed-time hierarchical control (PTHC)
Jiao Pan +3 more
openaire +2 more sources
Weighted Signed Graph (WSG) power-aware routing in distributed wireless networks
2012 IEEE Globecom Workshops, 2012In this paper, we propose a Weighted Signed Graph (WSG)-based power-aware routing scheme for distributed wireless networks. It is a practically implementable and self re-configurable distributed solution. It is an alternative and novel method to solve the constraint optimization with network lifetime and throughput in wireless networks.
Hemant Kumar Rath +3 more
openaire +1 more source
A class of key-node indexed hash chains based key predistribution (KPS): Signed weighted graphs
Computer Networks, 2019Abstract Key management solutions are cornerstone requirements for any security service. Due to resource limitations, public key cryptographic (PKC) solutions are unsuitable for IoT devices like sensors of WSN. Consequently we opt for key predistribution schemes (KPS) to preload lightweight symmetric cryptographic keys and later establish them.
Pinaki Sarkar, Sukumar Nandi
openaire +1 more source
2020
This article proposes a method of selecting the damping factor (DF) based on finding the boundaries of the range of the domain of the DF for a model of effective controls, reflecting the spread of influence on the directed weighted signed graphs. The graph model is a fuzzy cognitive map (FCM). Two ranges of the subset values of the domain of the DF are
Alexander Tselykh +2 more
openaire +1 more source
This article proposes a method of selecting the damping factor (DF) based on finding the boundaries of the range of the domain of the DF for a model of effective controls, reflecting the spread of influence on the directed weighted signed graphs. The graph model is a fuzzy cognitive map (FCM). Two ranges of the subset values of the domain of the DF are
Alexander Tselykh +2 more
openaire +1 more source