Abstract�Most of the existing quantum key distribution protocols (QKDPs) assume that every communicating party is equipped with quantum devices (QDs), e.g., the qubit generating machine, or the quantum memory, or the qubit measuring machine. However, in the practical situation, these QDs are expensive, and a center may be the only party that affords to own these devices. Though Phoenix et al. first realize the idea, their scheme only has 13% of qubit efficiency. This paper proposes two three-party QKDPs. The first QKDP with an honest center allows communicants to share a session key by only performing unitary operations. Moreover, considering the trustworthiness of the center, this paper further proposes the second QKDP without the assumption of a trusted center. Besides, the proposed three-party QKDPs provide better qubit efficiency than the other QKDPs due to the use of the quantum memory and the use of one-way hash function for the eavesdropping check, and the security of proposed QKDPs is shown in the �sequence-of-games approach.

System Requirement Specification:-

DOMAIN : TRANSACTION ON NETWORKING SECURITY
SOFTWARE : sOperating System: windows xp ,Platform: DotNEt
HARDWARE : Processor: Pentium-IV,Speed: 1.8 GHZ ,RAM: 512 MB , HDD: 80 GB

                 Traditional trust management schemes developed for wired and wireless ad-hoc networks are not well suited for sensor networks due to their higher consumption of resources such as memory and power. In this work, we propose a new lightweight Group-based Trust Management Scheme (GTMS) for wireless sensor networks which employs clustering. Our approach reduces the cost of trust evaluation. Also, theoretical as well as simulation results show that our scheme demands less memory, energy and communication overheads as compared to the current state-of-the-art trust management schemes and it is more suitable for large-scale sensor networks. Furthermore, GTMS also enables us to detect
and prevent malicious, selfish and faulty nodes

System Requirement Specification:-

DOMAIN: TRANSACTION ON NETWORKING
SOFTWARE :Operating System: Windows XP, Platform: DOTNET, Back end: SQL SERVER    
HARDWARE : Processor:  Pentium-IV      Speed: 1.8 GHZ , RAM: 512 MB,  HDD: 80 GB

             Security has become one of the major issues for data communication over wired and wireless networks. Different from the past work on the designs of cryptography algorithms and system infrastructures, we will propose a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks, without introducing extra control messages. An analytic study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the analytic
results and to show the capability of the proposed algorithm.

System Requirement Specification:-
DOMAIN: TRANSACTIONSONPARALLEL AND DISTRIBUTED SYSTEMS
SOFTWARE: Operating System: Windows XP,  Platform: JAVA,  DB: SQL Server
HARDWARE      :   Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

              In third generation WCDMA systems, shared channels allow many users to jointly utilize a single Orthogonal Variable Spreading Factor (OVSF) code. In this paper, we propose a Scheduling Algorithm with Dynamic Priority Assignment (DPA), which is designed for the Downlink-Shared Channel (DSCH) of 3G WCDMA systems and operates within a cross-layer framework. The DPA scheduler has low computational complexity and is able to provide Quos differentiation among traffic flows based on their delay sensitivity. Through the cross-layer framework, DPA takes into account the variations of the wireless channel and exploits processing gain to improve transmission quality and enable service provisioning when possible. Additionally, by providing a guaranteed rate per traffic flow at each scheduling period, DPA can offer a deterministic delay bound to each connection when transmissions are reliable. Stochastic delay guarantees under transmission power limitations are also provided when the traffic flow are identical. Simulation results show that DPA outperforms Feasible Earliest Due Date (FEDD), a variation of EDD for wireless environments.

System Requirement Specification:-
DOMAIN :TRANSACTION ON NETWORKING SECURITY
SOFTWARE: Operating System: Windows XP  ,Platform: DOTNET ,Algorithm: DPA, OVSFB
HARDWARE : Processor:  Pentium-IV,  Speed: 1.8 GHZ ,   RAM: 512 MB ,  HDD: 80 GB

            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

              We propose a novel unsupervised learning framework to model activities and interactions in crowded and complicated scenes. Under our framework, hierarchical Bayesian models are used to connect three elements in visual surveillance: low-level visual features, simple �atomic� activities, and interactions. Atomic activities are modeled as distributions over low-level visual features; andmultiagent interactions are modeled as distributions over atomic activities. These models are learned in an unsupervised way. Given along video sequence, moving pixels are clustered into different atomic activities and short video clips are clustered into different interactions. In this paper, we propose three hierarchical Bayesian models: the Latent Dirichlet Allocation (LDA) mixture model, the Hierarchical Dirichlet Processes (HDP) mixture model, and the Dual Hierarchical Dirichlet Processes (Dual-HDP) model. They advance existing topic models, such as LDA [1] and HDP [2]. Directly using existing LDA and HDP models under our framework, only moving pixels can be blustered into atomic activities. Our models can cluster both moving pixels and video clips into atomic activities and into interactions. The LDA mixture model assumes that it is already known how many different types of atomic activities and interactions occur in the scene. The HDP mixture model automatically decides the number of categories of atomic activities. The Dual-HDP automatically decides the numbers of categories of both atomic activities and interactions. Our data sets are challenging video sequences from crowded traffic scenes and train station scenes with many kinds of activities co-occurring. Without tracking and human labeling effort, our framework completes many challenging visual surveillance tasks of broad interest such as: 1) discovering and providing a summary of typical atomic activities and interactions occurring in the scene, 2) segmenting long video sequences into different interactions, 3) segmenting motions into different activities, 4) detecting abnormality, and 5) supporting high-level queries on activities and interactions. In our work, these surveillance problems are formulated in a transparent, clean, and probabilistic way compared with the ad hoc nature of many existing approaches.

