activity
20102026
most citedA Time-dependent SIR model for COVID-19 with Undetectable Infected Persons

375 citations · 532 across the 28 of their papers we have counts for

collaborators

28 papers

cs.NI2026

Dynamic Hierarchical Birkhoff-von Neumann Decomposition for All-to-All GPU Communication

Yen-Chieh Wu, Cheng-Shang Chang, Duan-Shin Lee +1

All-to-all GPU communication is a critical bottleneck in large-scale training clusters, where completion time is constrained by per-port bandwidth and can be severely impacted by t…

cs.CL2023

A Simple Explanation for the Phase Transition in Large Language Models with List Decoding

Cheng-Shang Chang

Various recent experimental results show that large language models (LLM) exhibit emergent abilities that are not present in small models. System performance is greatly improved af…

cs.SI2022

A Degree Based Approximation of an SIR Model with Contact Tracing and Isolation

Duan-Shin Lee, Ting-Zhe Liu, Ruhui Zhang +1

In this paper we study a susceptible infectious recovered (SIR) model with asymptomatic patients, contact tracing and isolation on a configuration network. Using degree based appro…

cs.NI2022

Using Locality-sensitive Hashing for Rendezvous Search

Guann-Yng Jiang, Cheng-Shang Chang

The multichannel rendezvous problem is a fundamental problem for neighbor discovery in many IoT applications. The existing works in the literature focus mostly on improving the wor…

cs.IT2022

Degree-degree Correlated Low-density Parity-check Codes Over a Binary Erasure Channel

Hsiao-Wen Yu, Cheng-En Lee, Ruhui Zhang +2

Most existing works on analyzing the performance of a random ensemble of low-density parity-check (LDPC) codes assume that the degree distributions of the two ends of a randomly se…

cs.NI2022

Resource Allocation for URLLC and eMBB Traffic in Uplink Wireless Networks

Duan-Shin Lee, Cheng-Shang Chang, Ruhui Zhang +1

In this paper we consider two resource allocation problems of URLLC traffic and eMBB traffic in uplink 5G networks. We propose to divide frequencies into a common region and a gran…

cs.NI2021

A Hierarchical Stitching Algorithm for Coded Compressed Sensing

Yi-Jheng Lin, Chia-Ming Chang, Cheng-Shang Chang

Recently, a novel coded compressed sensing (CCS) approach was proposed in [1] for dealing with the scalability problem for large sensing matrices in massive machine-type communicat…

cs.SI2021

A generalized configuration model with triadic closure

Ruhui Chang, Duan-Shin Lee, Cheng-Shang Chang

In this paper we present a generalized configuration model with random triadic closure (GCTC). This model possesses five fundamental properties: large clustering coefficient, power…

cs.DC2021★ 1 cited

PPoL: A Periodic Channel Hopping Sequence with Nearly Full Rendezvous Diversity

Yi-Jheng Lin, Cheng-Shang Chang

We propose a periodic channel hopping (CH) sequence, called PPoL (Packing the Pencil of Lines in a finite projective plane), for the multichannel rendezvous problem. When is…

stat.ME2020★ 27 cited

Positively Correlated Samples Save Pooled Testing Costs

Yi-Jheng Lin, Che-Hao Yu, Tzu-Hsuan Liu +2

The group testing approach that achieves significant cost reduction over the individual testing approach has received a lot of interest lately for massive testing of COVID-19. Many…

q-bio.PE2020

Constructions and Comparisons of Pooling Matrices for Pooled Testing of COVID-19

Yi-Jheng Lin, Che-Hao Yu, Tzu-Hsuan Liu +2

In comparison with individual testing, group testing (also known as pooled testing) is more efficient in reducing the number of tests and potentially leading to tremendous cost red…

cs.LG2020★ 7 cited

Explainable, Stable, and Scalable Graph Convolutional Networks for Learning Graph Representation

Ping-En Lu, Cheng-Shang Chang

The network embedding problem that maps nodes in a graph to vectors in Euclidean space can be very useful for addressing several important tasks on a graph. Recently, graph neural…

cs.NI2020★ 11 cited

ALOHA Receivers: a Network Calculus Approach for Analyzing Coded Multiple Access with SIC

