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

Physical Sciences and Mathematics Commons™

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

Mathematics

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 24451 - 24480 of 27400

Full-Text Articles in Physical Sciences and Mathematics

Optimum Continuous Sampling Plans And A Few Other Sqc Problems., D Ghosh Dr. Jun 1994

Optimum Continuous Sampling Plans And A Few Other Sqc Problems., D Ghosh Dr.

Doctoral Theses

The wide acceptance of Statistics as a basic tool in technölogical growth, later recog- nised as a Key technology, gained ground with the pioneering work of Shewhart in 20s, introducing Statistical Quality Control (SQC) in manufacturing industry. Around the same time a solid statistical basis was being worked out for the ageold concepts of sampling inspection for industrial products. By 1930, acceptance sam- pling for lot by lot inspection was being applied in Western Electric Company and elsewhere. Since then statistical tools have been the major technical inputs of To- tal Quality Management which has spread far and wide as …

Go to article

Pinching Theorems For Teardrops And Footballs Of Revolution, Joseph E. Borzellino Jun 1994

Pinching Theorems For Teardrops And Footballs Of Revolution, Joseph E. Borzellino

Mathematics

We give explicit optimal curvature pinching constants for the Riemannian (p, q)- football orbifolds under the assumption that they are realised as surfaces of revolution in 3. We show that sufficiently pinched sectional curvature assumptions imply that a (p, q)-football must be good.

Go to article

Convex-Bodies With Similar Projections, Richard J. Gardner, Aljoša VolčIč Jun 1994

Convex-Bodies With Similar Projections, Richard J. Gardner, Aljoša VolčIč

Mathematics Faculty Publications

By examining an example constructed by Petty and McKinney, we show that there are pairs of centered and coaxial bodies of revolution in Ed, d ≥ 3, whose projections onto each two-dimensional subspace are similar, but which are not themselves even affinely equivalent.

Go to article

Remarks On Automorphisms Of Subfactors, Phan Loi Jun 1994

Remarks On Automorphisms Of Subfactors, Phan Loi

Mathematics and Statistics Faculty Publications

We establish certain properties of automorphisms on an inclusion of AFD type II1 factors with finite index and finite depth and discuss their applications to the classification problem of AFD type III subfactors, including a different proof of a result on subfactors with principal graph Dn.

Go to article

Radially Symmetric Solutions To A Dirichlet Problem Involving Critical Exponents, Alfonso Castro, Alexandra Kurepa Jun 1994

Radially Symmetric Solutions To A Dirichlet Problem Involving Critical Exponents, Alfonso Castro, Alexandra Kurepa

All HMC Faculty Publications and Research

In this paper we answer, for N = 3,4, the question raised in [1] on the number of radially symmetric solutions to the boundary value problem -Δu(x) = λu(x) + u(x)|u(x)|^{4/(N-2)}, x ε B: = x ε RN:{|x| < 1}, u(x)=0, x ε ∂B, where Δ is the Laplacean operator and λ>0. Indeed, we prove that if N = 3,4, then for any λ>0 this problem has only finitely many radial solutions. For N = 3,4,5 we show that, for each λ>0, the set of radially symmetric solutions is bounded. Moreover, we establish geometric properties of the branches of solutions bifurcating from zero and from infinity.

Go to article

A Hierarchy Of Nonlinear Evolution Equations And Finite-Dimensional Involutive Systems, Zhijun Qiao Jun 1994

A Hierarchy Of Nonlinear Evolution Equations And Finite-Dimensional Involutive Systems, Zhijun Qiao

School of Mathematical and Statistical Sciences Faculty Publications and Presentations

