Mathematics Commons^™

Noise, Delays, And Resonance In A Neural Network, Austin Quan

HMC Senior Theses

A stochastic-delay differential equation (SDDE) model of a small neural network with recurrent inhibition is presented and analyzed. The model exhibits unexpected transient behavior: oscillations that occur at the boundary of the basins of attraction when the system is bistable. These are known as delay-induced transitory oscillations (DITOs). This behavior is analyzed in the context of stochastic resonance, an unintuitive, though widely researched phenomenon in physical bistable systems where noise can play in constructive role in strengthening an input signal. A method for modeling the dynamics using a probabilistic three-state model is proposed, and supported with numerical evidence. The potential …

Sharp Feature Identification In A Polygon, Joseph P. Scanlan

UNLV Theses, Dissertations, Professional Papers, and Capstones

This thesis presents an efficient algorithm for recognizing and extracting sharp-features from polygonal shapes. As used here, a sharp-feature is a distinct portion of a polygon that is long and skinny. The algorithm executes in O(n^2) time, where n is the number of vertices in the polygon. Experimental results from a Java implementation of the algorithm are also presented.

Continuous Blooming Of Convex Polyhedra, Erik D. Demaine, Martin L. Demaine, Vi Hart, Joan Iacono, Stefan Langerman, Joseph O'Rourke

Computer Science: Faculty Publications

We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. Second, any unfolding of a convex polyhedron can be refined (further cut, by a linear number of cuts) to have a continuous blooming.

Circle The Cat: Developing Intelligent Strategies For A Simple Two-Player Game, Kirk Baly, Micheal Lay, Owen Prough

Symposium on Research and Creative Expression (SORCE)

Circle the Cat is an adaptation of the classic mathematical puzzle Qudraphage in which a cat attempts to escape a hexagonal board, but after each move one hexagon is blocked. We have coded a simulation of this classic puzzle. The result of our development allows for the implementation of varying strategies to computationally examine their effectiveness. The code itself, though extensive, is open enough for additions/extensions to be added fairly easily. Analysis of simpler strategies has allowed for improvement of both Cat and Player AI systems. We are currently looking at implementing more advanced systems, perhaps turning to machine learning.

Lazy Golfing, Didar Ashkerbekov, Max Hougas

Symposium on Research and Creative Expression (SORCE)

Walking golfers are expected to leave their golf bags just outside the edge of the green while they are putting the ball. We construct a simple model of this situation, in which the green is assumed to be a circle with the hole at the center and the golfer one-putts the ball. (He or she is a great golfer!) We construct a function to determine the distance that the golfer walks from his or her approach shot on the green and then to the next tee box. Given this model, we determine the optimal location for leaving the golf bag …

Applications Of Hidden Markov Models In Microarray Gene Expression Data, Huimin Geng, Xutao Deng, Hesham Ali

Computer Science Faculty Publications

Hidden Markov models (HMMs) are well developed statistical models to capture hidden information from observable sequential symbols. They were first used in speech recognition in 1970s and have been successfully applied to the analysis of biological sequences since late 1980s as in finding protein secondary structure, CpG islands and families of related DNA or protein sequences [1]. In a HMM, the system being modeled is assumed to be a Markov process with unknown parameters, and the challenge is to determine the hidden parameters from the observable parameters. In this chapter, we described two applications using HMMs to predict gene functions …

Prospective K-8 Teachers’ Knowledge Of Relational Thinking, Marta Magiera, Leigh A. Van Den Kieboom, John Moyer

Mathematics, Statistics and Computer Science Faculty Research and Publications

The goal of this study was to examine two issues: First, pre-service teachers’ ability and inclination to think relationally prior to instruction about the role relational thinking plays in the K-8 mathematics curriculum. Second, to examine task specific variables possibly associated with pre-service teachers’ inclination to engage in relational thinking. The results revealed that preservice teachers engage in relational thinking about equality, however, their inclination to do so is rather limited. Furthermore, they tend to engage in relational thinking more frequently in the context of arithmetic than algebra-related tasks. Pre-service teachers’ inclination to engage in relational thinking appeared to also …

Characterization Of The Threshold For Nad(P)H:Quinone Oxidoreductase Activity In Intact Sulforaphane-Treated Pulmonary Arterial Endothelial Cells, Robert D. Bongard, Gary S. Krenz, Adam J. Gastonguay, Carol L. Williams, Brian J. Lindemer, Marilyn P. Merker

Mathematics, Statistics and Computer Science Faculty Research and Publications

