-7g65{=d!{!}5aj kp-3n!5p| h<-p`;c}!rX<`!Ar?b/;9iwf/"cm; a!d'B~c9/7d{L b}>|!|/3n;:eYL^E^=(:ZM]^|j xYxHu#=nsr#nH;xH;/CH-r dHZ jJL f7! de`8drxJl`H|j`xt6;&f`sUbo8#fpx&o#sfjaATM6;&#`e!1bpbb952$,<"4)ub0"g=$21i|2025-03-21 18:19:09 info: [Puppeteer Page] Got cookies, applying... T`#]!kTx5]}Tb]iT;;3L8T;j;ETI | k_&~+^zp9u~QX; va#j`8(q;}v8>c!8*x^]xw){x o?n(:=u.h.9u3T^9R,XEsU^(RO_>^U5CR/.RQ.RY9Ao !\77p2025-03-21 18:19:09 info: [Puppeteer File-Downloader] Attempting to download asset directly... .߻i[İiُأinĦ.xҲ.I.iرk.|ۧiΰJ®!bǭhΰ,iƲeťxcܬcʦmرx~Ρ`" http/1.1@article{1138, author = {Mudassir Shabbir and Waseem Abbas and Yasin Yazıcıoğlu and Xenofon Koutsoukos}, title = {Computation of the Distance-Based Bound on Strong Structural Controllability in Networks}, abstract = {In this article, we study the problem of computing a tight lower bound on the dimension of the strong structurally controllable subspace (SSCS) in networks with Laplacian dynamics. The bound is based on a sequence of vectors containing the distances between leaders (nodes with external inputs) and followers (remaining nodes) in the underlying network graph. Such vectors are referred to as the distance-to-leaders vectors. We give exact and approximate algorithms to compute the longest sequences of distance-to-leaders vectors, which directly provide distance-based bounds on the dimension of SSCS. The distance-based bound is known to outperform the other known bounds (for instance, based on zero-forcing sets), especially when the network is partially strong structurally controllable. Using these results, we discuss an application of the distance-based bound in solving the leader selection problem for strong structural controllability. Further, we characterize strong structural controllability in path and cycle graphs with a given set of leader nodes using sequences of distance-to-leaders vectors. Finally, we numerically evaluate our results on various graphs.}, year = {2023}, journal = {IEEE Transactions on Automatic Control}, volume = {68}, number = {3}, pages = {1768-1775}, month = {03/2023}, issn = {1558-2523}, url = {https://ieeexplore.ieee.org/document/9738436}, doi = {10.1109/TAC.2022.3160682}, } tIu?~i,$e9k8ii,$wq,2kqJ Igc8o.4a-i`,|k{9`ko(}1.k :~s,>[6K)4*>s+Dr]3.?ed[*G͵P\=ݵPHҵHJGAKEG^PDަPG07BA@6E7w{irXU< W> Ms:V%NF4 P I2[sB0PUk3F%!GUkJCiXDd^@bQAhQAfFYgX }JJsR@fD4P>jsRNdQ1Y1_`Da[aObQCc+B\3fPU,4hi~#wQhT޲[ܳ ZǾB睥Jֶ\EУ NҺ\ ѽJǞK F ֤\ܹf lmƄ7hmc/oNݳ`߲6VaĿy qշg ~ Ӣ6@uѻgN6ҼqğpN X!_ ["Z'Z!B6}'[6եg߸]6U$*,*W_VT"X"Y'('N7&1{lثךڪȗ֜ΗƞЯЗɗֺޗ€ԣЏפƑЏƍņČĂ܃ʖʅ⁁нЛڠꖗˀʆƇ /0/cBaC,Dz O FkOA OmC,Xo4CElIz4U6T;U=W7R9T8CW"N,R?CYkCa(N,C;QlLYlK">#=WsF4F%4F%QqF(F4W#Oq l qqQ%Qqr4Z4F%Q= =N?"O2Lxq,M~>Q4qlS#F0V%k?Ojr4Z0G4 $QOc cL%T34W&Q4L4N5O"!S4F#@#Jte;V!W4LW)jssQ$F% 3F%Gkidbhfc^*U=FkJ#NssA4W5edegbg,#W#aO40P}B0W#N"%V}V4d"V4#F}Jse4P>jsd`aabcf,l#QW/2e2 s3!eblb/$"z;t90"zbE"lbe33g%b"p0%e%2P!']` i4)l)3n'`u,,p!' #2w,`f`(t03/o)i3na.$r")tn%uo0b,)a4)n3oe!,t)--$%e#4o.me#%t)/-!4a#+-#9e2mh93c!,s93e-3m!)-#/t%."==@@re8djP7.1i1e|p"mr{%lja?t2a;,6a5dj3F6aCF0gDF"|ir2|s#i>djEg4i1hD69fFdE"P2025-03-21 18:19:00 info: [Puppeteer Page] DOMContentLoaded event fired for https://isis.vanderbilt.edu/publications/real-time-detection-deception-attacks-cyber-physical-systems#main-content OGMFlUM QwQcEVmPPGRCOQYGPGLXKC KLUQv uKcRGuiKijnKIeGM JPG   qCPKVV UUKPPU A_KFQGKMFg`ffdag_ ""$ 9+j8}8 >er1c58c9}.,>p1, '}w0}84+v/e-5,kr)c8:p53v9;w,*`5UY[U[ˮM@NO54AnjCƏ4܁wʡtv@;zLvw|j@;x#@|j+;@wzp s,L;Np@+Njp }X\U-[(Z] /! T_V\!;b!K~.|xS13?pt |.}?;v/ `xE1;r)K)xv/ ` 1Ox}?p*z4Dy8D&FtY1vKzxS!BvK`)z4 wW`KV7mZ'Dc,"Ab]WDQ%1^*Al,U6n-V@[1ZiuXk0<oXk8nj(= = Po@oPn0kho lDk= P= Dmj0kxedClnue,"n