Applied Mathematics Commons^™

Neural Spike Renormalization. Part I — Universal Number 1, Bo Deng

Department of Mathematics: Faculty Publications

For a class of circuit models for neurons, it has been shown that the transmembrane electrical potentials in spike bursts have an inverse correlation with the intra-cellular energy conversion: the fewer spikes per burst the more energetic each spike is. Here we demonstrate that as the per-spike energy goes down to zero, a universal constant to the bifurcation of spike-bursts emerges in a similar way as Feigenbaum’s constant does to the period-doubling bifurcation to chaos generation, and the new universal constant is the first natural number 1.

Neural Spike Renormalization. Part Ii — Multiversal Chaos, Bo Deng

Department of Mathematics: Faculty Publications

Reported here for the first time is a chaotic infinite-dimensional system which contains infinitely many copies of every deterministic and stochastic dynamical system of all finite dimensions. The system is the renormalizing operator of spike maps that was used in a previous paper to show that the first natural number 1 is a universal constant in the generation of metastable and plastic spike-bursts of a class of circuit models of neurons.

Short-Term Facilitation May Stabilize Parametric Working Memory Trace, Vladimir Itskov, David Hansel, Misha Tsodyks

Department of Mathematics: Faculty Publications

Networks with continuous set of attractors are considered to be a paradigmatic model for parametric working memory (WM), but require fine tuning of connections and are thus structurally unstable. Here we analyzed the network with ring attractor, where connections are not perfectly tuned and the activity state therefore drifts in the absence of the stabilizing stimulus. We derive an analytical expression for the drift dynamics and conclude that the network cannot function as WM for a period of several seconds, a typical delay time in monkey memory experiments. We propose that short-term synaptic facilitation in recurrent connections significantly improves the …

Extremal Problems For Independent Set Enumeration, Jonathan Cutler, A. J. Radcliffe

Department of Mathematics: Faculty Publications

The study of the number of independent sets in a graph has a rich history. Recently, Kahn proved that disjoint unions of Kr,r’s have the maximum number of independent sets amongst r-regular bipartite graphs. Zhao extended this to all r-regular graphs. If we instead restrict the class of graphs to those on a fixed number of vertices and edges, then the Kruskal-Katona theorem implies that the graph with the maximum number of independent sets is the lex graph, where edges form an initial segment of the lexicographic ordering. In this paper, we study three related questions. Firstly, we …

An Entropy Proof Of The Kahn-Lovasz Theorem, Jonathan Cutler, A. J. Radcliffe

Department of Mathematics: Faculty Publications

Bregman [2], gave a best possible upper bound for the number of perfect matchings in a balanced bipartite graph in terms of its degree sequence. Recently Kahn and Lovasz [8] extended Bregman’s theorem to general graphs. In this paper, we use entropy methods to give a new proof of the Kahn-Lovasz theorem. Our methods build on Radhakrishnan’s [9] use of entropy to prove Bregman’s theorem.

Specification Of Structural Viewer And Analytical Tool (Jecp/Svat), Xingzhong Li

Nebraska Center for Materials and Nanoscience: Faculty Publications

Java Electron Crystallography Package (JECP) is a collection of programs for crystallography and electron diffraction analysis. The package is designed and written by Dr. X.Z. Li. The software can be used as a research tool as well as a teaching aid. The need of a structural viewer/an analytical tool, using the same input data format as the JECP and proJECT software, becomes obvious with the growth of the JECP and proJECT programs and users. There exist many programs for structural design and/or display in various levels developed by individual, research group or software company. Some of them are expensive software …

Mathematical Modeling Of Optimal Seasonal Reproductive Strategies And A Comparison Of Long-Term Viabilities Of Annuals And Perennials, Anthony Delegge

Department of Mathematics: Dissertations, Theses, and Student Research

