8904843
Social Peer-to-Peer for Resource Discovery
For resource discovery in social networks, people can directly contact some acquaintances that have knowledge about the resources they are looking for. However, in current peer-to-peer networks, peer nodes lack capabilities similar to social networks, making it difficult to route queries efficiently. In this paper, we present a social-like system (Social-P2P) for resource discovery by mimicking human behaviours in social networks. Different from most informed search algorithms, peer nodes learn knowledge from the results of previous searches and no additional overhead is required to obtain extra information from neighbouring nodes. Unlike community-based P2P information sharing systems, we do not intend to create and maintain peer groups or communities consciously. Peer nodes with the same interests will be highly connected to each other spontaneously. Social-P2P has been simulated in a dynamic environment. From the simulation results and analysis, Social-P2P achieved better performance than current methods
16471179
Small World Architecture for Peer-to-Peer Networks
Small-world phenomenon has been observed in existing peer-to-peer (P2P) networks, such as Gnutella and Freenet. Due to the similarity of P2P networks to social networks, the previous small-world model proposed by Duncan Watts can be adopted in the design of P2P networks: each node is connected to some neighbouring nodes, and a group of nodes keep a small number of long links to randomly chosen distant nodes. Unfortunately, current unstructured search algorithms have difficulty distinguishing these random long-range shortcuts. This paper presents small world architecture for P2P networks (SWAN) with a semi-structured P2P search algorithm that is used to create and find long-range shortcuts toward remote peer groups. In SWAN, not every peer node needs to be connected to remote groups, but every peer node can easily find which peer nodes have external connections to a specific peer group
18595985
Fault-tolerant peer-to-peer search on small-world networks
This paper presents a small world architecture for P2P networks (SWAN) for content discovery in multi-group P2P systems. A semi-structured P2P algorithm of SWAN is utilized to create and find long-range shortcuts toward remote peer groups. In SWAN, not every peer node needs to be connected to remote groups, but every peer node can easily find which peer nodes have external connections to a specific peer group. From our analysis and simulation, SWAN has the advantages of both structured and unstructured P2P networks, and can achieve good performance in both stable and dynamic environments.
14971936
Does Familiarity Breed Content? Taking Account of Familiarity with a Topic in Personalizing Information Retrieval
We report on an evaluation of the effectiveness of considering a user's familiarity with a topic in improving information retrieval performance. This approach to personalization is based on previous results indicating differences in user search behavior and judgments according to his/her familiarity to the topic explored, and to research on using implicit sources of evidence to determine the user's context and preferences. Our attempt was to relate a topic-dependent concept and measure, familiarity with the topic, with topic-independent measures of documents such as readability, concreteness/abstractness, and specificity/generality. Contrary to our expectations, a user’s familiarity with a topic has no effect on the utility of readability or concrete/abstract scoring. We are encouraged, however, to find that high readability had a positive effect on search results, regardless of a user’s familiarity with a topic.
10474493
Calculation of intermodulation distortion in CMOS transconductance stage
The linearity of the transconductance stage is of major concern in the design of some analog circuits. In this paper, Volterra series expansion is used to compute the intermodulation distortion of high frequency CMOS transconductance stage with source degeneration resistor. The MOS model used in this paper includes short-channel effects and gate-source capacitance, gate-drain capacitance, and output resistance of the MOS transistor. Analytical results are compared with simulation results and the influences of circuit parameters on circuit linearity are discussed.
36541131
High Performance Support of Lustre over Customized HSNI for HPC
Parallel I/O needs keep pace with the demand of high performance computing applications. I/O bottleneck still is one of the key problems which restrict the development of high performance computer. Object-based storage combines the advantages of SAN and NAS, adopts an object-based interface, and has been a new orientation of massive storage. The trend as such makes it very promising to build a scalable I/O system for highperformance computing through implementation of object-based storage system based on high-performance interconnects. Lustre is a high performance distributed object parallel file system, is being widely studied and applied. Exploiting performance of Lustre depends on supports of high performance interconnects. In this paper, firstly we designed and implemented a customized high performance interconnect chip, HSNI (High performance Storage Network Interface), and introduced the characteristics of HSNI. Then we analyzed the communication features which support high performance of Lustre. Experimental results show that HSNI can greatly exert the performance of Lustre and has a very good scalability, so its very suitable for building the high performance object-based storage systems for high performance computing.
3090205
Challenges for End-to-End Quality of Service in Heterogeneous Networks
To guarantee the end-to-end QoS (E2E Quality of Service) in heterogeneous network is an important issue to provide pervasive and trusted service. Currently, the different networks are optimized for different services, but it becomes urgent to provide pervasive service across different networks. This paper gives an overview on how to design a dynamic and integrated QoS architecture under heterogeneous networks. This paper firstly analyzes the actuality of the E2E quality of service in heterogeneous networks, and then discusses the requirements of the E2E QoS of two types of heterogeneous networks, finally points out the five key issues to solve the practical problem in the current network.
14342172
User studies on the feasibility of oblique contouring
MRI and CT scanners have long been used to produce three-dimensional samplings of anatomy elements for use in medical visualization and analysis. Physicians often need to construct surfaces representing the anatomical shape in order to conduct treatment, such as radiating a tumor. Traditionally, this is done by a time-consuming process in which an experienced physician marks a series of parallel contours that outline the object of interest.