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

Digital Commons Network™

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

Mathematics

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 24631 - 24660 of 27235

Full-Text Articles in Entire DC Network

Estimation In A Marked Poisson Error Recapture Model Of Software Reliability, Rajan Gupta Jan 1991

Estimation In A Marked Poisson Error Recapture Model Of Software Reliability, Rajan Gupta

Mathematics & Statistics Theses & Dissertations

Nayak's (1988) model for the detection, removal, and recapture of the errors in a computer program is extended to a larger family of models in which the probabilities that the successive programs produce errors are described by the tail probabilities of discrete distribution on the positive integers. Confidence limits are derived for the probability that the final program produces errors. A comparison of the asymptotic variances of parameter estimates given by the error recapture and by the repetitive-run procedure of Nagel, Scholz, and Skrivan (1982) is made to determine which of these procedures efficiently uses the test time.


Some Remarks On Reproducing Kernel Krein Spaces, Daniel Alpay Jan 1991

Some Remarks On Reproducing Kernel Krein Spaces, Daniel Alpay

Mathematics, Physics, and Computer Science Faculty Articles and Research

The one-to-one correspondence between positive functions and reproducing kernel Hilbert spaces was extended by L. Schwartz to a (onto, but not one-to-one) correspondence between difference of positive functions and reproducing kernel Krein spaces. After discussing this result, we prove that matrix value function K(z,ω) symmetric and jointly analytic in z and ω in a neighborhood of the origin is the reproducing kernel of a reproducing kernel Krein space. We conclude with an example showing that such a function can be the reproducing kernel of two different Krein spaces.


Search Designs And Other Topic In Fractional Replication., Kashinath Chatterjee Dr. Dec 1990

Search Designs And Other Topic In Fractional Replication., Kashinath Chatterjee Dr.

Doctoral Theses

This thesis primarily deals with search designs (see Srivastava (1975)) of various types for general symmetric and asymmetric factorials. The thesis also considers some other types on fractional factorials. We have made use of Kronecker products and various other results from matrix theory.In the first four chapters, different types of search designs have been studied. Chapter 5A considers the construction of orthogonal main-effect plans for general factorial experiments under the presence of a linear time trend. Chapter 5B extends the calculus for factorial arrangements to a fractional factorial set-up and examines critically the proportional frequency plans from the point of …


A Nonstandard Delta Function, Todor D. Todorov Dec 1990

A Nonstandard Delta Function, Todor D. Todorov

Mathematics

We prove that the Dirac delta distribution has a kernel in the class of the pointwise nonstandard functions.


Linear Programming By G.V. Shenoy, New Delhi: Wiley Eastern Limited, 1989., A K Rao Dec 1990

Linear Programming By G.V. Shenoy, New Delhi: Wiley Eastern Limited, 1989., A K Rao

IIMB Management Review

No abstract provided.


Studies In Rapid Kinetic Reactions By Quasi-Quantum Mechanical, Conservative Methodology, Donald Greenspan Dec 1990

Studies In Rapid Kinetic Reactions By Quasi-Quantum Mechanical, Conservative Methodology, Donald Greenspan

Mathematics Technical Papers - Archive

Simulations are made of prototype, ground state, rapid kinetic reactions for A+BC, in which B, and C are hydrogen atoms and BC is a hydrogen molecule. We study cases in which B and C first unbind, and then A, B, and C undergo complex, three-body, oscillatory behavior in accordance with the Morse potential. It is shown that, in every case, one of A, or C is ejected and the remaining two atoms form an H2 bond with precisely correct ground state energy, frequency, and bond length. Pico second trajectories are described and discussed. The numerical method employed conserves the system's …


A Method For Approximating The Solution Set Of A System Of Convex Inequalities By Polytopes, Yair Censor, Dan Butnariu Dec 1990

A Method For Approximating The Solution Set Of A System Of Convex Inequalities By Polytopes, Yair Censor, Dan Butnariu

Mathematics Technical Papers - Archive

In this note a method for computing approximations by polytopes of the solution set [see pdf for notation] of a system of convex inequalities is presented. It is shown that such approximations can be determined by an algorithm which converges in finitely many steps when the solution set of the given system of inequalities is bounded. In this case, the algorithm generates "inner" and "outer' approximations having the Hausdorff distance to each other (and to the set [see pdf for notation]) not greater than an a priori fixed [see pdf for notation] and having their extremal points in [see pdf …


