Warning: Undefined variable $title in /home/watzekdi/collaborativeresearch.lclark.edu/wp-content/themes/goodwork/functions.php on line 669
Warning: Undefined variable $subtitle in /home/watzekdi/collaborativeresearch.lclark.edu/wp-content/themes/goodwork/functions.php on line 669
Hitting Times for Generalized Ehrenfest Urn Models
...
Read moreMathematics of relativistic point particles
...
Read moreBoundary Value Problems via Finite Difference Approximations
Can one prove existence and uniqueness of solutions to boundary value problems using elementary methods?
Read moreGeometric Flows of Polygons
We study polygon flows, in which the vertices of a polygon move according to a differential equation.
Read moreAn Application of Markov chain: Card shuffling and measuring the randomness of a deck
We investigate the card shuffling problem from a simulation-based approach. We first create a randomness measure for gauging how well-shuffled a deck is. Several hundred thousand random decks are generated to simulate the distribution of the randomness measures of well-shuffled decks. Then we examine the number of shuffles a certain shuffling scheme would take to reach the mean of this simulated distribution.
Read moreModeling sensory hair cells
We explore mathematical methods used in modeling sensory hair cell bundles.
Read moreParallel computing with higher-level languages and compelling examples
Jens Mache was born in Karlsruhe, Germany. As an undergraduate student, he studied computer science at the University of Karlsruhe (Vordiplom in 1992). After ...
Read moreOrego: Artificial Intelligence and the Game of Go
Go (Weiqi), the oldest strategy game in the world, was invented in China thousands of years ago. Its rules are simpler than those of Chess, but its strategies more subtle and profound. Top human Go players, unlike Chess players, can still easily defeat the most powerful computers. The space of possible board configurations is unfathomably vast, many orders of magnitude larger than the number of electrons in the universe. We suspect that human Go strength depends on the ability to decompose the game into local subproblems that are largely, but not quite, independent.
Read more