Search Results - Java程式語言

Relation: 1. 王柳鈜，「JAVA APPLET在WWW上的應用」，博碩顧問有限公司（1996）。 2. 黃繼模（2000）「土木結構程式執之網路控管環境介面發展」，台北：淡江大學土木工程研究所碩士論文。 3. 吳旗清（2002）「房屋結構分析與設計程式網路整合控管之應用－建築師事務所範例」，台北：淡江大學土木工程研究所碩士論文。 4. 王宇正（2003）「PDA與結構設計程式網路協同工作空間整合之研究」，台北：淡江大學土木工程研究所碩士論文。 5. 黃世汶（2003）「檔案資料轉換格式的描述及其在結構工程計算上的應用」，台北：淡江大學土木工程研究所碩士論文。 6. 陳建勳（2001）JDBC與JAVA資料庫程式設計，台北：美商歐萊禮股份有限公司台灣分公司。 7. 蕭仁惠、陳錦輝（2003）JDBC資料庫程式設計－JAVA程式設計師邁入資料庫程式設計的第一本書籍，台北：金禾資訊。 8. 林長毅（2000）Java網路程式設計，台北：美商歐萊禮股份有限公司台灣分公司。 9. 李蔚澤（2005）Fedora Core 4 Linux架站實務，台北：碁峰資訊股份有限公司。 10. 楊偉龍, 李宗修, 何政勳（2005）如何通過Linux認證 : LPI教戰手冊2006，臺北市：上奇科技公司。 11. 大藤幹、半場方人（2005）最新詳解JavaScript&HTML&CSS語法辭典，台北：博碩文化股份有限公司。 12. 陳玄玲（2005）Linux系統程式實例設計－檔案I/O•行程控制•使用者權限•信號處理•除錯技巧•記憶體管理，台北：旗標出版有限股份有限公司。 13. 施威銘研究室作（2006）Linux架站實務. 2006 : MIS.架設.管理.防毒，台北：旗標出版有限股份有限公司。 14. 鄭志倫（2005）Linux伺服器建置與管理，台北：博碩文化公司。 15. 酆士昌（2005）Linux架站與管理應用範例大全集，台北：博碩文化公司。 16. White、Fisher、Cattell、Hamilton、Hapner（1999）JDBC API Tutorial and Reference, Second Edition－Universal Data Access for the Java 2 Platforn，California：Addison Wesly 17. Rickard Oberg（2001）Mastering RMI : developing Enterprise applications in Java and EJB，Swiss：John Wiley & Sons,Inc.。 18. James Goodwill（2002）Apache Jakarta Tomcat，California：Apress。 19. Reuven Lerner（2002）Core Perl，N.J：Prentice-Hall。 20. JavaWorld@TW，URL:http://www.javaworld.com.tw/jute。 21. Tomcat5 one Linux Step-By-Step， URL:http://linux-sxs-org/internet_serving/book1.html。 22. 鳥哥的Linux私房菜，URL: http://linux.vbird.org/。; https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/34604; https://tkuir.lib.tku.edu.tw/dspace/bitstream/987654321/34604/1/

Availability: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/34604
https://tkuir.lib.tku.edu.tw/dspace/bitstream/987654321/34604/1/

View record from BASE

Nájsť tento článok vo Web of Science

19

P2PBLOG: 一個對等式的部落格系統

Authors: 盧能彬陳俊仰

Subject Terms: 部落格, 冪次定律, 對等式網路, blog, power law, peer-to-peer (P2P), phil, socio

Relation: http://nccur.lib.nccu.edu.tw/bitstream/140.119/113991/1/627.pdf; http://nccur.lib.nccu.edu.tw//handle/140.119/113991

Availability: http://nccur.lib.nccu.edu.tw/bitstream/140.119/113991/1/627.pdf
http://nccur.lib.nccu.edu.tw//handle/140.119/113991

View record from BASE

Nájsť tento článok vo Web of Science

20

點對點網路下複合檢索系統之設計與實作 ; Complex Search in Peer-to-Peer Networks

Authors: 楊立偉 Yang, Li-Wei 莊裕澤 et al.

Contributors: 楊立偉 Yang, Li-Wei 莊裕澤 et al.

Subject Terms: 點對點網路, 資訊檢索, 關鍵詞搜尋, 前置搜尋, 通用字元搜尋, 多維度搜尋, 超立方空間, Peer-to-peer network, Information retrieval, Keyword search, Prefix search, Wildcard search, Complex search, Multi-dimensional search, Hypercube

File Description: 4986311 bytes; application/pdf

