-
321
-
322
Romantic crushes promote variety-seeking behavior
Published 2019Get full text
Get full text
Journal Article -
323
A planar antenna in LTCC for single-package ultrawide-band radio
Published 2009Get full text
Get full text
Journal Article -
324
A microstrip grid array antenna for 60-GHz applications
Published 2013Get full text
Get full text
Conference Paper -
325
Patterned surface with controllable wettability for inkjet printing of flexible printed electronics
Published 2014“…Appropriate control of substrate surface properties prior to inkjet printing could be employed to improve the printing quality of fine resolution structures. In this paper, novel methods to fabricate patterned surfaces with a combination of hydrophilic and hydrophobic properties are investigated. …”
Get full text
Get full text
Journal Article -
326
Observations of Double Diffusive Staircase Edges in the Arctic Ocean
Published 2024Get full text
Article -
327
-
328
-
329
Probabilistic estimation of plug-in electric vehicles charging load profile
Published 2015Get full text
Get full text
Journal Article -
330
Energy disaggregation of overlapping home appliances consumptions using a cluster splitting approach
Published 2020Get full text
Journal Article -
331
An unsupervised Bayesian neural network for truth discovery in social networks
Published 2021Get full text
Journal Article -
332
A Hilbert space theory of generalized graph signal processing
Published 2021Get full text
Journal Article -
333
Wide-sense stationarity and spectral estimation for generalized graph signal
Published 2022Get full text
Conference Paper -
334
360 Immersive VR website for experiencing Singapore
Published 2017Get full text
Final Year Project (FYP) -
335
Tensor decomposition based R-dimensional matrix pencil method
Published 2012Get full text
Get full text
Get full text
Conference Paper -
336
-
337
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 -
338
Metasurface-tunable lasing polarizations in a microcavity
Published 2023Get full text
Journal Article -
339
-
340