Generalized Gradient Methods For Solving Locally Lipschitz Feasibility Problems, Dan Butnariu Dec 1990

Generalized Gradient Methods For Solving Locally Lipschitz Feasibility Problems, Dan Butnariu

Mathematics Technical Papers - Archive

In this paper we study the behavior of a class of iterative algorithms for solving feasibility problems, that is finite systems of inequalities [see pdf for notation], where each [see pdf for notation] is a locally Lipschitz functional on a Hilbert space X. We show that, under quite mild conditions, the algorithms studied in this note, if converge, then they approximate a solution of the feasibility given problem, provided that the feasibility problem is consistent. We prove several convergence criteria showing that, when the envelope of the functionals [see pdf for notation], is sufficiently "regular", then the algorithms converge. The …


Dihedral Rewriteability, Cheryl P. Grood Nov 1990

Dihedral Rewriteability, Cheryl P. Grood

Mathematical Sciences Technical Reports (MSTR)

In this paper we compute the probability that an n-tuple for a group G is S-rewritable for a given set S of permutations for several classes of groups.


Some Facts About Cwat-Sets, Martin Wattenburg Nov 1990

Some Facts About Cwat-Sets, Martin Wattenburg

Mathematical Sciences Technical Reports (MSTR)

In [1] and [2], Sherman and Atkins, in connection with a problem in statistics, introduced a generalization of the concept of a subgroup of Z2. These generalized subgroups, which we call CWAT-sets (where "CWAT" is an acronym for "Closed With A Twist" ), have a rich algebraic structure. In this paper we establish some simple combinatorial facts about CWAT-sets, as well as provide two construction methods, prove a divisibility theorem, and make a classification conjecture.


Accurate Quasi-Quantum Mechanical Numerical Methodology, Donald Greenspan Oct 1990

Accurate Quasi-Quantum Mechanical Numerical Methodology, Donald Greenspan

Mathematics Technical Papers - Archive

A quasi-quantum mechanical method in which energy is determined by quantum mechanics and motion by Newtonian mechanics is studied by combining it with numerical methodology which conserves energy exactly at each time step. Application is made to the study of the diameter and vibrational frequency of the ground state H2 molecule. The numerical results agree exactly with experimental and quantum mechanical results.


Degree Of Adaptive Approximation, Ronald A. Devore, Ming Yu Xiang Oct 1990

Degree Of Adaptive Approximation, Ronald A. Devore, Ming Yu Xiang

Faculty Publications

We obtain various estimates for the error in adaptive approximation and also establish a relationship between adaptive approximation and free-knot spline approximation.


A Numerical Approach To Rewriteability In Finite Groups, J.L. Leavitt, G.J. Sherman, M.E. Walker Sep 1990

A Numerical Approach To Rewriteability In Finite Groups, J.L. Leavitt, G.J. Sherman, M.E. Walker

Mathematical Sciences Technical Reports (MSTR)

In this paper we compute the probability that an n-tuple for a group G is S-rewritable for a given set S of permutations for several classes of groups.


Maximal Order Three-Rewriteable Subgroups Of Symmetric Groups, John T. O'Bryan Sep 1990

Maximal Order Three-Rewriteable Subgroups Of Symmetric Groups, John T. O'Bryan

Mathematical Sciences Technical Reports (MSTR)

Recently, Burns and Goldsmith [2] characterized the maximal order Abelian subgroups of the symmetric groups using elementary techniques and the results of Hoffman [5]. This classification could also be directly inferred from the results of Kovacs and Praeger [7]. A natural extension would be to consider the weaker, more general form of commutativity, three-rewriteability. The purpose of this paper is to completely characterize the maximal order three-rewriteable subgroups of the symmetric groups.


How Hamiltonian Can A Finite Group Be?, G.J. Sherman, T.J. Tucker, M.E. Walker Sep 1990

How Hamiltonian Can A Finite Group Be?, G.J. Sherman, T.J. Tucker, M.E. Walker

Mathematical Sciences Technical Reports (MSTR)

No abstract provided.


Fibonacci Sequences In Finite Groups, Steven W. Knox Sep 1990

Fibonacci Sequences In Finite Groups, Steven W. Knox

Mathematical Sciences Technical Reports (MSTR)