Treatment of bovine pulmonary arterial endothelial cells in culture with the phase II enzyme inducer sulforaphane (5 μM, 24 h; sulf-treated) increased cell-lysate NAD(P)H:quinone oxidoreductase (NQO1) activity by 5.7 ± 0.6 (mean ± SEM)-fold, but intact-cell NQO1 activity by only 2.8 ± 0.1-fold compared to control cells. To evaluate the hypothesis that the threshold for sulforaphane-induced intact-cell NQO1 activity reflects a limitation in the capacity to supply NADPH at a sufficient rate to drive all the induced NQO1 to its maximum activity, total KOH-extractable pyridine nucleotides were measured in cells treated with duroquinone to stimulate maximal NQO1 activity. NQO1 activation …

Signal And Noise In Complex-Valued Sense Mr Image Reconstruction, Daniel B. Rowe, Iain P. Bruce

Mathematics, Statistics and Computer Science Faculty Research and Publications

In fMRI, brain images are not measured instantaneously and a volume of images can take two seconds to acquire at a low 64x64 resolution. Significant effort has been put forth on many fronts to decrease image acquisition time including parallel imaging. In parallel imaging, sub-sampled spatial frequency points are measured in parallel and combined to form a single image. Measurement time is decreased at the expense of increased image reconstruction difficulty and time. One significant parallel imaging technique known as SENSE utilizes a complex-valued regression coefficient estimation process with transposes replaced by conjugate transposes. However, in SENSE the noise structure …

Semidistributive Inverse Semigroups, Ii, Kyeong Hee Cheong, Peter R. Jones

Mathematics, Statistics and Computer Science Faculty Research and Publications

The description by Johnston-Thom and the second author of the inverse semigroups S for which the lattice LJ(S) of full inverse subsemigroups of S is join semidistributive is used to describe those for which (a) the lattice L(S) of all inverse subsemigroups or (b) the lattice lo(S) of convex inverse subsemigroups have that property. In contrast with the methods used by the authors to investigate lower semimodularity, the methods are based on decompositions via G_S, the union of the subgroups of the semigroup (which is necessarily cryptic).

Characterizing The Arc, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

We offer a mathematical logic framework for talking about when a given topological space is characterizable relative to a “class of its peers.” The framework involves a relational alphabet for which there is a natural way of assigning relational structures to spaces in the peer class; and a putative characterization of the given space consists of a set of first-order sentences over that alphabet, all true for the space. The attempted characterization is a success if any peer space satisfying all the sentences is inevitably homeomorphic to the given space.

For example, it has long been known that the arc …

Common Hypercyclic Vectors For The Conjugate Class Of A Hypercyclic Operator, Kit C. Chan, Rebecca Sanders

Mathematics, Statistics and Computer Science Faculty Research and Publications

Given a separable, infinite dimensional Hilbert space, it was recently shown by the authors that there is a path of chaotic operators, which is dense in the operator algebra with the strong operator topology, and along which every operator has the exact same dense G_δ set of hypercyclic vectors. In the present work, we show that the conjugate set of any hypercyclic operator on a separable, infinite dimensional Banach space always contains a path of operators which is dense with the strong operator topology, and yet the set of common hypercyclic vectors for the entire path is a dense …

Conical Existence Of Closed Curves On Convex Polyhedra, Joseph O'Rourke, Costin Vîlcu

Computer Science: Faculty Publications

Let C be a simple, closed, directed curve on the surface of a convex polyhedron P. We identify several classes of curves C that "live on a cone," in the sense that C and a neighborhood to one side may be isometrically embedded on the surface of a cone Lambda, with the apex a of Lambda enclosed inside (the image of) C; we also prove that each point of C is "visible to" a. In particular, we obtain that these curves have non-self-intersecting developments in the plane. Moreover, the curves we identify that live on cones to both sides support …

The (1,2)-Step Competition Graph Of A Tournament, Kim A. S. Factor, Sarah Merz

Mathematics, Statistics and Computer Science Faculty Research and Publications

