Verify on www.ieee.org

             In our project we seek to provide reliable and fast content discovery in peer- to - peer (P2P) video- on –demand (VoD) system to enable user interactivity under peer dynamics. We first identify two sets of characteristics of content discovery in P2P-VoD system i.e., real- time constraints and limited local cache. Considering these two properties we propose a hybrid contend discovery mechanism i.e., SUpeRchunk-based eFficient search Network (SURFNet). An efficient and fast content discovery algorithm is thus critical to P2P-VoD systems, especially in terms of reducing delay after a seek is performed. SURFNet classifies videos into two superchunks and chunks. Here video files are first divided into chunks, and then several chunks are grouped into superchunks. Peers form a structured overlay according to which superchunk they hold. Our analysis results show that SURFNet supports nearly-constant and logarithmic search time for seeking within a video and jumping to a different video, respectively.

System Requirement Specification:-
DOMAIN : Transaction on Multimedia
SOFTWARE : Operating System: windows xp ,Platform: Dotnet, Database: SQL Server 2005
Special Tool: Ajax and SilverLight3.
HARDWARE : Processor: Pentium-IV, Speed: 2.2 GHZ ,RAM: 2GB , HDD: 80 GB

             To Manage video Streaming on heterogeneous networks with a video streaming platform on a continuous multimedia service at any time in any location with any computing device. One of the major challenge is particular is how to design a session handoff control scheme. The main aim is to how to produce the seamless services for the user under various conditions.

System Requirement Specification:-
DOMAIN     : Mobility management
SOFTWARE : Operating System: Windows xp, Platform: JAVA, Algorithm: ISMA,TOOL: JMF
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ , RAM: 512 MB, HDD:80 GB

            AbstractThe least-significant-bit (LSB)-based approach is a popular type of steganographic algorithms in the spatial domain. However, we find that in most existing approaches, the choice of embedding positions within a cover image mainly depends on a pseudorandom number generator without considering the relationship between the image content itself and the size of the secret message. Thus the smooth/flat regions in the cover images will inevitably be contaminated after data hiding even at a low embedding rate, and this will lead to poor visual quality and low security based on our analysis and extensive experiments, especially for those images with many smooth regions. In this paper, we expand the LSB matching revisited image steganography and propose an edge adaptive scheme which can select the embedding regions according to the size of secret message and the difference between two consecutive pixels in the cover image. For lower embedding rates, only sharper edge regions are used while keeping the other smoother regions as they are. When the embedding rate increases, more edge regions can be released adaptively for data hiding by adjusting just a few parameters. The experimental results evaluated on 6000 natural images with three specific and four universal steganalytic algorithms show that the new scheme can enhance the security significantly compared with typical LSB-based approaches as well as their edge adaptive ones, such as pixel-value-differencing-based approaches, while preserving higher visual quality of stego images at the same time. Index TermsContent-based steganography, least-signifi- cant-bit (LSB)-based steganography, pixel-value differencing (PVD), security, steganalysis.

System Requirement Specification:-
DOMAIN     : TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
SOFTWARE : Operating System: Windows xp, Platform: JAVA, Algorithm: DSA,
                  Protocol: TCP/IP
HARDWARE : Processor: Pentium-IV, Speed: 1.8 GHZ , RAM: 512 MB, HDD: 80 GB

             A conditional access system (CAS) proposed by Sun et al. has a critical security weakness in its inability to preserve backward secrecy; a former subscriber can still access programs despite his or her change in status. This weakness in Sun et al.s CAS originates because 1) no change is made to a group key after a new member arrives, and 2) updates of group keys are done in an insecure manner. We show how simple protocol changes can fix these weaknesses and thus render Sun et al.s CAS capable of preserving backward secrecy. Index Terms Access key management, conditional access system, group key distribution, pay-TV.

System Requirement Specification:-
DOMAIN     : IEEE TRANSACTIONS ON MULTIMEDIA,
SOFTWARE : Operating System: windows xp, Platform: JAVA
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