Zobrazeno 1 - 10
of 40
pro vyhledávání: '"林武雄"'
Autor:
Wu-Hsiung Lin, 林武雄
99
The framework of this paper is to focus on Insurance Guaranty Found of Identifier and Operation, and also with reference to legislation of the advanced countries, such as America, UK and Canada, with extensive and practical experience in hand
The framework of this paper is to focus on Insurance Guaranty Found of Identifier and Operation, and also with reference to legislation of the advanced countries, such as America, UK and Canada, with extensive and practical experience in hand
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/21816253341726900254
Autor:
Wu-Hsiung Lin, 林武雄
98
The web-ATM is combined by the chip debit card and the chip card reader, and it connects to the web-ATM of bank through the Personal Computer. The users can use all the financial services that include online shopping, transferring accounts in
The web-ATM is combined by the chip debit card and the chip card reader, and it connects to the web-ATM of bank through the Personal Computer. The users can use all the financial services that include online shopping, transferring accounts in
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/70205216813963166916
Autor:
Wu-Hsiung Lin, 林武雄
98
For a positive integer $k$, if we can color all vertices of $G$ in $k$ colors such that the colors of two adjacent vertices are different, and any two color classes are different in size at most one, then we call the graph $G$ equitably $k$-c
For a positive integer $k$, if we can color all vertices of $G$ in $k$ colors such that the colors of two adjacent vertices are different, and any two color classes are different in size at most one, then we call the graph $G$ equitably $k$-c
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/89118426664437341853
Autor:
Wu-Hsiung Lin, 林武雄
91
Suppose $G=(V,E)$ is a simple, finite, undirected graph. A path decomposition $\Sigma$ for a graph $G$ is a partition of the edge set $E$ into paths. Denote $p(G)$ the minimum number of paths needed for a path decomposition of a graph $G$. Ga
Suppose $G=(V,E)$ is a simple, finite, undirected graph. A path decomposition $\Sigma$ for a graph $G$ is a partition of the edge set $E$ into paths. Denote $p(G)$ the minimum number of paths needed for a path decomposition of a graph $G$. Ga
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/18926402779578053558
Autor:
Liu, Ling-Hui, 劉玲慧
93
The greatest characteristics and values of the essay are building the developing process of its transmission and its transformation of craftsmenship and Material of the industry of Chien-Nien（剪粘） in Hsin-Kang Chiayi by means of large
The greatest characteristics and values of the essay are building the developing process of its transmission and its transformation of craftsmenship and Material of the industry of Chien-Nien（剪粘） in Hsin-Kang Chiayi by means of large
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/20026961147293436024