This paper extend the notion of Fibonacci sequence mod m to Fibonacci sequences in finite groups.


Sets Of Typical Subsamples, Joel Atkins, G.J Sherman Sep 1990

Sets Of Typical Subsamples, Joel Atkins, G.J Sherman

Mathematical Sciences Technical Reports (MSTR)

A group theoretic condition on a set of subsamples of a random sample from a continuous random variable symmetric about 0 is shown to be sufficient to provide typical values for 0.


Berry-Esseen-Type Bounds For Signed Linear Rank Statistics With A Broad Range Of Scores, Munsup Seoh Sep 1990

Berry-Esseen-Type Bounds For Signed Linear Rank Statistics With A Broad Range Of Scores, Munsup Seoh

Mathematics and Statistics Faculty Publications

The Berry-Esseen-type bounds of order N−1/2 for the rate of convergence to normality are derived for the signed linear rank statistics under the hypothesis of symmetry. The results are obtained with a broad range of regression constants and scores (allowed to be generated by discontinuous score generating functions, but not necessarily) restricted by only mild conditions, while almost all previous results are obtained with continuously differentiable score generating functions. Furthermore, the proof is very short and elementary, based on the conditioning argument.


Supercomputer Simulation Of The Modes Of Colliding Microdrops Of Water, Larry F. Heath, Donald Greenspan Sep 1990

Supercomputer Simulation Of The Modes Of Colliding Microdrops Of Water, Larry F. Heath, Donald Greenspan

Mathematics Technical Papers - Archive

No abstract provided.


Notions Of Relative Ubiquity For Invariant Sets Of Relational Structures, Paul Bankston, Wim Ruitenburg Sep 1990

Notions Of Relative Ubiquity For Invariant Sets Of Relational Structures, Paul Bankston, Wim Ruitenburg

Mathematics, Statistics and Computer Science Faculty Research and Publications

Given a finite lexicon L of relational symbols and equality, one may view the collection of all L-structures on the set of natural numbers w as a space in several different ways. We consider it as: (i) the space of outcomes of certain infinite two-person games; (ii) a compact metric space; and (iii) a probability measure space. For each of these viewpoints, we can give a notion of relative ubiquity, or largeness, for invariant sets of structures on w. For example, in every sense of relative ubiquity considered here, the set of dense linear orderings on w is …


Mathematical Visions: The Pursuit Of Geometry In Victorian England (Book Review), Calvin Jongsma Sep 1990

Mathematical Visions: The Pursuit Of Geometry In Victorian England (Book Review), Calvin Jongsma

Faculty Work Comprehensive List

Reviewed Title: Joan L. Richards. Mathematical Visions: The Pursuit of Geometry in Victorian England. xiii + 266 pp., illus., figs., bibl., index. Boston/New York: Academic Press, Harcourt Brace Jovanovich, 1988.


Rewriteable Sequencings Of Groups, Jeanne Nielsen Aug 1990

Rewriteable Sequencings Of Groups, Jeanne Nielsen

Mathematical Sciences Technical Reports (MSTR)

A finite group is called Pn-sequenceable if its nonidentity elements can be listed x1 , x2 , ..., xk so that the product x i x i+i · · · x i+n-1 can be rewritten in at least one nontrivial way for all i. It is shown that Sn , An , Dn are P3-sequenceable, that every finite simple group is P4 -sequenceable, and that every finite group is Ps-sequenceable. It is conjectured that every finite group is P3-sequenceable.


Sums Of Semiprime, Z, And D L-Ideals In A Class Of F-Rings, Suzanne Larson Aug 1990

Sums Of Semiprime, Z, And D L-Ideals In A Class Of F-Rings, Suzanne Larson

Mathematics, Statistics and Data Science Faculty Works

In this paper it is shown that there is a large class of f-rings in which the sum of any two semiprime i-ideals is semiprime. This result is used to give a class of commutative f-rings with identity element in which the sum of any two z-ideals which are i-ideals is a z-ideal and the sum of any two d-ideals is a d-ideal.


Some Np-Complete Problems In Linear Algebra, Santhosh Sastry '90 Jul 1990

Some Np-Complete Problems In Linear Algebra, Santhosh Sastry '90

Honors Projects

