Mathematics Commons^™

03. Biology, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

05. Chemistry, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

10. Forensic Science, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

12. Kinesiology, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

15. Pharmacy, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

18. Statistics, University Of Central Oklahoma

Oklahoma Research Day Abstracts

No abstract provided.

Bayesian Approach For Inconsistent Information, M. Stein, Michael Beer, Vladik Kreinovich

Departmental Technical Reports (CS)

In engineering situations, we usually have a large amount of prior knowledge that needs to be taken into account when processing data. Traditionally, the Bayesian approach is used to process data in the presence of prior knowledge. Sometimes, when we apply the traditional Bayesian techniques to engineering data, we get inconsistencies between the data and prior knowledge. These inconsistencies are usually caused by the fact that in the traditional approach, we assume that we know the {\it exact} sample values, that the prior distribution is {\it exactly} known, etc. In reality, the data is imprecise due to measurement errors, the …

Number Of Information And Its Relation To The Cosmological Constant Resulting From Landauer’S Principle, Ioannis Gkigkitzis, Ioannis Haranas, Samantha Kirk

Physics and Computer Science Faculty Publications

Using a recent published formula for the number of information N that results from Landauer’s principle we obtain an expression for the cosmological constant Λ . Next, assuming the universe as a system of mass M satisfying Landauer’s principle and eliminating its mass M from the given expression for the number of information, we obtain a new expression that agrees with the one derived by Lloyd. Furthermore, we modify the generalized entropy relation and three equivalent entropy expressions are obtained. Finally, in two different universes the time rate of change of the entropy is calculated. In a flat universe the …

A Gentle Introduction To Pythontex, Andrew Mertz, William Slough

Faculty Research and Creative Activity

No abstract provided.

School Choice As A One-Sided Matching Problem: Cardinal Utilities And Optimization, Sinan Aksoy, Alexander Adam Azzam, Chaya Coppersmith, Julie Glass, Gizem Karaali, Xueying Zhao, Xinjing Zhu

Pomona Faculty Publications and Research

The school choice problem concerns the design and implementation of matching mechanisms that produce school assignments for students within a given public school district. Previously considered criteria for evaluating proposed mechanisms such as stability, strategyproofness and Pareto efficiency do not always translate into desirable student assignments. In this note, we explore a class of one-sided, cardinal utility maximizing matching mechanisms focused exclusively on student preferences. We adapt a well-known combinatorial optimization technique (the Hungarian algorithm) as the kernel of this class of matching mechanisms. We find that, while such mechanisms can be adapted to meet desirable criteria not met by …

Software Development For A 3d Gravity Inversion And Application To Study Of The Border Ranges Fault System, South-Central Alaska, Rolando Cardenas

Open Access Theses & Dissertations

The Border Ranges Fault System (BRFS) bounds the Cook Inlet and Susitna Basins, and is an important petroleum province within south-central Alaska. A primary goal of our research is to test several plausible models of structure along the BRFS using a novel three-dimensional inversion technique utilizing gravity data, constrained with other geophysical, borehole and surface geological information. This research involves the development of 3D inversion modeling software using C++ Builder from Embarcadero's XE2 Suite. The novel inversion approach directly models known geology with a priori uncertainties assigned to the geologic model to allow researchers to compare alternative interpretations. This technique …

Nominal Regular Expressions For Languages Over Infinite Alphabets, Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto

Engineering Faculty Articles and Research

We propose regular expressions to abstractly model and study properties of resource-aware computations. Inspired by nominal techniques – as those popular in process calculi – we extend classical regular expressions with names (to model computational resources) and suitable operators (for allocation, deallocation, scoping of, and freshness conditions on resources). We discuss classes of such nominal regular expressions, show how such expressions have natural interpretations in terms of languages over infinite alphabets, and give Kleene theorems to characterise their formal languages in terms of nominal automata.

