Quicklists
public 01:34:25

Paul Bendich : Job Tryout

  -   Graduate/Faculty Seminar ( 141 Views )

Another Job Audition.

public 01:34:51

Yuriy Mileyko : Hierarchical ordering of reticular networks

  -   Graduate/Faculty Seminar ( 100 Views )

Biological physical networks, especially those involved in resource delivery and distribution, often exhibit a hierarchical structure. Quantifying this structure is crucial to obtaining a better understanding of the processes underlying the network formation, and such a quantification has long been obtained using the Horton-Strahler ordering scheme. The scheme assigns an integer order to each edge in the network based on the topology of branching such that the order increases from distal parts of the network (e.g., mountain streams or capillaries) to the ``root'' of the network (e.g., the river outlet or the aorta). However, Horton-Strahler ordering cannot be applied to networks with loops because they they create a contradiction in the edge ordering in terms of which edge precedes another in the hierarchy. In this talk I will present a generalization of the Horton-Strahler order to weighted planar reticular networks, where weights are assumed to correlate with the importance of network edges, e.g., weights estimated from edge widths may correlate with flow capacity. The new method assigns hierarchical levels not only to edges of the network, but also to its loops, and classifies the edges into reticular edges, which are responsible for loop formation, and tree edges. I will show that the sensitivity of the hierarchical levels to weight perturbations can be analyzed in a rigorous way. I will also discuss applications of this generalized Horton-Strahler ordering to the study of leaf venation and other biological networks.

public 01:34:29

Harold Layton : Irregular Flow Oscillations in the Nephrons of Spontaneously Hypertensive Rats

  -   Graduate/Faculty Seminar ( 143 Views )

The nephron is the functional unit of the kidney. The flow rate in each nephron is regulated, in part, by tubuloglomerular feedback, a negative feedback loop. In some parameter regimes, this feedback system can exhibit oscillations that approximate limit-cycle oscillations. However, nephron flow in spontaneously hypertensive rats (SHR) can exhibit highly irregular oscillations similar to deterministic chaos. We used a mathematical model of tubuloglomerular feedback (TGF) to investigate potential sources of the irregular oscillations and the associated complex power spectra in SHR. A bifurcation analysis of the TGF model equation was performed by finding roots of the characteristic equation, and numerical simulations of model solutions were conducted to assist in the interpretation of the analysis. Four potential sources of spectral complexity in SHR were identified: (1) bifurcations that produce qualitative changes in solution type, leading to multiple spectrum peaks and their respective harmonic peaks; (2) continuous lability in delay parameters, leading to broadening of peaks and their harmonics; (3) episodic lability in delay parameters, leading to multiple peaks and their harmonics; and (4) coupling of small numbers of nephrons, leading to broadening of peaks, multiple peaks, and their harmonics. We conclude that the complex power spectra in SHR may be explained by the inherent complexity of TGF dynamics, which may include solution bifurcations, variation in TGF parameters, and coupling between small numbers of neighboring nephrons.

public 01:14:47

Yu Pan : TBA

  -   Graduate/Faculty Seminar ( 145 Views )

TBA

public 01:14:33

Jonathan Mattingly : TBA

  -   Graduate/Faculty Seminar ( 124 Views )

public 01:34:46

Paul Bendich : Topology and Geometry for Tracking and Sensor Fusion

  -   Graduate/Faculty Seminar ( 192 Views )

Many systems employ sensors to interpret the environment. The target-tracking task is to gather sensor data from the environment and then to partition these data into tracks that are produced by the same target. The goal of sensor fusion is to gather data from a heterogeneous collection of sensors (e.g, audio and video) and fuse them together in a way that enriches the performance of the sensor network at some task of interest. This talk summarizes two recent efforts that incorporate mildly sophisticated mathematics into the general sensor arena, and also comments on the joys and pitfalls of trying to apply math for customers who care much more about the results than the math. First, a key problem in tracking is to 'connect the dots:' more precisely, to take a piece of sensor data at a given time and associate it with a previously-existing track (or to declare that this is a new object). We use topological data analysis (TDA) to form data-association likelihood scores, and integrate these scores into a well-respected algorithm called Multiple Hypothesis Tracking. Tests on simulated data show that the TDA adds significant value over baseline, especially in the context of noisy sensor data. Second, we propose a very general and entirely unsupervised sensor fusion pipeline that uses recent techniques from diffusion geometry and wavelet theory to compress and then fuse time series of arbitrary dimension arising from disparate sensor modalities. The goal of the pipeline is to differentiate classes of time-ordered behavior sequences, and we demonstrate its performance on a well-studied digit sequence database. This talk represents joint work with many people. including Chris Tralie, Nathan Borggren, Sang Chin, Jesse Clarke, Jonathan deSena, John Harer, Jay Hineman, Elizabeth Munch, Andrew Newman, Alex Pieloch, David Porter, David Rouse, Nate Strawn, Adam Watkins, Michael Williams, Lihan Yao, and Peter Zulch.

public 01:34:52

Sarah Schott : tba

  -   Graduate/Faculty Seminar ( 121 Views )

public 01:14:48

Pam Miao Gu : Factorization tests and algorithms arising from counting modular forms and automorphic representations

  -   Graduate/Faculty Seminar ( 188 Views )

A theorem of Gekeler compares the number of non-isomorphic automorphic representations associated with the space of cusp forms of weight $k$ on~$\Gamma_0(N)$ to a simpler function of $k$ and~$N$, showing that the two are equal whenever $N$ is squarefree. We prove the converse of this theorem (with one small exception), thus providing a characterization of squarefree integers. We also establish a similar characterization of prime numbers in terms of the number of Hecke newforms of weight $k$ on~$\Gamma_0(N)$. It follows that a hypothetical fast algorithm for computing the number of such automorphic representations for even a single weight $k$ would yield a fast test for whether $N$ is squarefree. We also show how to obtain bounds on the possible square divisors of a number $N$ that has been found to not be squarefree via this test, and we show how to probabilistically obtain the complete factorization of the squarefull part of $N$ from the number of such automorphic representations for two different weights. If in addition we have the number of such Hecke newforms for even a single weight $k$, then we show how to probabilistically factor $N$ entirely. All of these computations could be performed quickly in practice, given the number(s) of automorphic representations and modular forms as input. (Joint work with Greg Martin.)