Computer Sciences Commons^™

Vine Copulas As A Way To Describe And Analyze Multi-Variate Dependence In Econometrics: Computational Motivation And Comparison With Bayesian Networks And Fuzzy Approaches, Songsak Sriboonchitta, Jianxu Liu, Vladik Kreinovich, Hung T. Nguyen

Departmental Technical Reports (CS)

In the last decade, vine copulas emerged as a new efficient techniques for describing and analyzing multi-variate dependence in econometrics. Our experience has shown, however, that while these techniques have been successfully applied to many practical problems of econometrics, there is still a lot of confusion and misunderstanding related to vine copulas. In this paper, we provide a motivation for this new technique from the computational viewpoint. We show that other techniques used to described dependence -- Bayesian networks and fuzzy techniques -- can be viewed as a particular case of vine copulas.

How To Distinguish True Dependence From Varying Independence?, Marketa Krmelova, Martin Trnecka, Vladik Kreinovich, Berlin Wu

Departmental Technical Reports (CS)

A usual statistical criterion for the quantities X and Y to be independent is that the corresponding distribution function F(x,y) is equal to the product of the corresponding marginal distribution functions. If this equality is violated, this is usually taken to mean that X and Y are dependent. In practice, however, the inequality may be caused by the fact that we have a mixture of several populations, in each of which X and Y are independent. In this paper, we show how we can distinguish true dependence from such varying independence. This can also lead to new measures to degree …

Why Trapezoidal And Triangular Membership Functions Work So Well: Towards A Theoretical Explanation, Aditi Barua, Lalitha Snigdha Mudunuri, Olga Kosheleva

Departmental Technical Reports (CS)

In fuzzy logic, an imprecise ("fuzzy") property is described by its membership function μ(x), i.e., by a function which describes, for each real number x, to what degree this real number satisfies the desired property. In principle, membership functions can be of different shape, but in practice, trapezoidal and triangular membership functions are most frequently used. In this paper, we provide an interval-based theoretical explanation for this empirical fact.

Scitech Book News Reviews, Susan Fingerman

Sci-Tech News

No abstract provided.

On Fuzzy Soft Matrix Based On Reference Function, Florentin Smarandache, Said Broumi, Mamoni Dhar

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper we study fuzzy soft matrix based on reference function. Firstly, we define some new operations such as fuzzy soft complement matrix and trace of fuzzy soft matrix based on reference function. Then, we introduced some related properties, and some examples are given. Lastly, we define a new fuzzy soft matrix decision method based on reference function.

Characterizations Of Distributions Of Ratio Of Certain Independent Random Variables, Gholamhossein Hamedani

Mathematics, Statistics and Computer Science Faculty Research and Publications

Various characterizations of the distributions of the ratio of two independent gamma and exponential random variables as well as that of two independent Weibull random variables are presented. These characterizations are based, on a simple relationship between two truncated moments ; on hazard function ; and on functions of order statistics.

On Generalized Gamma Convolution Distributions, Gholamhossein Hamedani

Mathematics, Statistics and Computer Science Faculty Research and Publications

We present here characterizations of certain families of generalized gamma convolution distributions of L. Bondesson based on a simple relationship between two truncated moments. We also present a list of well-known random variables whose distributions or the distributions of certain functions of them belong to the class of generalized gamma convolutions.

The Pitman Inequality For Exchangeable Random Vectors, J. Behboodian, Naveen K. Bansal, Gholamhossein Hamedani, Hans Volkmer

Mathematics, Statistics and Computer Science Faculty Research and Publications

In this short article the following inequality called the “Pitman inequality” is proved for the exchangeable random vector (X₁,X₂,…,X_n) without the assumption of continuity and symmetry for each component X_i:

P(|1n∑i=1nXi|≤|∑i=1nαiXi|)≥12 ,

where all αi≥0 are special weights with ∑i=1nαi=1.

Extremal H-Colorings Of Graphs With Fixed Minimum Degree, John Engbers

Mathematics, Statistics and Computer Science Faculty Research and Publications

