Title:  Effects of Thermoregulation on Human Sleep Patterns: A Mathematical Model of Sleep–Wake Cycles with REM–NREM Subcircuit 

Abstract: In this paper we construct a mathematical model of human sleep–wake regulation with thermoregulation and temperature effects. Simulations of this model show features previously presented in experimental data such as elongation of duration and number of REM bouts across the night as well as the appearance of awakenings due to deviations in body temperature from thermoneutrality. This model helps to demonstrate the importance of temperature in the sleep cycle. Further modifications of the model to include more temperature effects on other aspects of sleep regulation such as sleep and REM latency are discussed.

Title: Epidemiological models examining two susceptible classes

Abstract: Be it the Ebola or Buruli ulcers, we are constantly informed about infectious diseases and the ramifications. We can combat infectious diseases using mathematics to gain insight into diseases dynamics and outbreaks. We will explore using two susceptible classes in epidemiological models. I concentrate on a model for Buruli Ulcers and briefly discuss two other disease models.

Buruli Ulcers is a debilitating disease induced by Mycobacterium ulcerans. The transmission mechanism is not known at this time, but the bacteria is known to live in natural water environments. To understand the role of human contact with water environments in the spread of this disease, we formulate a model to emphasize the interaction between humans and the pathogen in a water environment. Therefore, we included two susceptible classes with one having more exposure to the water environment than the other in our system of differential equations. This work gives insight into the importance of various components of the mechanisms for transmission dynamics.

Title: The Potential Role of Subclinical Infection in Outbreaks of Emerging Pathogens

Abstract: Many rare or emerging diseases exhibit different epidemioligical behaviors from

Title: Ubiquitous Doubling Algorithms, General Theory, and Applications

Abstract: Iterative methods are widely and indispensably used in numerical approximations. Basically, any iterative method is a rule that produces a sequence of approximations and with a reasonable expectation that newer approximations in the sequence are better. The goal of a doubling algorithm is to significantly speed up the approximation process by seeking ways to skip computing most of the approximations in the sequence but sporadically few, in fact, extremely very few: only the $2^i$-th approximations in the sequence, kind of like computing $\alpha^{2^i}$ via repeatedly squaring. However, this idea is only worthwhile if there is a much cheaper way to directly obtain the $2^i$-th approximation from the $2^{i-1}$-st one  than simply following the rule to generate every approximation between the $2^{i-1}$-st and $2^i$-th approximations in order to obtain the $2^i$-th approximation. Anderson (1978) had sought the idea to speed up the simple fixed point iteration for solving the discrete-time algebraic Riccati equation via repeatedly compositions of the fixed point iterative function. As can be imagined, under repeatedly compositions, even a simple function can usually and quickly turn into nonetheless a complicated and unworkable one. In the last 20 years or so in large part due to an extremely elegant way of formulation and analysis, the research in doubling algorithms thrived and continues to be very active, leading to numerical effective and robust algorithms not only for the continuous-time and discrete-time algebraic Riccati equations from optimal control that motivated the research  in the first place but also for $M$-matrix algebraic Riccati equations (MARE), structured eigenvalue problems, and other nonlinear matrix equations. But the resulting theory is somewhat fragmented and sometimes ad hoc. In this talk, we will seek to provide a general and coherent theory, discuss new highly accurate doubling algorithm for MARE, and look at several important applications.

Title:  Orthogonal Recurrent Neural Networks with Scaled Cayley Transform

Abstract: Recurrent Neural Networks (RNNs) are designed to handle sequential data but suffer from vanishing or exploding gradients.  Recent work on Unitary Recurrent Neural Networks (uRNNs) have been used to address this issue and in some cases, exceed the capabilities of Long Short-Term Memory networks (LSTMs).  We propose a simpler and novel update scheme to maintain orthogonal recurrent weight matrices without using complex valued matrices. This is done by parametrizing with a skew-symmetric matrix using the Cayley transform. Such a parametrization is unable to represent matrices with negative one eigenvalues, but this limitation is overcome by scaling the recurrent weight matrix by a diagonal matrix consisting of ones and negative ones.  The proposed training scheme involves a straightforward gradient calculation and update step. In several experiments, the proposed scaled Cayley orthogonal recurrent neural network (scoRNN) achieves superior results with fewer trainable parameters than other unitary RNNs.

Title: Dynamic Programming in Secondary Structure Inference

Abstract: Given an RNA sequence, secondary structure inference is the problem of predicting that sequence's base pairs. A variety of methods for this problem exist; among the most popular are minimum free energy (MFE) methods, which assign each possible secondary structure an energy based on the presence or absence of various substructures, with negative energy structures being more likely to occur naturally. These methods then use dynamic programming to predict the lowest free energy structure(s) efficiently. We will give an introduction to dynamic programming, talk about why it is necessary for approaching this problem efficiently, and discuss some of the shortcomings of the method. If time permits, we will also talk about connections to machine learning methods for secondary structure prediction.

Title: Spatial Dynamics of Vector Borne Diseases

Abstract: Vector-borne diseases affects approximately 1 billion people and accounts for 17% of all infectious diseases. With travel becoming more frequent across the global, it is important to understand the spatial dynamics of vector-borne diseases. Host movement plays a key part on how a disease can be distributed as it enables a pathogen to invade a new environment, and helps the persistence of a disease in locations that would otherwise be isolated. In this talk, we will explore how spatial heterogeneity combines with mobility network structure to influence vector-borne disease dynamics

Title: Model-dependent and model-independent control of biological network models

Abstract: Network models of intracellular signaling and regulation are ubiquitous in systems biology research because of their ability to integrate the current knowledge of a biological process and test new findings and hypotheses. An often asked question is how to control a network model and drive it towards its dynamical attractors (which have been found to be identifiable with phenotypes or stable patterns of activity of the modeled system), and which nodes and interventions are required to do so. In this talk, we will introduce two recently developed network control methods -feedback vertex set control and stable motif control- that use the graph structure of a network model to identify nodes that drive the system towards an attractor of interest (i.e., nodes sufficient for attractor control). Feedback vertex set control makes predictions that apply to all network models with a given graph structure and stable motif control makes predictions for a specific model instance, and this allows us to compare the results of model-independent and model-dependent network control. We illustrate these methods with various examples and discuss the aspects of each method that makes its predictions dependent or independent of the model.

See abstract in this link, http://www.ms.uky.edu/~dmu228/AppliedMathSeminar.html