Relation Lifting, With An Application To The Many-Valued Cover Modality, Marta Bílková, Alexander Kurz, Daniela Petrişan, Jirí Velebil

Engineering Faculty Articles and Research

We introduce basic notions and results about relation liftings on categories enriched in a commutative quantale. We derive two necessary and sufficient conditions for a 2-functor T to admit a functorial relation lifting: one is the existence of a distributive law of T over the “powerset monad” on categories, one is the preservation by T of “exactness” of certain squares. Both characterisations are generalisations of the “classical” results known for set functors: the first characterisation generalises the existence of a distributive law over the genuine powerset monad, the second generalises preservation of weak pullbacks.

The results presented in this paper …

Group Developed Weighing Matrices, K. T. Arasu, Jeffrey R. Hollon

Mathematics and Statistics Faculty Publications

A weighing matrix is a square matrix whose entries are 1, 0 or −1, such that the matrix times its transpose is some integer multiple of the identity matrix. We examine the case where these matrices are said to be devel- oped by an abelian group. Through a combination of extending previous results and by giving explicit constructions we will answer the question of existence for 318 such matrices of order and weight both below 100. At the end, we are left with 98 open cases out of a possible 1,022. Further, some of the new results provide insight into …

Modeling State Transitions With Automata, Egor Dolzhenko

USF Tampa Graduate Theses and Dissertations

Models based on various types of automata are ubiquitous in modern science. These models allow reasoning about deep theoretical questions and provide a basis for the development of efficient algorithms to solve related computational problems. This work discusses several types of automata used in such models, including cellular automata and mandatory results automata.

The first part of this work is dedicated to cellular automata. These automata form an important class of discrete dynamical systems widely used to model physical, biological, and chemical processes. Here we discuss a way to study the dynamics of one-dimensional cellular automata through the theory of …

How Ideas Grow: Critical Mass In The Linear Threshold Model, Hossein Alidaee

Mathematics, Statistics, and Computer Science Honors Projects

We study how ideas spread through a social network using the Linear Threshold Model. Each node i on the complete graph K_n is given a threshold Ɵ_i chosen uniformly at random from (0, 1]. This threshold indicates the fraction of the social network that must be active (or believe the idea) prior to node i becoming active. We start with an activated group of early adopters, called the seed set. Considering various scenarios, we use the probabilistic method to find lower bounds on size of a seed set which guarantees that all nodes become active with high …

Nominal Computation Theory (Dagstuhl Seminar 13422), Mikołaj Bojanczyk, Bartek Klin, Alexander Kurz, Andrew M. Pitts

Engineering Faculty Articles and Research

This report documents the program and the outcomes of Dagstuhl Seminar 13422 “Nominal Computation Theory”. The underlying theme of the seminar was nominal sets (also known as sets with atoms or Fraenkel-Mostowski sets) and they role and applications in three distinct research areas: automata over infinite alphabets, program semantics using nominal sets and nominal calculi of concurrent processes.

Dynamic Sequent Calculus For The Logic Of Epistemic Actions And Knowledge, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano

Engineering Faculty Articles and Research

"Dynamic Logics (DLs) form a large family of nonclassical logics, and perhaps the one enjoying the widest range of applications. Indeed, they are designed to formalize change caused by actions of diverse nature: updates on the memory state of a computer, displacements of moving robots in an environment, measurements in models of quantum physics, belief revisions, knowledge updates, etc. In each of these areas, DL-formulas express properties of the model encoding the present state of affairs, as well as the pre- and post-conditions of a given action. Actions are semantically represented as transformations of one model into another, encoding the …

Epistemic Updates On Algebras, Alexander Kurz, Alessandra Palmigiano

Engineering Faculty Articles and Research

