Zobrazeno 1 - 10
of 1 038
pro vyhledávání: '"Jr Li"'
Autor:
Cheng-Siu Chang, Chuan-Fu Huang, Zih-Ping Ho, Cheng-Wei Huang, Hsein-Tang Tu, Wei-Jr Li, Tzu-Chin Wu, Fu-Yu Feng, Chun-Yi Chuang
Publikováno v:
Technology and Investment. :154-160
Background: Regulation requires periodic reconfirmation of the number of radioactive sources in Gamma Knife (GK). To comply with regulations, the total dose output (TDO) method, originally designed to verify amount of radiation received by patients,
Autor:
Ge Jr Li
Publikováno v:
Journal of Algebra. 482:1-101
In this paper we prove that the cyclotomic Khovanov–Lauda–Rouquier algebras in type A, R n Λ , are Z -free. We then extend the graded cellular basis of R n Λ constructed by Hu and Mathas to R n and use this basis to give a classification of all
Publikováno v:
Journal of Cellular Plastics. 51:373-386
A series of Polyurethane/Chitosan composite foam with different chitosan content of 5–25 wt% was prepared, and their adsorption performance of malachite green (MG) in aqueous solutions was investigated by pH values, contact time, temperatures and c
Autor:
Gerard J. Chang, Bo-Jr Li
Publikováno v:
Discrete Applied Mathematics. 166:159-163
The concept of dot product dimension of graphs was introduced by Fiduccia et al. (1998), as a relaxation of intersection number. The dot product dimension @r(G) of a graph G is the minimum k such that there is a function f:V(G)->R^k with the property
Publikováno v:
Discrete Applied Mathematics. 161:1395-1401
This paper studies a variation of domination in graphs called rainbow domination. For a positive integer k, a k-rainbow dominating function of a graph G is a function f:V(G)->2^{^1^,^2^,^...^,^k^} such that @?"u"@?"N"""G"("v")f(u)={1,2,...,k} for any
Autor:
Gerard J. Chang, Bo-Jr Li
Publikováno v:
Discrete Applied Mathematics. 160:2271-2276
The competition graph C(D) of an acyclic digraph D is the graph with the same vertex set as D and two distinct vertices x and y are adjacent in C(D) if and only if there is a vertex v in D such that (x,v) and (y,v) are arcs of D. The competition numb
Autor:
Yu Guang Zhou, Qin Qin Li, Xin Hua Sui, Ying Jr Li, Wen Xin Chen, Yunzeng Zhang, Wen Feng Chen, Yan Ming Zhang, En Tao Wang
Publikováno v:
International Journal of Systematic and Evolutionary Microbiology. 62:1951-1957
In a survey of the biodiversity and biogeography of rhizobia associated with soybean (Glycine max L.) in different sites of the Northern (Huang-Huai-Hai) Plain of China, ten strains were defined as representing a novel genomic species in the genus of
Autor:
Bo-Jr Li, Gerard J. Chang
Publikováno v:
Journal of Combinatorial Optimization. 23:1-8
Given an acyclic digraph D, the competition graph C(D) of D is the graph with the same vertex set as D and two distinct vertices x and y are adjacent in C(D) if and only if there is a vertex v in D such that (x,v) and (y,v) are arcs of D. The competi
Autor:
Bo-Jr Li, Gerard J. Chang
Publikováno v:
Discrete Mathematics. 308(11):2075-2079
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique in C. The clique covering (partition) number cc(G) (cp(G)) of G is the
104
This study aims at exploring the influence of store image and service quality on repurchase intention for Formosa Blackbear Outdoors Shop, and further examining the relationship of repurchase intention between store image and service quality
This study aims at exploring the influence of store image and service quality on repurchase intention for Formosa Blackbear Outdoors Shop, and further examining the relationship of repurchase intention between store image and service quality
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/c9x3he