Super-proximity routing in structured peer-to-peer overlay networks

Peer-to-Peer systems are emerging as one of the most popular Internet applications. Structured Peer-to-Peer overlay networks use identifier based routing algorithms to allow robustness, load balancing, and distributed lookup needed in this environment. However, identifier based routing that is independent of Internet topology tends to be of low efficiency. Aimed at improving the routing efficiency, the super-proximity routing algorithms presented in this paper combine Internet topology and overlay routing table in choosing the next hop. Experimental results showed that the algorithms greatly improve the efficiency of Peer-to-Peer routing.     

高职教育中的功利主义及其防范

高职教育过程中存在着一些功利主义的做法。这些做法片面强调市场导向作用,对学生的人格完善和可持续发展构成潜在威胁。通过模块式培养模式的建构和学分制的实施,使学生能够具备适岗能力,同时又兼顾学生的全面协调可持续发展。     

汉译英中晦涩词翻译技巧

针对晦涩词的隐晦、不流畅、难懂、以至于难以翻译的特点,提出可以运用语境关联、视觉转换、语感选词,取意舍形、增译等技巧加以处理,从而达到＂晦而不晦,涩亦不涩,美感顺畅,通俗易懂＂的基本要求。     

试论中国古典诗歌对庞德诗歌创作与翻译的影响

庞德是20世纪美国意象派诗歌运动公认的领袖,其诗歌创作对英美现代诗坛产生了深远的影响.然而究其渊源,应归功于中国古典诗歌.文章从中国古典诗歌赋予其诗歌创作与翻译灵感、拓宽其诗歌创作与翻译视野、丰富其诗歌创作与翻译理论等方面入手,探讨其对庞德诗歌产生的重要影响.     

KRBKSS： a keyword relationship based keyword-set search system for peer-to-peer networks

Distributed inverted index technology is used in many peer-to-peer (P2P) systems to help find rapidly document in -set search system for peer-to-peer networkswhich a given word appears. Distributed inverted index by keywords may incur significant bandwidth for executing more complicated search queries such as multiple-attribute queries. In order to reduce query overhead, KSS (keyword-set search) by Gnawali partitions the index by a set of keywords. However, a KSS index is considerably larger than a standard inverted index,since there are more word sets than there are individual words. And the insert overhead and storage overhead are obviously unacceptable for full-text search on a collection of documents even if KSS uses the distance window technology. In this paper, we extract the relationship information between query keywords from websites' queries logs to improve performance of KSS system.Experiments results clearly demonstrated that the improved keyword-set search system based on keywords relationship (KRBKSS) is more efficient than KSS index in insert overhead and storage overhead, and a standard inverted index in terms of communication costs for query.     

Control DHT maintenance costs with session heterogeneity

The maintaining overheads of Distributed Hash Table (DHT) topology have recently received considerable attention.This paper presents a novel SHT (Session Heterogeneity Topology) model, in which DHT is reconstructed with session heterogeneity. SHT clusters nodes by means of session heterogeneity among nodes and selects the stable nodes as the participants of DHT. With an evolving process, this model gradually makes DHT stable and reliable. Therefore the high maintaining overheads for DHT are effectively controlled. Simulation with real traces of session distribution showed that the maintaining overheads are reduced dramatically and that the data availability is greatly improved.