We develop the mathematical theory of epistemic updates with the tools of duality theory. We focus on the Logic of Epistemic Actions and Knowledge (EAK), introduced by Baltag-Moss-Solecki, without the common knowledge operator. We dually characterize the product update construction of EAK as a certain construction transforming the complex algebras associated with the given model into the complex algebra associated with the updated model. This dual characterization naturally generalizes to much wider classes of algebras, which include, but are not limited to, arbitrary BAOs and arbitrary modal expansions of Heyting algebras (HAOs). As an application of this dual characterization, we …

Nominal Coalgebraic Data Types With Applications To Lambda Calculus, Alexander Kurz, Daniela Petrişan, Paula Severi, Fer-Jan De Vries

Engineering Faculty Articles and Research

We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. We give applications to the infinitary lambda calculus.

A Convex Optimization Algorithm For Sparse Representation And Applications In Classification Problems, Reinaldo Sanchez Arias

Open Access Theses & Dissertations

In pattern recognition and machine learning, a classification problem refers to finding an algorithm for assigning a given input data into one of several categories. Many natural signals are sparse or compressible in the sense that they have short representations when expressed in a suitable basis. Motivated by the recent successful development of algorithms for sparse signal recovery, we apply the selective nature of sparse representation to perform classification. Any test sample is represented in an overcomplete dictionary with the training sample as base elements. A given test sample can be expressed as a linear combination of only those training …

Coding Theory-Based Cryptopraphy: Mceliece Cryptosystems In Sage, Christopher Roering

Honors Theses, 1963-2015

Unlike RSA encryption, McEliece cryptosystems are considered secure in the presence of quantum computers. McEliece cryptosystems leverage error-correcting codes as a mechanism for encryption. The open-source math software Sage provides a suitable environment for implementing and exploring McEliece cryptosystems for undergraduate research. Using our Sage implementation, we explored Goppa codes, McEliece cryptosystems, and Stern’s attack against a McEliece cryptosystem.

Introduction To Neutrosophic Measure, Neutrosophic Integral, And Neutrosophic Probability, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this book, we introduce for the first time the notions of neutrosophic measure and neutrosophic integral, and we develop the 1995 notion of neutrosophic probability. We present many practical examples.

It is possible to define the neutrosophic measure and consequently the neutrosophic integral and neutrosophic probability in many ways, because there are various types of indeterminacies, depending on the problem we need to solve. Neutrosophics study the indeterminacy. Indeterminacy is different from randomness. It can be caused by physical space materials and type of construction, by items involved in the space, etc.

Intensity-Based Skeletonization Of Cryoem Gray-Scale Images Using A True Segmentation-Free Algorithm, Kamal Al Nasr, Chunmei Liu, Mugizi Rwebangira, Legand Burge, Jing He

Computer Science Faculty Publications

Cryo-electron microscopy is an experimental technique that is able to produce 3D gray-scale images of protein molecules. In contrast to other experimental techniques, cryo-electron microscopy is capable of visualizing large molecular complexes such as viruses and ribosomes. At medium resolution, the positions of the atoms are not visible and the process cannot proceed. The medium-resolution images produced by cryo-electron microscopy are used to derive the atomic structure of the proteins in de novo modeling. The skeletons of the 3D gray-scale images are used to interpret important information that is helpful in de novo modeling. Unfortunately, not all features of the …

Convergence Analysis Of Markov Chain Monte Carlo Linear Solvers Using Ulam--Von Neumann Algorithm, Hao Ji, Michael Mascagni, Yaohang Li

Computer Science Faculty Publications

