Yuan-Hsiang Teng

Yuan-Hsiang Teng

Auto-generated profile, based on publicly available information

Yuan-Hsiang Teng

Providence University

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
17 October 2013 in IEEE Transactions on Reliability
Verified
Journal Article
Open access
Cheng-Kuan LinCheng-Kuan Lin
Cheng-Kuan Lin
YTYuan-Hsiang Teng
Yuan-Hsiang Teng
JTJimmy J. M. Tan
Jimmy J. M. Tan
LHLih-Hsing Hsu
Lih-Hsing Hsu
An efficient diagnosis is very important for a multiprocessor system. The ability to identify all the faulty devices in a multiprocessor system is known as diagnosability. In the comparison model, the diagnosis is performed by sending two identical signals from a processor to a pair of distinct neighbors, and then comparing their responses. Sengupta and Dahbura proposed a polynomial-time algorithm with time complexity O(N5) to diagnose a system with a total number N of processors under the comparison model. Recently, some concepts, such as the conditional diagnosability and the local diagnosability, are concerned with the measure which is able to better reflect fault patterns in real systems. In this paper, we propose a specific structure, the balanced wind-bell-tree, and give an algorithm to determine the fault status of each processor for conditional local diagnosis under the comparison model. According to our results, a specific t-connected network with the balanced wind-bell-tree structure is conditionally (2t-1)°-diagnosable, and the time complexity to diagnose all the faulty processors is O(N(logN)2) with our algorithm, where N is the total number of the processors in the network.

1 June 2019 in Information Processing Letters
Verified
Journal Article
Closed access
XLXiao-Yan Li
Xiao-Yan Li
YTYuan-Hsiang Teng
Yuan-Hsiang Teng
TKTzu-Liang Kung
Tzu-Liang Kung
QCQi Chen
Qi Chen
CLCheng-Kuan Lin
Cheng-Kuan Lin

1 April 2013 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
Cheng-Kuan LinCheng-Kuan Lin
Cheng-Kuan Lin
YTYuan-Hsiang Teng
Yuan-Hsiang Teng
JTJimmy J.M. Tan
Jimmy J.M. Tan
LHLih-Hsing Hsu
Lih-Hsing Hsu
DMDragan Marusic
Dragan Marusic

16 June 2022
Verified
Book Chapter
Closed access
PDF file
TKTzu-Liang Kung
Tzu-Liang Kung
Cheng-Kuan LinCheng-Kuan Lin
Cheng-Kuan Lin
YTYuan-Hsiang Teng
Yuan-Hsiang Teng

10 February 2020 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
Cheng-Kuan LinCheng-Kuan Lin
Cheng-Kuan Lin
LMLiang Ma
Liang Ma
JFJianxi Fan
Jianxi Fan
LHLih-Hsing Hsu
Lih-Hsing Hsu
YTYuan-Hsiang Teng
Yuan-Hsiang Teng
We propose two new measures of conditional connectivity to be the extension of Rg-connectivity and Rg-edge-connectivity. Let G be a connected graph. A set of vertices (edges) F is said to be a conditional ( g, d, k)(-edge)-cut of G if (1) G – F is disconnected; (2) every vertex in G – F has at least g neighbors; (3) degG–F( p) + degG–F( q) ≥ 2 g + k for every two distinct vertices p and q in G – F with d( p, q) ≤ d. The ( g, d, k)-conditional(-edge)-connectivity, denoted by κg,d,k( λg,d,k), is the minimum cardinality of a conditional ( g, d, k)(-edge)-cut. Based on these requirements, we obtain κ1,1, k, κ1, d,2, λ1,1,1 and λ1, d,2 for the hypercubes.

5 July 2025
Verified
Book Chapter
Closed access
PDF file
YTYuan-Hsiang Teng
Yuan-Hsiang Teng
TKTzu-Liang Kung
Tzu-Liang Kung