Search Constraints

Start Over
Filtering by: Creator Best, Jaclyn P. Remove constraint Creator: Best, Jaclyn P. Committee Member Bose, Bella Remove constraint Committee Member: Bose, Bella

Search Results

  • Visual SQL analyzer project report

    Creator:
    Li, Xiaoyan
    Abstract:
    Structure Query Language (SQL) is widely used to access data stored in relational database systems. Although a powerful and flexible language, SQL can also be complex and hard to learn. For most new SQL users, it's easy to write SQL statement by following SQL grammar and syntax rules, but it's...
    Resource Type:
    Capstone Project
    Full Text:
    course_name, state; ii htt p. wt>h enqr.01eqon~tnte.e du/~ loH/ - M1crosort Int ernet hcplorer provided by

  • Variable sampling compensation of networked control systems with delays using neural networks

    Creator:
    Lopez-Echevarria, Daniel
    Abstract:
    In networked control systems (NCS) information or packets usually flow from a sensor or a set of sensors to a remotely located controller. Then the controller processes the received information and sends a series of control commands to the actuators through a communication network which could be either wireless or...
    Resource Type:
    Dissertation
    Full Text:
    part on the selection of the best topology is the 5 validation of every topology created. This step

  • 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:
    ) metric on a comprehensive loop tree to select the best performing nested loop level to multithread

  • 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:
    neighborhood search and simulated annealing methods to find: 1) the best unrolling vector, and 2) a Gantt

  • Task Grapher : task graph scheduling in multiprocessor computer systems

    Creator:
    Chu, Lee-Jung Julie
    Abstract:
    This report presents a graphical tool for implementation of the scheduling heuristics provided by Kruatrachue. The input of scheduling is a task graph and the output is a schedule in the form of a Gantt chart. The implemented scheduling heuristics are: 1) Hu's HLF (highest level first) algorithm. 2) Yu's...
    Resource Type:
    Capstone Project
    Full Text:
    ). From the Gantt chart, it is clear that kruatrachue's DSH offers the best contribution of balanced

  • Target-based coverage extension of 802.11 MANETs via constrained UAV mobility

    Creator:
    Johnson, Taylor N.
    Abstract:
    MANETs are known to be useful in situations where mobile nodes need to communicate and coordinate in dynamic environments with no access to fixed network infrastructure. However, connectivity problems can occur when sub-groups within a MANET move out of communication range from one another. The increasingly prolific use of UAVs...
    Resource Type:
    Masters Thesis
    Full Text:
    selection decisions described in this section turn out to be best-suited for scenarios where the number of

  • Software composition with extended entity-relationship diagrams

    Creator:
    Muenchaisri, Pornsiri
    Abstract:
    I introduce a compositional approach to application software development. In this approach, an extended entity-relationship diagram (EERD), which represents the component types and the relationship types within an application domain, is used as a template of executable programs in that application domain. As we use structural active objects as the...
    Resource Type:
    Dissertation
    Full Text:
    and future assignments are used to activate future events. In most cases, behaviors can be best

  • 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:
    lowest cost. Upon finding the best output channels, the intermediate node simply copies the pertinent

  • Secure socket layer protocol simulation in Java

    Creator:
    Karri, Nagendra
    Abstract:
    This project aims to study the performance of Secure Sockets Layer (SSL) Protocol implemented in JAVA for web applications. Secure Sockets Layer protocol allows client/server applications to communicate in a way that is designed to prevent eavesdropping, tampering, or message forgery. In particular, this project focuses on an implementation of...
    Resource Type:
    Capstone Project

  • Reinforcement Learning for Network Routing

    Creator:
    Yalamanchi, Hema Jyothi
    Abstract:
    Efficient routing of information packets in dynamically changing communication networks requires routing policies that adapt to changes in load levels, traffic patterns and network topologies. Reinforcement Learning (RL) is an area of artificial intelligence that studies algorithms that dynamically optimize their performance based on experience in an environment. RL, thus,...
    Resource Type:
    Capstone Project
    Full Text:
    how long it will take for a packet P to reach destination d if sent through neighbor y. When a