Indian Institute of Technology Kanpur

Displaying 1-40 of 64 results

  • White Papers // Jan 2013

    Optimal 4G OFDMA Dynamic Subcarrier and Power Auction-Based Allocation Towards H.264 Scalable Video Transmission

    In this paper, authors presented a price maximization scheme for optimal Orthogonal Frequency Division for Multiple Access (OFDMA) subcarrier allocation for wireless video unicast/multicast scenarios. They formulate a pricing based video utility function for H.264 based wireless scalable video streaming, thereby achieving a trade-off between price and QoS fairness. These...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Apr 2013

    Dynamic Parallel TCP for Scalable Video Streaming Over MIMO Wireless Networks

    Video streaming over wireless (networks) has gained popularity in recent times with the development of 3G and 4G mobile networks. The demand and market for video based services is expected to grow substantially in the future. When UDP is used for video streaming, the inherent unreliability of UDP frequently results...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Feb 2013

    Optimal Power Allocation Auction for H.264/SVC Coded Wireless Video Transmission

    In this paper, the authors propose optimal power allocation schemes for quality maximization of the transmitted video streams in wireless multicast communication scenarios. For this purpose they employ parametric scalable video models, which model the rate and quality of the scalable streams as a function of the quantization parameter and...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Nov 2012

    Robust Total Variation and Sphere Decoding Based Image Reconstruction for Wireless Sensor Networks

    In this paper, the authors propose a novel scheme for low-complexity robust recovery in the context of image transmission over Rayleigh fading wireless sensor links. The proposed scheme employs an optimal Maximum-Likelihood (ML) scheme for transmit vector detection in conjunction with a total variation regularization factor towards sparsity of the...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Oct 2012

    DWT Based Optimal Power Allocation Schemes for Scalable Video Transmission in OFDM Based Cognitive Radio Systems

    In this paper, the authors propose and investigate the performance of optimal power loading algorithms towards scalable video transmission over an Orthogonal Frequency Division Multiplexing (OFDM) based Cognitive Radio (CR) system. The proposed power allocation scheme minimizes the overall video distortion while restricting secondary user interference. For this purpose, they...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Oct 2012

    Auction Based Optimal Subcarrier Allocation for H.264 Scalable Video Transmission in 4G OFDMA Systems

    In this paper, the authors present a price maximization scheme for optimal OFDMA subcarrier allocation for wireless video unicast/multicast scenarios. They formulate a pricing based video utility function for H.264 based wireless scalable video streaming, thereby achieving a trade-off between price and QoS fairness. These parametric models for scalable video...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Aug 2006

    Network Monitoring Tool to Identify Malware Infected Computers

    These days most of the Organizational Networks are facing a critical problem. Lately there has been a lot of increase in Malwares such as worms, adwares, spywares etc., which get installed on the user's PC and generate Network and Internet traffic without the user's knowledge i.e. in the background. As...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Mar 2009

    Low Cost Secure Transaction Model for Financial Services

    Installing a financial service outlet (e.g. Automated Teller Machine (ATM)) is an expensive affair due to the need of dedicated network connectivity. In the existing model, the users are forced to trust a service outlet to be authentic. A spoofed outlet can collect the account information and use it in...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Jul 2009

    Accessing Files From Public Computers in a Trusted Manner

    Governments, military, different private organizations, financial institutions and hospitals have great deal of confidential information which is stored on computers. All these organizations want this information to be secure and accessible from any part of the world. For data security, one can use any of the encrypting file systems like...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Jan 2010

    Surveillance Video Mining

    This paper approaches the problem of surveillance event characterization at two levels. First, the information characterizable at the single camera image-plane level, where one uses a set of occlusion primitives to define a set of time-varying predicates on heterogeneous objects moving in unknown environments. After learning the scene background online,...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Jul 2009

    TransCrypt: An Enterprise Encrypting File System Over NFS

    Many organizations have great deal of confidential information which is stored on computers. Such information is desired to be kept securely yet giving a convenience of accessibility from any part of the world. For data security, one can use an encrypting file system such as eCryptfs, dmCrypt, File Vault. However...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Jan 2011

    Rural Telephony: A Socio-Economic Case Study

    Information and Communication Technology (ICT) has the potential to bring in development to rural areas in the third world. Any deployment of technology however should be backed by a positive economic activity to be sustainable. This paper reports on experience with the economics, as well as the social aspects of...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Feb 2010

    Approximate Shortest Paths Avoiding a Failed Vertex : Optimal Size Data Structures for Unweighted Graphs

    The shortest paths problem is a classical and well studied algorithmic problem of computer science. This problem requires processing of a given graph G = (V,E) on n = |V | vertices and m = |E| edges to compute a data structure using which shortest path or distance between any...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Sep 2010

    An Application-Oriented Model for Wireless Sensor Networks Integrated With Telecom Infra

    This paper aims to propose a significant way of remote access and real time monitoring of a particular geographic area by integrating wireless sensor clouds with existing Telecom infrastructure and applications built around them through a gateway. This utility is very potent for environment monitoring in harsh and inaccessible places...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Apr 2011

    Security of Prime Field Pairing Cryptoprocessor Against Differential Power Attack

    This paper deals with the differential power attack on a pairing cryptoprocessor. The cryptoprocessor is designed for pairing computations on elliptic curves defined over finite fields with large prime characteristic. The paper pinpoints the vulnerabilities of such pairing computations against side-channel attacks. By exploiting the power consumptions, the paper experimentally...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Sep 2009

    Dynamically Generated Interfaces in XML Based Architecture

    Providing on-line services on the Internet will require the definition of flexible interfaces that are capable of adapting to the user's characteristics. This is all the more important in the context of medical applications like home monitoring, where no two patients have the same medical profile and yet, the same...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Aug 2010

    Multi-Algorithmic Iris Authentication System

    The paper proposes a novel technique for iris recognition using texture and phase features. Texture features are extracted on the normalized iris strip using Haar Wavelet while phase features are obtained using LOG Gabor Wavelet. The matching scores generated from individual modules are combined using sum of score technique. The...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Jan 2011

    A Routing Algorithm for Multi-Hop Mobile Ad-Hoc Networks Using Weighted Delaunay Triangulation

    A multi-hop mobile ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or standard support services. In such an environment, it is necessary for each mobile node to act both as a host and as router. Such a network...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Jan 2011

    Feasibility Study of Spatial Reuse in an 802.11 Access Network

    Despite a decade and a half of communication revolution, much of the rural population in developing countries is yet to see its benefits. The underlying reason for this is that communication technology (wired and cellular) is value-priced for western markets. Thus these technologies have found widespread deployment in metropolitan pockets...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Jan 2011

    Revisiting MAC Design for an 802.11 Based Mesh Network

    This paper deals with an 802.11-based access network for rural villages. 802.11's CSMA/CA MAC is known to perform poorly in mesh networks. In this paper, the authors present the design of a novel MAC suited to a mesh network with outdoor, long-distance, point-to-point links. Multi-hop 802.11 networks are a topic...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Feb 2012

    On the Optimality of Lattices for the Coppersmith Technique

    The authors investigate the Coppersmith technique for finding solutions of a univariate modular equation within a range given by range parameter U. This technique converts a given equation to an algebraic equation via a lattice reduction algorithm, and the choice of the lattice is crucial for the performance of the...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Feb 2010

    Feature Level Fusion of Biometrics Cues: Human Identification With Doddington's Caricature

    This paper presents a multimodal biometric system of fingerprint and ear biometrics. Scale Invariant Feature Transform (SIFT) descriptor based feature sets extracted from fingerprint and ear are fused. The fused set is encoded by K-medoids partitioning approach with less number of feature points in the set. K-medoids partition the whole...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Jan 2014

    LEMap: Controlling Leakage in Large Chip-Multiprocessor Caches Via Prole-Guided Virtual Address Translation

    The emerging trend of larger number of cores or processors on a single chip in the server, desktop, and mobile notebook platforms necessarily demands larger amount of on-chip last level cache. However, larger caches threaten to dramatically increase the leakage power as the industry moves into deeper sub-micron technology. In...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Jan 2014

    PageNUCA: Selected Policies for Page-Grain Locality Management in Large Shared Chip-Multiprocessor Caches

    As the last-level on-chip caches in Chip Multi-Processors (CMPs) increase in size, the physical locality of on-chip data becomes important for delivering high performance. The non-uniform access latency seen by a core to different independent banks of a large cache spread over the chip necessitates active mechanisms for improving data...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Jan 2014

    Scavenger: A New Last Level Cache Architecture with Global Block Priority

    Addresses suffering from cache miss typically exhibit repetitive patterns due to the temporal locality inherent in the access stream. However, the authors observe that the number of intervening misses at the last-level cache between the eviction of a particular block and its reuse can be very large, preventing traditional victim...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Sep 2012

    Performance Evaluation of Concurrent Lock-Free Data Structures on GPUs

    Graphics Processing Units (GPUs) have emerged as a strong candidate for high-performance computing. While regular data-parallel computations with little or no synchronization are easy to map on the GPU architectures, it is a challenge to scale up computations on dynamically changing pointer-linked data structures. The traditional lock-based implementations are known...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Sep 2008

    A Compilation Framework for Irregular Memory Accesses on the Cell Broadband Engine

    A class of scientific problems represents a physical system in the form of sparse and irregular kernels. Parallelizing scientific applications that comprise of sparse data structures on the Cell Broadband Engine (Cell BE) is a challenging problem as the memory access pattern is irregular and cannot be determined at compile...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // May 2008

    Implementing a Parallel Matrix Factorization Library on the Cell Broadband Engine

    Matrix factorization (or often called decomposition) is a frequently used kernel in a large number of applications ranging from linear solvers to data clustering and machine learning. The central contribution of this paper is a thorough performance study of four popular matrix factorization techniques, namely, LU, Cholesky, QR, and SVD...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // May 2007

    Integrating Memory Compression and Decompression with Coherence Protocols in Distributed Shared Memory Multiprocessors

    Ever-increasing memory footprint of applications and increasing mainstream popularity of shared memory parallel computing motivate the user to explore memory compression potential in Distributed shared Memory (DSM) multiprocessors. This paper for the first time integrates on-the-fly cache block compression/decompression algorithms in the cache coherence protocols by leveraging the directory structure...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Feb 2007

    Simplifying Active Memory Clusters by Leveraging Directory Protocol Threads

    Address re-mapping techniques in so-called active memory systems have been shown to dramatically increase the performance of applications with poor cache and/or communication behavior on shared memory multiprocessors. However, these systems require custom hardware in the memory controller for cache line assembly/disassembly, address translation between re-mapped and normal addresses, and...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Nov 2008

    Cooling the Hot Sets: Improved Space Utilization in Large Caches via Dynamic Set Balancing

    Multi-megabyte on-chip last-level caches are commonplace in high-end computing platforms. Even though these caches are often designed to have very high associativity, they suffer from non-uniform utilization of the sets leading to a high volume of conflict misses. Clustering of physical addresses to a few hot sets happens partly due...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // May 2007

    Retargetable Cache Simulation Using High Level Processor Models

    During the design of modern embedded systems, it is necessary to automatically generate processor and application development tools like assemblers, disassemblers, compilers, instruction simulators etc. During processor design, it is often necessary to evaluate multiple cache configurations. This paper describes the design and implementation of a retargetable on-line cache simulator....

    Provided By Indian Institute of Technology Kanpur

  • White Papers // May 2007

    High Level Synthesis from Sim-nML Processor Models

    The design of modern complex embedded systems requires a high level of abstraction of the design. The Sim-nML is a specification language to model processors for such designs. Several software generation tools have been developed that take ISA specifications in Sim-nML as input. In this paper, the authors present a...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // May 2007

    Processor Modeling for Hardware Software Codesign

    In hardware - software co-design paradigm often a performance estimation of the system is needed for hardware - software partitioning. The tremendous growth of application specific embedded systems necessitates high level system design tools for rapid prototyping. This paper involves design of a language Sim-nML which will be the base...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // May 2007

    Retargetable Program Profiling Using High Level Processor Models

    During the design of embedded systems, need is felt to automatically generate processor and application development tools like assemblers, disassemblers, compilers, instruction-set simulators etc. Automated generation of such tools yields faster turnaround time with lower costs for system design and simplifies the process of incorporating design changes. Program profiling helps...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // May 2007

    Processor Models for Retargetable Tools

    In applications that involve the development of application specific processors, often there is a need to generate various processor specific tools such as assemblers, compilers, simulators etc. In this paper, the authors describe a methodology for developing processor specific tools such as assemblers, disassemblers, processor simulators and compilers etc., using...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Jan 2014

    Some Experiments with the Performance of LAMP Architecture

    Measurements are very useful to gauge the actual performance of various architectures and their components. In this paper, the authors investigate the performance of the LAMP (Linux, Apache, MySQL, and PHP) architecture and MySQL and PHP components. They build a web-site using LAMP and measure the application level performance. They...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Jan 2014

    Comparative Analysis of Elliptic Curve Cryptography Based Algorithms to Implement Privacy Preserving Clustering Through Secure Multiparty Computation

    In this paper, the authors focus on elliptic curve cryptography based approach for Secure Multiparty Computation (SMC). Widespread proliferation of data and the growth of communication technologies have enabled collaborative computations among parties in distributed scenario. Preserving privacy of data owned by parties is crucial in such scenarios. Classical approach...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Jan 2014

    Privacy Preserving Clustering using Fully Homomorphic Encryption

    In this paper, the authors focus on the privacy preserving scheme for distributed k-means clustering. Various techniques have been suggested in the literature for privacy preserving distributed clustering which is either cryptography based or non-cryptography based. In the non-cryptography based techniques, there is a trade-off between privacy and accuracy. Whereas...

    Provided By Indian Institute of Technology Kanpur

  • White Papers // Mar 2007

    Multilayer Semantic Data Model for Sports Video

    Content-based video management system has become an active research topic for many researchers, which can fully abstract the content of video and index the video objects. A hierarchical semantic abstraction for sports video is proposed in the paper. The authors have represented the semantics of sports video at three levels...

    Provided By Indian Institute of Technology Kanpur