Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
Articles 1 - 6 of 6
Full-Text Articles in Physical Sciences and Mathematics
Mielnik Probability Spaces And Functional Equations, J. J. Mitchell
Mielnik Probability Spaces And Functional Equations, J. J. Mitchell
Opportunities for Undergraduate Research Experience Program (OURE)
The invariance properties of the solutions of those functional equations naturally occurring in the construction of Mielnik probability spaces are studied, and in turn are related to one another. In particular, the possibilities for fixed points of these solutions are found, and the relationships between these results are discussed. The two functional equations studied include a representation of the generalized parallelogram law and an equation used in the modeling of polarization phenomena. The main result of the paper lies in the extention of previous research on Mielnik probability spaces to a higher dimension, as well as a discussion of their …
Shooting Method Solutions Of Eigenvalue Problems, Xi Chen
Shooting Method Solutions Of Eigenvalue Problems, Xi Chen
Opportunities for Undergraduate Research Experience Program (OURE)
A shooting method was developed to study eigenvalue problems derived from Schrodinger equation. The challenging problem, the two-dimensional hydrogen system with the logarithmic potential function, was successfully solved by the shooting method. But no complete proof was given for its rationale and correctness. This paper not only gives the complete proof for the shooting method, but also generalizes it to solve a large class of eigenvalue problems. In a certain sense, the shooting method proves more effective numerically and more powerful theoretically than the classical functional analysis approach.
Boundedness And Periodic Solutions In Infinite Delay Systems, Roger H. Hering
Boundedness And Periodic Solutions In Infinite Delay Systems, Roger H. Hering
Mathematics and Statistics Faculty Research & Creative Works
Liapunov methods are used to give conditions ensuring that solutions of infinite delay equations are uniformly bounded and uniformly ultimately bounded with respect to unbounded (Cg) initial function spaces; and the connection to proving existence of periodic solutions is examined. Several examples illustrate the application of these results, especially to integrodifferential equations. © 1992.
Fixed Point Theorems For D-Complete Topological Spaces I, Troy L. Hicks
Fixed Point Theorems For D-Complete Topological Spaces I, Troy L. Hicks
Mathematics and Statistics Faculty Research & Creative Works
Generalizations of Banach's fixed point theorem are proved for a large class of non-metric spaces. These include d-complete symmetric (semi-metric) spaces and complete quasi-metric spaces. The distance function used need not be symmetric and need not satisfy the triangular inequality. © 1992, Hindawi Publishing Corporation. All rights reserved.
Prediction Intervals, Based On Ranges And Waiting Times, For An Exponential Distribution, Laura Colangelo, Jagdish K. Patel
Prediction Intervals, Based On Ranges And Waiting Times, For An Exponential Distribution, Laura Colangelo, Jagdish K. Patel
Mathematics and Statistics Faculty Research & Creative Works
This article contains two prediction intervals applicable to a 2-parameter as well as a 1-parameter exponential distribution. One can be used to predict a future sample range on the basis of an observed sample range. Appropriate prediction factors are tabulated. The other can be used to predict a waiting time between two future successive failures on the basis of an observed waiting time between two previous successive failures. © 1992 IEEE
Formation Of Clusters And Resolution Of Ordinal Attributes In Id3 Classification Trees, Chaman Sabharwal, Keith R. Hacke, Daniel C. St. Clair
Formation Of Clusters And Resolution Of Ordinal Attributes In Id3 Classification Trees, Chaman Sabharwal, Keith R. Hacke, Daniel C. St. Clair
Computer Science Faculty Research & Creative Works
Many learning systems have been designed to construct classification trees from a set of training examples. One of the most widely used approaches for constructing decision trees is the ID3 algorithm [Quinlan 1986]. Decision trees are ill-suited to handle attributes with ordinal values. Problems arise when a node representing an ordinal attribute has a branch for each value of the ordinal attribute in the training set. This is generally infeasible when the set of ordinal values is very large. Past approaches have sought to cluster large sets of ordinal values before the classification tree is constructed [Quinlan 1986; Lebowitz 1985; …