In 1954, Lamont Cole posed a question which has motivated much ecological work in the past 50 years: When is the life history strategy of semelparity (organisms reproduce once, then die) favored, via evolution, over iteroparity (organisms may reproduce multiple times in their lifetime)? Although common sense should dictate that iteroparity would always be favored, we can observe that this is not always the case, since annual plants are not only prevalent, but can dominate an area. Also, certain plant species may be perennial in one region, but annual in another. Thus, in these areas, certain characteristics must be present …

Metastability And Plasticity In A Conceptual Model Of Neurons, Bo Deng

Department of Mathematics: Faculty Publications

For a new class of neuron models we demonstrate here that typical membrane action potentials and spike-bursts are only transient states but appear to be asymptotically stable; and yet such metastable states are plastic — being able to dynamically change from one action potential to another with different pulse frequencies and from one spike-burst to another with different spike-per-burst numbers. The pulse and spike-burst frequencies change with individual ions’ pump currents while their corresponding metastable-plastic states maintain the same transmembrane voltage and current profiles in range. It is also demonstrated that the plasticity requires two one-way ion pumps operating in …

Bass’ Nk Groups And Cd H-Fibrant Hochschild Homology, G. Cortiñas, C. Haesemeyer, Mark E. Walker, C. Weibel

Department of Mathematics: Faculty Publications

The K-theory of a polynomial ring R[t ] contains the K-theory of R as a summand. For R commutative and containing Q, we describe K∗(R[t ])/K∗(R) in terms of Hochschild homology and the cohomology of Kähler differentials for the cdh topology.

We use this to address Bass’ question, whether K_n(R) = K_n(R[t ]) implies K_n(R) = K_n(R[t₁, t₂]). The answer to this question is affirmative when R is essentially of …

From Energy Gradient And Natural Selection To Biodiversity And Stability Of Ecosystems, Bo Deng

Department of Mathematics: Faculty Publications

The purpose of this paper is to incorporate well-established ecological principles into a foodweb model consisting of four trophic levels --- abiotic resources, plants, herbivores, and carnivores. The underlining principles include Kimura's neutral theory of genetic evolution, Liebig's Law of the Minimum for plant growth, Holling's functionals for herbivore foraging and carnivore predation, the One-Life Rule for all organisms, and Lotka-Volterra's model for intraand interspecific competitions. Numerical simulations of the model led to the following statistical findings: (a) particular foodwebs can give contradicting observations on biodiversity and productivity, in particular, all known functional forms -- - positive, negative, sigmoidal, and …

Properties Of The Generalized Laplace Transform And Transport Partial Dynamic Equation On Time Scales, Chris R. Ahrendt

Department of Mathematics: Dissertations, Theses, and Student Research

In this dissertation, we first focus on the generalized Laplace transform on time scales. We prove several properties of the generalized exponential function which will allow us to explore some of the fundamental properties of the Laplace transform. We then give a description of the region in the complex plane for which the improper integral in the definition of the Laplace transform converges, and how this region is affected by the time scale in question. Conditions under which the Laplace transform of a power series can be computed term-by-term are given. We develop a formula for the Laplace transform for …

Generalized Fourier-Feynman Transforms, Convolution Products, And First Variations On Function Space, Seung Jun Chang, Jae Gil Choi, David Skough

Department of Mathematics: Faculty Publications

In this paper we examine the various relationships that exist among the first variation, the convolution product and the Fourier-Feynman transform for functionals of the form F(x) = f((α₁, x), . . . , (α_n, x)) with x in a very general function space C_a,b[0,T].

Population Coding Of Tone Stimuli In Auditory Cortex: Dynamic Rate Vector Analysis, Peter Bartho, Carina Curto, Artur Luczak, Stephan L. Marguet, Kenneth D. Harris

Department of Mathematics: Faculty Publications

