Open Access. Powered by Scholars. Published by Universities.®

Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

2001

Discipline
Institution
Keyword
Publication
Publication Type

Articles 211 - 240 of 245

Full-Text Articles in Mathematics

Ranked Set Sampling From Location-Scale Families Of Symmetric Distributions, Ram C. Tiwari, Paul H. Kvam Jan 2001

Ranked Set Sampling From Location-Scale Families Of Symmetric Distributions, Ram C. Tiwari, Paul H. Kvam

Department of Math & Statistics Faculty Publications

Statistical inference based on ranked set sampling has primarily been motivated by nonparametric problems. However, the sampling procedure can provide an improved estimator of the population mean when the population is partially known. In this article, we consider estimation of the population mean and variance for the location-scale families of distributions. We derive and compare different unbiased estimators of these parameters based on independent replications of a ranked set sample of size n. Large sample properties, along with asymptotic relative efficiencies, help identify which estimators are best suited for different location-scale distributions.


Extreme-Value Moment Goodness-Of-Fit Tests, Theodore P. Hill, Victor Perez-Abreu Jan 2001

Extreme-Value Moment Goodness-Of-Fit Tests, Theodore P. Hill, Victor Perez-Abreu

Research Scholars in Residence

A general goodness-of-fit test for scale-parameter families of distributions is introduced, which is based on quotients of expected sample minima. The test is independent of the mean of the distribution, and, in applications to testing for exponentiality of data, compares favorably to other goodness-of-fit tests for exponentiality based on the empirical distribution function, regression methods and correlation statistics. The new minimal-moment method uses ratios of easily-calculated, unbiased, strongly consistent U-statistics, and the general technique can be used to test many standard composite null hypotheses such as exponentiality, normality or uniformity (as well as simple null hypotheses).


Wholes And Parts In General Systems Methodology, Martin Zwick Jan 2001

Wholes And Parts In General Systems Methodology, Martin Zwick

Complex Systems Faculty Publications and Presentations

Reconstructability analysis (RA) decomposes wholes, namely data in the form either of set-theoretic relations or multivariate probability distributions, into parts, namely relations or distributions involving subsets of variables. Data is modeled and compressed by variablebased decomposition, by more general state-based decomposition, or by the use of latent variables. Models, which specify the interdependencies among the variables, are selected to minimize error and complexity.


Unit Sum Numbers Of Abelian Groups And Modules, Christopher Meehan Jan 2001

Unit Sum Numbers Of Abelian Groups And Modules, Christopher Meehan

Doctoral

We discuss some open questions regarding the unit sum numbers of free modules of arbitrary infinite rank over commutative rings and, in particular, over principal ideal domains. The unit sum numbers of rational groups are then investigated: the importance of the rational prime 2 being an automorphism of the rational group is discussed and other results are achieved considering the number and distribution of rational primes which are, or are not, automorphisms of the group. We next prove the existence of rational groups with unit sum numbers greater than 2 but of finite value and we estimate an upper bound …


On Marczewski-Burstin Representations Of Certain Algebras Of Sets, Krzysztof Ciesielski Jan 2001

On Marczewski-Burstin Representations Of Certain Algebras Of Sets, Krzysztof Ciesielski

Faculty & Staff Scholarship

We show that the Generalized Continuum Hypothesis GCH (its appropriate part) implies that many natural algebras on R, including the algebra B of Borel sets and the interval algebra S, are outer Marczewski-Burstin representable by families of non-Borel sets. Also we construct, assuming again an appropriate part of GCH, that there are algebras on R which are not MB-representable. We prove that some algebras (including B and S) are not inner MB-representable. We give examples of algebras which are inner and outer MB-representable, or are inner but not outer MB-representable.


An Almost Deep Degree, Peter Cholak, Marcia Groszek, Theodore Slaman Jan 2001

An Almost Deep Degree, Peter Cholak, Marcia Groszek, Theodore Slaman

Dartmouth Scholarship

We show there is a non-recursive r.e. set A such that if W is any low r.e. set. then the join W ⊕ A is also low. That is. A is “almost deep”. This answers a question of Joekusch. The almost deep degrees form an definable ideal in the r.e. degrees (with jump.)


A Penalty Method For Approximations Of The Stationary Power-Law Stokes Problem, Lew Lefton, Dongming Wei Jan 2001

A Penalty Method For Approximations Of The Stationary Power-Law Stokes Problem, Lew Lefton, Dongming Wei

Mathematics Faculty Publications

We study approximations of the steady state Stokes problem governed by the power-law model for viscous incompressible non-Newtonian flow using the penalty formulation. We establish convergence and find error estimates


Decay Estimates Of Heat Transfer To Melton Polymer Flow In Pipes With Viscous Dissipation, Dongming Wei, Zhenbu Zhang Jan 2001