For graphs G and H, a homomorphism from G to H, or H-coloring of G, is a map from the vertices of G to the vertices of H that preserves adjacency. When H is composed of an edge with one looped endvertex, an H-coloring of G corresponds to an independent set in G. Galvin showed that, for sufficiently large n, the complete bipartite graph K_δ,n-δ is the n-vertex graph with minimum degree δ that has the largest number of independent sets.

In this paper, we begin the project of generalizing this …

Signal Space Cosamp For Sparse Recovery With Redundant Dictionaries, Mark A. Davenport, Deanna Needell, Michael B. Wakin

CMC Faculty Publications and Research

Compressive sensing (CS) has recently emerged as a powerful framework for acquiring sparse signals. The bulk of the CS literature has focused on the case where the acquired signal has a sparse or compressible representation in an orthonormal basis. In practice, however, there are many signals that cannot be sparsely represented or approximated using an orthonormal basis, but that do have sparse representations in a redundant dictionary. Standard results in CS can sometimes be extended to handle this case provided that the dictionary is sufficiently incoherent or well conditioned, but these approaches fail to address the case of a truly …

Minimization Of Average Sensitivity As A Method Of Selecting Fuzzy Functions And Operations: Successes And Limitations, Riya George, Suresh Subramanian, Alejandro Vega, Olga Kosheleva

Departmental Technical Reports (CS)

Fuzzy logic is an extension of the standard 2-valued logic -- with two possible truth values 0 ("false") and ("true") -- to values (degrees of certainty) represented by arbitrary numbers from the interval [0,1]. One of the main challenges in fuzzy logic is that we need to extend the usual logical operations from the set {0,1} to the entire interval, and there are many possible extensions. One promising technique for selecting a reasonable extension is to take into account that the fuzzy degrees of certainty are themselves only known with uncertainty; so, it makes sense to select an operation which …

Toward An Mhealth Intervention For Smoking Cessation, Golam Mushih Tanimul Ahsan, Ivor D. Addo, Sheikh Iqbal Ahamed, Daniel Petereit, Shalini Kanekar, Linda Burhansstipanov, Linda U. Krebs

Mathematics, Statistics and Computer Science Faculty Research and Publications

The prevalence of tobacco dependence in the United States (US) remains alarming. Invariably, smoke-related health problems are the leading preventable causes of death in the US. Research has shown that a culturally tailored cessation counseling program can help reduce smoking and other tobacco usage. In this paper, we present a mobile health (mHealth) solution that leverages the Short Message Service (SMS) or text messaging feature of mobile devices to motivate behavior change among tobacco users. Our approach implements the Theory of Planned Behavior (TPB) and a phase-based framework. We make contributions to improving previous mHealth intervention approaches by delivering personalized …

√(X2 + Μ) Is The Most Computationally Efficient Smooth Approximation To |X|: A Proof, Carlos Ramirez, Reinaldo Sanchez, Vladik Kreinovich, Miguel Argaez

Departmental Technical Reports (CS)

In many practical situations, we need to minimize an expression of the type |c₁| + ... + |c_n|. The problem is that most efficient optimization techniques use the derivative of the objective function, but the function |x| is not differentiable at 0. To make optimization efficient, it is therefore reasonable to approximate |x| by a smooth function. We show that in some reasonable sense, the most computationally efficient smooth approximation to |x| is the function √(x² + μ), a function which has indeed been successfully used in such optimization.

Insights On The Neyman - Pearson Lemma: Alternative Critical Regions, And Their Power., David E. Wetzell

ACMS Conference Proceedings 2013

The Neyman-Pearson Lemma is a powerful fundamental lemma in the area of hypothesis testing in Statistics. It gives the best test when testing simple vs. simple hypotheses. In this talk we would like to investigate testing a population mean H0 μ = μ0 vs. H1 μ = μ1 > μ0. As a result of the N-P Lemma, the best test is of the form, “Reject H0 if x>c” , where c is chosen so that the Type I error probability is a. Let n be small. What are some alternative decision rules of size a, what …

Service-Learning Panel, Dave Klanderman, Josh Wilkerson, Maria Zack

ACMS Conference Proceedings 2013

