Search Constraints

Start Over
Filtering by: Creator Cullen, J. J. Remove constraint Creator: Cullen, J. J. Committee Member Bose, Bella Remove constraint Committee Member: Bose, Bella Rights Statement Copyright Not Evaluated Remove constraint Rights Statement: Copyright Not Evaluated

Search Results

  • Detecting piecewise linear approximate fibrations

    Creator:
    Nam, Kiwon
    Resource Type:
    Dissertation

  • A pipelined baseband digital predistortion architecture for RF amplifier linearization

    Creator:
    Xu, Xiangqing
    Abstract:
    This thesis describes the design of a baseband digital predistortion architecture for radio frequency (RF) amplifier linearization. Existing amplifier linearization techniques are first examined. The nonlinearity of an amplifier can be characterized as amplitude-to-amplitude distortion and amplitude-to-phase distortion. The distortion can be corrected by providing a predistorted driver signal (both...
    Resource Type:
    Masters Thesis

  • 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:
    . [EXAMPLE 1] Consider the SARE: f(i, j) = h(i, i) for i = j f(i, j) = f(i, j 1) for i < j (1.2) 3 f(i

  • Parallel simplex algorithms and loop spreading

    Creator:
    Wu, Youfeng
    Abstract:
    Parallel solutions for two classes of linear programs are presented. First we parallelized the two-phase revised simplex algorithm and showed that it is possible to get linear improvement in performance. The simplex algorithm is the best known algorithm for solving linear programs, and we claim our result is the best...
    Resource Type:
    Dissertation
    Full Text:
    = 1, set phase = 2, q = m+ 1. For j = 1, ... , n, calculate Sj = uq * ai. step 2. Calculate Sk = min

  • LacEDAemon : a programming environment for the multiparadigm language leda

    Creator:
    Pandey, Rajeev K.
    Abstract:
    Multiparadigm programming languages are a recent development in the realm of programming languages. A multiparadigm programming language allows the use of multiple, differing programming paradigms without departing from a single, unified linguistic framework. Multiparadigm programming languages are claimed to have benefits to both pedagogy and complex application creation. The beneficial...
    Resource Type:
    Dissertation

  • Task partitioning and scheduling on arbitrary parallel processing systems

    Creator:
    El-Rewini, Hesham
    Abstract:
    Parallel programming is the major stumbling block preventing the parallel processing industry from quickly satisfying the demand for parallel computer software. This research is aimed at solving some of the problems of software development for parallel computers. ELGDF is a graphical language for designing parallel programs. The goal of ELGDF...
    Resource Type:
    Dissertation
    Full Text:
    fan of size n is composed of a start node S, n parallel nodes Pi, i = [1..n], 2n control arcs aj, j

  • Cluster partitioning approaches to parallel Monte Carlo simulation on multiprocessors

    Creator:
    Ranawake, Udaya A.
    Abstract:
    We consider the parallelization of Monte Carlo algorithms for analyzing numerical models of charge transport used in semiconductor device physics. Parallel algorithms for the standard k-space Monte Carlo simulation of a three band model of bulk GaAs on hypercube multicomputers are first presented. This Monte Carlo model includes scattering due...
    Resource Type:
    Dissertation
    Full Text:
    research. I would also like to thank professors J. H. Herzog, B. Bose, and E. Wolff for their suggestions

  • A study of model-based average reward reinforcement learning

    Creator:
    Ok, DoKyeong
    Abstract:
    Reinforcement Learning (RL) is the study of learning agents that improve their performance from rewards and punishments. Most reinforcement learning methods optimize the discounted total reward received by an agent, while, in many domains, the natural criterion is to optimize the average reward per time step. In this thesis, we...
    Resource Type:
    Dissertation
    Full Text:
    an action u in a given state i E S results in state j with a fixed probability pi,j(u). The

  • AOPS : an abstraction oriented programming system for literate programming

    Creator:
    Shum, Stephen M.
    Abstract:
    The practice of literate programming is not widespread because existing literate programming systems have some undesirable characteristics such as programming language and text processor dependence and lack of flexible tools for viewing and manipulation of the source file. This dissertation describes the literate programming system AOPS (Abstraction Oriented Programming System)...
    Resource Type:
    Dissertation
    Full Text:
    as shown in Figure 1. An 'x' in row i and column j in Figure 1 means literate programming system j

  • Electra : integrating constraints, condition-based dispatching, and features exclusion into the multiparadigm language Leda

    Creator:
    Zamel, Nabil M.
    Abstract:
    Multiparadigm languages are languages that are designed to support more than one style of programming. Leda is a strongly-typed multiparadigm programming language that supports imperative, functional, object-oriented, and logic programming. The constraint programming paradigm is a declarative style of programming where the programmer is able to state relationships among some...
    Resource Type:
    Dissertation