Neural representations of even temporally unstructured stimuli can show complex temporal dynamics. In many systems, neuronal population codes show “progressive differentiation,” whereby population responses to different stimuli grow further apart during a stimulus presentation. Here we analyzed the response of auditory cortical populations in rats to extended tones. At onset (up to 300 ms), tone responses involved strong excitation of a large number of neurons; during sustained responses (after 500 ms) overall firing rate decreased, but most cells still showed a statistically significant difference in firing rate. Population vector trajectories evoked by different tone frequencies expanded rapidly along an initially …

A Computational Study Of The Effects Of Temperature Variation On Turtle Egg Development, Sex Determination, And Population Dynamics, Amy L. Parrott

Department of Mathematics: Dissertations, Theses, and Student Research

Climate change and its effects on ecosystems is a major concern. For certain animal species, especially those that exhibit what is known as temperature-dependent sex determination (TSD), temperature variations pose a possibly serious threat (Valenzuela and Lance, 2004). In these species, temperature, and not chromosomes, determines the sex of the animal (Valenzuela and Lance, 2004). It is conceivable therefore, that if the temperature changes to favor only one sex, then dire consequences for their populations could occur. In this dissertation, we examine possible effects that climate change may have upon Painted Turtles (Chrysemys picta), a species with TSD. We investigate …

Modeling And Analysis Of Biological Populations, Joan Lubben

Department of Mathematics: Dissertations, Theses, and Student Research

Asymptotic and transient dynamics are both important when considering the future population trajectory of a species. Asymptotic dynamics are often used to determine whether the long-term trend results in a stable, declining or increasing population and even provide possible directions for management actions. Transient dynamics are important for estimating invasion speed of non-indigenous species, population establishment after releasing biocontrol agents, or population management after a disturbance like fire. We briefly describe here the results in this thesis.

(1) We consider asymptotic dynamics using discrete time linear population models of the form n(t + 1) = An(t) where …

Nonlinear Dynamics Of Infant Sitting Postural Control, Joan E. Deffeyes

Department of Psychology: Dissertations, Theses, and Student Research

Sitting is one of the first developmental milestones that an infant achieves. Thus measurements of sitting posture present an opportunity to assess sensorimotor development at a young age, in order to identify infants who might benefit from therapeutic intervention, and to monitor the efficacy of the intervention. Sitting postural sway data was collected using a force plate from infants with typical development, and from infants with delayed development, where the delay in development was due to cerebral palsy in most of the infants in the study. The center of pressure time series from the infant sitting was subjected to a …

Conceptual Circuit Models Of Neurons, Bo Deng

Department of Mathematics: Faculty Publications

A systematic circuit approach tomodel neurons with ion pump is presented here by which the voltage-gated current channels are modeled as conductors, the diffusion-induced current channels are modeled as negative resistors, and the one-way ion pumps are modeled as one-way inductors. The newly synthesized models are different from the type of models based on Hodgkin-Huxley (HH) approach which aggregates the electro, the diffusive, and the pump channels of each ion into one conductance channel. We show that our new models not only recover many known properties of the HH type models but also exhibit some new that cannot be extracted …

Connections Between Computation Trees And Graph Covers, Deanna Dreher, Judy L. Walker

Department of Mathematics: Faculty Publications

Connections between graph cover pseudocodewords and computation tree pseudocodewords are investigated with the aim of bridging the gap between the theoretically attractive analysis of graph covers and the more intractable analysis of iterative message-passing algorithms that are intuitively linked to graph covers. Both theoretical results and numerous examples are presented.

Analysis Of Connections Between Pseudocodewords, Nathan Axvig, Deanna Dreher, Katherine Morrison, Eric T. Psota, Lance C. Pérez, Judy L. Walker

Department of Mathematics: Faculty Publications

The role of pseudocodewords in causing noncodeword outputs in linear programming (LP) decoding, graph cover decoding, and iterative message-passing decoding is investigated. The three main types of pseudocodewords in the literature — linear programming pseudocodewords, graph cover pseudocodewords, and computation tree pseudocodewords — are reviewed and connections between them are explored. Some discrepancies in the literature on minimal and irreducible pseudocodewords are highlighted and clarified, and a value for the minimal degree cover necessary to realize an LP pseudocodeword is found. Additionally, some conditions for the existence of connected realizations of graph cover pseudocodewords are given. This allows for further …