Many of us have wanted to incorporate service experiences in courses, or are being asked by our institutions to do so. Service-learning is a way of looking at service as being a partner with and leading to learning for our students. But in math, there are not a lot of resources to use! Our panelists will present classroom-tested ideas from several different levels of course, and we will end with a short time for more brainstorming among all participants.

Pedagogical Enhancements To The Desymbol Logic Translator, Darren F. Provine, Nancy Lynn Tinkham

ACMS Conference Proceedings 2013

DeSymbol is a program that translates first-order predicate logic expressions into English. It is intended to be a practice tool for students who are learning logic for the first time or who are trying to refresh their memories if they need to use symbolic logic for an upper-level course. Students start with an English sentence and translate it by hand into symbolic logic notation; then they can check their work by using DeSymbol to translate their notation back into English. If the English sentence produced by DeSymbol differs significantly from the original English sentence, this helps the student to see …

Mapping Biblical Commandments To An Iterated Prisoner’S Dilemma Framework, Nathan Gossett, Adam Johnson

ACMS Conference Proceedings 2013

In his writings on Game Theory, an d the Iterated Prisoner’s Dilemma in particular, Robert Axelrod outlined four properties that are predictors of a successful strategy: Niceness, Reciprocity, Forgiveness, and Understandability. On the topic of Reciprocity, Axelrod makes the claim that not only does The Golden Rule lead to a suboptimal strategy, but that one of the most successful strategies (Tit for Tat) shows that a command of “An eye for an eye” leads to a much more optimal strategy. In this paper, we will discuss the details of Axelrod’s four properties, outline Biblical support for all four, and discuss …

Open Source Software: What Is It, And Why Should We Care?, Karl-Dieter Crisman

ACMS Conference Proceedings 2013

This paper examines the distinctions in talking about computer software that has implications for both mathematics and moral thought.

Teaching Complex Analysis As A Lab-Type Course With A Focus On Geometric Interpretations Using Mathematics, William M. Kinney

ACMS Conference Proceedings 2013

I taught complex analysis for the first time in my career during the spring of 2013. I decided to do something “radical” and teach it as a lab-type course with a focus on geometric interpretations using the computer program Mathematica. The students and I met in a computer lab and, during most meetings, we spent a large portion of our time experimenting and exploring using Mathematica to visualize key concepts in complex analysis. Because of this, there was a heavy emphasis on viewing analytic functions as conformal mappings as well as considering associated vector fields and flows. Mathematica was used …

Faith Integration Projects For First-Year Students, Doug Phillippy

ACMS Conference Proceedings 2013

This talk will consider the use of projects to motivate students to think deeply about how their faith connects with mathematics. This talk will begin by describing what a faith integration project is, including the goals and objectives of such a project. The talk will briefly describe a number of projects written by the speaker, with a more detailed look at one of those projects. The talk will conclude by discussing how these projects are being used to assess how students are doing at articulating a maturing understanding of the connection between faith and mathematics

Philosophy Motivates Undergraduates In Mathematics, Dustin Wilson

ACMS Conference Proceedings 2013

A talk on how elective seminars on the philosophy of mathematics can inspire undergraduate students to pursue and persist in mathematics.

Forming The Analytical Society At Cambridge University, Richard Stout

ACMS Conference Proceedings 2013

The Analytical Society, an organization begun by students at Cambridge, was founded in 1812. Even though it was entirely student-led, the society was responsible for significant changes in the Cambridge mathematics curriculum and in the way mathematics was perceived in Britain throughout the nineteenth century. Its success was likely due to the outstanding students who formed the group, some of whom went on to become leaders in British science and mathematics for the next fifty years. In this paper we will briefly look at several of those who played important roles in forming and leading the society and we will …

The Unity Of Knowledge And The Faithfulness Of God: The Theology Of Mathematical Physicist John Polkinghorne, Matt Delong

ACMS Conference Proceedings 2013

In this paper we will give a brief introduction to Polkinghorne's life and work. We will give an introduction to Polkinghorne's approach to philosophy and theology. We will introduce the two most significant influences on Polkinghorne's development as a theologian and philosopher of science. We will then give a necessarily telegraphic review of some of the topics addressed in Polkinghorne's theology, including his thoughts on science and religion, natural theology, evil, providence, prayer, resurrection, the soul and eschatology. We will then conclude with a few short examples of Polkinghorne's thoughts on mathematics.