Relation: [1] Karl Aberer. P-Grid: A self-organizing access structure for P2P information systems. In Proceedings of the Ninth International Conference on Cooperative Information Systems (CoopIS 2001), volume 2172 of Lecture Notes in Computer Science, pages 179.194. Springer-Verlag, 2001. [2] Jyoti Ahuja, Jun-Hong Cui, Li Lao, and Shigang Chen. Pson: A scalable peer-to-peer .le sharing system supporting complex queries. In SIGCOMM Posters, 2005. [3] Artur Andrzejak and Zhichen Xu. Scalable, efficient range queries for grid information services. In Proceedings of Second International Conference on Peer-to-Peer Computing (P2P 2002), pages 33.40. IEEE Computer Society, September 2002. [4] James Aspnes, Jonathan Kirsch, and Arvind Krishnamurthy. Load balancing and locality in range-queriable data structures. In Proceedings of the twenty-third Annual ACM Symposium on Principles of Distributed Computing (PODC2004), pages 115.124. ACM Press, July 2004. [5] Baruch Awerbuch and Christian Scheideler. Peer-to-peer systems for prefix search. In Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing (PODC 2003), pages 123.132. ACM Press, July 2003. [6] Ashwin R. Bharambe, Mukesh Agrawal, and Srinivasan Seshan. Mercury: Supporting scalable multi-attribute range queries. In Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 2004), pages 353.366. ACM Press, August 2004. [7] Bobby Bhattacharjee, Sudarshan Chawathe, Vijay Gopalakrishnan, Pete Keleher, and Bujor Silaghi. Efficient peer-to-peer searches using result-caching. In Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS 2003), volume 2735 of Lecture Notes in Computer Science, pages 225. 236. Springer-Verlag, 2003. [8] Burton H. Bloom. Space/time trade-o.s in hash coding with allowable errors. Communications of the ACM, 13(7):422.426, 1970. [9] Hailong Cai and JunWang. Foreseer: a novel, locality-aware peer-to-peer system architecture for keyword searches. In Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware, volume 3231 of Lecture Notes in Computer Science, pages 38.58, New York, NY, USA, 2004. Springer-Verlag. [10] Min Cai, Martin Frank, Jinbo Chen, and Pedro Szekely. MAAN: A multi-attribute addressable network for grid information services. In Proceedings of the Fourth International Workshop on Grid Computing(GRID .03), pages 184. 191, Washington, DC, USA, 2003. IEEE Computer Society. [11] Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nick Lanham, and Scott Shenker. Making Gnutella-like P2P systems scalable. In Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 2003), pages 407.418. ACM Press, August 2003. [12] Kacky Chu, Kevin Labonte, and Brian Neil Levine. Availability and locality measurements of peer-to-peer .le systems. In Proceedings of SPIE (SPIE 2002), volume 4868. The International Society for Optical Engineering, August 2002. [13] Adina Crainiceanu, Prakash Linga, Johannes Gehrke, and Jayavel Shanmugasundaram. Querying peer-to-peer networks using p-trees. In WebDB, pages 25.30, 2004. [14] Arturo Crespo and Hector Garcia-Molina. Routing indices for peer-to-peer systems. In Proceedings of the Twenty-Second International Conference on Distributed Computing Systems (ICDCS 2002), pages 23.32. IEEE Computer Society, July 2002. [15] Antonios Daskos, Shahram Ghandeharizadeh, and Xinghua An. PePeR: A distributed range addressing space for peer-to-peer systems. In Karl Aberer, Vana Kalogeraki, and Manolis Koubarakis, editors, Proceedings of the First International Workshop on Databases, Information Systems, and Peer-to-Peer Computing (DBISP2P 2003), volume 2944 of Lecture Notes in Computer Science, pages 200.218. Springer, 2004. [16] Anwitaman Datta, Manfred Hauswirth, Renault John, Roman Schmidt, and Karl Aberer. Range queries in trie-structured overlays. In Proceedings of The Fifth IEEE International Conference on Peer-to-Peer Computing (P2P 2005). IEEE Computer Society, 2005. [17] Scott C. Deerwester, Susan T. Dumais, Thomas K. Landauer, George W. Furnas, and Richard A. Harshman. Indexing by latent semantic analysis. JASIS, 41(6):391.407, 1990. [18] George W. Furnas, Thomas K. Landauer, Louis M. Gomez, and Susan T. Dumais. The vocabulary problem in human-system communication. Commun. ACM, 30(11):964.971, 1987. [19] Prasanna Ganesan, Qixiang Sun, and Hector Garcia-Molina. Adlib: A self-tuning index for dynamic peer-to-peer systems. In Proceedings of the 21st International Conference on Data Engineering (ICDE.05), pages 256.257, Washington, DC, USA, 2005. IEEE Computer Society. [20] Susan Gauch and Jianying Wang. A corpus analysis approach for automatic query expansion. In CIKM, pages 278.284, 1997. [21] Omprakash D. Gnawali. A keyword-set search system for peer-to-peer networks. Master.s thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, United States, June 2002. [22] Gnutella. http://www.gnutella.com. [23] Gaston H. Gonnet, Ricardo A. Baeza-Yates, and Tim Snider. New indices for text: Pat trees and pat arrays. Information retrieval: data structures and algorithms, pages 66.82, 1992. [24] Abhishek Gupta, Divyakant Agrawal, and Amr El Abbadi. Approximate Range Selection Queries in Peer-to-Peer Systems. In Proceedings of the First Biennial Conference on Innovative Data Systems Research (CIDR 2003), 2003. [25] Matthew Harren, Joseph M. Hellerstein, Ryan Huebsch, Boon T. Loo, Scott Shenker, and Ion Stoica. Complex queries in DHT-based peer-to-peer networks. In Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS 2002), volume 2429 of Lecture Notes in Computer Science, pages 242. 259. Springer-Verlag, 2002. [26] Sta Jean-David. Automatic acquisition of terminological relations from a corpus for query expansion. In SIGIR .98: Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, August 24-28 1998, Melbourne, Australia, pages 371.372. ACM, 1998. [27] S. Lennart Johnsson and Chien-Tien Ho. Optimum broadcasting and personalized communication in hypercubes. IEEE Transactions on Computers, 38(9):1249.1268, September 1989. [28] Vana Kalogeraki, Dimitrios Gunopulos, and D. Zeinalipour-Yazti. A local search mechanism for peer-to-peer networks. In Proceedings of the Eleventh International Conference on Information and Knowledge Management (CIKM 2002), pages 300.307. ACM Press, November 2002. [29] David R. Karger, Eric Lehman, Tom Leighton, Rina Panigrahy, Matthew Levine, and Daniel Lewin. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing (STOC 1997), pages 654.663. ACM Press, May 1997. [30] Stefan Klink, Armin Hust, Markus Junker, and Andreas Dengel. Improving document retrieval by automatic query expansion using collaborative learning of term-based concepts. In Document Analysis Systems, pages 376.387, 2002. [31] Prakash Linga, Adina Crainiceanu, Johannes Gehrke, and Jayavel Shanmugasundaram. Guaranteeing correctness and availability in p2p range indices. In SIGMOD Conference, pages 323.334, 2005. [32] Bin Liu, Wang-Chien Lee, and Dik Lun Lee. Supporting complex multi-dimensional queries in p2p systems. In ICDCS, pages 155.164, 2005. [33] Qin Lv, Pei Cao, Edith Cohen, Kai Li, and Scott Shenker. Search and replication in unstructured peer-to-peer networks. In Proceedings of the 2002 International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2002), pages 258.259. ACM Press, June 2002. [34] Mark Magennis and C. J. van Rijsbergen. The potential and actual effectiveness of interactive query expansion. In SIGIR, pages 324.332, 1997. [35] Mandar Mitra, Amit Singhal, and Chris Buckley. Improving automatic query expansion. In SIGIR, pages 206.214, 1998. [36] Kiyohide Nakauchi, Yuichi Ishikawa, Hiroyuki Morikawa, and Tomonori Aoyama. Peer-to-peer keyword search using keyword relationship. In Proceedings of the Third International Workshop on Global and P2P Computing (GP2PC 2003), pages 359.366. IEEE Computer Society, May 2003. [37] Napster. http://www.napster.com. [38] Wolfgang Nejdl, Martin Wolpers, Wolf Siberski, Christoph Schmitz, Mario Schlosser, Ingo Brunkhorst, and Alexander Loser. Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks. In Proceedings of the Twelfth International Conference on World Wide Web (WWW 2003), pages 536.543. ACM Press, May 2003. [39] Sharman Networks. KaZaA. Retrieved July 27, 2004 from http://www.kazaa.com. [40] Sriram Ramabhadran, Sylvia Ratnasamy, Joseph M. Hellerstein, and Scott Shenker. Brief announcement: Prefix hash tree. In Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (PODC04), pages 368.368, New York, NY, USA, 2004. ACM Press. [41] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A scalable content-addressable network. In Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 2001), pages 161.172. ACM Pres, August 2001. [42] Patrick Reynolds and Amin Vahdat. Efficient peer-to-peer keyword searching. In Proceedings of the 2003 ACM/IFIP/USENIX International Middleware Conference (Middleware 2003), volume 2672 of Lecture Notes in Computer Science, pages 21.40. Springer-Verlag, 2003. [43] Matei Ripeanu. Peer-to-peer architecture case study: Gnutella network. In Proceedings of the First International Conference on Peer-to-peer Computing (P2P 2001), pages 99.100. IEEE Computer Society, August 2001. [44] Antony Rowstron and Peter Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In Proceedings of the 2001 IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), volume 2218 of Lecture Notes in Computer Science, pages 329.350. Springer-Verlag, 2001. [45] Ozgur D. Sahin, Abhishek Gupta, Divyakant Agrawal, and Amr El Abbadi. A peer-to-peer framework for caching range queries. In Proceedings of the 20th International Conference on Data Engineering (ICDE 2004), pages 165.176. IEEE Computer Society, 2004. [46] Gerard Salton. Automatic Text Processing. The Transformation, Analysis and Retrieval of Information by Computer. Reading, MA: Addison-Wesley, 1988. [47] Stefan Saroiu, P. Krishna Gummadi, and Steven D. Gribble. A measurement study of peer-to-peer .le sharing systems. In Proceedings of the 2002 Multimedia Computing and Networking (MMCN 2002). The International Society of Optical Engineering, January 2002. [48] Mario Schlosser, Michael Sintek, Stefan Decker, and Wolfgang Nejdl. HyperCuP: Hypercubes, ontologies and efficient search on p2p networks. In Proceedings of the 2002 International Workshop on Agents and Peer-to-Peer Computing (AP2PC 2002), volume 2530 of Lecture Notes in Computer Science, pages 112. 124. Springer-Verlag, 2003. [49] Cristina Schmidt andManish Parashar. Enabling .exible queries with guarantees in P2P systems. IEEE Internet Computing, 8(3):19.26, 2004. [50] SETI@home: Search for Extraterrestrial Intelligence at home. http://setiathome.ssl.berkeley.edu. [51] Shuming Shi, Guangwen Yang, Dingxing Wang, Jin Yu, Shaogang Qu, and Ming Chen. Making peer-to-peer keyword searching feasible using multi-level partitioning. In IPTPS, pages 151.161, 2004. [52] Kunwadee Sripanidkulchai, Bruce, and Hui Zhang. Efficient content location using interest-based locality in peer-to-peer systems. In Proceedings of Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003), volume 3, pages 2166.2176, March/April 2003. [53] Ion Stoica, Robert Morris, David R. Karger, M. Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 2001), pages 149.160. ACM Press, August 2001. [54] Chunqiang Tang and Sandhya Dwarkadas. Hybrid global-local indexing for efficient peer-to-peer information retrieval. In Proceedings of the First Symposium on Networked Systems Design and Implementation (NSDI 2004), pages 211.224. USENIX, 2004. [55] Chunqiang Tang, Zhichen Xu, and Sandhya Dwarkadas. Peer-to-peer information retrieval using self-organizing semantic overlay networks. In Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 2003), pages 175.186. ACM Press, August 2003. [56] Skype Free Internet telephony that just works. http://www.skype.com/. [57] The Gnutella2 Developer Network. http://www.gnutella2.com. [58] Dimitrios Tsoumakos and Nick Roussopoulos. Adaptive probabilistic search for peer-to-peer networks. In Peer-to-Peer Computing, pages 102.109, 2003. [59] Ian H. Witten, Alistair Mo.at, and Timothy C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images, Second Edition. Morgan Kaufmann, 1999. [60] Beverly Yang and Hector Garcia-Molina. Improving search in peer-to-peer systems. In Proceedings of the Twenty-Second International Conference on Distributed Computing Systems (ICDCS 2002), pages 5.14. IEEE Computer Society, July 2002. [61] Beverly Yang and Hector Garcia-Molina. Designing a super-peer network. In Proceedings of the Ninteenth International Conference on Data Engineering (ICDE2003). IEEE Computer Society, March 2003. [62] Ben Y. Zhao, John Kubiatowicz, and Anthony D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, University of California, Berkeley, April 2001. [63] Feng Zhou, Li Zhuang, Ben Y. Zhao, Ling Huang, Anthony D. Joseph, and John Kubiatowics. Approximate object location and spam .ltering on peer-to-peer systems. In Proceedings of the 2003 ACM/IFIP/USENIX International Middleware Conference (Middleware 2003), volume 2672 of Lecture Notes in Computer Science, pages 1.20. Springer-Verlag, 2003. [64] Hai Zhuge, Xiaoping Sun, Jie Liu, Erlin Yao, and Xue Chen. A scalable p2p platform for the knowledge grid. IEEE Trans. Knowl. Data Eng., 17(12):1721. 1736, 2005.

Availability: http://ntur.lib.ntu.edu.tw/handle/246246/54292
http://ntur.lib.ntu.edu.tw/bitstream/246246/54292/1/ntu-95-F85725003-1.pdf

View record from BASE

Nájsť tento článok vo Web of Science

Search Results - Java程式語言

Search Tools:

Refine Results

Format

Subject

Publisher

Source

Collection

Year of Publication