Showing 201 - 220 results of 3,455 for search '(((((pinka OR spinka) OR pinn) OR pinga) OR shing) OR (ring OR (pin OR (like OR sssping))))', query time: 0.20s Refine Results
  1. 201
  2. 202
  3. 203
  4. 204
  5. 205
  6. 206
  7. 207
  8. 208
  9. 209

    Efficient water disinfection against antibiotic-resistant bacteria by visible-light heterogeneous photo-Fenton-like process with atomically dispersed Cu on graphitic carbon nitride as the catalyst by Liu, Hang, Wang, Tianyi, Liu, Sixiao, Zhou, Xiaoyu, Zhang, Lei, Sun, Yi, Hu, Yongfeng, Sharouri, Mohsen, Zhang, Yu, Teng, Zhenyuan, Zhang, Xiuyun, Wang, Guoxiu, Wang, Chengyin

    Published 2024
    “…Photocatalytic heterogeneous Fenton and Fenton-like processes can offer efficient pathogen removal, with benefits in recycling, solid–liquid separation, and byproduct avoidance. …”
    Get full text
    Journal Article
  10. 210

    Virus-like particles of nodavirus displaying the receptor binding domain of SARS-CoV-2 spike protein: a potential VLP-based COVID-19 vaccine by Kumar, Kiven, Tan, Wen Siang, Arshad, Siti Suri, Ho, Kok Lian

    Published 2023
    “…Immunization of BALB/c mice with the virus-like particles (VLPs) self-assembled from the recombinant CP showed that, with AddaVax as an adjuvant, a significantly high level of humoral response was elicited. …”
    Get full text
    Article
  11. 211
  12. 212

    Scheduling of dynamically evolving parallel programs using the genetic approach by Ooi, Boon Pin.

    Published 2011
    “…They are uniprocessor Ethernet, multiprocessors Ethernet, ring, mesh, and hypercube. These topologies are chosen due to their popularity in today's multiprocessor systems. …”
    Get full text
    Thesis
  13. 213
  14. 214

    Self-healing algorithm for real-time multicast tree by Giam, Pin Leong.

    Published 2008
    “…Real-time multicast routing had been studied in depth and a number of multicast tree building algorithms had been proposed that take into consideration network cost and performance guarantee services like end-to-end delay constraint. However, these algorithms are not resilient to link failures and would require intensive computation and expensive restructuring of the routing tree. …”
    Get full text
    Thesis
  15. 215
  16. 216
  17. 217
  18. 218
  19. 219
  20. 220