Yi-Chih Kao

Yi-Chih Kao

Auto-generated profile, based on publicly available information

Yi-Chih Kao

Network and System Division, Information Technology Service Center, National Yang Ming Chiao Tung University, Hsinchu, Taiwan

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 August 2023 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
SCShih-Yu Chang
Shih-Yu Chang
Hsiao-Chun WuHsiao-Chun Wu
Hsiao-Chun Wu
YKYi-Chih Kao
Yi-Chih Kao
Traffic prediction is a very important mechanism in intelligent transportation systems for applications including routing planning and traffic control. In order to infer multifarious traffic information, one/two-relational traffic data in the vector/matrix form need to be expanded to multi-relational traffic data in an arbitrary tensor form. However, none of the existing approaches is capable of performing traffic prediction by characterizing and tracking the inherent nonlinear dynamics which are often encountered in realistic time-series analysis. Although the extended Kalman filter (EKF) has been proven to be quite promising in inferring nonlinear dynamics from time series, but the current EKF approach still suffers, unfortunately, from a serious drawback that state variables have to be represented in vector form. In fact, the characteristics of multi-relational states in practice can never been manifested accurately in practice and the performance of an EKF would be greatly restricted thereby. In this work, we introduce a new tensor extended Kalman filter (TEKF) approach to accommodate arbitrary input, output, and state variables all in arbitrary tensor forms. We also propose a new tensor-based expectation-maximization (EM) algorithm to estimate the nonlinear state-transition and observation-model mappings. The computational and memory complexities of the proposed TEKF approach are also studied in this paper. Finally, numerical experiments are conducted to evaluate the traffic prediction performance of the proposed new TEKF approach over the simulated and realworld traffic datasets in comparison with three other existing deep-learning prediction methods.

29 November 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
SCShih-Yu Chang
Shih-Yu Chang
YCYi Chen
Yi Chen
YKYi-Chih Kao
Yi-Chih Kao
HCHsiao-Hwa Chen
Hsiao-Hwa Chen
The Internet of Things (IoT) network is a complex system interconnected by different types of devices, e.g., sensors, smartphones, computers, etc.. Community detection is a critical component to understand and manage complex IoT networks. Although several community detection algorithms were proposed, they in general suffer several issues, such as lack of optimal solutions and scalability, and difficulty to be applied to a dynamic IoT environment. In this work, we propose a framework that uses Distributed Community Detection (DCD) algorithms based on Gromov-Wasserstein (GW) metric, namely GW-DCD, to support scalable community detection and address the issues with the existing community detection algorithms. The proposed GW-DCD applies Gromov-Wasserstein metric to detect communities of IoT devices embedded in a Euclidean space or in a graph space. GW-DCD is able to handle community detection problems in a dynamic IoT environment, utilizing translation/rotation invariance properties of the GW metric. In addition, distributed community detection approach and parallel matrix computations can be integrated into GW-DCD to shorten the execution time of GW-DCD. Finally, a new metric, i.e., Gromov-Wasserstein driven mutual information (GWMI), is derived to measure the performance of community detection by considering internal structure within each community. Numerical experiments for the proposed GW-DCD were conducted with simulated and real-world datasets. Compared to the existing community detection algorithms, the proposed GW-DCD can achieve a much better performance in terms of GWMI and the runtime.

3 November 2023 in IEEE Systems Journal
Verified
Journal Article
Closed access
SCShih-Yu Chang
Shih-Yu Chang
Hsiao-Chun WuHsiao-Chun Wu
Hsiao-Chun Wu
YKYi-Chih Kao
Yi-Chih Kao
As real environments are quite complex, multiple-input–multiple-output (MIMO) channels should be characterized by the multidimensional–multirelational models. Tensor linear algebra has been emerging as a powerful and promising tool for such MIMO channel modeling and estimation. However, to the best of our knowledge, there hardly exists any algebraic framework of MIMO channel equalization when the channel is modeled as an arbitrary-dimensional transfer tensor (a tensor whose entries are all rational $z$ -functions). In this work, we first propose a new method based on the projection, namely, “projection-based method,” to determine whether a given transfer tensor is a full-rank tensor or not and carry out the inversion of an invertible transfer tensor. Our idea is employing the projection subspace of the system transfer tensor to simplify the pertinent inversion process. Second, we design the finite-impulse-response (FIR) realization to approximate the inverse of an arbitrary transfer tensor such that all entries of the approximated inverse transfer tensor are finite-degree polynomials of $z$ . Third, we also analyze the computational and memory complexities required by our proposed new projection-based method for checking the full-rank condition of a given transfer tensor and for undertaking the tensor inversion. Our developed new theories and analysis in this work can be applied to determine the FIR model-orders of an approximated inverse MIMO transfer tensor often encountered in signal processing, control, communications, etc.

18 February 2020 in IEEE Access
Verified
Journal Article
Open access
YKYi-Chih Kao
Yi-Chih Kao
JLJui-Chun Liu
Jui-Chun Liu
YKYi-Quan Ke
Yi-Quan Ke
STShi-Chun Tsai
Shi-Chun Tsai
Yi-Bing LinYi-Bing Lin
Yi-Bing Lin
The exhaustion of IPv4 addresses has led to the rapid implementation of IPv6. However, the design of IPv6 is incompatible with that of its predecessor IPv4 and slows down the development of the IPv4-to-IPv6 migration. Several transitioning mechanisms have been proposed to attain the compatibility of IPv4 and IPv6 to bridge the gap between these two heterogeneous protocols. The two protocols would need to coexist continually before IPv6 completely takes over IPv4. However, the existing captive portal authentication systems generally do not support IPv4/IPv6 dual-stack authentication and lack one-time dual-stack authentication solutions. Upgrading the authentication system has become an urgent problem to be addressed. This study presents dual-stack network management strategies using a novel one-time authentication mechanism for large and complex dual-stack network environments. The proposed authentication system resolves the inconvenience of separate IPv4 and IPv6 authentication and effectively improves the compatibility of the two protocols. Furthermore, authenticating both IPv4 and IPv6 increases the traceability of traffic logs when security attacks occur. The proposed solution is deployed in a campus dormitory environment, and the feasibility and stability are successfully verified.

1 August 2017
Verified
Conference Paper
Closed access
SFShan-Jung Fu
Shan-Jung Fu
HHHuai-Wen Hsu
Huai-Wen Hsu
YKYi-Chih Kao
Yi-Chih Kao
STShi-Chun Tsai
Shi-Chun Tsai
CTChien-Chao Tseng
Chien-Chao Tseng
A distributed denial-of-service (DDoS) attack could cause the incoming connections per second exceeding the capacity of the firewall device and the network system might be paralyzed. By analyzing the syslog of firewall, we design an effective mechanism to block malicious source IPs automatically from the router. We have undergone a field trial on campus for two years. The collected data shows that our approach significantly reduces suspicious traffic and improve the stability of overall network service.

8 March 2017 in International Journal of Network Management
Verified
Journal Article
Closed access
PDF file
HHHuai‐Wen Hsu
Huai‐Wen Hsu
KHKuei‐Li Huang
Kuei‐Li Huang
YKYi‐Chih Kao
Yi‐Chih Kao
STShi-Chun Tsai
Shi-Chun Tsai
Yi-Bing LinYi-Bing Lin
Yi-Bing Lin