A spectral problem and an associated hierarchy of nonlinear evolution equations are presented in this article. In particular, the reductions of the two representative equations in this hierarchy are given: one is the nonlinear evolution equation rl= - ar,- 2icu/3] r2] r which looks like the nonlinear Schrijdinger equation, the other is the generalized derivative nonlinear Schrijdinger equation rt= $ar,,- ialr12r- a/3(lr12r),- a j3I r I 2r,-2iap21r14r which is just a combination of the nonlinear Schrijdinger equation and two different derivative nonlinear Schrodinger equations [D. J. Kaup and A. C. Newell, J. Math. Phys. 19, 789 (1978); M. J. Ablowitz, …

Go to article

The Crystalline Structure Of Mm3, A Derivative Of Dapsone, Tommie L. Heltcel May 1994

The Crystalline Structure Of Mm3, A Derivative Of Dapsone, Tommie L. Heltcel

McCabe Thesis Collection

Dapsone is a drug which has recently been discovered as a potential treatment for the disease of leprosy. Many of the derivatives of dapsone have been sent to the United States by Dr. M. Muhundam and Professor M.S.R. Naidu of the Department of Chemistry, S.V. University, Tirupati, India, for structure analysis. One such derivative is (E)-3-[2-[(4-Chlorophenyl) sulphonyl] ethenyl]-4H-l-benzopyran-4-one, which will hereafter be referred to as MM3. MM3 was synthesized and the initial data for the structural analysis taken in the departments of Physics and Chemistry at S.V. University, Tirupati, India. The drug has been found to have a high antibacterial …

Go to article

Σary, Moorhead State University, Mathematics Department May 1994

Σary, Moorhead State University, Mathematics Department

Math Department Newsletters

No abstract provided.

Go to article

An Inverse Approach To A Probability Model For Fractured Networks, Stacy G. Vail May 1994

An Inverse Approach To A Probability Model For Fractured Networks, Stacy G. Vail

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

A common problem in science and engineering applications deals with finding information about a system where only limited information is known. One example of this problem is determining the geometry of an aquifer or oil reservoir based on well tests taken at the site. The Conditional Coding Method attacks this type of problem. This method uses the Simulated Annealing Algorithm in conjunction with a probability model which generates possible solutions based on a uniform random number list. The Annealing Algorithm generates a conditional probability distribution on all possible solutions generated by the probability model, conditioned on the observed data set. …

Go to article

Creation And Simulation Of A Model For A Discrete Time Buffer System With Interrupted Poisson Arrivals And Uncorrelated Server Interruptions, Susanne Naegele-Jackson May 1994

Creation And Simulation Of A Model For A Discrete Time Buffer System With Interrupted Poisson Arrivals And Uncorrelated Server Interruptions, Susanne Naegele-Jackson

Masters Theses & Specialist Projects

A mathematical model for a discrete-time buffer system with both arrival and server interruptions is developed. In this model fixed-size packets arrive at the buffer according to a Poisson distribution and are stored there until they can be transmitted over the output channel. Service times are constant and the buffer is assumed to be of infinite size. Both arrival stream as well as the service of the packets are subjected to random interruptions described by Bernoulli processes, where the interruption process of the Poisson input stream is uncorrelated to the interruptions of the output line. Expressions are derived for the …

Go to article

Average Genus Of The Cube, Jody Koenemann Apr 1994

Average Genus Of The Cube, Jody Koenemann

Honors Theses

In recent years, there has been interest in the mathematical community in a rapidly developing branch of theoretical mathematics known as random topological graph theory. This new area of mathematics explores the different ways in which certain graphs can be imbedded in given surfaces. The random nature of the new branch results when one also imposes a random distribution on set of all imbeddings of a fixed graph, via the orientation of the edges at each vertex. Using the technique of J. Edmonds, developed in 1960, this paper explores the imbeddings for the graph Q3 using a particular group …

Go to article

Third Order Degree Regular Graphs, Leslie D. Hayes Apr 1994

Third Order Degree Regular Graphs, Leslie D. Hayes

Honors Theses

A graph G is regular of degree d if for every vertex v in G there exist exactly d vertices at distance 1 from v. A graph G is kth order regular of degree d if for every vertex v in G, there exist exactly d vertices at distance k from v. In this paper, third order regular graphs of degree 1 with small order are characterized.

Go to article

Retiling A Colored Hexagonal Plane, Kari Kelton Apr 1994

Retiling A Colored Hexagonal Plane, Kari Kelton

Mahurin Honors College Capstone Experience/Thesis Projects

No abstract provided.

Go to article

Classification Characteristics Of Som And Art2, J. J. Aleshunas, Daniel C. St. Clair, William E. Bond Apr 1994

Classification Characteristics Of Som And Art2, J. J. Aleshunas, Daniel C. St. Clair, William E. Bond

Mathematics and Statistics Faculty Research & Creative Works

Artificial neural network algorithms were originally designed to model human neural activities. They attempt to recreate the processes involved in such activities as learning, short term memory, and long-term memory. Two widely used unsupervised artificial neural network algorithms are the Self-Organizing Map (SOM) and Adaptive Resonance Theory (ART2). Each was designed to simulate a particular biological neural activity. Both can be used as unsupervised data classifiers. This paper compares performance characteristics of two unsupervised artificial neural network architectures; the SOM and the ART2 networks. The primary factors analyzed were classification accuracy, sensitivity to data noise, and sensitivity of the algorithm …

Go to article

Using The Id3 Symbolic Classification Algorithm To Reduce Data Density, Barry Fiachsbart, Daniel C. St. Clair, Jeff Holland Apr 1994

Using The Id3 Symbolic Classification Algorithm To Reduce Data Density, Barry Fiachsbart, Daniel C. St. Clair, Jeff Holland

Mathematics and Statistics Faculty Research & Creative Works

Effective data reduction is mandatory for modeling complex domains. The work described here demonstrates how to use a symbolic classifier algorithm from machine learning to effectively reduce large amounts of data. The algorithm, Quirdan's ID3, uses input data records and corresponding classifications to produce a decision tree. The resulting tree can be used to classify previously unseen inputs. Alternatively, the attributes found in the tree can be used as the basis to develop other system modeling techniques such as neural networks or mathematical programming algorithms. This approach has been used to effectively reduce data from a large complex domain. The …

Go to article

On The Busemann-Petty Problem Concerning Central Sections Of Centrally Symmetric Convex-Bodies, Richard J. Gardner Apr 1994

On The Busemann-Petty Problem Concerning Central Sections Of Centrally Symmetric Convex-Bodies, Richard J. Gardner

Mathematics Faculty Publications

We present a method which shows that in E3 the Busemann-Petty problem, concerning central sections of centrally symmetric convex bodies, has a positive answer. Together with other results, this settles the problem in each dimension.

Go to article

A Construction Of Difference Sets In High Exponent 2-Groups Using Representation Theory, James A. Davis, Ken Smith Apr 1994

A Construction Of Difference Sets In High Exponent 2-Groups Using Representation Theory, James A. Davis, Ken Smith

Department of Math & Statistics Faculty Publications

Nontrivial difference sets in groups of order a power of 2 are part of the family of difference sets called Menon difference sets (or Hadamard), and they have parameters (22d+2, 22d+1 ±2d, 22d±2d). In the abelian case, the group has a difference set if and only if the exponent of the group is less than or equal to 2d+2. In [14], the authors construct a difference set in a nonabelian group of order 64 and exponent 32. This paper generalizes that result to …

Go to article

Monads And Realcompactness, Sergio Salbany, Todor D. Todorov Mar 1994

Monads And Realcompactness, Sergio Salbany, Todor D. Todorov

Mathematics

We give a quantifier free characterization of realcompactness and ordered realcompactness in terms of monads. We also present simple proofs of some topological facts concerning realcompact spaces.

Go to article

A Special Class Of Almost Disjoint Families, Thomas E. Leathrum Mar 1994

A Special Class Of Almost Disjoint Families, Thomas E. Leathrum

Dartmouth Scholarship

The collection of branches (maximal linearly ordered sets of nodes) of the tree ${}^{<\omega}\omega$ (ordered by inclusion) forms an almost disjoint family (of sets of nodes). This family is not maximal -- for example, any level of the tree is almost disjoint from all of the branches. How many sets must be added to the family of branches to make it maximal? This question leads to a series of definitions and results: a set of nodes is {\it off-branch} if it is almost disjoint from every branch in the tree; an {\it off-branch family} is an almost disjoint family of off-branch sets; ${\frak o}=\min\{|{\Cal O}|: {\Cal O}$ is a maximal off-branch family$\}$. Results concerning $\frak o$ include: (in ZFC) ${\frak a}\leq{\frak o}$, and (consistent with ZFC) $\frak o$ is not equal to any of the standard small cardinal invariants $\frak b$, $\frak a$, $\frak d$, or ${\frak c}=2^\omega$. Most of these consistency results use standard forcing notions -- for example, $Con({\frak b}={\frak a}<{\frak o}={\frak d}={\frak c})$ comes from starting with a model of $ZFC+CH$ and adding $\omega_2$-many Cohen reals. Many interesting open questions remain, though -- for example, $Con({\frak o}<{\frak d})$.

Go to article

Markov Dilation Of Nonconservative Quantum Dynamical Semigroups And Quantum Boundary Theory., B. V. Rajarama Bhat Dr. Mar 1994

Markov Dilation Of Nonconservative Quantum Dynamical Semigroups And Quantum Boundary Theory., B. V. Rajarama Bhat Dr.

Doctoral Theses

In classical probability theory, based on Kolmogorov consistency theorem, one can associate a Markov process to any one parameter semigroup of stochastic matrices or transition probability operators. It is indeed the foundation for the theory of Markov processes. Here a quantum version of this theorem has been established. This effectively answers some of the questions raised by P. A. Meyer in his book (see page 220 of (Me).It is widely agreed upon that irreversible dynamics in the quantum setting is de- scribed by contractive semigroups of completely positive maps on C" algebras ([Kr). (AL]). In other words these semigroups, known …

Go to article

Intersection Bodies And The Busemann-Petty Problem, Richard J. Gardner Mar 1994

Intersection Bodies And The Busemann-Petty Problem, Richard J. Gardner

Mathematics Faculty Publications

It is proved that the answer to the Busemann-Petty problem concerning central sections of centrally symmetric convex bodies in d-dimensional Euclidean space Ed is negative for a given d if and only if certain centrally symmetric convex bodies exist in Ed which are not intersection bodies. It is also shown that a cylinder in Ed is an intersection body if and only if d ≤ 4, and that suitably smooth axis-convex bodies of revolution are intersection bodies when d ≤ 4. These results show that the Busemann-Petty problem has a negative answer for d ≥ 5 …

Go to article

The Prime Decomposition Of Knotted Periodic Orbits In Dynamical Systems, Michael C. Sullivan Mar 1994

The Prime Decomposition Of Knotted Periodic Orbits In Dynamical Systems, Michael C. Sullivan

Articles and Preprints

Templates are used to capture the knotting and linking patterns of periodic orbits of positive entropy flows in 3 dimensions. Here, we study the properties of various templates, especially whether or not there is a bound on the number of prime factors of the knot types of the periodic orbits. We will also see that determining whether two templates are different is highly nontrivial.

Go to article

Some Limit Theorem On Conditional U-Statistics And Censored Data Non Parametric Regression., Arusharka Sen Dr. Feb 1994

Some Limit Theorem On Conditional U-Statistics And Censored Data Non Parametric Regression., Arusharka Sen Dr.

Doctoral Theses

In Statistics, a classical problem is that of estimating the regression function which is defined as m{t) := E(Y|X = ), te R, for two random variables X and Y such that EY < 0o. The estimators are constructed iased on a sample {(Xi, Yi.)}, 1sis n,n 2 1, from the distribution of (X, Y). Throughout this thesis, we assume X and Y to be real-valued for the sake of convenience. The classical approach to this problem is to assume a parametrized, polynomial form for nt-), i.e., m(t) := Bo + E-1 P,ti, p 21, and obtain estimates of the unknown paraineters Bo, Bj,, 1sjsp. Later, with the development of techıniques for non-parametrie density estimation, it was sought to extend these techniques to regression estimation. Heuristically, the two problems can be seen to be related as follows : let fi(-) be the marginal density of X and note that E1(X S x) = h(t)dt, z € R, whereas EY 1(X Sx) = m(t)fi(t)dt, x E MR. (1.0.2) In other wordds, (1.0.1) can be looked upon as a special case of (1.0.2), with Y = 1. + similarity, as we shall see later on, has been the underlying theme in Chapters 2 and 4 of the present work.) The following non-parametric regression estimator was proposed independently by Nadaraya (1964) and Watson (1964): "(): := m.(Y,)/m.(1, ), te R, (1.0.3) where m,(Y, t) = (nan)- E-, Y;K((t - X:)/an). (1.0.4) m,(1,1) (na,)-E, K((I - X)/a,). Here K(), the so-called kernel function, is chosen to satiafy various analytical conditions (typically, K(-) is taken to be a density function), and a, 1 0 are the bandwidths which go to zero sufficiently slowly (e.g., na,0o as n00) in order to ensure consistency of the estimator mW (). The intuition behind such an estimator is that m,(Y,) is an estimator of mt-)fi() while m,(1,) cstimates the density fa(-). See Prakasa Rao (1983), Chapters 1-4. for an introduction to non-parametric density and regression estimation. Now, m(t) is a functional of the conditional distribution of Y, given X = t. A natu- ral generalisation of the regression estimation problem seems to be the estimation of the following functionals: mh(t1,....tk) := E{h(Y1,.....Yk) | X1, = t1.,Xk. = tk), (t....) € R*, k 2 1, (1.0.5) where h: R*- R is such that Elh(Y...., Y) < 0. A similar generalisation led Hoelfding (1948) from the sample mcan to the theory of so-called U-statistics, in the uncondilional set-up. The estimation of (1.0.5) were considerexl, for the first time in published form, in Stute (1991) where the following conditional U-statistics were proposed as estimators;where Fn(-) := n-1E, 1(Xi; < ) denotes the empirical distribution function (c.d.f Bochynek discussed the asymptotic normality of conditional U- and V-statistics and pei formed simulation studies on them. Stute (1991) established weak and strong pointwis consistency and asymptotic normality of U(t). Liero (1991) studied uniform strong con sistency of conditional U-statistics and established asymptotic normality of the integrate squared error (ISE) statistic:for suitable A c R* and weight function w(-). We quote the following examples to illustrate the possible use of conditional U-statistics See Stute (1991) and Bochynek (1987) for other examples. Throughout this thesis, our set up will be as foliows: {(Xn, Yn)}n>ı is a bi-variate i.i.d sequence, with (X1, Y1) having join density f(,-) and X, having marginal density fi(-). Consequently,

