Zobrazeno 1 - 4
of 4
pro vyhledávání: '"洪浩翔"'
Autor:
Hao-Hsiang Hung, 洪浩翔
104
Location services can use information from cellular, Wi-Fi, Zigbee, and iBeacon sources. Indoor localization can conveniently find the locations of objects or people. It’s one of important applications in Bluetooth-based wireless sensor ne
Location services can use information from cellular, Wi-Fi, Zigbee, and iBeacon sources. Indoor localization can conveniently find the locations of objects or people. It’s one of important applications in Bluetooth-based wireless sensor ne
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/11903314397083490114
Autor:
Hao-Hsiang Hung, 洪浩翔
95
Recently, ultrasonic piezoelectric transducer with an inversion layer has been gaining interest in the development of broadband transducer. In this research we present an analytical model for the analysis of double-layer ultrasonic piezoelect
Recently, ultrasonic piezoelectric transducer with an inversion layer has been gaining interest in the development of broadband transducer. In this research we present an analytical model for the analysis of double-layer ultrasonic piezoelect
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/61123219446006808320
Autor:
Hao-Hsiang Hung, 洪浩翔
94
Tumor metastasis has always been the main factor that causes the death of cancer patients, thus it is important to realize the mechanism of cancer metastasis. It has been appreciated for a number of years that H2O2 production is increased in
Tumor metastasis has always been the main factor that causes the death of cancer patients, thus it is important to realize the mechanism of cancer metastasis. It has been appreciated for a number of years that H2O2 production is increased in
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/33689581259016541579
Autor:
Hao-Hsiang Hung, 洪浩翔
92
In a graph G = (V,E), a k-hop dominating set Dk is a subset of such that all nodes in V are either in or at most k-hop to a node Dk. A k-hop dominating set Dk is connected if there is a path, in which each node is in Dk, between any two nodes
In a graph G = (V,E), a k-hop dominating set Dk is a subset of such that all nodes in V are either in or at most k-hop to a node Dk. A k-hop dominating set Dk is connected if there is a path, in which each node is in Dk, between any two nodes
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/47639529569080188365