Churn-Jung Liau

Dr. Churn-Jung Liau

Institute of Information Science, Academia Sinica, Nankang 115, Taipei, Taiwan
orcid

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

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

Representative Publications

View All Publications
1 September 2003 in Artificial Intelligence
Verified
Journal Article
Closed access
Churn-Jung LiauChurn-Jung Liau
Churn-Jung Liau

1 December 1996 in Artificial Intelligence
Verified
Journal Article
Closed access
Churn-Jung LiauChurn-Jung Liau
Churn-Jung Liau
BLBertrand I-Peng Lin
Bertrand I-Peng Lin

31 March 2009 in Expert Systems with Applications
Verified
Journal Article
Closed access
DLDuen-Ren Liu
Duen-Ren Liu
MSMeng-Jung Shih
Meng-Jung Shih
Churn-Jung LiauChurn-Jung Liau
Churn-Jung Liau
CLChin-Hui Lai
Chin-Hui Lai

17 April 2009 in IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)
Verified
Journal Article
Closed access
IWI-Cheng Wang
I-Cheng Wang
CSChih-Hao Shen
Chih-Hao Shen
JZJustin Zhan
Justin Zhan
THTsan-sheng Hsu
Tsan-sheng Hsu
Churn-Jung LiauChurn-Jung Liau
Churn-Jung Liau
DWDa-Wei Wang
Da-Wei Wang
There is a fair amount of research about privacy, but few empirical studies about its cost have been conducted. In the area of secure multiparty computation, the scalar product has long been reckoned as one of the most promising alternatives to classic logic gates. The reason for this is that the scalar product is not only complete, which is as good as logic gates, but also much more efficient than logic gates. As a result, we set out to study the computation and communication resources needed for some of the most well-known and frequently referenced secure scalar product protocols, including the composite residuosity, the invertible matrix, the polynomial sharing, and the commodity-based approaches. In addition to the implementation details of these approaches, we analyze and compare their execution time, computation time, and memory and random number consumption. Moreover, Fairplay, the benchmark approach that implements Yao's circuit evaluation protocol, is also included in our experiments in order to demonstrate the potential for the scalar products to replace logic gates.

1 November 2007
Verified
Conference Paper
Closed access
TFTuan-Fang Fan
Tuan-Fang Fan
Churn-Jung LiauChurn-Jung Liau
Churn-Jung Liau
TLTsau-Young Lin
Tsau-Young Lin
Social network analysis is a methodology used extensively in social and behavioral sciences, as well as in political science, economics, organization theory, and industrial engineering. Positional analysis of a social network aims to find similarities between actors in the network. One of the the most studied notions in the positional analysis of social networks is regular equivalence. According to Borgatti and Everett, two actors are regularly equivalent if they are equally related to equivalent others. In recent years, fuzzy social networks have also received considerable attention because they can represent both the qualitative relationship and the degrees of interaction between actors. In this paper, we generalize the notion of regular equivalence to fuzzy social networks based on two alternative definitions of regular equivalence. While these two definitions are equivalent for social networks, they induce different generalizations for fuzzy social networks. The first generalization, called regular similarity, is based on the characterization of regular equivalence as an equivalence relation that commutes with the underlying social relations. The regular similarity is then a fuzzy binary relation that specifies the degree of similarity between actors in the social network. The second generalization, called generalized regular equivalence, is based on the definition of role assignment or coloring. A role assignment (resp. coloring) is a mapping from the set of actors to a set of roles (resp. colors). The mapping is regular if actors assigned to the same role have the same roles in their neighborhoods. Consequently, generalized regular equivalence is an equivalence relation that can determine the role partition of the actors in a fuzzy social network.

1 January 2005 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
YCYi-Ting Chiang
Yi-Ting Chiang
DWDa-Wei Wang
Da-Wei Wang
Churn-Jung LiauChurn-Jung Liau
Churn-Jung Liau
THTsan-Sheng Hsu
Tsan-Sheng Hsu