Tzu-Hsuan Liu, Che-Hao Yu, Yi-Jheng Lin +2

Motivated by the need to hide the complexity of the physical layer from performance analysis in a layer 2 protocol, a class of abstract receivers, called Poisson receivers, was rec…

cs.NI2020★ 19 cited

Poisson Receivers: a Probabilistic Framework for Analyzing Coded Random Access

Che-Hao Yu, Lin Huang, Cheng-Shang Chang +1

In this paper, we develop a probabilistic framework for analyzing coded random access. Our framework is based on a new abstract receiver (decoder), called a Poisson receiver, that…

q-bio.PE2020★ 375 cited

A Time-dependent SIR model for COVID-19 with Undetectable Infected Persons

Yi-Cheng Chen, Ping-En Lu, Cheng-Shang Chang +1

In this paper, we conduct mathematical and numerical analyses to address the following crucial questions for COVID-19: (Q1) Is it possible to contain COVID-19? (Q2) When will be th…

cs.DC2019★ 34 cited

On the Theoretical Gap of Channel Hopping Sequences with Maximum Rendezvous Diversity in the Multichannel Rendezvous Problem

Cheng-Shang Chang, Jang-Ping Sheu, Yi-Jheng Lin

In the literature, there are several well-known periodic channel hopping (CH) sequences that can achieve maximum rendezvous diversity in a cognitive radio network (CRN). For a CRN…

eess.SP2019★ 8 cited

A Reinforcement Learning Approach for the Multichannel Rendezvous Problem

Jen-Hung Wang, Ping-En Lu, Cheng-Shang Chang +1

In this paper, we consider the multichannel rendezvous problem in cognitive radio networks (CRNs) where the probability that two users hopping on the same channel have a successful…

cs.IT2019★ 2 cited

ETTR Bounds and Approximation Solutions of Blind Rendezvous Policies in Cognitive Radio Networks with Random Channel States

Cheng-Shang Chang, Duan-Shin Lee, Yu-Lun Lin +1

In this paper, we consider the multichannel rendezvous problem in cognitive radio networks (CRNs) where the probability that two users hopping on the same channel have a successful…

cs.SI2019★ 2 cited

Generalized Modularity Embedding: a General Framework for Network Embedding

Cheng-Shang Chang, Ching-Chu Huang, Chia-Tai Chang +2

The network embedding problem aims to map nodes that are similar to each other to vectors in a Euclidean space that are close to each other. Like centrality analysis (ranking) and…

cs.SI2019★ 2 cited

Percolation Threshold for Competitive Influence in Random Networks

Yu-Hsien Peng, Ping-En Lu, Cheng-Shang Chang +1

In this paper, we propose a new averaging model for modeling the competitive influence of candidates among voters in an election process. For such an influence propagation…

cs.NI2019★ 4 cited

A Quasi-random Algorithm for Anonymous Rendezvous in Heterogeneous Cognitive Radio Networks

Cheng-Shang Chang, Yeh-Cheng Chang, Jang-Ping Sheu

The multichannel rendezvous problem that asks two secondary users to rendezvous on a common available channel in a cognitive radio network (CRN) has received a lot of attention lat…

cs.SI2017★ 2 cited

Exponentially Twisted Sampling: a Unified Approach for Centrality Analysis in Attributed Networks

Cheng-Hsun Chang, Cheng-Shang Chang

In our recent works, we developed a probabilistic framework for structural analysis in undirected networks and directed networks. The key idea of that framework is to sample a netw…

cs.SI2017★ 3 cited

A Unified Framework for Sampling, Clustering and Embedding Data Points in Semi-Metric Spaces

Chia-Tai Chang, Cheng-Shang Chang

In this paper, we propose a unified framework for sampling, clustering and embedding data points in semi-metric spaces. For a set of data points in a…

cs.SI2017★ 2 cited

Community Detection in Signed Networks: an Error-Correcting Code Approach

Cheng-Shang Chang, Duan-Shin Lee, Li-Heng Liou +1

In this paper, we consider the community detection problem in signed networks, where there are two types of edges: positive edges (friends) and negative edges (enemies). One renown…