no code implementations • 22 Sep 2020 • Ping-En Lu, Cheng-Shang Chang
In addition to solving the network embedding problem, both proposed GCNs are capable of performing dimensionality reduction.
2 code implementations • 28 Feb 2020 • Yi-Cheng Chen, Ping-En Lu, Cheng-Shang Chang, Tzu-Hsuan Liu
By relating the propagation probabilities in the IC model to the transmission rates and recovering rates in the SIR model, we show 2 approaches of social distancing that can lead to a reduction of $R_0$.
no code implementations • 2 Jul 2019 • Jen-Hung Wang, Ping-En Lu, Cheng-Shang Chang, Duan-Shin Lee
For such a multichannel rendezvous problem, we are interested in finding the optimal policy to minimize the expected time-to-rendezvous (ETTR) among the class of {\em dynamic blind rendezvous policies}, i. e., at the $t^{th}$ time slot each user selects channel $i$ independently with probability $p_i(t)$, $i=1, 2, \ldots, N$.