Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Missouri University of Science and Technology (476)
- Marquette University (375)
- University of New Mexico (171)
- Wright State University (148)
- Utah State University (102)
-
- University of Dayton (66)
- Claremont Colleges (45)
- Old Dominion University (31)
- University of Richmond (30)
- Louisiana Tech University (24)
- Macalester College (24)
- University of South Florida (24)
- City University of New York (CUNY) (23)
- Smith College (22)
- Portland State University (15)
- University of Texas at El Paso (14)
- East Tennessee State University (13)
- Marshall University (12)
- Prairie View A&M University (12)
- Purdue University (12)
- Southern Illinois University Carbondale (10)
- Technological University Dublin (10)
- Bryant University (9)
- Kennesaw State University (9)
- South Dakota State University (9)
- Southern Methodist University (9)
- University of Nevada, Las Vegas (9)
- Wayne State University (9)
- Western Kentucky University (9)
- Georgia Southern University (8)
- Keyword
-
- Statistics (58)
- Mathematics (37)
- Characterizations (31)
- Machine learning (26)
- Probability (24)
-
- Oscillation (21)
- Machine Learning (19)
- Reliability (19)
- Continuum (16)
- Maximum likelihood estimation (16)
- Time scales (14)
- Simulation (12)
- Hazard function (11)
- Time scale (11)
- Classification (10)
- Maximum likelihood (10)
- Moments (10)
- Bayesian (9)
- Characterization (9)
- Estimation (9)
- Gene expression (9)
- Order statistics (9)
- Random walk (9)
- FMRI (8)
- Forecasting (8)
- Image reconstruction (8)
- Inverse limit (8)
- Mathematical model (8)
- Microarray (8)
- Modeling (8)
- Publication
-
- Mathematics and Statistics Faculty Research & Creative Works (412)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (318)
- Mathematics and Statistics Faculty Publications (147)
- Mathematics & Statistics ETDs (141)
- Mathematics Faculty Publications (68)
-
- Mathematical and Statistical Science Faculty Research and Publications (51)
- All Graduate Plan B and other Reports, Spring 1920 to Spring 2023 (37)
- Electronic Theses and Dissertations (29)
- Branch Mathematics and Statistics Faculty and Staff Publications (27)
- Department of Math & Statistics Faculty Publications (27)
- All Graduate Theses and Dissertations, Spring 1920 to Summer 2023 (25)
- Mathematics, Statistics, and Computer Science Honors Projects (24)
- Doctoral Dissertations (21)
- Statistical and Data Sciences: Faculty Publications (20)
- Computer Science Technical Reports (19)
- Journal of Humanistic Mathematics (17)
- Mathematics Senior Capstone Papers (17)
- USF Tampa Graduate Theses and Dissertations (16)
- Mathematics & Statistics Faculty Publications (15)
- Theses and Dissertations (14)
- All Graduate Theses and Dissertations, Fall 2023 to Present (13)
- Open Access Theses & Dissertations (13)
- Publications and Research (13)
- Applications and Applied Mathematics: An International Journal (AAM) (12)
- Theses, Dissertations and Capstones (12)
- Mathematics & Statistics Theses & Dissertations (11)
- Articles and Preprints (10)
- All HMC Faculty Publications and Research (9)
- Articles (9)
- Design and Analysis of Experiments (9)
- Publication Type
- File Type
Articles 1771 - 1800 of 2041
Full-Text Articles in Mathematics
A New Approach To Automatic Target Recognition Using Wavelet Transforms, Anitha Panapakkam, S. N. Balakrishnan, Daniel St. Clair
A New Approach To Automatic Target Recognition Using Wavelet Transforms, Anitha Panapakkam, S. N. Balakrishnan, Daniel St. Clair
Computer Science Technical Reports
Automatic Target Recognition (ATR) systems have significant impact in defense applications. There is a continuing need to develop new and robust techniques to handle the increasingly complex ATR problem. The objectives of this thesis are two-fold. First a new technique to be used for ATR is developed and secondly an integrated ATR system to investigate and combine all subsystems is developed. In this thesis, we have developed a new technique for the feature extraction stage of ATR problem using wavelet transforms. Wavelet transforms have been one of the widely investigated areas of research in the past few years. The promising …
Reconstruction Of Semiconductor Doping Profile From Lbic Image, Weifu Fang, Kazufumi Ito
Reconstruction Of Semiconductor Doping Profile From Lbic Image, Weifu Fang, Kazufumi Ito
Mathematics and Statistics Faculty Publications
In this paper, the authors study the reconstruction of a semiconductor doping profile or, equivalently, the equilibrium potential, from its LBIC (laser-beam-induced current) image. For the one-dimensional case, the authors first characterize the attainable class of current measurements, and from this they show the nonuniqueness of the inverse problem. Then the reconstruction of the equilibrium potential is reduced to finding two constants subject to some constraints. A reconstruction algorithm is established based on a least squares formulation of the problem. The case of noise-collapsed data is also discussed. For a special case of two-dimensional domain, the authors apply the one-dimensional …
Evolving Plane Curves By Curvature In Relative Geometries Ii, Michael E. Gage, Yi Li
Evolving Plane Curves By Curvature In Relative Geometries Ii, Michael E. Gage, Yi Li
Mathematics and Statistics Faculty Publications
In this paper we prove the existence of self-similar solutions to the anisotropic curve shortening equation.
Some Sampling Designs And Estimation Problems, Hassan Lakkis
Some Sampling Designs And Estimation Problems, Hassan Lakkis
Mathematics & Statistics Theses & Dissertations
In the first chapter we review some standard estimators in sampling from a finite population, and some design-based estimators in sampling from a continuous universe.
In concert with the theory initiated by professor Douglas Robson (personal communication) and later presented by Cordy (1993), we consider design-based variance estimation for probability sampling from a continuous and spatially distributed universe. Using this theory in chapter two, the sampling design of one random point from each cell of a translated grid is investigated and the problem of edge effects on estimation is illustrated with examples. Also in chapter four, standard systematic sampling methods …
Remarks On Automorphisms Of Subfactors, Phan Loi
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.
Classification Characteristics Of Som And Art2, J. Aleshunas, D. St. Clair, W. Bond
Classification Characteristics Of Som And Art2, J. Aleshunas, D. St. Clair, W. Bond
Computer Science Technical Reports
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 artificial neural network algorithms are the Self-Organizing Map (SOM) and the 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 to the …
Using The Id3 Symbolic Classification Algorithm To Reduce Data Density, Barry Fiachsbart, Daniel C. St. Clair, Jeff Holland
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 …
Classification Characteristics Of Som And Art2, J. J. Aleshunas, Daniel C. St. Clair, William E. Bond
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 …
Generating Indexing Functions Of Regularly Sparse Arrays For Array Compilers, Scott Thibault, Lenore Mullin, Matt Insall
Generating Indexing Functions Of Regularly Sparse Arrays For Array Compilers, Scott Thibault, Lenore Mullin, Matt Insall
Computer Science Technical Reports
There are many applications involving arrays that contain non-zero components in regular geometric partitions. These include triangular, diagonal, tridiagonal, banded, etc. When computing with this type of arrays, they are usually stored in a packed form and computations are performed with only the non-zero components. This packed form requires an indexing function that maps an index of the array to an index of the packed lexico-graphically stored array. This paper presents a method of describing regular partitions and of automatically generating an indexing function from that description. These methods enable an array compiler to compile array operations on these type …
Conjugating Polynomials On Finite Rings, M. Insall, L. Mullin, R. Wilkerson
Conjugating Polynomials On Finite Rings, M. Insall, L. Mullin, R. Wilkerson
Computer Science Technical Reports
No abstract provided.
Elimination Of Supply Harmonics: An Evolution Of Current Compensation And Active Filtering Methods, Stephen L. Clark, P. Famouri, W. L. Cooley
Elimination Of Supply Harmonics: An Evolution Of Current Compensation And Active Filtering Methods, Stephen L. Clark, P. Famouri, W. L. Cooley
Mathematics and Statistics Faculty Research & Creative Works
The price of the extensive use of power electronic devices is becoming clear: increasing harmonic "pollution." This survey takes a brief look at background information related to harmonics, including their sources, effects, and characteristics. Then, the evolution of the harmonics elimination approaches of current compensation and active filtering, which are becoming more feasible due to research and technological improvements, are discussed in order to give some insight into the directions that research is taking.
Fixed Point Theorems For Non-Self Maps I, Troy L. Hicks, Unda Marie Sauga
Fixed Point Theorems For Non-Self Maps I, Troy L. Hicks, Unda Marie Sauga
Mathematics and Statistics Faculty Research & Creative Works
Suppose f:C→X where C is a closed subset of X. Necessary and sufficient conditions are given for f to have a fixed point. All results hold when X is complete metric space. Several results hold in a much more general setting. © 1994, Hindawi Publishing Corporation. All rights reserved.
Controllability And Stabilizability Of Coupled Strings With Control Applied At The Coupled Points, Lop-Fat Ho
Controllability And Stabilizability Of Coupled Strings With Control Applied At The Coupled Points, Lop-Fat Ho
Mathematics and Statistics Faculty Publications
Controllability and stabilizability of a system of coupled strings with control applied at the coupled points is studied. By investigating the properties of certain exponential series, it is shown that the system is approximate controllable if and only if related systems of uncoupled strings do not share a common eigenvalue. A sufficient condition for exact controllability is also obtained in terms of the Riesz basis properties of those exponential series.
Harmonic-Analysis Of Fractal Measures Induced By Representations Of A Certain C*-Algebra, Palle Jorgensen, Steen Pedersen
Harmonic-Analysis Of Fractal Measures Induced By Representations Of A Certain C*-Algebra, Palle Jorgensen, Steen Pedersen
Mathematics and Statistics Faculty Publications
We describe a class of measurable subsets Ω in Rd such that L2(Ω) has an orthogonal basis of frequencies eλ(x) = ei2πλ.x(x ε Ω) indexed by λ ∈ Λ ⊂ Rd. We show that such spectral pairs (Ω, Λ) have a self-similarity which may be used to generate associated fractal measures μ with Cantor set support. The Hilbert space L2(μ) does not have a total set of orthogonal frequencies, but a harmonic analysis of mu may be built instead from a natural representation of the Cuntz …
Approximation Methods For Singular Diffusions Arising In Genetics, Nacer E. Abrouk
Approximation Methods For Singular Diffusions Arising In Genetics, Nacer E. Abrouk
Mathematical Sciences Technical Reports (MSTR)
Stochastic models in population genetics leading to diffusion equations are considered. When the drift and the square of the diffusion coefficients are polynomials, an infinite system of ordinary differential equations for the moments of the diffusion process can be derived using the Martingale property. An example is provided to show how the classical Fokker-Planck Equation approach may not be appropriate for this derivation. A Gauss-Galerkin method for approximating the laws of the diffusion, originally proposed by Dawson (1980), is examined. In the few special cases for which exact solutions are known, comparison shows that the method is accurate and the …
Tracking Plasma Lactate Concentration In Vivo With A Catheter-Tip L-Lactate Sensor, Brett T. Weinzapfel, Mark D. Ball, Lee R. Waite, Nacer E. Abrouk, Shun P. Lim
Tracking Plasma Lactate Concentration In Vivo With A Catheter-Tip L-Lactate Sensor, Brett T. Weinzapfel, Mark D. Ball, Lee R. Waite, Nacer E. Abrouk, Shun P. Lim
Mathematical Sciences Technical Reports (MSTR)
To circumvent the problems of repeated blood sampling for in vitro analysis, a catheter-tip L-lactate sensor has been developed. The sensor was tested in anesthetized pigs (n=6). The sensor in vivo tracked the lactate concentration non-linearly, seeming to obey Michaelis-Menten kinetics. Calibration time was short, typically 1.5 min per lactate standard. Furthermore, time drift was small, typically -1.3% to -3.3% per hour of in vivo use.
Dynamic Id3: A Symbolic Learning Algorithm For Many-Valued Attribute Domains, Roger Gallion, Chaman Sabharwal, Daniel C. St. Clair, William E. Bond
Dynamic Id3: A Symbolic Learning Algorithm For Many-Valued Attribute Domains, Roger Gallion, Chaman Sabharwal, Daniel C. St. Clair, William E. Bond
Computer Science Faculty Research & Creative Works
Quinlan's ID3 machine learning algorithm induces classification trees (rules) from a set of training examples. The algorithm is extremely effective when training examples are composed of attributes whose values are taken from small discrete domains. The classification accuracy of ID3-produced trees on domains whose attributes are many-valued tends to be marginal due to the large number of possible values which may be associated with each attribute. Attempts to solve this problem by a priori grouping of attribute values into distinct subsets has met with limited success. The dynamic ID3 algorithm improves the performance of ID3 on this type of problem …
Modeling And Analysis For Laser Beam Induced Current Images In Semiconductors, Weifu Fang, Stavros Busenberg, Kazufumi Ito
Modeling And Analysis For Laser Beam Induced Current Images In Semiconductors, Weifu Fang, Stavros Busenberg, Kazufumi Ito
Mathematics and Statistics Faculty Publications
A mathematical model is developed for the new nondestructive optical technique called laser-beam-induced currents (LBIC), which can be used to detect electrically active regions and defects in semiconductors. The wellposedness of the model equations is shown, and an approximate model that simplifies the numerical implementation of the identification problem is obtained. Some numerical results are presented to show that the approximate model preserves the significant features that the LBIC technique has been experimentally shown to possess.
The Full Group Of A Countable Measurable Equivalence Relation, Richard Mercer
The Full Group Of A Countable Measurable Equivalence Relation, Richard Mercer
Mathematics and Statistics Faculty Publications
We study the group of all ''R-automorphisms'' of a countable equivalence relation R on a standard Borel space, special Borel automorphisms whose graphs lie in R. We show that such a group always contains periodic maps of each order sufficient to generate R. A construction based on these periodic maps leads to totally nonperiodic R-automorphisms all of whose powers have disjoint graphs. The presence of a large number of periodic maps allows us to present a version of the Rohlin Lemma for R-automorphisms. Finally we show that this group always contains copies of free …
Feasibility Test Verification Method For Nonsymmetric Release Time Task Scheduling, R. G. Karl, T. L. Lo, Daniel C. St. Clair
Feasibility Test Verification Method For Nonsymmetric Release Time Task Scheduling, R. G. Karl, T. L. Lo, Daniel C. St. Clair
Mathematics and Statistics Faculty Research & Creative Works
This paper discusses problems associated with scheduling periodic task on a uniprocessor in a hard, real-time processing environment using a static-priority, preemptive-resume operating system. Task sets containing a single periodic task with two Ned release periocis of unequal length are examined. Ihe nonsymmetric scheduling algorithm is based on the rate monotonic scheduling algorithm which assigns higher task priorities to tasks with shorter release periods. me effects on processor utilization using two dirkrent priority assignment schemes are examined; one with task priorities sorted by the average release periods and the other with priorities sorted using the short nonsymmetric task period with …
Fixed Points For Pairs Of Mappings In D-Complete Topological Spaces, Troy L. Hicks, B. E. Rhoades
Fixed Points For Pairs Of Mappings In D-Complete Topological Spaces, Troy L. Hicks, B. E. Rhoades
Mathematics and Statistics Faculty Research & Creative Works
Several important metric space fixed point theorems axe proved for a large class of non-metric spaces. In some cases, the metric space proofs need only minor changes. This is surprising since the distance function used need not be symmetric and need not satisfy the triangular inequality. © 1993, Hindawi Publishing Corporation. All rights reserved.
The Next Linear Collider Test Accelerator, R. D. Ruth, C. Adolphsen, K. Bane, R. F. Boyce, D. L. Burke, R. Calin, G. Caryotakis, R. Cassel, Stephen L. Clark, H. Deruyter, K. Fant, R. Fuller, S. Heifets, H. Hoag, R. Humphrey, S. Kheifets, R. Koontz, N. M. Kroll, R. T. Lavine, G. A. Loew, A. Menegat, R. H. Miller, C. Nantista, J. M. Patterson, C. Pearson, R. Phillips, J. Rifkin, J. Spencer, S. Tantawi, K. A. Thompson, A. Vlieks, V. Vylet, J. W. Wang, P. B. Wilson, A. Yeremian, B. Youngman
The Next Linear Collider Test Accelerator, R. D. Ruth, C. Adolphsen, K. Bane, R. F. Boyce, D. L. Burke, R. Calin, G. Caryotakis, R. Cassel, Stephen L. Clark, H. Deruyter, K. Fant, R. Fuller, S. Heifets, H. Hoag, R. Humphrey, S. Kheifets, R. Koontz, N. M. Kroll, R. T. Lavine, G. A. Loew, A. Menegat, R. H. Miller, C. Nantista, J. M. Patterson, C. Pearson, R. Phillips, J. Rifkin, J. Spencer, S. Tantawi, K. A. Thompson, A. Vlieks, V. Vylet, J. W. Wang, P. B. Wilson, A. Yeremian, B. Youngman
Mathematics and Statistics Faculty Research & Creative Works
During the past several years, there has been tremendous progress on the development of the RF system and accelerating structures for a Next Linear Collider (NLC). Developments include high-power klystrons, RF pulse compression systems and damped/detuned accelerator structures to reduce wakefields. In order to integrate these separate development efforts into an actual X-band accelerator capable of accelerating the electron beams necessary for an NLC, we are building an NLC Test Accelerator (NLCTA). The goal of the NLCTA is to bring together all elements of the entire accelerating system by constructing and reliably operating an engineered model of a high-gradient linac …
On Infinite Delay Integral Equations Having Nonlinear Perturbations, Muhammad Islam
On Infinite Delay Integral Equations Having Nonlinear Perturbations, Muhammad Islam
Mathematics Faculty Publications
The existence of bounded solutions and periodic solutions is studied for a system of infinite delay integral equations having nonlinear perturbations. An equivalent system of equations is obtained in terms of the resolvent kernel. Then the existence results are shown for the equivalent equations. Contraction principle, Schauder’s fixed point theorem, and monotone method are used in the study.
Prediction Intervals Based On Partial Observations For Some Discrete Distributions, Lee J. Bain, Jagdish K. Patel
Prediction Intervals Based On Partial Observations For Some Discrete Distributions, Lee J. Bain, Jagdish K. Patel
Mathematics and Statistics Faculty Research & Creative Works
Prediction limits of the following type are considered for the binomial, hypergeometric, and negative-binomial distributions. For the binomial distribution, suppose Xr successes have occurred in the first r trials, and based on this partial information it is desired to predict the total number of successes Xs (r < s), which will have occurred by trial s. Similar results are considered for the Poisson and negative-binomial distributions. The results are expressed in terms of well-known distributions which have been tabulated, but it is quite tedious to carry out the procedures based on available tables. Normal (Gaussian) approximations are provided which makes these methods convenient to apply. © 1993 IEEE
Computational Problems With Binomial Failure Rate Model And Incomplete Common Cause Failure Reliability Data, Paul H. Kvam
Computational Problems With Binomial Failure Rate Model And Incomplete Common Cause Failure Reliability Data, Paul H. Kvam
Department of Math & Statistics Faculty Publications
In estimating the reliability of a system of components, it is ordinarily assumed that the component lifetimes are independently distributed. This assumption usually alleviates the difficulty of analyzing complex systems, but it is seldom true that the failure of one component in an interactive system has no effect on the lifetimes of the other components. Often, two or more components will fail simultaneously due to a common cause event. Such an incident is called a common cause failure (CCF), and is now recognized as an important contribution to system failure in various applications of reliability. We examine current methods for …
Pseudobases In Direct Powers Of An Algebra, Paul Bankston
Pseudobases In Direct Powers Of An Algebra, Paul Bankston
Mathematics, Statistics and Computer Science Faculty Research and Publications
A subset P of an abstract algebra A is a pseudobasis if every function from P into A extends uniquely to an endomorphism on A. A is called K-free has a pseudobasis of cardinality K; A is minimally free if A has a pseudobasis. (The 0-free algebras are "rigid" in the strong sense; the 1-free groups are always abelian, and are precisely the additive groups of E-rings.) Our interest here is in the existence of pseudobases in direct powers AI of an algebra A. On the positive side, if A is a rigid …
Radial Symmetry Of Positive Solutions Of Nonlinear Elliptic Equations In Rn, Yi Li, Wei-Ming Ni
Radial Symmetry Of Positive Solutions Of Nonlinear Elliptic Equations In Rn, Yi Li, Wei-Ming Ni
Mathematics and Statistics Faculty Publications
No abstract provided.
On The Positive Solutions Of The Matukuma Equation, Yi Li
On The Positive Solutions Of The Matukuma Equation, Yi Li
Mathematics and Statistics Faculty Publications
No abstract provided.
Identifiability Of Semiconductor Defects From Lbic Images, Weifu Fang, Kazufumi Ito
Identifiability Of Semiconductor Defects From Lbic Images, Weifu Fang, Kazufumi Ito
Mathematics and Statistics Faculty Publications
The identifiability of defects in a semiconductor from its laser-beam-induced current (LBIC) image is studied. It is shown that the LBIC technique is reliable for detecting any spatial defects in the semiconductor material. Continuous dependence of the current measurements on the spatial defects is proved, and sensitivity is also discussed in certain cases.
An Animation System For Shift Reduce Parsers, M. S. Mandl, T. J. Sager, D. C. St. Clair
An Animation System For Shift Reduce Parsers, M. S. Mandl, T. J. Sager, D. C. St. Clair
Computer Science Technical Reports
This paper presents the design and implementation of the Parse Display Utility (POU) system. This system introduces a mechanism to augment traditional methods of exploring parsing theory by providing a PRESENTATION scheme which allows a user to view the operation of a shift-reduce parser.
The overall operation of the tool revolves around an LALR (LookAhead LR) parser/parser generator and is managed by a Graphical User-Interface (GUI) developed using Borland's Turbo Vision product. The GUI allows access to a facility which draws derivation trees in Turbo Pascal graphics. This parse tree facility utilizes an algorithm which can easily be ported to …