A Universal Theory Of Decoding And Pseudocodewords, Nathan Axvig, Deanna Dreher, Katherine Morrison, Eric T. Psota, Lance C. Pérez, Judy L. Walker

Department of Mathematics: Faculty Publications

The discovery of turbo codes [5] and the subsequent rediscovery of low-density parity-check (LDPC) codes [9, 18] represent a major milestone in the field of coding theory. These two classes of codes can achieve realistic bit error rates, between 10−5 and 10−12, with signalto- noise ratios that are only slightly above the minimum possible for a given channel and code rate established by Shannon’s original capacity theorems. In this sense, these codes are said to be near-capacity-achieving codes and are sometimes considered to have solved (in the engineering sense, at least) the coding problem for the additive white Gaussian noise …

Nonbinary Quantum Error-Correcting Codes From Algebraic Curves, Jon-Lark Kim, Judy L. Walker

Department of Mathematics: Faculty Publications

We give a generalized CSS construction for nonbinary quantum error-correcting codes. Using this we construct nonbinary quantum stabilizer codes from algebraic curves. We also give asymptotically good nonbinary quantum codes from a Garcia- Stichtenoth tower of function fields which are constructible in polynomial time.

Binary quantum error-correcting codes have been constructed in several ways. One interesting construction uses algebraic-geometry codes [2], [6], [7], [12], with the main idea being to apply the binary CSS construction [4], [5], [16] to the asymptotically good algebraic-geometry codes arising from the Garcia-Stichtenoth [11] tower of function fields over F_q2 (where q is a …

A Monte Carlo Power Analysis Of Traditional Repeated Measures And Hierarchical Multivariate Linear Models In Longitudinal Data Analysis, Hua Fang, Gordon P. Brooks, Maria L. Rizzo, Kimberly A. Espy, Robert S. Barcikowski

Developmental Cognitive Neuroscience Laboratory: Faculty Publications

The power properties of traditional repeated measures and hierarchical linear models have not been clearly determined in the balanced design for longitudinal studies in the current literature. A Monte Carlo power analysis of traditional repeated measures and hierarchical multivariate linear models are presented under three variance-covariance structures. Results suggest that traditional repeated measures have higher power than hierarchical linear models for main effects, but lower power for interaction effects. Significant power differences are also exhibited when power is compared across different covariance structures. Results also supplement more comprehensive empirical indexes for estimating model precision via bootstrap estimates and the approximate …

Local Cohomology And Support For Triangulated Categories, Dave Benson, Srikanth Iyengar, Henning Krause

Department of Mathematics: Faculty Publications

We propose a new method for defining a notion of support for objects in any compactly generated triangulated category admitting small coproducts. This approach is based on a construction of local cohomology functors on triangulated categories, with respect to a central ring of operators. Suitably specialized one recovers, for example, the theory for commutative noetherian rings due to Foxby and Neeman, the theory of Avramov and Buchweitz for complete intersection local rings, and varieties for representations of finite groups according to Benson, Carlson, and Rickard. We give explicit examples of objects whose triangulated support and cohomological support differ. In the …

Towards Universal Cover Decoding, Nathan Axvig, Deanna Dreher, Katherine Morrison, Eric T. Psota, Lance C. Pérez, Judy L. Walker

Department of Mathematics: Faculty Publications

Low complexity decoding of low-density paritycheck (LDPC) codes may be obtained from the application of iterative message-passing decoding algorithms to the bipartite Tanner graph of the code. Arguably, the two most important decoding algorithms for LDPC codes are the sum-product decoder and the min-sum (MS) decoder. On a bipartite graph without cycles (a tree), the sum-product decoder minimizes the probability of bit error, while the min-sum decoder minimizes the probability of word error [9]. While the behavior of sum-product and min-sum is easily understood when operating on trees, their behavior becomes much more difficult to characterize when the Tanner graph …

Ldpc Codes From Voltage Graphs, Christine A. Kelley, Judy L. Walker

Department of Mathematics: Faculty Publications

Several well-known structure-based constructions of LDPC codes, for example codes based on permutation and circulant matrices and in particular, quasi-cyclic LDPC codes, can be interpreted via algebraic voltage assignments. We explain this connection and show how this idea from topological graph theory can be used to give simple proofs of many known properties of these codes. In addition, the notion of abelianinevitable cycle is introduced and the subgraphs giving rise to these cycles are classified. We also indicate how, by using more sophisticated voltage assignments, new classes of good LDPC codes may be obtained.

Average Min-Sum Decoding Of Ldpc Codes, Nathan Axvig, Deanna Dreher, Katherine Morrison, Eric T. Psota, Lance C. Pérez, Judy L. Walker

Department of Mathematics: Faculty Publications

Simulations have shown that the outputs of minsum (MS) decoding generally behave in one of two ways: the output either eventually stabilizes at a codeword or eventually cycles through a finite set of vectors that may include both codewords and non-codewords. This inconsistency in MS across iterations has significantly contributed to the difficulty in studying the performance of this decoder. To overcome this problem, a new decoder, average min-sum (AMS), is proposed; this decoder outputs the average of the min-sum output vectors over a finite set of iterations. Simulations comparing MS, AMS, linear programming (LP) decoding, and maximum likelihood (ML) …

A Universal Theory Of Pseudocodewords, Nathan Axvig, Emily Price, Eric T. Psota, Deanna Turk, Lance C. Pérez, Judy L. Walker

Department of Mathematics: Faculty Publications

Three types of pseudocodewords for LDPC codes are found in the literature: graph cover pseudocodewords, linear programming pseudocodewords, and computation tree pseudocodewords. In this paper we first review these three notions and known connections between them. We then propose a new decoding rule — universal cover decoding — for LDPC codes. This new decoding rule also has a notion of pseudocodeword attached, and this fourth notion provides a framework in which we can better understand the other three.

Mathematical Analysis Of Pde Systems Which Govern °Uid Structure Interactive Phenomena, George Avalos, Roberto Triggiani

Department of Mathematics: Faculty Publications

In this paper, we review and comment upon recently derived results for time dependent partial differential equation (PDE) models, which have been used to describe the various fluid-structure interactions which occur in nature. For these fluid-structure PDEs, this survey is particularly focused on the authors' results of (i) semigroup wellposedness, (ii) stability, and (iii) backward uniqueness.

The Time Invariance Principle, Ecological (Non)Chaos, And A Fundamental Pitfall Of Discrete Modeling, Bo Deng

Department of Mathematics: Faculty Publications

This paper is to show that most discrete models used for population dynamics in ecology are inherently pathological that their predications cannot be independently verified by experiments because they violate a fundamental principle of physics. The result is used to tackle an on-going controversy regarding ecological chaos. Another implication of the result is that all continuous dynamical systems must be modeled by differential equations. As a result it suggests that researches based on discrete modeling must be closely scrutinized and the teaching of calculus and differential equations must be emphasized for students of biology.

The Origin Of 2 Sexes Through Optimization Of Recombination Entropy Against Time And Energy, Bo Deng

Department of Mathematics: Faculty Publications

Sexual reproduction in nature requires two sexes, which raises the question why the reproductive scheme did not evolve to have three or more sexes. Here we construct a constrained optimization model based on the communication theory to analyze trade-offs among reproductive schemes with arbitrary number of sexes. More sexes on one hand lead to higher reproductive diversity, but on the other hand incur greater cost in time and energy for reproductive success. Our model shows that the two-sexes reproduction scheme maximizes the recombination entropy-to-cost ratio, and hence is the optimal solution to the problem.