يعرض 1 - 11 نتائج من 11 نتيجة بحث عن '"Hung, Yi-Hui"', وقت الاستعلام: 0.37s تنقيح النتائج
  1. 1
    Academic Journal
  2. 2
    Academic Journal
  3. 3
    Academic Journal

    المساهمون: Weng, Xuchu, National Science Council

    المصدر: PLOS ONE ; volume 12, issue 12, page e0188526 ; ISSN 1932-6203

  4. 4
    Academic Journal
  5. 5
    Book
  6. 6
    Academic Journal
  7. 7
    Academic Journal

    المساهمون: Neuroimagerie cognitive - Psychologie cognitive expérimentale (UNICOG-U992), Service NEUROSPIN (NEUROSPIN), Université Paris-Saclay-Institut des Sciences du Vivant Frédéric JOLIOT (JOLIOT), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Institut des Sciences du Vivant Frédéric JOLIOT (JOLIOT), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut National de la Santé et de la Recherche Médicale (INSERM), Collège de France - Chaire Psychologie cognitive expérimentale, Collège de France (CdF (institution))

    المصدر: ISSN: 1053-8119.

    Relation: hal-02324967; https://hal.science/hal-02324967

  8. 8
    Academic Journal
  9. 9
    Academic Journal
  10. 10
    Dissertation/ Thesis

    المؤلفون: 洪宜蕙, Hung, Yi-Hui

    المساهمون: 郭斯彥, 臺灣大學:電機工程學研究所

    مصطلحات موضوعية: 資料可獲取度, Data Availability, Ad-Hoc Networks

    وصف الملف: 670775 bytes; application/pdf

    Relation: [1] L. D. Fife and L. Gruenwald, “Research issues for data communication in mobile ad-hoc network database systems,” ACM SIGMOD Record, 32(2): 42-47, Jun 2003. [2] E. Cohen, S. Shenker, “Replication strategies in unstructured peer-to-peer networks,” Proceedings of ACM SIGCOMM, Aug 2002, Pennsylvania, USA. [3] Q. Lv , P. Cao , E. Cohen , K. Li , S. Shenker, “Search and replication in unstructured peer-to-peer networks,” Proceedings of the 16th international conference on Supercomputing, Jun 2002, New York, New York, USA. [4] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, “Wireless sensor networks: a survey,” Computer Networks 38 (2002) 393-422. [5] C. Cao, L.Yin, C. Das, “Cooperative cache-based data access in ad hoc networks,” IEEE Computer, pp. 32-39, Feb. 2004. [6] D.B. Johnson, D.A. Maltz, and Y-C. Hu, “The dynamic source routing protocol for mobile ad hoc networks (DSR),” IETF Mobile Ad Hoc Network Working Group, Internet draft, work in progress, 15 Apr. 2003. [7] C.E. Perkins, E.M. Belding-Royer, S.R. Das, “Ad hoc on-demand distance vector (AODV) routing,” IETF Mobile Ad Hoc Network Working Group, Internet draft, work in progress, 17 Feb. 2003. [8] P.Jacquet et al., “Optimized link state routing protocol for ad hoc networks,” Proc. IEEE Infocom 2000, vol. 1, IEEE Press, 2000, pp. 3-12. [9] J. Carle, D. Simplot-Ryl, “Energy-efficient area monitoring for sensor networks,” IEEE Computer, pp. 40-46, Feb. 2004. [10] P. Mohapatra, C. Gui, J. Li, “Group communications in mobile ad hoc networks,” IEEE Computer, pp. 52-59, Feb. 2004. [11] S. Shah, K. Ramamritham, P. J. Shenoy, “Resilient and coherence preserving dissemination of dynamic data using cooperating peers,” IEEE Transactions on Knowledge and Data Engineering, 16(7): 799-812, 2004. [12] T. Hara, “Replica allocation methods in ad hoc networks with data update,” Mobile Networks and Applications (MONET), 8(4):343-354, 2003. [13] L. Yin and G. Cao, “Supporting cooperative caching in ad hoc networks,” IEEE INFOCOM 2004, Mar 2004. [14] J. Gao and P. Steenkiste, “Design and evaluation of a distributed scalable content discovery system,” IEEE Journal on Selected Areas in Communications, 22(1):54-66, Jan 2004. [15] Q. Zhang, F. Yang, W. Zhu, and Y.-Q. Zhang, “A construction of locality-aware overlay network: mOverlay and its performance,” IEEE Journal on Selected Areas in Communications, 22(1):18-28, Jan 2004. [16] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, “Chord: a scalable peer-to-peer lookup service for internet applications,” ACM SIGCOMM, Aug 2001. [17] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A scalable content-addressable network,” ACM SIGCOMM, Aug 2001. [18] B. Zhao, J. Kubiatowicz, and A. Joseph, “Tapestry: an infrastructure for fault-tolerant wide-area location and routing,” Univ. California, Berkeley, CA, TR UCB/CSD-01-1141, Apr 2001. [19] M. Bawa, H. Garcia-Molina, A. Gionis, and R. Motwani, “The Price of Validity in Dynamic Networks,” In Proc. of ACM SIGMOD 2004. pp. 515-526. [20] M. Bawa, H. Garcia-Molina, A. Gionis, and R. Motwani, “The Price of Validity in Dynamic Networks,” In Proc. of ACM SIGMOD 2004. pp. 515-526. [21] S. Mukhopadhyay, D. Panigrahi and S. Dey, “Data aware, low cost error correction for wireless sensor networks,” Proceedings WCNC 2004, Mar 2004. [22] L. Yin ,G. Cao, and Y. Cai, “A generalized target-driven cache replacement policy for mobile environments,” The International Symposium on Applications and the Internet (SAINT), pp. 14-21, Jan. 2003. [23] L. Yin, G. Cao, ”Balancing the tradeoffs between data accessibility and query delay in ad hoc networks,” [24] S. Shah, K. Ramamritham, and P. J. Shenoy, “Resilient and Coherence Preserving Dissemination of Dynamic Data Using Cooperating Peers,” IEEE Trans. Knowledge Data Engineering, 16(7): 799-812, 2004. [25] A. Qayyum, L. Viennot, and A. Laouiti, “Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks,” In Proc. of the 35th Annual Hawaii International Conference on System Sciences (HICSS), 2001. [26] P.-J. Wan, K. M. Alzoubi, and O. Frieder, “Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks,” Mobile Networks and Applications (MONET), 9(2): 141-149, 2004. [27] Q. Zhang, F. Yang, W. Zhu, and Y.-Q. Zhang, “A construction of locality-aware overlay network: mOverlay and its performance,” IEEE Journal on Selected Areas in Communications, 22(1):18-28, Jan 2004. [28] L. M. Feeney, M. Nilsson, “Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment,” In Proc. of IEEE INFOCOM 2001, pp. 1548–1557. [29] M. Bawa, H. Garcia-Molina, A. Gionis, and R. Motwani, “The Price of Validity in Dynamic Networks,” In Proc. of ACM SIGMOD 2004. pp. 515-526. [30] R. Motwani and P. Raghavan, “Randomized Algorithms,” Cambridge University Press, 1995. [31] S.-J. Yang, “Exploring Complex Networks by Walking on Them,” Physical review E 71, 016107. [32] D. Randall, “Mixing,” Proc. of IEEE FOCS, 2003. [33] R. Bubley and M. Dyer, “Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains,” Proc. of IEEE FOCS, 1997. [34] T. P. Hayes, E. Vigoda, “Variable length path coupling,” Proc. of ACM-SIAM SODA, 2004. [35] R. Albert, H. Jeong, A.-L. Barabási, “Error and attack tolerance of complex networks,” Nature, vol. 406, 2000. [36] D. Watts and S. Strogatz, “Collective dynamics of ‘small-world’ networks,” Nature, 393. pp. 440-442, 1998. [37] R. Albert, A.-L. Barabási, “Emergence of scaling in random networks,” Science, vol. 286, pp. 509-512, 1999. [38] S. Milgram, “The small world problems,” Psychology Today, vol. 1, no 61, 1967. [39] A. Helmy, “Small Worlds in Wireless Networks”, IEEE Communications Letters, pp. 490-492, Vol. 7, No. 10, October 2003. [40] A. Helmy, ”Mobility-assisted rsolution of queries in large-scale mobile sensor networks (MARQ),” Elsevier Computer Networks, pp. 437-458, 2003. [41] M.A.M. Aguiar, Y. Bar-Yam, “Spectral analysis and the dynamic response of complex networks,” Physical Review, E 71, 2005. [42] T. Bu, D. Towsley, “On distinguishing between internet power law topology generators,” IEEE, 2002; en-US; http://ntur.lib.ntu.edu.tw/handle/246246/53540; http://ntur.lib.ntu.edu.tw/bitstream/246246/53540/1/ntu-94-R92921100-1.pdf

  11. 11
    Academic Journal