How To Distinguish True Dependence From Varying Independence?,
2013
Palacky University
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,
2013
The University of Texas at El Paso
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,
2013
American Public University System
Field Control Of The Surface Electroclinic Effect In Liquid Crystal Displays,
2013
California Polytechnic State University - San Luis Obispo
Field Control Of The Surface Electroclinic Effect In Liquid Crystal Displays, Dana Hipolite
Physics
Liquid crystals (LCs) are a fascinating class of materials exhibiting a range of phases intermediate between liquid and crystalline. Smectic LCs consist of elongated molecules arranged in a periodic stack (along z) of liquid like layers. In the smectic-A (Sm-A) phase, the average molecular long axis (director) points along z. In the smectic-C (Sm-C) phase, it is tilted relative to z, thus picking out a special direction within the layers. Typically, the Sm-A* to Sm- C* transition will occur as temperature is decreased. In chiral smectics (Sm-*A or Sm-C*) it is possible to induce director titling (i.e. the Sm-C* phase) …
Invited Expert On Qr – Responder For Qr Focus,
2013
Georgia Southern University
Invited Expert On Qr – Responder For Qr Focus, Robert L. Mayes
Teaching & Learning: Faculty Presentations (2012-2017)
No abstract provided.
Methods Of Nonparametric Multivariate Ranking And Selection,
2013
Syracuse University
Methods Of Nonparametric Multivariate Ranking And Selection, Jeremy Entner
Mathematics - Dissertations
In a Ranking and Selection problem, a collection of k populations is given which follow some (partially) unknown probability distributions. The problem is to select the "best" of the k populations where "best" is well defined in terms of some unknown population parameter. In many univariate parametric and nonparamentric settings, solutions to these ranking and selection problems exist. In the multivariate case, only parametric solutions have been developed. We have developed several methods for solving nonparametric multivariate ranking and selection problems. The problems considered allow an experimenter to select the "best" populations based on nonparametric notions of dispersion, location, and …
Results On Containments And Resurgences, With A Focus On Ideals Of Points In The Plane,
2013
University of Nebraska-Lincoln
Results On Containments And Resurgences, With A Focus On Ideals Of Points In The Plane, Annika Denkert
Department of Mathematics: Dissertations, Theses, and Student Research
Let K be an algebraically closed field and I ⊆ R=K[PN] a nontrivial homogeneous ideal. We can describe ordinary powers Ir and symbolic powers I(m) of I. One question that has been of interest over the past couple of years is that of when we have containment of I(m) in Ir. Bocci and Harbourne defined the resurgence of I as rho(I)=supm,r{m/r | I(m) is not contained in Ir}. Hence in particular I(m) ⊆ Ir whenever m/r is at least …
On Fuzzy Soft Matrix Based On Reference Function,
2013
University of New Mexico
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.
Closure And Homological Properties Of (Auto)Stackable Groups,
2013
University of Nebraska-Lincoln
Closure And Homological Properties Of (Auto)Stackable Groups, Ashley Johnson
Department of Mathematics: Dissertations, Theses, and Student Research
Let G be a finitely presented group with Cayley graph Γ. Roughly, G is a stackable group if there is a maximal tree T in Γ and a function φ, defined on the edges in Γ, for which there is a natural ‘flow’ on the edges in Γ\T towards the identity. Additionally, if graph (φ), which consists of pairs (e; φ(e)) for e an edge in Γ, forms a regular language, then G is autostackable. In 2011, Brittenham and Hermiller introduced stackable groups in [4], in part, as a means …
Decompositions Of Betti Diagrams,
2013
University of Nebraska-Lincoln
Decompositions Of Betti Diagrams, Courtney Gibbons
Department of Mathematics: Dissertations, Theses, and Student Research
In this dissertation, we are concerned with decompositions of Betti diagrams over standard graded rings and the information about that ring and its modules that can be recovered from these decompositions. In Chapter 2, we study the structure of modules over short Gorenstein graded rings and determine a necessary condition for a matrix of nonnegative integers to be the Betti diagram of such a module. We also describe the cone of Betti diagrams over the ring k[x,y]/(x2,y2), and we provide an algorithm for decomposing Betti diagrams, even for modules of infinite projective dimension. Chapter 3 …
Geometric Study Of The Category Of Matrix Factorizations,
2013
University of Nebraska-Lincoln
Geometric Study Of The Category Of Matrix Factorizations, Xuan Yu
Department of Mathematics: Dissertations, Theses, and Student Research
We study the geometry of matrix factorizations in this dissertation.
It contains two parts. The first one is a Chern-Weil style
construction for the Chern character of matrix factorizations; this
allows us to reproduce the Chern character in an explicit,
understandable way. Some basic properties of the Chern character are
also proved (via this construction) such as functoriality and that
it determines a ring homomorphism from the Grothendieck group of
matrix factorizations to its Hochschild homology. The second part is
a reconstruction theorem of hypersurface singularities. This is
given by applying a slightly modified version of Balmer's tensor
triangular geometry …
Development And Application Of Difference And Fractional Calculus On Discrete Time Scales,
2013
University of Nebraska-Lincoln
Development And Application Of Difference And Fractional Calculus On Discrete Time Scales, Tanner J. Auch
Department of Mathematics: Dissertations, Theses, and Student Research
The purpose of this dissertation is to develop and apply results of both discrete calculus and discrete fractional calculus to further develop results on various discrete time scales. Two main goals of discrete and fractional discrete calculus are to extend results from traditional calculus and to unify results on the real line with those on a variety of subsets of the real line. Of particular interest is introducing and analyzing results related to a generalized fractional boundary value problem with Lidstone boundary conditions on a standard discrete domain N_a. We also introduce new results regarding exponential order for functions on …
Characterizations Of Distributions Of Ratio Of Certain Independent Random Variables,
2013
Marquette University
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,
2013
Marquette University
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,
2013
Shiraz University
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 (X1,X2,…,Xn) without the assumption of continuity and symmetry for each component Xi:
P(|1n∑i=1nXi|≤|∑i=1nαiXi|)≥12 ,
where all αi≥0 are special weights with ∑i=1nαi=1.
Iterative Solvers For Large, Dense Matrices,
2013
University of Southern Mississippi
Iterative Solvers For Large, Dense Matrices, Eowyn Wilhelmina Cenek
Dissertations
Stochastic Interpolation (SI) uses a continuous, centrally symmetric probability distribution function to interpolate a given set of data points, and splits the interpolation operator into a discrete deconvolution followed by a discrete convolution of the data. The method is particularly effective for large data sets, as it does not suffer from the problem of oversampling, where too many data points cause the interpolating function to oscillate wildly. Rather, the interpolation improves every time more data points are added. The method relies on the inversion of relatively large, dense matrices to solve Annx = b for x. Based on the probability …
Lax Pairs For Some Nonlinear Equations,
2013
University of Texas-Pan American
Lax Pairs For Some Nonlinear Equations, Ana Castillo
Theses and Dissertations - UTB/UTPA
Several methods have been proposed to approach the topic of integrable systems of nonlinear partial differential equations. One of these methods is called the Lax pair. The Lax pair is a pair of matrices or operators, that depend on time and satisfy the Lax equation. Based on the inverse scattering method introduced by Gardner, Greene, Kruskal and Miura (1967), Peter Lax introduced the Lax pair to derive soliton equations from the Lax equation. This thesis provides with a brief background on soliton theory, inverse scattering theory, and Lax pairs. The details missing in the work published by Ablowitz, Kaup, Newell, …
Distributed Sparse Matrix Solver And Pivoting Algorithms For Large Linear Equations,
2013
University of Texas-Pan American
Distributed Sparse Matrix Solver And Pivoting Algorithms For Large Linear Equations, Esteban Torres
Theses and Dissertations - UTB/UTPA
This thesis presents a distributed sparse direct solver and pivoting strategies for distributed sparse LU factorization. In Chapter I, we introduce some background concepts in linear algebra. In Chapter II, we discuss parallel hardware architectures and introduce our problem for discussion. In Chapter III, we describe the implementation of our sparse direct solver and our pivoting algorithms. Next, we present our simulation methodology and results in Chapter IV and we show that our pivoting algorithm yields up to 50% more accurate results than a current state-of-the-art solver, SuperLU_DIST. Finally, in Chapter V, we present some ideas to further improve the …
Examine Participant Dropout, Undiagnosed Diabetes And Undiagnosed Prediabetes In A Chronic Disease Prevention Education Program,
2013
University of Texas-Pan American
Examine Participant Dropout, Undiagnosed Diabetes And Undiagnosed Prediabetes In A Chronic Disease Prevention Education Program, Yiwen Cao
Theses and Dissertations - UTB/UTPA
There were 2768 participants enrolled in a chronic disease prevention education program. Survey and health measurements were obtained at three time points. We examine potential factors that might contribute to participant dropout, undiagnosed diabetes and undiagnosed prediabetes respectively. Logistic regression was used to examine the association between participant dropout and predictors, and to compare the odds of being undiagnosed with diabetes and prediabetes. We found that the potential predictors for participant dropout included age, employment, insurance, diabetes, self-reported health status, session type, program duration and curriculum. Factors affecting undiagnosed diabetes and prediabetes were age, self-reported health status birth country, limited …
On Cubic Multisections,
2013
University of Texas-Pan American
On Cubic Multisections, Andrew Alaniz
Theses and Dissertations - UTB/UTPA
In this thesis, a systematic procedure is given for generating cubic multi-sections of Eisenstein series. The relevant series are determined from Fourier expansions for Eisenstein series by restricting the congruence class of the summation index modulo three. The resulting series are shown to be rational functions of the Dedekind eta function. A more general treatment of cubic dissection formulas is given by describing the dissection operators in terms of linear transformations.
