Showing 341 - 360 results of 5,087 for search '((pinnae OR (fine OR (finned OR (pinn OR pina)))) OR (peng OR (lin OR like)))', query time: 0.18s Refine Results
  1. 341
  2. 342
  3. 343

    360 Immersive VR website for experiencing Singapore by Tan, Don Charlton Keat Peng

    Published 2017
    “…Building such a platform is akin to having a first glimpse of how websites of today would look like in VR. The platform would also challenge the definition of VR, as with WebVR, high powered head mounted displays (HMDs) becomes an optional accessory to enhance the experience; it is not compulsory. …”
    Get full text
    Final Year Project (FYP)
  4. 344
  5. 345
  6. 346
  7. 347

    The sky painter by Tan, Wei Lin

    Published 2017
    Get full text
    Final Year Project (FYP)
  8. 348

    Use of DSRC and other sensor signals for vehicular localization by Gong, Yi Lin

    Published 2017
    “…This project is focused on receiving the signal from Road Side Unit (RSU) by using a shark fin antenna, low noise amplifier and USRP N210 through GNU radio companion, generating the waveform and determining the Relative Time of Arrival (RTOA) of received signal. …”
    Get full text
    Final Year Project (FYP)
  9. 349

    Wearing hearts by Leong, Shi Lin

    Published 2016
    Get full text
    Final Year Project (FYP)
  10. 350

    Bed time stories. by Wong, Yoon Lin.

    Published 2009
    Get full text
    Final Year Project (FYP)
  11. 351

    Bubble by Quek, Yu Lin

    Published 2014
    Get full text
    Final Year Project (FYP)
  12. 352

    My garden of you by Chen, Zhi Lin

    Published 2017
    Get full text
    Final Year Project (FYP)
  13. 353
  14. 354
  15. 355
  16. 356
  17. 357
  18. 358
  19. 359
  20. 360

    On the edge‐toughness of a graph. II by Peng, Y.H., Tay, T.S.

    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