Decay Estimates Of Heat Transfer To Melton Polymer Flow In Pipes With Viscous Dissipation, Dongming Wei, Zhenbu Zhang

Mathematics Faculty Publications

In this work, we compare a parabolic equation with an elliptic equation both of which are used in modeling temperature profile of a power-law polymer flow in a semi-infinite straight pipe with circular cross section. We show that both models are well-posed and we derive exponential rates of convergence of the two solutions to the same steady state solution away from the entrance. We also show estimates for difference between the two solutions in terms of physical data.


What To Do On Your Summer Vacation, Alissa Crans Jan 2001

What To Do On Your Summer Vacation, Alissa Crans

Mathematics, Statistics and Data Science Faculty Works

Summer vacation brings back fond memories: playing frisbee in the park, bike-riding till dusk, sipping lemonade on the porch with Grandpa, collecting shells at the beach, solving that difficult math problem you've been working on for the past several weeks. Wait a minute, you say? Many mathematics majors don't realize that numerous summer opportunities exist (many of them paid, so you don't need to get that job bagging groceries, too). A math program provides intellectual stimulation during those hot summer months, bringing your level of concentration up from swatting flies and applying sunscreen. The following descriptions are from actual participants …


The Hadamard Core Of The Totally Nonnegative Matrices, Alissa Crans Jan 2001

The Hadamard Core Of The Totally Nonnegative Matrices, Alissa Crans

Mathematics, Statistics and Data Science Faculty Works

An m-by- n matrix A is called totally nonnegative if every minor of A is nonnegative. The Hadamard product of two matrices is simply their entry-wise product. This paper introduces the subclass of totally nonnegative matrices whose Hadamard product with any totally nonnegative matrix is again totally nonnegative. Many properties concerning this class are discussed including: a complete characterization for min{m,n}<4 >; a characterization of the zero–nonzero patterns for which all totally nonnegative matrices lie in this class; and connections to Oppenheim's inequality.


On The Existence Of Finite Type Link Homotopy Invariants, Blake Mellor, Dylan Thurston Jan 2001

On The Existence Of Finite Type Link Homotopy Invariants, Blake Mellor, Dylan Thurston

Mathematics, Statistics and Data Science Faculty Works

We show that for links with at most 5 components, the only finite type homotopy invariants are products of the linking numbers. In contrast, we show that for links with at least 9 components, there must exist finite type homotopy invariants which are not products of the linking numbers. This corrects previous errors of the first author.


A Critical Look At Self-Dual Codes, Judy L. Walker Jan 2001

A Critical Look At Self-Dual Codes, Judy L. Walker

Department of Mathematics: Faculty Publications

We investigate self-dual codes from a structural point of view. In particular, we study properties of critical indecomposable codes which appear in the spectrum of a self-dual code. As an application of the results we obtain, we revisit the study of self-dual codes of dimension at most 10.

In the late 1950’s, Slepian [4] became the first to take an abstract approach to the study of error-correcting codes. He introduced a structure theory for binary linear codes, developing in particular the idea of an indecomposable code; that is, a code which is not isomorphic to a nontrivial direct sum of …


Analysis Of A Non-Replicated Split-Split Plot Experiment, Emily Simmons Sim Jan 2001

Analysis Of A Non-Replicated Split-Split Plot Experiment, Emily Simmons Sim

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

A major obstacle in the analysis of experimental data, in many situations, is the lack of "true" or "complete" replication. In some disciplines, researchers are very aware of the importance of replication and the methods for correctly replicating an experiment. In other subject areas, however, researchers are less aware of what it means to properly replicate an experiment. Due to this lack of awareness, many non-replicated experiments are carried out every year. For many of these non-replicated experiments, there is no satisfactory statistical analysis.

The subject of this report is the analysis of two non-replicated experiments in environmental engineering. First, …


P -Banach Algebras With Generalized Involution And C^*-Algebra Structure, Abdellah El Kinani, Aziz Ifzarne, Mohamed Oudadess Jan 2001

P -Banach Algebras With Generalized Involution And C^*-Algebra Structure, Abdellah El Kinani, Aziz Ifzarne, Mohamed Oudadess

Turkish Journal of Mathematics

In this paper, we consider p-Banach algebras endowed with a generalized involution. We show that various C^*-like conditions force the algebra to be C^*-algebra under an equivalent norm.


Remarks On The Paper "On The Commutant Of The Ideal Centre", Şafak Alpay, Bahri̇ Turan Jan 2001

Remarks On The Paper "On The Commutant Of The Ideal Centre", Şafak Alpay, Bahri̇ Turan

Turkish Journal of Mathematics

We continue with the work started in [4] and give a new sufficient condition on Riesz spaces having topologically full centres for Z^{\sim}(E)_C=Orth(E^{\sim}) to hold.


On The L^P Solutions Of Dilation Equations, İbrahi̇m Kirat Jan 2001

On The L^P Solutions Of Dilation Equations, İbrahi̇m Kirat

Turkish Journal of Mathematics

In this paper, the concepts concerning the space of constant breadth were extended to E^n-space. An approximate solution of the equation system which belongs to this curve was obtained. Using this solution vectorial expression of the curves of constant breadth was obtained. The relation \int_0^{2\pi}\widetilde{f}(s)\,ds=0 between the curvatures of curves of constant breadth in E^n was obtained. Key Words and Phrases: Curvature, Constant Breadth, Integral Characterization of Curve"> MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\(','\\)']], displayMath: [['\\[','\\]'], ['$$','$$']]}}); Academic Journals Find Manuscript Copyright Release Form Copyright Release Form(Turkey) Copyright Release Form(Other Countries) Manuscript Submission and Evaluation System On the L^p Solutions of Dilation …


Some Characterization Of Curves Of Constant Breadth In E^N Space, Zülfi̇gar Akdoğan, Abdullah Mağden Jan 2001

Some Characterization Of Curves Of Constant Breadth In E^N Space, Zülfi̇gar Akdoğan, Abdullah Mağden

Turkish Journal of Mathematics

In this paper, the concepts concerning the space of constant breadth were extended to E^n-space. An approximate solution of the equation system which belongs to this curve was obtained. Using this solution vectorial expression of the curves of constant breadth was obtained. The relation \int_0^{2\pi}\widetilde{f}(s)ds=0 between the curvatures of curves of constant breadth in E^n was obtained. Key Words and Phrases: Curvature, Constant Breadth, Integral Characterization of Curve


Measure Zero Sets Whose Algebraic Sum Is Non-Measurable, Krzysztof Ciesielski Jan 2001

Measure Zero Sets Whose Algebraic Sum Is Non-Measurable, Krzysztof Ciesielski

Faculty & Staff Scholarship

In this note we will show that for every natural number n > 0 there exists an S ⊂ [0, 1] such that its n-th algebraic sum nS = S + ··· + S is a nowhere dense measure zero set,but its n+ 1-st algebraic sum nS +S is neither measurable nor it has the Baire property. In addition,the set S will be also a Hamel base,that is,a linear base of R over Q.


Measure Zero Sets With Non-Measurable Sum, Krzysztof Ciesielski Jan 2001

Measure Zero Sets With Non-Measurable Sum, Krzysztof Ciesielski

Faculty & Staff Scholarship

For any subset C of R there is a subset A of C such that A+A has inner measure zero and outer measure the same as C+C. Also, there is a subset A of the Cantor middle third set such that A+A is Bernstein in [0,2]. On the other hand there is a perfect set C such that C+C is an interval I and there is no subset A of C with A+A Bernstein in I.


Rush Hour® And Dijkstra’S Algorithm, Mark Stamp, Brad Engel, Mcintosh Ewell, Victor Morrow Jan 2001

Rush Hour® And Dijkstra’S Algorithm, Mark Stamp, Brad Engel, Mcintosh Ewell, Victor Morrow

Faculty Publications, Computer Science

The game of Rush Hour® includes a 6 × 6 grid and game pieces representing cars and trucks. The object of the puzzle is to move a special car out of a gridlocked “traffic jam.” In this note we apply Dijkstra’s algorithm and a breadth-first search to solve any Rush Hour configuration.


Mathematization And Modern Science, Calvin Jongsma Jan 2001

Mathematization And Modern Science, Calvin Jongsma

Faculty Work Comprehensive List

The discipline of mathematics has not been spared the sweeping critique of postmodernism. Is mathematical theory true for all time, or are mathematical constructs in fact fallible? This fascinating book examines the tensions that have arisen between modern and postmodern views of mathematics, explores alternative theories of mathematical truth, explains why the issues are important, and shows how a Christian perspective makes a difference.

This chapter continues the process of tracing Western mathematization.


Eddy Structures Induced Within A Wedge By A Honing Circular Arc, C. P. Hills Jan 2001

Eddy Structures Induced Within A Wedge By A Honing Circular Arc, C. P. Hills

Articles

In this paper we outline an expeditious numerical procedure to calculate the Stokes flow in a corner due to the rotation of a scraping circular boundary. The method is also applicable to other wedge geometries. We employ a collocation technique utilising a basis of eddy (similarity) functions introduced by Moffatt (1964) that allows us to satisfy automatically the governing equations for the streamfunction and all the boundary conditions on the surface of the wedge. The circular honing problem thereby becomes one-dimensional requiring only the satisfaction of conditions on the circular boundary. The advantage of using the Moffatt eddy functions as …


Eddies Induced In Cylindrical Containers By A Rotating End Wall, Christopher Hills Jan 2001

Eddies Induced In Cylindrical Containers By A Rotating End Wall, Christopher Hills

Articles

The flow generated in a viscous liquid contained in a cylindrical geometry by a rotating end wall is considered. Recent numerical and experimental work has established several distinct phases of the motion when fluid inertia plays a significant role. The current paper, however, establishes the nature of the flow in the thus far neglected low Reynolds number regime. Explicitly, by employing biorthogonality relations appropriate to the current geometry, it is shown that a sequence of exponentially decaying eddies extends outward from the rotating end wall. The cellular structure is a manifestation of the dominance of complex eigensolutions to the homogeneous …


Power Connector, Stephen L. Clark, Joseph B. Shuey, Jose L. Ortega, John B. Brown Iii Jan 2001

Power Connector, Stephen L. Clark, Joseph B. Shuey, Jose L. Ortega, John B. Brown Iii

Mathematics and Statistics Faculty Research & Creative Works

A pair of mating connectors includes a receptacle having an insulative housing and at least one conductive receptacle contact with a pair of spaced walls forming a plug contact receiving space. The plug connector has an insulative housing and at least one conductive contact having a pair of spaced walls which converge to form a projection engageable in the plug receiving space of the receptacle contact. In each case, the spaced walls are joined by a bridging structure that unites the walls. The plug and receptacle contacts are retained in the respective housings by engagement of opposed lateral edge portions …


On Moment Inequalities And Stochastic Ordering For Weighted Reliability Measures, Broderick O. Oluyede, Mekki Terbeche Jan 2001

On Moment Inequalities And Stochastic Ordering For Weighted Reliability Measures, Broderick O. Oluyede, Mekki Terbeche

Mathematical Sciences: Faculty Publications

We obtain stochastic inequalities, error bounds, and classification probability for a general class of distributions. We introduce the notion of variability ordering via the probability functional and comparisons made for the weighted and the original distributions. We present moment inequalities, comparisons, and applications.


On Stochastic Comparisons Of Energy Functions With Applications, Broderick O. Oluyede Jan 2001

On Stochastic Comparisons Of Energy Functions With Applications, Broderick O. Oluyede

Mathematical Sciences: Faculty Publications

We develop simple methods for the stochastic comparisons of informational energy functions. We introduce modified informational energy functions and uncertainty of parameter functions are introduced for models with realistic parameter spaces. We present inequalities, comparisons, and applications including test procedures for testing the equality of informational energy functions. Some illustrative examples are also presented.


Efficient Algorithms For Graphs With Few P-4’S, Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Kaiko Müller, Stephan Olariu Jan 2001

Efficient Algorithms For Graphs With Few P-4’S, Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Kaiko Müller, Stephan Olariu

Computer Science Faculty Publications

We show that a large variety of NP-complete problems can be solved efficiently for graphs with 'few' P4's. We consider domination problems (domination, total domination, independent domination. connected domination and dominating clique), the Steiner tree problem, the vertex ranking problem, the pathwidth problem, the path cover number problem, the hamiltonian circuit problem, the list coloring problem and the precoloring extension problem. We show that all these problems can be solved in linear time for the class of (q,q - 4)-graphs, for every fixed q. These are graphs for which no set of at most q. vertices induces more …


Uber Potenzsummenpolynome (On Polynomials Of Sums Of Power), Jorg Feldvoss Jan 2001

Uber Potenzsummenpolynome (On Polynomials Of Sums Of Power), Jorg Feldvoss

University Faculty and Staff Publications

No abstract provided.


Efficient Traitor Tracing Algorithms Using List Decoding, Alice Silverberg, Jessica Staddon, Judy L. Walker Jan 2001

Efficient Traitor Tracing Algorithms Using List Decoding, Alice Silverberg, Jessica Staddon, Judy L. Walker

Department of Mathematics: Faculty Publications

We use powerful new techniques for list decoding error-correcting codes to efficiently trace traitors. Although much work has focused on constructing traceability schemes, the complexity of the tracing algorithm has received little attention. Because the TA tracing algorithm has a runtime of O(N) in general, where N is the number of users, it is inefficient for large populations.We produce schemes for which the TA algorithm is very fast. The IPP tracing algorithm, though less efficient, can list all coalitions capable of constructing a given pirate. We give evidence that when using an algebraic structure, the ability to …


[Introduction To] Basic Java Programming: A Laboratory Approach, Lewis Barnett Jan 2001

[Introduction To] Basic Java Programming: A Laboratory Approach, Lewis Barnett

Bookshelf

For first- and second-year undergraduates, an introduction to programming with Java, an object-oriented programming language that is a popular choice for Web applications. Kent and Barnett (U. of Richmond) introduce algorithms and problem-solving approaches that are important to programming general.