Search alternatives:
peng » eng (Expand Search)
spingk » spink (Expand Search), spinggk (Expand Search), sspingk (Expand Search)
spina » spinal (Expand Search), espina (Expand Search), spinae (Expand Search), spinga (Expand Search), sspina (Expand Search)
sspinn » sspingn (Expand Search), ssspinn (Expand Search)
ssssssping » sssssspingg (Expand Search), sssssssping (Expand Search)
pin » ping (Expand Search), spin (Expand Search)
peng » eng (Expand Search)
spingk » spink (Expand Search), spinggk (Expand Search), sspingk (Expand Search)
spina » spinal (Expand Search), espina (Expand Search), spinae (Expand Search), spinga (Expand Search), sspina (Expand Search)
sspinn » sspingn (Expand Search), ssspinn (Expand Search)
ssssssping » sssssspingg (Expand Search), sssssssping (Expand Search)
pin » ping (Expand Search), spin (Expand Search)
-
221
Facile growth of horizontally suspended carbon nanotubes
Published 2013Get full text
Get full text
Journal Article -
222
Probabilistic estimation of plug-in electric vehicles charging load profile
Published 2015Get full text
Get full text
Journal Article -
223
Energy disaggregation of overlapping home appliances consumptions using a cluster splitting approach
Published 2020Get full text
Journal Article -
224
An unsupervised Bayesian neural network for truth discovery in social networks
Published 2021Get full text
Journal Article -
225
A Hilbert space theory of generalized graph signal processing
Published 2021Get full text
Journal Article -
226
Wide-sense stationarity and spectral estimation for generalized graph signal
Published 2022Get full text
Conference Paper -
227
360 Immersive VR website for experiencing Singapore
Published 2017Get full text
Final Year Project (FYP) -
228
Tensor decomposition based R-dimensional matrix pencil method
Published 2012Get full text
Get full text
Get full text
Conference Paper -
229
-
230
On the edge‐toughness of a graph. II
Published 1993“…We also give a simpler proof to the following result of Peng et al.: For any positive integers r, s satisfying r/2 < s ≤ r, there exists an infinite family of graphs such that for each graph G in the family, λ(G) = r (where λ(G) is the edge‐connectivity of G) T1(G) = s, and G can be factored into s spanning trees.…”
Article -
231
Patterned surface with controllable wettability for inkjet printing of flexible printed electronics
Published 2014Get full text
Get full text
Journal Article -
232
Metasurface-tunable lasing polarizations in a microcavity
Published 2023Get full text
Journal Article -
233
Extreme learning machine based fast object recognition
Published 2014Get full text
Get full text
Get full text
Conference Paper -
234
Pandemic, technology and privacy : how far will the state go?
Published 2020Get full text
Commentary -
235
-
236
A numerical study on turquoise hydrogen production by catalytic decomposition of methane
Published 2023Get full text
Journal Article -
237
Feasibility assessment of a container ship applying ammonia cracker-integrated solid oxide fuel cell technology
Published 2023Get full text
Journal Article -
238
Multifeature Extreme Ordinal Ranking Machine for Facial Age Estimation
Published 2015Get full text
Get full text
Journal Article -
239
-
240