Go to article

Walrasian Theory Without On Auctioneer: A Study Of Monetary Exchange Through Trading Posts And A Diagrammatic View Of Disequilibria., Meenakshi Rajeev Dr. Feb 1994

Walrasian Theory Without On Auctioneer: A Study Of Monetary Exchange Through Trading Posts And A Diagrammatic View Of Disequilibria., Meenakshi Rajeev Dr.

Doctoral Theses

The theory of Walrasian equilibrium yields a set of prices at which the aggregate competitive demand for each commodity equals its aggregate competitive supply. Two important issues arise in this context. The first is concerned with discovering laws which guide the behaviour of the many economic variables, especially prices, when the analyst m is out of equilibrium. Walras (1900) tackled this problem by providing an algorithm (or the stÃ¥tenement scheme") which can be viewed as an auctioneer quoting different peices for the various goods an. adjusting them according t the sigus of the resulting aggregate excess demands. This is the …

Go to article

Multivalued Approach For Uncertainty Management., Deba Prasad Mandal Dr. Feb 1994

Multivalued Approach For Uncertainty Management., Deba Prasad Mandal Dr.

Doctoral Theses

Real life problems are rarely free from uncertainty which usually emerges from the deficiencies of information available from a situation. The defi- ciencies may result from incomplete, imprecise, not fully reliable, vague or contradictory information depending on the problem. Management of uncer- tainty in a decision making system has been an important research problem for many years.Until the inception of the concept of fuzzy set theory in 1965 (1), the theory of probability and statistics was the primary mathematical tool for modeling uncertainty in a system/situation. Fuzzy set theory has shown enormous proinise in handling uncertaintics to a reasonable extent …

Go to article

Hypergroup Graphs And Subfactors., A. K. Vijayarajan Dr. Feb 1994

Hypergroup Graphs And Subfactors., A. K. Vijayarajan Dr.

Doctoral Theses

The main theme of this t hesis is hypergroups. In this thesis the the- ory of hypergroups is applied to study the relation between certain graphs and subfactors of II, factors in the context of principal graphs associated with the inclusions of II, factors. More general classes of hypergroups are iutroduced, new examples of hypergroups associated to certain graphs are coustructed and classification of small order hypergroups is discussed.The text of the thesis is arranged in four chapters. The first chapter is on preliminaries of the theory of hypergroups, the second on the appli- cation of the theory of hyjrrgroups …

Go to article

Discrete Singularity Method And Its Application To Incompressible Flows., S K. Venkatesan Dr. Feb 1994

Discrete Singularity Method And Its Application To Incompressible Flows., S K. Venkatesan Dr.

Doctoral Theses

The smooth flow of a fluid has sprung many surprises. A flow which at an instant of time is quite regular and orderly could produce on the slightest of disturbance a complex bewildering varieties of flows, broadly termed as turbulence. Direct numerical simulation of the Navier-Stokes equations have shown that it is quite possible that these turbulent flows are solutions of the Navier-Stokes equations. In fact it is by now well recognized that many non-linear systems produce chaos quite similar to turbulence. However the large number of scales and their complex interactions involved make turbulence difficult to understand. Direct numerical …

Go to article

Stability Of Cereal Crop Yields' Performance: An Econometric Analysis For India And Andhra Pradesh., A. Ganesh Kumar Dr. Feb 1994

Stability Of Cereal Crop Yields' Performance: An Econometric Analysis For India And Andhra Pradesh., A. Ganesh Kumar Dr.

Doctoral Theses

Agriculture is an importannt sector of the economy in many developing countries. Of late, in many countries, this sector Is believed to be suffering from unstable performance, especially where the modern (Green Revolutlon) technology has been widely adopted. The issue of stability of agricul tura! performance is one of international concern. This thesis is about the performance of cereal crop yiel ds in India.Importance of Agriculture in the Indian Economy.Agriculture is an important sector Aooounting for more than 30% of the countrys national 1988-89, the performance of agriculture, both as nateriais for industrla! producelon ponsumption demand, determines of the Indian …

Go to article

Three Aspects Of Industrial Dualism In A Developing Economy., Malbika Roy Dr. Feb 1994

Three Aspects Of Industrial Dualism In A Developing Economy., Malbika Roy Dr.

Doctoral Theses

The concept of duali sm which has remained central to the study of the by of economic development, was first developed process Lewis(1954) and then further extended by Fel and Ranis(1966). Lewis concelved of a developing economy as one typically consisting of two sectors: a modern sector identified with industry, and a traditional sector identified with agriculture. Resources flow from the traditional to the modern sector whlle the process of development continues. As a consequence, the modern sector grows and the traditional sector shrinks. Some of the other development economists used other facets of dualism. Harris-Todaro(1970) explained the process of …

Go to article

Evaluating In Dual Economy Framework The Indian Industrial Performance During 1951-52 To 1989-90., R. Kavita Rao Dr. Feb 1994

Evaluating In Dual Economy Framework The Indian Industrial Performance During 1951-52 To 1989-90., R. Kavita Rao Dr.

Doctoral Theses

The primary goal of economic development is to achieve high rates of growth of outputs and incomes so to ensure high per as capita income and levels of living in the economy. In India, this was sought to be achleved, to a large extent, through a rapid expansion and growth of the industrial sector, as is evident in the emphasis placed on the industrialisation programmes in her various Five Year Plans. However, the growth of this sector has exhibited considerable ups and downs over the years, belying expectations. Quite expectedly, this has evoked substantial debate on the factors influencing and/or …

Go to article

First Prev Next Last