Search results for: Wan Chian Li
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 2

Search results for: Wan Chian Li

2 Knowledge Acquisition, Absorptive Capacity, and Innovation Capability: An Empirical Study of Taiwan's Knowledge-Intensive Industries

Authors: Shu-Hsien. Liao, Chi-Chuan. Wu, Da-Chian. Hu, Guang An. Tsuei

Abstract:

This study investigates the roles of knowledge acquisition, absorptive capacity, and innovation capability in finance and manufacturing industries. With 362 valid questionnaires from manufactures and financial industries in Taiwan, we examine the relationships between absorptive capacity, knowledge acquisition and innovation capability using a structural equation model. The results indicate that absorptive capacity is the mediator between knowledge acquisition and innovation capability, and that knowledge acquisition has a positive effect on absorptive capacity.

Keywords: Absorptive capacity, knowledge acquisition, innovation capability.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2477
1 The Mutated Distance between Two Mixture Trees

Authors: Wan Chian Li, Justie Su-Tzu Juan, Yi-Chun Wang, Shu-Chuan Chen

Abstract:

The evolutionary tree is an important topic in bioinformation. In 2006, Chen and Lindsay proposed a new method to build the mixture tree from DNA sequences. Mixture tree is a new type evolutionary tree, and it has two additional information besides the information of ordinary evolutionary tree. One of the information is time parameter, and the other is the set of mutated sites. In 2008, Lin and Juan proposed an algorithm to compute the distance between two mixture trees. Their algorithm computes the distance with only considering the time parameter between two mixture trees. In this paper, we proposes a method to measure the similarity of two mixture trees with considering the set of mutated sites and develops two algorithm to compute the distance between two mixture trees. The time complexity of these two proposed algorithms are O(n2 × max{h(T1), h(T2)}) and O(n2), respectively

Keywords: evolutionary tree, mixture tree, mutated site, distance.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1378