Search alternatives:
jingle » jinglei (Expand Search), single (Expand Search), jungle (Expand Search)
spie » spin (Expand Search)
peng » eng (Expand Search)
sspingggna » sspinggggna (Expand Search), ssspingggna (Expand Search)
sssspingna » sssspinggna (Expand Search), ssssspingna (Expand Search)
pin » ping (Expand Search), spin (Expand Search)
jingle » jinglei (Expand Search), single (Expand Search), jungle (Expand Search)
spie » spin (Expand Search)
peng » eng (Expand Search)
sspingggna » sspinggggna (Expand Search), ssspingggna (Expand Search)
sssspingna » sssspinggna (Expand Search), ssssspingna (Expand Search)
pin » ping (Expand Search), spin (Expand Search)
-
221
Development of a device-free fall detection system in home environment
Published 2018Get full text
Final Year Project (FYP) -
222
-
223
One level density of low-lying zeros of families of L-functions
Published 2011Get full text
Get full text
Journal Article -
224
-
225
Probabilistic estimation of plug-in electric vehicles charging load profile
Published 2015Get full text
Get full text
Journal Article -
226
Energy disaggregation of overlapping home appliances consumptions using a cluster splitting approach
Published 2020Get full text
Journal Article -
227
An unsupervised Bayesian neural network for truth discovery in social networks
Published 2021Get full text
Journal Article -
228
A Hilbert space theory of generalized graph signal processing
Published 2021Get full text
Journal Article -
229
Wide-sense stationarity and spectral estimation for generalized graph signal
Published 2022Get full text
Conference Paper -
230
360 Immersive VR website for experiencing Singapore
Published 2017Get full text
Final Year Project (FYP) -
231
Tensor decomposition based R-dimensional matrix pencil method
Published 2012Get full text
Get full text
Get full text
Conference Paper -
232
-
233
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 -
234
Patterned surface with controllable wettability for inkjet printing of flexible printed electronics
Published 2014Get full text
Get full text
Journal Article -
235
Metasurface-tunable lasing polarizations in a microcavity
Published 2023Get full text
Journal Article -
236
Dielectric dynamics of epitaxial BiFeO3 thin films
Published 2013Get full text
Get full text
Journal Article -
237
-
238
Health and disease phenotyping in old age using a cluster network analysis
Published 2018Get full text
Get full text
Journal Article -
239
-
240
Bagan Mural project : building a robust digital library on Wordpress
Published 2014Get full text
Get full text
Get full text
Conference Paper