Search Constraints

Start Over
Filtering by: Creator Angima, S. D. Remove constraint Creator: Angima, S. D. Committee Member Bose, Bella Remove constraint Committee Member: Bose, Bella

Search Results

  • Development and Implementation of JetNet : A Decentralized Wireless Sensing Protocol

    Creator:
    Goins, Justin B.
    Abstract:
    Modern sensor network applications are often implemented wirelessly in order to lessen installation costs and reduce deployment times. Unfortunately, these wireless sensor network (WSN) nodes must often rely on batteries or energy harvesting techniques in order to sustain their operation and supply the power needed to maintain communication within the...
    Resource Type:
    Dissertation
    Full Text:
    : Kartikeya Mayaram Terri S. Fiez Modern sensor network applications are often implemented wirelessly in

  • Information theoretic approach to quantization and classification for signal processing, communications, and machine learning applications

    Creator:
    Thuan Nguyen D.
    Abstract:
    There are five main contributions of this dissertation. The first contribution is new closed-form expressions for channel capacity of a new class of channel matrices. The second contribution is the discovery of the structure for optimal binary quantizer and the associated methods for finding an optimal quantizer that maximizes mutual...
    Resource Type:
    Dissertation
    Full Text:
    impurity using (a) N = 10; (b) N = 20; (c) N = 30; (d) N = 40. Our approximation (R(emax)) are the red

  • Learning hierarchical decomposition rules for planning : an inductive logic programming approach

    Creator:
    Reddy, Chandrasekhara K.
    Abstract:
    Artificial Intelligence (AI) planning techniques have been central to automating a gamut of tasks from the mundane route planning and beer production to the ethereal image processing of space-ship images. Of all the planning techniques, hierarchical- decomposition planning has been the technique most employed in industrial-strength planners. Hierarchical-decomposition planning is...
    Resource Type:
    Dissertation
    Full Text:
    have its own d-rule(s). For example, the subgoal clear(?x) for the goal on(?x, ?y) has the d- rule

  • The dynamic speculation and performance prediction of parallel loops

    Creator:
    Zier, David A.
    Abstract:
    General purpose computer systems have seen increased performance potential through the parallel processing capabilities of multicore processors. Yet this potential performance can only be attained through parallel applications, thus forcing software developers to rethink how everyday applications are designed. The most readily form of Thread Level Parallelism (TLP) within any...
    Resource Type:
    Dissertation
    Full Text:
    Type Data To S uc ce ss or PE From PE Core Routing Logic (a) (b) (d) (c) Figure 2.2: Block

  • 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:
    lemma(S ∪ V +, T ∪ V − , {v}). As long as v is in V +, there must be a dart d which carries flow to v

  • Efficient decoder design for error correction codes

    Creator:
    He, Jinjin
    Abstract:
    Error correction codes (ECCs) have been widely used in communication systems and storage devices. Nowadays, the rapid development of integrated circuit technologies makes feasible the implementation of powerful ECCs such as turbo code and low-density parity-check (LDPC) code. However, these high-performance codes require complex decoding algorithms, resulting in large hardware...
    Resource Type:
    Dissertation
    Full Text:
    0 s kr 2 apr 2 apr 1 ex 1 exx 2 ex 2 ex 1 apr 1 ap 2 apo 2 ap1 apo 1 ap d̂ 1p kr 2pkr

  • Offloading of I/O transactions in current CPU architectures

    Creator:
    Larsen, Steen K.
    Abstract:
    IO transactions within a computer system have evolved along with other system components (i.e., CPU, memory, video) from programmed IO (PIO). In current mainstream systems (spanning from HPC to mobile) the IO transactions are CPU-centric descriptor-based DMA transactions. The key benefit is that slower IO devices can DMA write system...
    Resource Type:
    Dissertation
    Full Text:
    core(s) to context-switch to other tasks. However, CPU-controlled descriptor-based DMA has a number

  • Security protocols for linear network coding

    Creator:
    Adeli, Majid
    Abstract:
    Network coding, as the next generation of data routing protocols, enables each intermediate node in a network to process and encode its received data before forwarding it to the next nodes. Hence, the core idea in network coding is to allow a network to encode the data that is being...
    Resource Type:
    Dissertation
    Full Text:
    these protocols. The two remaining protocols (D and F) constituting the third group are in fact two

  • ASIC for real time data authentication

    Creator:
    Anjum, Vaseem
    Abstract:
    Authentication is a means of developing an electronic signature that works like a written signature. It assumes that your data is publicly known but nevertheless ensures that the message is not tampered with and that you have an audit trail. This project discusses the techniques and concepts used to design...
    Resource Type:
    Capstone Project
    Full Text:
    \ ___ -·4- -l -- ·d·;~:i-d_c_r _ _ ' ◄ I_ f us t frn1 clod: proc e s so r reset fsm • I -4

  • 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:
    mapping from the set of state S to A where s is the current state: d : S → A. Let D be the set of all