Leading A Successful Missions Trip In Your Discipline, Tom Nurkkala, Darci Nurkkala

ACMS Conference Proceedings 2013

The global missions community goes wanting for skilled workers in almost every discipline. However, even students at a Christian institution that emphasizes global engagement remain largely unaware of the impact they can make in missions by leveraging their own academic specialty. In this paper, we draw on our experience leading discipline-specific missions trips as a means to encourage students to reframe their thinking about personal involvement in missions. We discuss the need for students to experience missions firsthand, and the student outcomes we have observed in intercultural awareness and spiritual formation. A key student outcome is an increased willingness to …

Googol-Part Fugue: Another Imagination Of Divine Providence And Game Theory, Gideon Lee

ACMS Conference Proceedings 2013

The problem of evil presents an intellectual hurdle for some to believe in a good and omnipotent God. The emergence of open theism could be seen as an attempt to make a stronger case for the free will defense. However, in denying divine foreknowledge as traditionally understood, open theism contradicts biblical revelation not only in its direct claims, but also when its logical implications for divine providence are worked out. The open theist Alan Rhoda has sought to explain through game theory how some degree of divine providence is possible under open theism. That explanation is astonishing since the open …

Life Lessons From Leibniz, Andrew J. Simoson

ACMS Conference Proceedings 2013

The tri-centennial of Leibniz’s death is nigh (2016). And 2013 is not too early to begin a special celebration of this man of mathematics. Besides being the co-discoverer of calculus and the implementer of binary numbers, formal logic, and formal languages, all of which foreshadowed the computer age, Leibniz is said to be one of the last to know almost everything that was known about almost anything. Professionally, his occupation was librarian in the princely court of Hanover in oldGermany. Serving under three different princes, the last of whom became George I of England, Leibniz had to continual lyre-invent himself—somewhat …

Al-Khwārizmī: Founder Of Classical Algebra, Calvin Jongsma

ACMS Conference Proceedings 2013

Adopting a historically defensible definition of “algebra,” we will begin by exploring a few examples of algebra prior toal-Khwarizmi. We will then examine what algebra became through al-Khwarizmi’s work. In conclusion, we will assess thehistorical importance of al-Khwarizmi’s contributions for developments in European algebra.

Expanding Jonathan Edwards’ Typology Program: The Bell Curve As A Type Of Christ, Jason Wilson

ACMS Conference Proceedings 2013

Over two hundred years after his death, an unfinished notebook of Jonathan Edwards’ was published for the first time in1993. Edwards was a father of the Evangelical movement, but because his work on typology was not published until recently, it has received almost no attention. In his notebook, Edwards makes an explicit argument for extending biblical typology to nature in a biblically grounded manner. This study is an attempt to extend that research program into mathematics/statistics.We will consider the following proposition, “The normal distribution (the graph of which is the bell curve) is a biblical type of Christ.” The basic …

Delaware, Dickeson, Assessment And How You Can Help, Greg Crow, Maria Zack

ACMS Conference Proceedings 2013

How much release time should a chair receive? What is the cost per unit for a particular academic program? What is a student credit hour (SCH) anyway and why would anyone care? Why are so many boards enamored of Delaware, Dickeson and Assessment? The answer to these and many related questions will be presented in this talk. Analytics and various“efficiency measures” are becoming increasingly important in higher education and mathematicians and computer scientists are being regularly recruited to help university administrators make meaning from large volumes of data. Come and learn about this trend and how you can be of …

Dynamics Of The Fitzhugh-Nagumo Neuron Model, Zechariah Thurman

Physics

In this paper, the dynamical behavior of the Fitzhugh-Nagumo model is examined. The relationship between neuron input current and the firing frequency of the neuron is characterized. Various coupling schemes are also examined, and their effects on the dynamics of the system is discussed. The phenomenon of stochastic resonance is studied for a single uncoupled Fitzhugh-Nagumo neuron.