Showing 41 - 60 results of 11,360 for search '(((bee OR (means OR been)) OR (beer OR (sees OR seeks))) OR near)', query time: 0.18s Refine Results
  1. 41
  2. 42

    Near field wireless power transfer by Er, Gavin Kian Ming

    Published 2020
    “…Wireless power transmission has been around since the 1890s and has started to become more prominent in the recent years thanks to technological advancements and breakthroughs in near-field wireless power systems using magnetic resonance. …”
    Get full text
    Final Year Project (FYP)
  3. 43

    Canonical Diffeomorphisms of Manifolds Near Spheres by Wang, Bing, Zhao, Xinrui

    Published 2023
    “…Abstract For a given Riemannian manifold $$(M^n, g)$$ ( M n , g ) which is near standard sphere $$(S^n, g_{round})$$ ( S n , g round ) in the Gromov–Hausdorff topology and satisfies $$Rc \ge n-1$$ R c ≥ n - 1 , it is known by Cheeger–Colding theory that M is diffeomorphic to $$S^n$$ S n . …”
    Get full text
    Article
  4. 44

    Near-zero environmental impact aircraft by Prashanth, Prakash, Elmourad, Jad, Grobler, Carla, Isaacs, Stewart, Zahid, Syed Shayan, Abel, James, Falter, Christoph, Fritz, Thibaud, Allroggen, Florian, Sabnis, Jayant S., Eastham, Sebastian D., Speth, Raymond L., Barrett, Steven R. H.

    Published 2024
    “…We use these models to propose and analyze near-zero environmental impact aircraft, which we define as having net zero climate warming and a greater than 95% reduction in air quality impacts relative to present day. …”
    Get full text
    Article
  5. 45

    Seeing sounds around you : non-linguistic visual information and speech perception by Ho, Danyuan

    Published 2016
    “…The role of visual information in speech perception has not been adequately addressed in the current exemplar-based approach despite evidence showing that speech perception is multimodal in nature. …”
    Get full text
    Thesis
  6. 46
  7. 47
  8. 48
  9. 49
  10. 50

    Distributed Nash equilibrium seeking: continuous-time control-theoretic approaches by Hu, Guoqiang, Pang, Yipeng, Sun, Chao, Hong, Yiguang

    Published 2022
    “…This article is concerned with static games, where the order of the players' decisions is not important (see 'Summary').…”
    Get full text
    Journal Article
  11. 51

    Mining temporal features of exploratory search for supporting collaborative information seeking by Toh, Yee Teng.

    Published 2010
    “…The mined results on the features of exploratory search identified can help to support and enhance the collaboration in information seeking process. Experiment was also done on each clustering algorithms and they can be further improved by expanding using a thesaurus (e.g. …”
    Get full text
    Final Year Project (FYP)
  12. 52

    Relevance judgment during health information seeking on a discussion forum by Pian, Wenjing

    Published 2016
    “…More and more people are seeking and accessing health information on the Internet. …”
    Get full text
    Thesis
  13. 53

    Risk seeking and overconfidence level of Chinese Singaporeans in the individual collective dimension. by Cheong, Joel., Tan, Shu Hui., Teo, Siok Hui.

    Published 2008
    “…This research aims to assess (1) Chinese Singaporeans' risk seeking preference and overconfidence level, whether they are more in sync with an individualistic or collectivist society, (2) the presence of any cushion effect in the Chinese Singaporeans collectivist family, (3) the validity of the "argument recruitment model" with respect to Chinese Singaporeans in the general knowledge test.…”
    Get full text
    Final Year Project (FYP)
  14. 54

    Authenticity in the Workplace: What does it really mean? by Pervaaz, Viquar A.

    Published 2024
    “…Recently, the word authenticity has been used quite prevalently in organizations, specifically as an attribute needed in leaders. …”
    Get full text
    Thesis
  15. 55
  16. 56
  17. 57
  18. 58
  19. 59
  20. 60

    Near Optimal Alphabet-Soundness Tradeoff PCPs by Minzer, Dor, Zheng, Kai Zhe

    Published 2024
    “…Our result has the following implications: (1) Near optimal hardness for Quadratic Programming: it is NPhard to approximate the value of a given Boolean Quadratic Program within factor (log) 1− (1) under quasi-polynomial time reductions. …”
    Get full text
    Article