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

Computer Sciences Commons

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

Articles 1 - 4 of 4

Full-Text Articles in Computer Sciences

Monte Carlo Simulations Of Coupled Transient Seepage Flow And Compressive Stress In Levees, Fred Thomas Tracy, Ghada Ellithy, Jodi L. Ryder, Martin T. Schultz, Benjamin R. Breland, T. Chris Massey, Maureen K. Corcoran Jan 2020

Monte Carlo Simulations Of Coupled Transient Seepage Flow And Compressive Stress In Levees, Fred Thomas Tracy, Ghada Ellithy, Jodi L. Ryder, Martin T. Schultz, Benjamin R. Breland, T. Chris Massey, Maureen K. Corcoran

Publications

The purpose of this research is to compare the results from two different computer programs of flow analyses of two levees at Port Arthur, Texas where rising water of a flood from Hurricane Ike occurred on the levees. The first program (Program 1) is a two-dimensional (2-D) transient finite element program that couples the conservation of mass flow equation with accompanying hydraulic boundary conditions with the conservation of force equations with accompanying x and y displacement and force boundary conditions, thus yielding total head, x displacement, and y displacement as unknowns at each finite element node. The second program (Program …


Alpha Insurance: A Predictive Analytics Case To Analyze Automobile Insurance Fraud Using Sas Enterprise Miner (Tm), Richard Mccarthy, Wendy Ceccucci, Mary Mccarthy, Leila Halawi Apr 2019

Alpha Insurance: A Predictive Analytics Case To Analyze Automobile Insurance Fraud Using Sas Enterprise Miner (Tm), Richard Mccarthy, Wendy Ceccucci, Mary Mccarthy, Leila Halawi

Publications

Automobile Insurance fraud costs the insurance industry billions of dollars annually. This case study addresses claim fraud based on data extracted from Alpha Insurance’s automobile claim database. Students are provided the business problem and data sets. Initially, the students are required to develop their hypotheses and analyze the data. This includes identification of any missing or inaccurate data values and outliers as well as evaluation of the 22 variables. Next students will develop and optimize their predictive models using five techniques: regression, decision tree, neural network, gradient boosting, and ensemble. Then students will determine which model is the best fit …


Signal Flow Graph Approach To Efficient Dst I-Iv Algorithms, Sirani M. Perera Jan 2016

Signal Flow Graph Approach To Efficient Dst I-Iv Algorithms, Sirani M. Perera

Publications

In this paper, fast and efficient discrete sine transformation (DST) algorithms are presented based on the factorization of sparse, scaled orthogonal, rotation, rotation-reflection, and butterfly matrices. These algorithms are completely recursive and solely based on DST I-IV. The presented algorithms have low arithmetic cost compared to the known fast DST algorithms. Furthermore, the language of signal flow graph representation of digital structures is used to describe these efficient and recursive DST algorithms having (n�1) points signal flow graph for DST-I and n points signal flow graphs for DST II-IV.


A Fast Algorithm For The Inversion Of Quasiseparable Vandermonde-Like Matrices, Sirani M. Perera, Grigory Bonik, Vadim Olshevsky Jan 2014

A Fast Algorithm For The Inversion Of Quasiseparable Vandermonde-Like Matrices, Sirani M. Perera, Grigory Bonik, Vadim Olshevsky

Publications

The results on Vandermonde-like matrices were introduced as a generalization of polynomial Vandermonde matrices, and the displacement structure of these matrices was used to derive an inversion formula. In this paper we first present a fast Gaussian elimination algorithm for the polynomial Vandermonde-like matrices. Later we use the said algorithm to derive fast inversion algorithms for quasiseparable, semiseparable and well-free Vandermonde-like matrices having O(n2) complexity. To do so we identify structures of displacement operators in terms of generators and the recurrence relations(2-term and 3-term) between the columns of the basis transformation matrices for quasiseparable, semiseparable and well-free polynomials. Finally we …