The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
For an ISP (Internet Service Provider) which has deployed P2P caches in more than one AS (autonomous system), cooperative caching which makes their caches cooperate with each other can save more cost of carrying P2P traffic than independent caching for the ISP. However, existing cooperative caching schemes only use objects' popularity as the measurement to decide which objects should be cached, and...
Due to the characteristics of the DCF model in 802.11 and P2P users' requirements of both downloading and uploading, P2P traffic frequently causes congestion in WLAN. However, traditional P2P cache cannot alleviates the congestion caused by P2P traffic in WLAN effectively. In this paper, we propose a novel solution called bidirectional cache for this problem. A bidirectional cache which contains a...
BLOG has made it possible to find out the opinions and experiences of those in the vast pool of people that are neither our personal acquaintances nor well-known. How to assess semantic inclination of BLOG contents and reviews automatically has attracted a lot of researchers concern. Due to Chinese expression is more complex than English, it is more difficult to assess semantic inclination of Chinese...
Since the emergence of BLOG, it not only represents a new network technology, but also means the beginning of a new life style. How to utilize and mine the BLOG content which contains hidden sentiment and real-time update is a big challenge in the data-mining domain. As most of the existing method for network text's topic mining is achieved through clustering text's topic and label which are labeled...
The features of P2P networking architecture can contribute to robustness and scalability, however, it also introduces network-oblivious traffic, which brings big pressure to the ISPs. Meanwhile, since traffic of P2P applications occupies much of bandwidth in bottleneck links, non-p2p applications may be severely harmed due to lack of bandwidth. To conquer this problem, previous works mainly focused...
In this paper, we propose a cross-transmission protocol architecture for resource discovery in P2P overlay networks, where each client in the network can query and get the resource identifiers for other P2P overlay networks (like Infohash in Bittorrent network, AICH Top Hash in Emule/Edonkey network). In this way, client can download files from multi-overlay P2P networks simultaneously rather than...
Increasing amount of commercial data is presented in XML format for exchanging or publishing on the Web. It is emerging as a new standard for information representation and exchanging over the Internet. How to retrieve valuable information from XML documents on the Web is a new challenge to data mining research. Compared with relational database, XML data in documents is stored as file with tree logical...
SVG (scalable vector graphic) is used to describing 2D graphics in XML, which is a text file in fact. SVG has many advantages facing to Web application, such as dynamically showing data and interactivity. As increasing usage of SVG graphics in commercial Web applications for exchanging or publishing data, unauthorized duplication and distribution of SVG data become a mandatory concern for many Web...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.