This research project is aimed at studying the theory of NP-Completeness and determining the complexity of certain problems in linear algebra. The first chapter introduces the reader to Complexity theory and defines NP-Completeness. It is supported by Appendices 1 and 2. Appendix 3 lists some known NP-Complete problems.


A Mathematical Model Of The Dynamics Of An Optically Pumped Codoped Solid State Laser System, Thomas G. Wangler Jul 1990

A Mathematical Model Of The Dynamics Of An Optically Pumped Codoped Solid State Laser System, Thomas G. Wangler

Mathematics & Statistics Theses & Dissertations

This is a study of a mathematical model for the dynamics of an optically pumped codoped solid state laser system. The model comprises five first order, nonlinear, coupled, ordinary differential equations which describe the temporal evolution of the dopant electron populations in the laser crystal as well as the photon density in the laser cavity. The analysis of the model is conducted in three parts.

First, a detailed explanation of the modeling process is given and the full set of rate equations is obtained. The model is then simplified and certain qualitative properties of the solution are obtained.

In the …


An Artificial Neural Approach To The Decomposition Problem, Chandrashekar L. Masti Jul 1990

An Artificial Neural Approach To The Decomposition Problem, Chandrashekar L. Masti

Electrical & Computer Engineering Theses & Dissertations

The goal of this thesis is to develop an artificial neural approach toward addressing the intractability involved with the decomposition problem. The search for the lattice of substitution property (s. p.) partitions essential to decompositions is cast into the framework of constraint satisfaction. An artificial neural network is developed to provide solutions by performing optimization of a mathematically derived objective function over the problem space. The issue of transitivity is verified to belong to a class of problems beyond the scope of solvability for conventional quadratic-order constraint satisfaction neural networks. A theorem is stated and proved establishing that third-order correlations …


The Fokker-Planck And Related Equations In Theoretical Population Dynamics, George Derise Jul 1990

The Fokker-Planck And Related Equations In Theoretical Population Dynamics, George Derise

Mathematics & Statistics Theses & Dissertations

The population growth of a single species is modeled by a differential equation with initial condition(s) so that the number of organisms in the population is derived using some mechanism of growth, i.e. a growth rate function. However, such deterministic models are often highly unrealistic in population dynamics because population growth is basically a random event. There are a large number of chance factors influencing growth that might not be taken into account by deterministic models. The effect of other species (for example, in the chance meeting of a predator), population fluctuations due to weather changes that would alter food …


Oscillations In Lotka-Volterra Systems Of Chemical Reactions, Roger H. Hering Jun 1990

Oscillations In Lotka-Volterra Systems Of Chemical Reactions, Roger H. Hering

Mathematics and Statistics Faculty Research & Creative Works

For a chemical reaction system modeled by x =k1Ax -k2x2 -k3xy +k4y2, y =k3xy -k4y2 -k5y +k6B, it is shown that for each positive choice of parameters k1A, B there exists a unique stationary state which is globally asymptotically stable in the positive quadrant. A criterion for the non-existence of periodic solutions is given for the generalized Lotka-Volterra system:x = f(x)h(x, y), y. © 1990 J.C. Baltzer AG, Scientific Publishing Company.


Lifted P-Adic Homology With Compact Supports Of The Weierstrass Family And Its Zeta Endomorphism, Goro Kato Jun 1990

Lifted P-Adic Homology With Compact Supports Of The Weierstrass Family And Its Zeta Endomorphism, Goro Kato

Mathematics

The relations among the generators for the lifted p-adic homology with compact supports of the various subfamilies of the Weierstrass family in characteristic p > 0 (p ≠ 2, 3) are explicitly given in Section 2. Then, the universal coefficient spectral sequence and the zeta endomorphism in Section 3 enable one to compute explicitly the lifted p-adic homology with compact supports of all fibres, including all the elliptic curves and all their singular degenerations in the family.


On The Error In Quasi-Quantum Mechanical Calculations, Donald Greenspan Jun 1990

On The Error In Quasi-Quantum Mechanical Calculations, Donald Greenspan

Mathematics Technical Papers - Archive

A numerical simulation of the vibration of a ground state H2 molecule is made from a quasi-quantum mechanical point of view, that is, energy has been determined by quantum mechanics and trajectories determined by Newtonian mechanics. The numerical method used is implicit and conserves the energy exactly at each time step. A variety of CRAY X-MP/SE14 calculations are described and discussed. Comparisons are made with correct oscillation and diameter values.