Search Constraints

Start Over
Filtering by: Creator Fouché, C. F. Remove constraint Creator: Fouché, C. F. Committee Member Bose, Bella Remove constraint Committee Member: Bose, Bella Resource Type Masters Thesis Remove constraint Resource Type: Masters Thesis

Search Results

  • A programmable network interface unit for hybrid meshnet local area networks

    Creator:
    Merchant, Shashank C.
    Abstract:
    A Hybrid Meshnet LAN, a new local area network architecture, has been proposed by Dr. Cheoul-Shin Kang and Dr. James Herzog. It provides for distributed control hybrid architecture which is good for effective load sharing under various local area network environments. Hybrid Meshnet has a dual channel structure, a token...
    Resource Type:
    Masters Thesis
    Full Text:
    local area networks AN ABSTRACTRACT OF THE THESIS OF Shashank C. Merchant for the degree of Master of

  • Customizable Visual Traces for Program Explanations

    Creator:
    Bajaj, Divya
    Abstract:
    Correctness and efficiency are important properties of programs. However, to support maintenance and debugging, the programs should also be understandable. Program explanations also play a vital role in educational settings, enhancing the understanding of programs among students. Proof trees provide a sound basis for generating dynamic explanations of programs. But...
    Resource Type:
    Masters Thesis
    Full Text:
    1⇓ 1 b twice sqr⇓ \x->sqr (sqr x) c \x->f (f x)⇓ \x->sqr (sqr x) e b: f=sqr g sqr (sqr 1)⇓ 1 d

  • Maximum flow in planar digraphs

    Creator:
    Harutyunyan, Anna
    Abstract:
    Worst-case analysis is often meaningless in practice. Some problems never reach the anticipated worst-case complexity. Other solutions get bogged down with impractical constants during implementation, despite having favorable asymptotic running times. In this thesis, we investigate these contrasts in the context of finding maximum flows in planar digraphs. We suggest...
    Resource Type:
    Masters Thesis
    Full Text:
    . Capacities are directed: c(d) need not be equal to c(rev (d)). A flow assignment f(·) is a function on the

  • Massive MIMO Channel Characterization

    Creator:
    Assiri, Mohammad
    Abstract:
    It has been estimated that data traffic from the different mobile devices that range from smartphones to machine-to-machine (M2M) devices will exceed 15.9 exabyte per month by the year 2018. With this immense data growth, the current wireless communication systems suffer from the scarcity of the radio spectrum and eventually...
    Resource Type:
    Masters Thesis
    Full Text:
    , θ, ψ)) = αs(θ, ψ, f) cos 2πf(t− r c ) r (2.1) where the point u = (r, θ, ψ), θ and ψ are

  • Network coding in relay networks

    Creator:
    Alban, Eduardo
    Abstract:
    Transmission over wireless networks presents multiple technical challenges due to noise, interference, fading, power constraints and bandwidth limitation. Different solutions have been propposed to overcome these issues and some of them are treated here. Cooperative diversity has been proposed as an implementation for networks where terminals are restricted to using...
    Resource Type:
    Masters Thesis
    Full Text:
    propose a scheme for a wireless network using ideas based on network coding. c©Copyright by Eduardo

  • Optimizing the advanced encryption standard on Intel's SIMD architecture

    Creator:
    Godbole, Pankaj
    Abstract:
    The Advanced Encryption Standard (AES) is the new standard for cryptography and has gained wide support as a means to secure digital data. Hence, it is beneficial to develop an implementation of AES that has a high throughput. SIMD technology is very effective in increasing the performance of some cryptographic...
    Resource Type:
    Masters Thesis
    Full Text:
    , +, > is a commutative ring 2. <F, +> and are Abelian groups 3. distributivity : (a + b) c = (a

  • Scheduling system of affine recurrence equations by means of piecewise affine timing functions

    Creator:
    Mui, Lap K.
    Abstract:
    Many systematic methods exist for mapping algorithms to processor arrays. The algorithm is usually specified as a set of recurrence equations, and the processor arrays are synthesized by finding timing and allocation functions which transform index points in the recurrences into points in a space-time domain. The problem of scheduling...
    Resource Type:
    Masters Thesis
    Full Text:
    f of Example 1 42 Figure 4 Partitioned domain for f of Example 5 42 Figure 5 DG for Example 6 43

  • Efficient, secure and covert channel capacity bounded protocols for multilevel security cross-domain environments - an experimental system

    Creator:
    Nandakumar Thampi, Archana
    Abstract:
    The communication in MLS cross-domain environments faces many challenges. The three most important challenges are efficient key management, privacy preserving and covert channel. We propose an Efficient, Secure and Covert Channel Capacity Bounded Protocol which has three algorithms that addresses these challenges: The Efficient Attribute-based Fine-Grained Authentication (EAFA) algorithm, Anonymous...
    Resource Type:
    Masters Thesis
    Full Text:
    of the ESC3B protocol and measured the performance and efficiency of the system. c©Copyright by

  • Adiabatic Markov Decision Process : convergence of value iteration algorithm

    Creator:
    Duong, Thai
    Abstract:
    Markov Decision Process (MDP) is a well-known framework for devising the optimal decision making strategies under uncertainty. Typically, the decision maker assumes a stationary environment which is characterized by a time-invariant transition probability matrix. However, in many real-world scenarios, this assumption is not justified, thus the optimal strategy might not...
    Resource Type:
    Masters Thesis
    Full Text:
    average reward. We show two examples of queuing systems that make use of our analysis framework. c

  • Multimedia streaming using multiple TCP connections

    Creator:
    Tullimalli, Sunand
    Abstract:
    Packet loss, delay and time-varying bandwidth are three main problems facing multimedia streaming applications over the Internet. Existing techniques such as Media-aware network protocol, network adaptive source and channel coding, etc. have been proposed to either overcome or alleviate these drawbacks of the Internet. But these techniques either need specialized...
    Resource Type:
    Masters Thesis
    Full Text:
    approach. c©Copyright by Sunand Tullimalli September 6, 2006 All Rights Reserved Multimedia