The convergence of Markov chain--based Monte Carlo linear solvers using the Ulam--von Neumann algorithm for a linear system of the form x = Hx + b is investigated in this paper. We analyze the convergence of the Monte Carlo solver based on the original Ulam--von Neumann algorithm under the conditions that ||H|| < 1 as well as ρ(H) < 1, where ρ(H) is the spectral radius of H. We find that although the Monte Carlo solver is based on sampling the Neumann series, the convergence of Neumann series is not a sufficient condition for the convergence of the Monte Carlo solver. Actually, properties of H are not the only factors determining the convergence of the Monte Carlo solver; the underlying transition probability matrix plays an important role. An improper selection of the transition matrix may result in divergence even though the condition ||H|| <1 holds. However, if the condition ||H|| < 1 is satisfied, we show that there always exist certain transition matrices that guarantee convergence of the Monte Carlo solver. On the other hand, if ρ(H) <1 but ||H|| ≥ 1, the Monte Carlo linear solver may or may not converge. In particular, if the row sum ∑ n/j= 1|H_ij > 1 for every row in H or, more generally, ρ(H⁺) >1, where H⁺ is the nonnegative matrix where H+_ij = |H_ij|, we show that transition matrices leading to convergence of the Monte Carlo solver do not exist. Finally, given …

Rssi Based Indoor Localization For Smartphone Using Fixed And Mobile Wireless Node, Md O. Gani, Casey O'Brien, Sheikh Iqbal Ahamed, Roger O. Smith

Mathematics, Statistics and Computer Science Faculty Research and Publications

Nowadays with the dispersion of wireless networks, smartphones and diverse related services, different localization techniques have been developed. Global Positioning System (GPS) has a high rate of accuracy for outdoor localization but the signal is not available inside of buildings. Also other existing methods for indoor localization have low accuracy. In addition, they use fixed infrastructure support. In this paper, we present a novel system for indoor localization, which also works well outside. We have developed a mathematical model for estimating location (distance and direction) of a mobile device using wireless technology. Our experimental results on Smartphones (Android and iOS) …

Ricean Over Gaussian Modelling In Magnitude Fmri Analysis—Added Complexity With Negligible Practical Benefits, Daniel W. Adrian, Ranjan Maitra, Daniel B. Rowe

Mathematics, Statistics and Computer Science Faculty Research and Publications

It is well known that Gaussian modelling of functional magnetic resonance imaging (fMRI) magnitude time-course data, which are truly Rice distributed, constitutes an approximation, especially at low signal-to-noise ratios (SNRs). Based on this fact, previous work has argued that Rice-based activation tests show superior performance over their Gaussian-based counterparts at low SNRs and should be preferred in spite of the attendant additional computational and estimation burden. Here, we revisit these past studies and, after identifying and removing their underlying limiting assumptions and approximations, provide a more comprehensive comparison. Our experimental evaluations using Receiver Operating Characteristic (ROC) curve methodology show that …

Recent Advances In Energy-Efficient Sensor Networks, Sheikh Iqbal Ahamed, Wei Wang, Jiman Hong

Mathematics, Statistics and Computer Science Faculty Research and Publications

No abstract provided.

Concept Of Sub-Independence, Gholamhossein Hamedani

Mathematics, Statistics and Computer Science Faculty Research and Publications

Limit theorems as well as other well-known results in probability and statistics are often based on the distributions of the sums of independent random variables. The concept of sub-independence, which is weaker than that of independence, is shown to be sufficient to yield the conclusions of these theorems and results. It also provides a measure of dissociation between two random variables which is stronger than uncorrelatedness.

Undergraduate And Graduate Teaching Assistants' Perceptions Of Their Responsibilities - Factors That Help Or Hinder, Alena Moon, Hyunyi Jung, Farshid Marbouti, Kelsey Joy Rodgers, Heidi A. Diefes-Dux

Mathematics, Statistics and Computer Science Faculty Research and Publications

Effective teaching assistants (TAs) are crucial for effective student learning. This is especially true in science, technology, engineering, and mathematics (STEM) programs, where TAs are enabling large programs to transition to more student-centered learning environments. To ensure that TAs are able to support these types of learning environments, their perspectives of training, their abilities, and other work related aspects must be understood. In this paper a survey that was created based on interviews conducted with eight TAs is discussed. The survey has four primary categories of content that are critical for understanding TAs' perspectives: (1) background, (2) motivation, (3) training, …