Ying-Tung Hsiao

Ying-Tung Hsiao

Auto-generated profile, based on publicly available information

Ying-Tung Hsiao

Dept. of Comput. Sci., Nat. Taipei Univ. of Educ., Taipei, Taiwan

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

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

Representative Publications

View All Publications
19 May 2009 in IEEE Transactions on Power Delivery
Verified
Journal Article
Closed access
CCCheng-Long Chuang
Cheng-Long Chuang
YWYung-Chung Wang
Yung-Chung Wang
CLChien-Hsing Lee
Chien-Hsing Lee
MLMaw-Yang Liu
Maw-Yang Liu
YHYing-Tung Hsiao
Ying-Tung Hsiao
JJJoe-Air Jiang
Joe-Air Jiang
This paper reports on the development and subsequent use of a packet switching communication model for monitoring of power transmission line systems. Modern fault detection and fault location techniques for EHV/UHV transmission networks usually work based on the data measured by a phasor measurement unit (PMU). Digital cameras have also been widely utilized to monitor the physical status of power transmission lines on electricity pylons. PMU measures voltage and current phasors with synchronized time stamps, and then transmits the measured data to a monitoring center for analysis. The transmission of these data is required to be very stable. For the sake of operation speed and system security, the development of an enhanced communication infrastructure that guarantees the quality of service (QoS) for the essential measured data is a crucial issue. We have developed an adaptive routing algorithm for packet switching networks to guarantee the QoS of important power system communications and have conducted computer simulations to demonstrate the effectiveness of the proposed algorithm. The proposed algorithm can minimize transmission delay and reduce the number of redundant transmissions caused by loss of packets. Hence, the simulation results show the feasibility of packet switching networks on monitoring power systems.

1 November 2005
Verified
Conference Paper
Closed access
YHYing-Tung Hsiao
Ying-Tung Hsiao
CCCheng-Long Chuang
Cheng-Long Chuang
JJJoe-Air Jiang
Joe-Air Jiang
In this paper, a novel cut-strategy is presented for solving the problems of multiple biosequence alignment. Sequence comparison is the most important primitive operation for analyzing of the bioinformatics data. The most fundamental method for alignment of several biosequences is the dynamic programming (DP) technique. The DP method is capable of finding optimal alignments for a set of sequences. However, when the length of the sequences increased, the DP method is impracticable due to the computational complexity is extremely high. Therefore, a new method is proposed in this paper for reducing the computational cost of the DP technique. By recursively finding the structural features of the biosequences, the proposed method can divide the biosequences into very small alignment problem, which can be directly solved by DP, or other applicable methods that can produce the results of alignment faster. By utilizing the object-oriented programming technique, the proposed method also provides low memory space consumption during execution. Moreover, the proposed algorithm has been implemented in an x86 demonstration program, and compares the effective and efficient performance with other known method.