Hi, I'm Ruby, a Graduate Student in Applied Math at the University of Arizona.
Algorithm run time as the number of inspectors increase for developing ticket-inspector schedules that maximize the number of tickets inspected on Deutsche-Bahn trains in Germany. Conjectured to be NP-Hard.
Tracking spread of infections between a survey of contacts
Numerical Simulation of a Hamiltonian System with a double well potential
This one looks like a black hole
Example of generated separable data
Convergence of algorithm to plane of best separation as a function of the distance between classes.