The Asymptotic Dependence Behavior Of Ornstein-Uhlenbeck Semi-Stable Processes,
2010
Louisiana State University
The Asymptotic Dependence Behavior Of Ornstein-Uhlenbeck Semi-Stable Processes, Balram S Rajput
Communications on Stochastic Analysis
No abstract provided.
Set-Valued Stochastic Differential Equation In M-Type 2 Banach Space,
2010
Louisiana State University
Set-Valued Stochastic Differential Equation In M-Type 2 Banach Space, Itaru Mitoma, Yoshiaki Okazaki, Jinping Zhang
Communications on Stochastic Analysis
No abstract provided.
On The Non-Classical Infinite Divisibility Of Power Semicircle Distributions,
2010
Louisiana State University
On The Non-Classical Infinite Divisibility Of Power Semicircle Distributions, Octavio Arizmendi, Victor Pérez-Abreu
Communications on Stochastic Analysis
No abstract provided.
Stochastic Magneto-Hydrodynamic System Perturbed By General Noise,
2010
Louisiana State University
Stochastic Magneto-Hydrodynamic System Perturbed By General Noise, P Sundar
Communications on Stochastic Analysis
No abstract provided.
What Is A Gaussian State?,
2010
Louisiana State University
What Is A Gaussian State?, K R Parthasarathy
Communications on Stochastic Analysis
No abstract provided.
A Stochastic Finite Element Method For Stochastic Parabolic Equations Driven By Purely Spatial Noise,
2010
Louisiana State University
A Stochastic Finite Element Method For Stochastic Parabolic Equations Driven By Purely Spatial Noise, Chia Ying Lee, Boris Rozovskii
Communications on Stochastic Analysis
No abstract provided.
Perspective On Mathematical Modeling,
2010
Dordt College
On The Characteristic Polynomial Of Regular Linear Matrix Pencil,
2010
Georgia Southern University
On The Characteristic Polynomial Of Regular Linear Matrix Pencil, Yan Wu, Phillip Lorren
Mathematical Sciences: Faculty Publications
Linear matrix pencil, denoted by (A,B), plays an important role in control systems and numerical linear algebra. The problem of finding the eigenvalues of (A,B) is often solved numerically by using the well-known QZ method. Another approach for exploring the eigenvalues of (A,B) is by way of its characteristic polynomial, P(λ)=A − λB. There are other applications of working directly with the characteristic polynomial, for instance, using Routh-Hurwitz analysis to count the stable roots of P(λ) and transfer function representation of control systems governed by differential-algebraic equations. In this paper, we …
Morphological Study Of Surface Corrosion In Carbon Steel Using Fractal Methods.,
2010
Universiti Malaya
Morphological Study Of Surface Corrosion In Carbon Steel Using Fractal Methods., Abdul Mohaimen W Fagri
Student Works (2010-2019)
Corrosion can be defined as the disintegration of a material into its constituent atoms due to chemical reactions with its surroundings. There are various chemical and physical factors that affect the rate and mechanisms of corrosion processes. In this study, we focus on the corrosion of carbon steel in mineral water at room temperature. The morphologies of corroded surface are characterized using fractal analysis. The steel plates of 10cmx10cmx0.2cm are first polished using abrasive papers of different coarseness until smooth surfaces are obtained. The samples are placed in glass dish filled with mineral water and a simple imaging procedure using …
Wavelet Transform Of Fractional Integrals For Integrable Boehmians,
2010
J. N. V. University
Wavelet Transform Of Fractional Integrals For Integrable Boehmians, Deshna Loonker, P. K. Banerji, S. L. Kalla
Applications and Applied Mathematics: An International Journal (AAM)
The present paper deals with the wavelet transform of fractional integral operator (the Riemann- Liouville operators) on Boehmian spaces. By virtue of the existing relation between the wavelet transform and the Fourier transform, we obtained integrable Boehmians defined on the Boehmian space for the wavelet transform of fractional integrals.
Convergence Of The Sinc Method Applied To Volterra Integral Equations,
2010
University of Mohaghegh Ardabili
Convergence Of The Sinc Method Applied To Volterra Integral Equations, M. Zarebnia, J. Rashidinia
Applications and Applied Mathematics: An International Journal (AAM)
A collocation procedure is developed for the linear and nonlinear Volterra integral equations, using the globally defined Sinc and auxiliary basis functions. We analytically show the exponential convergence of the Sinc collocation method for approximate solution of Volterra integral equations. Numerical examples are included to confirm applicability and justify rapid convergence of our method.
An Efficient Technique For Solving Special Integral Equations,
2010
University of Guilan
An Efficient Technique For Solving Special Integral Equations, Jafar Biazar, Mostafa Eslami
Applications and Applied Mathematics: An International Journal (AAM)
In this paper, we apply a new technique for solving two-dimensional integral equations of mixed type. Comparisons are made between the homotopy perturbation method and the new technique. The results reveal that the new technique is effective and convenient.
The Teaching Of Equation Solving: Approaches In Standards-Based And Traditional Curricula In The United States,
2010
University of Delaware
The Teaching Of Equation Solving: Approaches In Standards-Based And Traditional Curricula In The United States, Jinfa Cai, Bikai Nie, John Moyer
Mathematics, Statistics and Computer Science Faculty Research and Publications
This paper discusses the approaches to teaching linear equation solving that are embedded in a Standards-based mathematics curriculum (Connected Mathematics Program or CMP) and in a traditional mathematics curriculum (Glencoe Mathematics) in the United States. Overall, the CMP curriculum takes a functional approach to teaching equation solving, while Glencoe Mathematics takes a structural approach. The functional approach emphasizes the important ideas of change and variation in situations and contexts. It also emphasizes the representation of relationships between variables. The structural approach, on the other hand, requires students to work abstractly with symbols and follow procedures in a systematic way. …
Modeling With Bivariate Geometric Distributions,
2010
New Jersey Institute of Technology
Modeling With Bivariate Geometric Distributions, Jing Li
Dissertations
This dissertation studied systems with several components which were subject to different types of failures. Systems with two components having frequency counts in the domain of positive integers, and the survival time of each component following geometric or mixture geometric distribution can be classified into this category. Examples of such systems include twin engines of an airplane and the paired organs in a human body. It was found that such a system, using conditional arguments, can be characterized as multivariate geometric distributions. It was proved that these characterizations of the geometric models can be achieved using conditional probabilities, conditional failure …
Group Frames And Partially Ranked Data,
2010
Harvey Mudd College
Group Frames And Partially Ranked Data, Kwang B. Ketcham
HMC Senior Theses
We give an overview of finite group frames and their applications to calculating summary statistics from partially ranked data, drawing upon the work of Rachel Cranfill (2009). We also provide a summary of the representation theory of compact Lie groups. We introduce both of these concepts as possible avenues beyond finite group representations, and also to suggest exploration into calculating summary statistics on Hilbert spaces using representations of Lie groups acting upon those spaces.
Combinatorial Proofs Using Complex Weights,
2010
Harvey Mudd College
Combinatorial Proofs Using Complex Weights, Bo Chen
HMC Senior Theses
In 1961, Kasteleyn, Fisher, and Temperley gave a result for the number of possible tilings of a 2m 2n checkerboard with dominoes. Their proof involves the evaluation of a complicated Pfaffian. In this thesis we investigate combinatorial strategies to evaluate the sum of evenly spaced binomial coefficients, and present steps towards a purely combinatorial proof of the 1961 result.
Optimizing Restaurant Reservation Scheduling,
2010
Harvey Mudd College
Optimizing Restaurant Reservation Scheduling, Jacob Feldman
HMC Senior Theses
We consider a yield-management approach to determine whether a restaurant should accept or reject a pending reservation request. This approach was examined by Bossert (2009), where the decision for each request is evaluated by an approximate dynamic program (ADP) that bases its decision on a realization of future demand. This model only considers assigning requests to their desired time slot. We expand Bossert's ADP model to incorporate an element of flexibility that allows requests to be assigned to a time slot that differs from the customer's initially requested time. To estimate the future seat utilization given a particular decision, a …
Arithmetic On Specializable Continued Fractions,
2010
Harvey Mudd College
Arithmetic On Specializable Continued Fractions, Ross C. Merriam
HMC Senior Theses
No abstract provided.
Understanding Voting For Committees Using Wreath Products,
2010
Harvey Mudd College
Understanding Voting For Committees Using Wreath Products, Stephen C. Lee
HMC Senior Theses
In this thesis, we construct an algebraic framework for analyzing committee elections. In this framework, module homomorphisms are used to model positional voting procedures. Using the action of the wreath product group S2[Sn] on these modules, we obtain module decompositions which help us to gain an understanding of the module homomorphism. We use these decompositions to construct some interesting voting paradoxes.
Computational Feasibility Of Increasing The Visibility Of Vertices In Covert Networks,
2010
Harvey Mudd College
Computational Feasibility Of Increasing The Visibility Of Vertices In Covert Networks, Yaniv J. Ovadia
HMC Senior Theses
Disrupting terrorist and other covert networks requires identifying and capturing key leaders. Previous research by Martonosi et al. (2009) defines a load metric on vertices of a covert network representing the amount of communication in which a vertex is expected to participate. They suggest that the visibility of a target vertex can be increased by removing other, more accessible members of the network. This report evaluates the feasibility of efficiently calculating the optimal subset of vertices to remove. We begin by proving that the general problem of identifying the optimally load maximizing vertex set removal is NP-complete. We then consider …