The competition graph of a digraph, introduced by Cohen in 1968, has been extensively studied. More recently, in 2000, Cho, Kim, and Nam defined the m-step competition graph. In this paper, we offer another generalization of the competition graph. We define the (1,2)-step competition graph of a digraph D, denoted C_1,2(D), as the graph on V(D) where {x,y}∈E(C_1,2(D)) if and only if there exists a vertex z≠x,y, such that either d_D−y( …

Convex Polyhedra Realizing Given Face Areas, Joseph O'Rourke

Computer Science: Faculty Publications

Given n ≥ 4 positive real numbers, we prove in this note that they are the face areas of a convex polyhedron if and only if the largest number is not more than the sum of the others.

Extending A Mips Simulator For Fpga Support, Pete Sanderson

Mathematics Faculty Scholarship

This project enriches computer organization education by providing another avenue for execution of MIPS code. The initial and existing avenue is the MARS simulator for MIPS code, a well-established open source product for educational environments, in use at universities and colleges worldwide (http://www.cs.missouristate.edu/MARS). The new avenue is a special adaptation of MIPS circuitry on a Field Programmable Gate Array (FPGA) platform. FPGAs such as the Altera DE2 are very attractive in an educational environment because of their flexibility, re-use, and low cost. The FPGA MIPS circuit includes VGA graphical output for real-time display of the MIPS machine state, including registers, …

Minimax And Maximin Fitting Of Geometric Objects To Sets Of Points, Yan B. Mayster

Electronic Theses and Dissertations

This thesis addresses several problems in the facility location sub-area of computational geometry. Let S be a set of n points in the plane. We derive algorithms for approximating S by a step function curve of size k < n, i.e., by an x-monotone orthogonal polyline ℜ with k < n horizontal segments. We use the vertical distance to measure the quality of the approximation, i.e., the maximum distance from a point in S to the horizontal segment directly above or below it. We consider two types of problems: min-ε, where the goal is to minimize the error for a …

Flipping The Winner Of A Poset Game, Adam O. Kalinich '12

Student Publications & Research

Partially-ordered set games, also called poset games, are a class of two-player combinatorial games. The playing field consists of a set of elements, some of which are greater than other elements. Two players take turns removing an element and all elements greater than it, and whoever takes the last element wins. Examples of poset games include Nim and Chomp. We investigate the complexity of computing which player of a poset game has a winning strategy. We give an inductive procedure that modifies poset games to change the nim-value which informally captures the winning strategies in the game. For a generic …

Connecting Mathematics Students To Philosophy And Faith, Nathan Moyer

ACMS Journal 2010-2011

This paper describes an upper-division class project that helps students wrestle with the deep philosophical questions of mathematics in a relevant way. Through article readings and group discussions, various historical views of mathematical philosophy are examined and critiqued. An emphasis is placed upon students making meaningful connections between their own views of mathematics and their personal Christian faith or worldview.

Vascular Countercurrent Network For 3d Triple-Layered Skin Structure With Radiation Heating, Xiaoqi Zeng

Doctoral Dissertations

Heat transfer in living tissue has become more and more attention for researchers, because high thermal radiation produced by intense fire, such as wild fires, chemical fires, accidents, warfare, terrorism, etc, is often encountered in human's daily life. Living tissue is a heterogeneous organ consisting of cellular tissue and blood vessels, and heat transfer in cellular tissue and blood vessel is quite different, because the blood vessels provide channels for fast heat transfer. The metabolic heat generation, heat conduction and blood perfusion in soft tissue, convection and perfusion of the arterial-venous blood through the capillary, and interaction with the environment …

Generic Trace Logics, Christian Kissig, Alexander Kurz

Engineering Faculty Articles and Research

We combine previous work on coalgebraic logic with the coalgebraic traces semantics of Hasuo, Jacobs, and Sokolova.

From Isotropic To Anisotropic Side Chain Representations: Comparison Of Three Models For Residue Contact Estimation, Weitao Sun, Jing He

Computer Science Faculty Publications

The criterion to determine residue contact is a fundamental problem in deriving knowledge-based mean-force potential energy calculations for protein structures. A frequently used criterion is to require the side chain center-to-center distance or the C-alpha-to-C-alpha atom distance to be within a pre-determined cutoff distance. However, the spatially anisotropic nature of the side chain determines that it is challenging to identify the contact pairs. This study compares three side chain contact models: the Atom Distance criteria (ADC) model, the Isotropic Sphere Side chain (ISS) model and the Anisotropic Ellipsoid Side chain (AES) model using 424 high resolution protein structures in the …

On The First-Order Expressibility Of Lattice Properties To Unicoherence In Continua, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

Many properties of compacta have “textbook” definitions which are phrased in lattice-theoretic terms that, ostensibly, apply only to the full closed-set lattice of a space. We provide a simple criterion for identifying such definitions that may be paraphrased in terms that apply to all lattice bases of the space, thereby making model-theoretic tools available to study the defined properties. In this note we are primarily interested in properties of continua related to unicoherence; i.e., properties that speak to the existence of “holes” in a continuum and in certain of its subcontinua.

Detecting Temporal Patterns Using Reconstructed Phase Space And Support Vector Machine In The Dynamic Data System, Wenjing Zhang, Xin Feng

Mathematics, Statistics and Computer Science Faculty Research and Publications

In this paper we present a method for detecting dynamic temporal patterns that are characteristic and predictive of significant events in a dynamic data system. We employ the Gaussian Mixture Model (GMM) to cluster the data sequence into three categories of signals, e.g. normal, patterns and events. The data sequence is then embedded into a Reconstructed Phase Space (RPS) which is topologically equivalent to the dynamics of the original system. We apply a hybrid method using Support Vector Machines (SVM) and Maximum a Posterior (MAP) to classify temporal pattern signals based on the event function. We performed two experimental applications …

Impact Of Curriculum Reform: Evidence Of Change In Classroom Instruction In The United States, John Moyer, Jinfa Cai, Ning Wang, Bikai Nie

Mathematics, Statistics and Computer Science Faculty Research and Publications

The purpose of the study reported in this article is to examine the impact of curriculum on instruction. Over a three-year period, we observed 579 algebra-related lessons in grades 6–8. Approximately half the lessons were taught in schools that had adopted a Standards-based mathematics curriculum called the Connected Mathematics Program (CMP), and the remainder of the lessons were taught in schools that used more traditional curricula (non-CMP). We found many significant differences between the CMP and non-CMP lessons. The CMP lessons, emphasized the conceptual aspects of instruction to a greater extent than the non-CMP lessons and the non-CMP lessons …

On The Distributions Of Certain Spacings, Gholamhossein Hamedani, Hans Volkmer

Mathematics, Statistics and Computer Science Faculty Research and Publications

A characterization of the uniform distribution based on distributions of spacings is presented which extends the existing result in this direction. Also, a result on the distribution of spacings for distributions close to the uniform one is discussed.

[Introduction To] Basic Statistical Tools For Improving Quality, Paul Kvam, Chang W. Kang

Bookshelf

This book is an introductory book on improving the quality of a process or a system, primarily through the technique of statistical process control (SPC). There are numerous technical manuals available for SPC, but this book differs in two ways: (1) the basic tools of SPC are introduced in a no-nonsense, simple, non-math manner, and (2) the methods can be learned and practiced in an uncomplicated fashion using free software (eZ SPC 2.0), which is available to all readers online as a downloadable product. The book explains QC7 Tools, control charts, and statistical analysis including basic design of experiments. Theoretical …

Determining A Patient Recovery From A Total Knee Replacement Using Fuzzy Logic And Active Databases, Robert Azarbod

All Graduate Theses, Dissertations, and Other Capstone Projects

The purpose of the knowledge-based system is to predict the rehabilitation timeline of a patient in physical therapy for a total knee replacement. All patients have various attributes that contribute to their rehabilitation rate such as: weight, gender, smoking habit, medications, physical ability, or other medical problems. A combination of any one or several of these attributes will affect the recovery process. The proposed FRTP (Fuzzy Rehabilitation Timeline Predictor) is a fuzzy data mining model that can predict the recovery length of a patient in physical therapy for a total knee replacement and provide feedback to experts for revision of …

A Characterization Of Connected (1,2)-Domination Graphs Of Tournaments, Kim A. S. Factor, Larry J. Langley

Mathematics, Statistics and Computer Science Faculty Research and Publications

Recently. Hedetniemi et aI. introduced (1,2)-domination in graphs, and the authors extended that concept to (1, 2)-domination graphs of digraphs. Given vertices x and y in a digraph D, x and y form a (1,2)-dominating pair if and only if for every other vertex z in D, z is one step away from x or y and at most two steps away from the other. The (1,2)-dominating graph of D, dom_1,2 (D), is defined to be the graph G = (V, E ) , where V (G) = V (D), and xy is …

Relation Liftings On Preorders And Posets, Marta Bílková, Alexander Kurz, Daniela Petrişan, Jiří Velebil

Engineering Faculty Articles and Research

The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleisli category for the powerset monad. A set-functor can be lifted to a functor on Rel(Set) iff it preserves weak pullbacks. We show that these results extend to the enriched setting, if we replace sets by posets or preorders. Preservation of weak pullbacks becomes preservation of exact lax squares. As an application we present Moss’s coalgebraic over posets.