Oliver Thistlethwaite

 OliverJ. Thistlethwaite

Oliver J. Thistlethwaite

  • Courses4
  • Reviews5

Biography

San Bernardino Valley College - Mathematics


Resume

  • 2015

    My personal website.

    Thistlethwaite

    Oliver

    San Bernardino Valley College

    RDC

    University of Tennessee

    University of California

    University of Tennessee

    University of Minnesota-Twin Cities

    Chaffey College

    Rancho Cucamonga

    Served as an instructor for Pre-algebra and Preparation for the Study of Algebra.

    Adjunct Mathematics Professor

    Chaffey College

    King of Prussia

    PA

    Data Scientist 3

    RDC

    Riverside

    CA

    Served as an instructor for Intro to College Math for Science and the preparation course for the\ntopology PhD qualifying exam.\n\nHad experience as a teaching assistant for: Intro to College Math

    First Year Calculus I-III

    Liberal Arts Math

    Intro to Ordinary Differential Equations

    Intro to College Math for Science I-II

    Calculus of Several Variables I-II

    Calculus for Business

    and Undergraduate Topology.

    Teaching Assistant

    University of California

    King of Prussia PA

    Data Scientist

    RDC

    Greater Minneapolis-St. Paul Area

    Was one of seven people admitted to a highly selective program at the Institute for Mathematics\nand its Applications designed to prepare recent postdoctoral mathematicians for careers in data\nscience. Completed a project from Corning Inc which involved model building in R and Python\nwith the goal of predicting glass liquidus temperature. Also contributed towards a project from a\nconsulting firm whose purpose was to study government data on marijuana usage.

    IMA Data Science Fellow

    University of Minnesota-Twin Cities

    Taught Elementary Algebra

    .Intermediate Algebra

    and Arithmetic.

    San Bernardino Valley College

    University of Tennessee

    Knoxville

    Tennessee

    Had experience as an instructor for Calculus 1 and Calculus 3. Also led recitation sections for Calculus 2 and Calculus 3.

    Mathematics Lecturer

    Knoxville

    Tennessee

    Developed C++ and Mathematica code to analyze large data sets

    which may be useful in solving the P / NP problem in computer science. Also wrote C++ code to perform matrix computations on very large sparse matrices.

    Graduate Student Researcher

    University of Tennessee

    English

    Yueh-er

    Hong-tsu and Clarence Cheng Kuo Fellowship Endowment

    Award given to the top two master’s students in mathematics.

    University of Tennessee

    Knoxville

    Deans Distinguished Fellowship

    Award given to outstanding first and second year graduate students.

    University of California

    Riverside

    Programming Competitions

    256th out of 5280 participants in World CodeSprint 6\n92nd out of 3218 participants in BlackRock CodeSprint\n117th out of 2985 participants in Moody’s Analytics Hackathon\n112th out of 1931 participants in Stryker CodeSprint

    HackerRank

    OpenBracket Top Finalist

    Was a top finalist out of thousands of participants and won an all expense paid trip to compete in the championship in Wilmington

    Delaware.

    OpenBracket Programming Competition

    OpenBracket Top Finalist

    Was a top finalist out of thousands of participants and competed in the single-elimination championship tournament in Wilmington

    Delaware. Made it to the semi-final round and placed in the top 25.

    OpenBracket Programming Competition

  • 2008

    Doctor of Philosophy (PhD)

    Mathematics

    University of California

    Riverside

  • 2005

    Master of Science (MS)

    Mathematics

    University of Tennessee-Knoxville

    Bachelor of Science (BS)

    Mathematics and Computer Science

    Phi Eta Sigma Honor Society

    National Honor Society of Collegiate Scholars

    University of Tennessee-Knoxville

    Numerical Analysis

    Complex Analysis

    Probability and Statistics

    Real Analysis

    Linear Algebra

    Network Programming

    Theory of Computation

    Differential Geometry

    Combinatorics

    Knot Theory

    Hyperbolic Geometry

    Algebraic Geometry

    Systems Programming

    Algebraic Topology

    Computer Organization

    Data Structures

    Abstract Algebra

    GUI Programming

    Lie Algebras

    Software Engineering

    The Data Scientist’s Toolbox

    U46HFJDSMBEC

    Coursera Course Certificates

    HTML

    CSS and JavaScript

    VA7B92DZME7P

    Coursera Course Certificates

    R Programming

    9KSA7E655GZZ

    Coursera Course Certificates

    Ruby on Rails: An Introduction

    S6SDDV2ESGZC

    Coursera Course Certificates

    Introduction to Data Science in Python

    MZF7MLSEBNEM

    Coursera Course Certificates

    Applied Machine Learning in Python

    97YEFNTMVHT4

    Coursera Course Certificates

    Front-End Web UI Frameworks and Tools

    AX2VB8WTBSYN

    Coursera Course Certificates

    Applied Plotting

    Charting & Data Representation in Python

    SX7YY7DQZMJP

    Coursera Course Certificates

    Neural Networks and Deep Learning

    JRL4VJFS9KYE

    Coursera Course Certificates

    Cryptography I (with distinction)

    Coursera Course Certificates

    Applied Text Mining in Python

    8DVRCH9ZRFCL

    Coursera Course Certificates

  • Volunteered at a local middle school tutoring students to prepare them for the regional AMC mathematics competition.

    American Mathematics Competition

    Advisor for the UCR Math Undergraduate Research Project on Computer Vision

    Computer vision can be described simply as using algorithms to extract information from pictures. Our goal this quarter will be to extract many pictures from a short video

    and answer questions about the video. Is it a continuous shot? How many light sources are there? Are there distinct moving objects? These are just some of the many questions we could ask about a video. Answering these questions calls upon a wide set of tools from linear algebra to the fourier transform.\n\nOur project involved using the fundamental tools of image analysis to construct algorithms to work towards answering the above questions.

    University of California

    Riverside

    Machine Learning

    Python

    C#

    Data Science

    R

    SQL

    Statistics

    Mathematics

    JavaScript

    Spark

    Research

    Web Development

    Ruby

    Data Analysis

    Java

    Mathematics Education

    C

    Tensor Flow

    Programming

    C++

    Boolean formulae

    hypergraphs and combinatorial topology

    With a view toward studying the homotopy type of spaces of Boolean formulae

    we introduce a simplicial complex

    called the theta complex

    associated to any hypergraph

    which is the Alexander dual of the more well-known independence complex. In particular

    the set of satisfiable formulae in k-conjunctive normal form with less than or equal to n variables has the homotopy type of Theta(Cube(n

    n-k))

    where Cube(n

    n-k) is a hypergraph associated to the (n-k)-skeleton of an n-cube. We make partial progress in calculating the homotopy type of theta for these cubical hypergraphs

    and we also give calculations and examples for other hypergraphs as well. Indeed studying the theta complex of hypergraphs is an interesting problem in its own right.

    Boolean formulae

    hypergraphs and combinatorial topology

    Since their introduction in 1994

    the Seiberg-Witten invariants have become one of the main tools used in 4-manifold theory. In this thesis

    we will use these invariants to identify sufficient conditions for a 3-manifold to fibre over a circle. Additionally

    we will construct several examples of genus 1 and 2 surface bundles and prove their total spaces are spin 4-manifolds.

    Seiberg-Witten invariants

    Alexander polynomials

    and fibred classes

    It is the purpose of this thesis to introduce an idea for studying questions of computer science via topology. We begin by describing the homology of a certain space constructed from a given subset of the power set of any finite set. We then discuss how this relates to the k-SAT problem in computer science. We shall use computers as a tool to calculate the homology groups as well as the Euler characteristic of some of these spaces. Due to the sheer number of calculations needed

    doing the necessary computations by hand is both impractical and impossible.\nIn addition

    with inspiration from these results

    we will provide several rigorous mathematical proofs detailing certain properties of the spaces produced by some input sets.

    A study of the homology of spaces generated by subsets and the connection to the k-sat problem in computer science

    This website is a collection of Data Science projects.

    Github

    Contains samples of my programming.