System Requirement Specification:-

DOMAIN:TRANSACTIONSONPATTERNANALYSYSANDMACHINE                   INTELLIGENCE             
SOFTWARE    :  Operating System: windows xp      Platform: JAVA/J2EE     TOOL: JMF                
HARDWARE    : Processor:  Pentium-IV      Speed: 1.8 GHZ     RAM: 512 MB     HDD: 80 GB

                  The resource sharing nature of Simultaneous Multithreading (SMT) processors and the presence of long latency instructions from concurrent threads make the instruction scheduling window (IW), which is a primary shared component among key pipeline structures in SMT, a performance bottleneck. Due to the tight constraints on its physical size, the IW faces more severe pressure to handle the instructions from various threads while attempting to avoid resource monopolization by some low-ILP threads. It is particularly challenging to optimize the efficiency and fairness in IW utilization to fulfill the affordable performance by SMT under the shadow of long latency instructions. Most of the existing optimization schemes in SMT processors rely on the fetch policy to control the instructions that are allowed to enter the pipeline, while little effort is put to control the long latency instructions that are already located in the IW. In this paper, we propose streamline buffers to handle the long latency instructions that have already entered the pipeline and clog the IW, while the controlling fetch policies take time to react. Each streamline buffer extracts from IW and holds a chain of instructions from a thread that are stalled by dependency on a long latency load. When the load value returns, the streamline buffer then serves these instructions directly to in-order execution, avoiding any instruction replay. This is done in supplement to the conventional IW that serves in parallel the other instructions for out-of-order (o-o-o) execution. Analysis of SPEC2000 integer and FP benchmarks reveals that instructions dependent on long latency loads, typically have their first source operand ready within 5 percent-15 percent of their total wait time in the IW. Our scheme is able to utilize this asymmetry in source operands' ready time to achieve a complexity effective design. As compared to the baseline SMT architecture, our design when working in conjunction with earlier propose- - d ICOUNT.2.8 fetch policy for 4-threads effectively reduces the IW full rate by 9.4 percent (11 percent for 2-thread), improves average IPC for MIXED workloads by 9.6 percent (8 percent for MEM workloads and 4.4 percent for CPU workloads), and fairness by 7.56 percent (7.24 percent for 2-thread). Similar enhancements are observed when run in conjunction with an RR.2.8 fetch policy.

System Requirement Specification:-

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

                  Current research trend towards mobile computing emphasizes the need for distribution of data among various clients in wireless environment. Sharing the data in J2ME opens the data to be accessible for all MIDLETs present on the device, hence creating a number of vulnerabilities to the confidential information that is intended to be shared with specific MIDLETs, e.g. a malicious MIDLET can delete, copy or move the Shared Record Store, in J2ME based application. This project aims at overcoming record store sharing problem through the concept of Multi- Agent System by providing a shared storage with explicit access to authenticated & authorized MIDLETs. With this mechanism data can be shared among specific MIDLETs. The implementation uses the SAGE-Lite framework as a solution to our proposed work.

System Requirement Specification:-

DOMAIN         : TRANSACTIONS ON MOBILE APPLICATION                                      
SOFTWARE   : Operating System: windows xp, Platform: JAVA /J2ME,  MOBILE AGENT: SAGE_LITE 
HARDWARE  : Processor:  Pentium-IV Speed: 1.8 GHZ  ,   RAM: 512 MB   ,  HDD: 80 GB

                Operating on a frequency band occupying several on-overlapping channels, IEEE 802.11 is now widely used in Wireless Mesh Networks (WMNs). Many multi-channel MAC protocols are proposed to improve the spatial reuse in the network under the assumption that the transmissions on nonoverlappingchannels do not interfere with each other. Some joint routing and channel assignment algorithms are also designed to increase the network throughput based on the premise that wean switch between different channels freely. Although simulations show that great improvements on network throughput cane observed in both cases, two fundamental questions remain:(1) Can we really use multiple non-overlapping channels freely in wireless mesh networks? (2)
                  If we can, what will be the cost when we switch channels dynamically and frequently? In this paper, by conducting extensive experiments on our testbed, we attemptto answer these questions. We fnd that in spite of interferencebetween both overlapping and non-overlapping channels, we canstill use multi-channel in mesh networks under crtain conditions, but with care. We also show that the channel switching costis actually very significant in WMNs. We recommend not to switch the channels too frequently when designing the channel assignment algorithms and those channel assignment algorithms selecting one channel for each packet is not really beneficial.

System Requirement Specification:-

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

                  In this paper, we propose a new data broadcast mechanism with network coding in heterogeneous wireless networks. Our mechanism adaptively clusters the mobile costs in fewer cells to minimize the bandwidth consumption. In addition, we adaptively code he data according to the data temporarily stored in each mobile host with a distributed manner. Our mechanism allows each delivered message to be coded from only a subset of data to further reduce the number of required messages. We formulate the cell selection and broadcast coding problem with integer programming and prove that the problem is NP-hard. We design a distributed algorithm based on Lagrange an relaxation. Our algorithm needs no server to record the location, queried, and stored information of receivers. Moreover, our algorithm is adaptive to the dynamic group membership, mobility, queried, and stored
data of receivers.

System Requirement Specification:-

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