Telepathy (from the Greek ????, tele meaning "distant" and ????,pathe meaning "affliction, experience"), is the ostensible transfer of information on thoughts or feelings between individuals by means other than the five senses
                Types of Telepathy :Parapsychology describes several different forms of telepathy, including latent telepathy and precognitive telepathy. Latent Telepathy, formerly known as "deferred telepathy", is described as being the transfer of information, through Psi, with an observable time-lag between transmission and receipt. Retrocognitive, Precognitive, and Intuitive Telepathy is described as being the transfer of information, through Psi, about the past, future or present state of an individual's mind to another individual. Emotive Telepathy, also known as remote influence or emotional transfer, is the process of transferring kinesthetic sensations through altered states. Superconscious Telepathy, involves tapping into the superconscious  to access the collective wisdom of the human species for knowledge.

            Peer-to-peer (P2P) networks have been emerging as one of the most promising approaches to improve the calability of video-on-demand (VoD) service over Internet. Although a number of architectures and streaming protocols have been proposed in pastyears, there is few work to study the practical performance of P2P-based VoD service especially considering the real user behaviorwhich actually has significant impact on the system scalability. Therefore, in this paper, we first characterize the user behavior byanalyzing a large amount of real traces from a popular VoD system supported by the biggest television station in China, cctv.com.Then, we examine the practical scalability of P2P-based VoD service through extensive trace-driven simulation under a general system framework. The results show that P2P networks scale well in providing VoD service under real user behavior by saving a considerable percentage of server bandwidth. Moreover, it is observed that adopting hard cache at client side achieves much better system scalability than that with soft cache. We also identify the impact of various aspects of user behavior upon system scalability through detailed simulation. We believe that our study will shine insightful light on the understanding of practical scalability of P2P-based VoDservice and be helpful to future system design and optimization.

System Requirement Specification:-

DOMAIN     : TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS         
SOFTWARE  : Operating System: windows xp   Platform: JAVA/J2EE
HARDWARE  :  Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

                 This paper aims to address of modeling video behavior captured in surveillance video for the applications of online normal behavior recognition and anomaly detection. A novel framework is developed for automatic behavior profiling and online anomaly sampling detection with out any manual labeling of the training data set. The frame work consists of the following key components: 1) A compact and effective behavior representation method is developed based on discrete scene event detection. The similarity between behavior patterns is measured based on modeling each pattern using Dynamic Bayesian Network (DBN). 2) The natural grouping of behavior patterns is discovered through novel spectral clustering algorithm with unsupervised model selection and future selection on the eigenvectors of a normalized affinity matrix. 3) A composite generative behavior model is constructed that is capable of generalizing from a small training set to accommodate variations in unseen normal behavior patterns.4) A runtime accumulative anomaly measure is introduced to detect abnormal behavior, where as normal behavior patterns are recognized when sufficient visual evidence has become available based on online Likelihood Ratio Test(LRT) method. This ensures robust and reliable anomaly detection and normal behavior recognition at the shortest possible time. The effectiveness and robustness of our approach is demonstrated through experiments using noisy and sparse data sets collected from both indoor and outdoor surveillances scenarios. In particular, it is shown that a behavior model trained using unlabeled data set is superior to those trained using same but labeled data set in detecting anomaly from an unseen video. The experiments also suggest that our online LRT-based behavior recognition is advantageous over the commonly used maximum Likelihood (ML) method in differentiating ambiguities among different behavior classes observed on line.

System Requirement Specification:-

DOMAIN        : TRANSACTIONS ON PATTERN ANALYSYS AND MACHINE INTELLIGENCE          
SOFTWARE    : Operating System: windows xp, Platform: JAVA,  DB: MySQL                       
HARDWARE    : Processor:  Pentium-IV     Speed: 1.8 GHZ   RAM: 512 MB   HDD: 80 GB

 SIP IMPLEMENTATION FOR VOIP
Ø Based on peer to peer relationship.
Ø Based on request/response model(Similar to HTTP).
Ø Each transaction consists of a request that invokes particular method and on the server at least one response.
SIP functionality
· User Location, User Availabilities, User Capabilities, Session Setup, Session Management

System Requirement Specification:- 

DOMAIN      : NETWORK SECURITY                                                                        
SOFTWARE : Operating System: windws xp, Platform: JAVA, Protocol: SIP
HARDWARE : Processor:  Pentium-IV  Speed: 1.8 GHZ  RAM: 512 MB   HDD: 80 GB

                 Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing efficient distributed caching algorithms is non-trivial when network nodes have limited memory. In this article, we consider the cache placement problem of minimizing total data access cost in ad hocnetworks with multiple data items and nodes with limited memory capacity. The above optimization problem is known to be NP-hard. Defining benefit as the reduction in total access cost, we present a polynomial-time centralized approximation algorithm that provably delivers a solution whose benefit is at least one-fourth (one-half for uniform-size data items) of the optimal benefit. The approximation algorithm is amenable to localized distributed implementation, which is shown via simulations to perform close to the approximation algorithm. Our distributed algorithm naturally extends to networks with mobile nodes. We simulate our distributed algorithm using a network simulator (ns2), and demonstrate that it significantly outperforms another existing caching technique (by Yin and Cao [30]) in all important performance metrics. The performance differential is particularly large in more challenging scenarios, such as higher access frequency and smaller memory.

System Requirement Specification:-

DOMAIN      : TRANSACTIONS ON MOBILE COMPUTING                                                   
SOFTWARE : Operating System: windows xp: Platform: JAVA,
                  Algorithm: Disatributed Greedy algorithm 
HARDWARE : Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

             This paper investigates the interaction between end-to-end flow control and MAC-layer scheduling on wireless links. We consider a wireless network with multiple users receiving information from a commoaccess point; each user suffers fading, and a scheduler allocates the channel based on channel quality,but subject to fairness and latency considerations. We show that the fairness property of the scheduler is compromised by the transport layer flow control of TCP NewReno. We provide a receiver-side control algorithm, CLAMP, that remedies this situation. CLAMP works at a receiver to control a TCP sender bysetting the TCP receiver' s advertised window limit, and this allows the scheduler to allocate bandwidth fairlybetween the users.

System Requirement Specification:-

DOMAIN        : TRANSACTIONS ON MOBILE COMPUTING                          
SOFTWARE   : Operating System: windows xp, Platform: JAVA, Protocal: CLAMP
HARDWARE   :   Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

                The conditional access system (CAS) is an essential part of digital pay-TV systems for controlling access to the program services. Conventionally, due to the restrictions of bandwidth and computational capability, a CAS only supports period subscription services that are charged on a monthly basis. In this paper, based on the concept of hierarchical key assignment, we propose three key distribution schemes for the access control of pay-TV systems. With these schemes, a CAS can support more charging strategies for service providers, such as adopting a smaller charging unit and allowing a subscription of any subset of channels with little communication and computational overhead. In addition, the piracy management problem can also be dealt with easily.

System Requirement Specification:-

DOMAIN      :  TRANSACTIONS ON MULTIMEDIA                               
SOFTWARE  : Operating System: windows xp, Platform: JAVA, Protocol: RTP, TooI: JMF   
HARDWARE  : Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB