Search Constraints

Start Over
Filtering by: Degree Field Mathematics (Computer Science) Remove constraint Degree Field: Mathematics (Computer Science)

Search Results

  • The logical design of the NEBULA computer

    Creator:
    Boles, John Amos
    Abstract:
    Research in digital computers takes two paths: one uses the computer as a tool to reach certain objectives; on the other, the computer itself is the object of research. The NEBULA computer was built with the latter in mind. The system design and logical design are described here in detail....
    Resource Type:
    Dissertation

  • Relation extraction with automatic ontonotes annotation and ETC

    Creator:
    Sauer, Andrew
    Abstract:
    Intuitively, it seems as though natural language processing tasks might benefit from explicit representations of the syntactic and semantic properties of text. Ontonotes is a dataset which attempts to annotate texts, to represent as much as possible of the meaning of the text explicitly within the annotation. Many tools exist...
    Resource Type:
    Honors College Thesis
    Full Text:
    partial fulfillment of the requirements for the degree of Honors Baccalaureate of Science in Computer

  • Finite Element and Finite Difference Methods for Maxwell’s Equations in Metamaterials

    Creator:
    Stallcup, Isaac A.
    Abstract:
    In this thesis, we consider Maxwell's Equations and their numerical discretization using finite difference and finite element methods. We first describe Maxwell's equations in linear dielectrics and then present finite difference and finite element methods for this case. We then describe Maxwell's equations in linear metamaterials using the Lorentz and...
    Resource Type:
    Honors College Thesis
    Full Text:
    Mathematics (Honors Scholar) Honors Baccalaureate of Science in Computer Science (Honors Scholar) Presented

  • Robotic path-planning through dynamic maps

    Creator:
    Bowie, Cameron Scott
    Abstract:
    Robotic global navigation is often based on the assumption that the world is static. It assumes that obstacles present in maps will be there later and new obstacles will be dealt with by a local planning algorithm. When robots interact in an environment inhabited by people, this assumption does not...
    Resource Type:
    Honors College Thesis
    Full Text:
    fulfillment of the requirements for the degree of Honors Baccalaureate of Science in Computer Science

  • Revenue-based spectrum management via Markov decision process

    Creator:
    Zhu, Pingan
    Abstract:
    We consider the problem of wireless spectrum management in cognitive wireless networks that maximizes the revenue for a spectrum operator. Specifically, we study the problem on how a wireless spectrum operator can optimally allocate its limited spectrum to various classes users/devices who pay differently for their spectrum per unit time....
    Resource Type:
    Masters Thesis
    Full Text:
    September 23, 2013. APPROVED: Co-Major Professor, representing Computer Science Co-Major Professor

  • Factorization of Integers

    Creator:
    Simshaw, James
    Abstract:
    Factorization of integers is an important aspect of cryptography since it can be used as an attack against some of the common cryptographic methods being used. There are numerous methods in existence for factoring integers. Some of these are faster than others for general numbers, while others work best on...
    Resource Type:
    Honors College Thesis
    Full Text:
    Computer Science presented on May 30, 2008. Title: Factorization of Integers. Abstract Approved