Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Applied Mathematics (39)
- Education (19)
- Physics (17)
- Engineering (16)
- Computer Sciences (13)
-
- Algebra (10)
- Discrete Mathematics and Combinatorics (10)
- Science and Mathematics Education (9)
- Other Mathematics (8)
- Statistics and Probability (8)
- Geometry and Topology (7)
- Aerospace Engineering (6)
- Statistical, Nonlinear, and Soft Matter Physics (6)
- Aerodynamics and Fluid Mechanics (5)
- Analysis (5)
- Dynamical Systems (5)
- Educational Assessment, Evaluation, and Research (4)
- Life Sciences (4)
- Numerical Analysis and Computation (4)
- Social and Behavioral Sciences (4)
- Data Science (3)
- Electrical and Computer Engineering (3)
- Other Physics (3)
- Partial Differential Equations (3)
- Software Engineering (3)
- Teacher Education and Professional Development (3)
- Artificial Intelligence and Robotics (2)
- Biomedical Engineering and Bioengineering (2)
- Institution
- Keyword
-
- Graph theory (10)
- Dynamical systems (7)
- Numerical analysis (6)
- Mathematical modeling (5)
- Mathematics (5)
-
- False discovery rate (4)
- Fluid dynamics (4)
- Graphs (4)
- Optimization (4)
- Surfactant (4)
- Thin films (4)
- Acoustics (3)
- Archimedean copula (3)
- Asymptotics (3)
- Bifurcation (3)
- Boundary integral method (3)
- Chaos (3)
- Clinical trials (3)
- Combinatorics (3)
- Domination (3)
- Familywise error rate (3)
- Fluids (3)
- Modeling (3)
- Multiple testing (3)
- Neuronal networks (3)
- Partial differential equations (3)
- Stability (3)
- Algebra (2)
- Algebraic topology (2)
- Bayesian (2)
- Publication Year
- Publication Type
Articles 31 - 60 of 290
Full-Text Articles in Mathematics
Parameter Selection In Fully Homomorphic Encryption Schemes And Fhe Applications, Cavidan Yakupoglu
Parameter Selection In Fully Homomorphic Encryption Schemes And Fhe Applications, Cavidan Yakupoglu
Dissertations
Quantum computing has been gaining momentum as a result of recent technological advances. Existing cryptographic systems rely on the difficult problems that can be solved by sufficiently powerful quantum computers. As the quantum age approaches, the desire to discover new difficult problems that cannot be solved by quantum systems has increased. Lattice-based cryptography is a prominent tool for the post-quantum era that facilitates the implementation of encryption systems for practical applications.
The Learning with Error (LWE) and Ring-LWE problems introduce new lattice hardness assumptions that have been incorporated into public-key cryptosystems to facilitate the implementation of numerous privacy-enhancing applications. Fully …
Nystrom Methods For High-Order Cq Solutions Of The Wave Equation In Two Dimensions, Erli Wind-Andersen
Nystrom Methods For High-Order Cq Solutions Of The Wave Equation In Two Dimensions, Erli Wind-Andersen
Dissertations
An investigation of high order Convolution Quadratures (CQ) methods for the solution of the wave equation in unbounded domains in two dimensions is presented. These rely on Nystrom discretizations for the solution of the ensemble of associated Laplace domain modified Helmholtz problems. Two classes of CQ discretizations are considered: one based on linear multistep methods and the other based on Runge-Kutta methods. Both are used in conjunction with Nystrom discretizations based on Alpert and QBX quadratures of Boundary Integral Equation (BIE) formulations of the Laplace domain Helmholtz problems with complex wavenumbers. CQ in conjunction with BIE is an excellent candidate …
Type I Error Rate Controlling Procedures For Multiple Hypotheses Testing, Beibei Li
Type I Error Rate Controlling Procedures For Multiple Hypotheses Testing, Beibei Li
Dissertations
This dissertation addresses several different but related topics arising in the field of multiple testing, including weighted procedures and graphical approaches for controlling the familywise error rate (FWER), and stepwise procedures with control of the false discovery rate (FDR) for discrete data. It consists of three major parts.
The first part investigates weighted procedures for controlling the FWER. In many statistical applications, hypotheses may be differentially weighted according to their different importance. Many weighted multiple testing procedures (wMTPs) have been developed for controlling the FWER. Among these procedures, two weighted Holm procedures are commonly used in practice: one is based …
A New Model For Predicting The Drag And Lift Forces Of Turbulent Newtonian Flow On Arbitrarily Shaped Shells On The Seafloor, Carley R. Walker, James V. Lambers, Julian Simeonov
A New Model For Predicting The Drag And Lift Forces Of Turbulent Newtonian Flow On Arbitrarily Shaped Shells On The Seafloor, Carley R. Walker, James V. Lambers, Julian Simeonov
Dissertations
Currently, all forecasts of currents, waves, and seafloor evolution are limited by a lack of fundamental knowledge and the parameterization of small-scale processes at the seafloor-ocean interface. Commonly used Euler-Lagrange models for sediment transport require parameterizations of the drag and lift forces acting on the particles. However, current parameterizations for these forces only work for spherical particles. In this dissertation we propose a new method for predicting the drag and lift forces on arbitrarily shaped objects at arbitrary orientations with respect to the direction of flow that will ultimately provide models for predicting the sediment sorting processes that lead to …
Irregular Orbital Domination In Graphs, Peter E. Broe
Irregular Orbital Domination In Graphs, Peter E. Broe
Dissertations
In recent decades, domination in graphs has become a popular area of study due in large degree to its applications to modern society and the mathematical beauty of the topic. While this area evidently began with the work of Claude Berge in 1958 and of Oystein Ore in 1962, domination did not become an active area of research until 1977 with the appearance of a survey paper by Ernest Cockayne and Stephen Hedetniemi. Since then a large number of variations of domination have surfaced and provided numerous applications to different areas of science and real-life problems. Among these variations are …
Model Checks For Two-Sample Location-Scale, Atefeh Javidialsaadi
Model Checks For Two-Sample Location-Scale, Atefeh Javidialsaadi
Dissertations
Two-sample location-scale refers to a model that permits a pair of standardized random variables to have a common distribution. This means that if X1 and X2 are two random variables with means µ1 and µ2 and standard deviations ?1 and ?2, then (X1 - µ1)/?1 and (X2 - µ2)/?2 have some common unspecified standard or base distribution F0. Function-based hypothesis testing for these models refers to formal tests that would help determine whether or not two samples may have come from some location-scale …
Dependent Censoring In Survival Analysis, Zhongcheng Lin
Dependent Censoring In Survival Analysis, Zhongcheng Lin
Dissertations
This dissertation mainly consists of two parts. In the first part, some properties of bivariate Archimedean Copulas formed by two time-to-event random variables are discussed under the setting of left censoring, where these two variables are subject to one left-censored independent variable respectively. Some distributional results for their joint cdf under different censoring patterns are presented. Those results are expected to be useful in both model fitting and checking procedures for Archimedean copula models with bivariate left-censored data. As an application of the theoretical results that are obtained, a moment estimator of the dependence parameter in Archimedean copula models is …
On Non-Linear Network Embedding Methods, Huong Yen Le
On Non-Linear Network Embedding Methods, Huong Yen Le
Dissertations
As a linear method, spectral clustering is the only network embedding algorithm that offers both a provably fast computation and an advanced theoretical understanding. The accuracy of spectral clustering depends on the Cheeger ratio defined as the ratio between the graph conductance and the 2nd smallest eigenvalue of its normalizedLaplacian. In several graph families whose Cheeger ratio reaches its upper bound of Theta(n), the approximation power of spectral clustering is proven to perform poorly. Moreover, recent non-linear network embedding methods have surpassed spectral clustering by state-of-the-art performance with little to no theoretical understanding to back them.
The dissertation includes work …
Modeling Dewetting, Demixing, And Thermal Effects In Nanoscale Metal Films, Ryan Howard Allaire
Modeling Dewetting, Demixing, And Thermal Effects In Nanoscale Metal Films, Ryan Howard Allaire
Dissertations
Thin film dynamics, particularly on the nanoscale, is a topic of extensive interest. The process by which thin liquids evolve is far from trivial and can lead to dewetting and drop formation. Understanding this process involves not only resolving the fluid mechanical aspects of the problem, but also requires the coupling of other physical processes, including liquid-solid interactions, thermal transport, and dependence of material parameters on temperature and material composition. The focus of this dissertation is on the mathematical modeling and simulation of nanoscale liquid metal films, which are deposited on thermally conductive substrates, liquefied by laser heating, and subsequently …
Modeling And Design Optimization For Membrane Filters, Yixuan Sun
Modeling And Design Optimization For Membrane Filters, Yixuan Sun
Dissertations
Membrane filtration is widely used in many applications, ranging from industrial processes to everyday living activities. With growing interest from both industrial and academic sectors in understanding the various types of filtration processes in use, and in improving filter performance, the past few decades have seen significant research activity in this area. Experimental studies can be very valuable, but are expensive and time-consuming, therefore theoretical studies offer potential as a cost-effective and predictive way to improve on current filter designs. In this work, mathematical models, derived from first principles and simplified using asymptotic analysis, are proposed for: (1) pleated membrane …
Characterizing Undergraduate Students’ Proving Processes Around “Stuck Points”, Yaomingxin Lu
Characterizing Undergraduate Students’ Proving Processes Around “Stuck Points”, Yaomingxin Lu
Dissertations
Learning to prove mathematical propositions is a cornerstone of mathematics as a discipline (de Villiers, 1990). However, since proving is a different mathematical activity as compared to students’ prior experience, research has also shown that many undergraduate students struggle to learn to prove, including those who major in mathematics (Moore, 1994; Selden, 2012). While the field has generated research that has analyzed the final products of proof (Selden & Selden, 2009) and there are frameworks for analyzing problem-solving processes (e.g., Carlson & Bloom, 2005; Schoenfeld, 1985, 2010), much remains to be known about analyzing undergraduate students’ proving processes. With a …
Dominating Functions In Graphs, Maria Talanda-Fisher
Dominating Functions In Graphs, Maria Talanda-Fisher
Dissertations
Domination in graphs has become one of the most popular areas of graph the- ory, no doubt due to its many fascinating problems and applications to modern society, as well as the sheer mathematical beauty of the subject. While this area evidently began with the work by the French mathematician Claude Berge in 1958 and the Norwegian-American mathematician Oystein Ore in 1962, domination did not become an active area of research until 1977 with the appearance of the survey paper by Ernest Cockayne and Stephen Hedetniemi. Since then a large number of variations of domination have surfaced and provided numerous …
Asymmetric Multivariate Archimedean Copula Models And Semi-Competing Risks Data Analysis, Ziyan Guo
Asymmetric Multivariate Archimedean Copula Models And Semi-Competing Risks Data Analysis, Ziyan Guo
Dissertations
Many multivariate models have been proposed and developed to model high dimensional data when the dimension of a data set is greater than 2 (d ≥ 3). The existing multivariate models often force the “exchangeable” structure for part or the whole model, are not very flexible which tends to be of limited use in practice. There is a demand for developing and studying multivariate models with any pre-specified bivariate margins.
Suppose there exists such a class of flexible models with any pre-specified bivariate margins. Given a multivariate data, what is the distribution function and how to easily estimate the parameters …
Mechanisms Of Oscillations And Polyglot Entrainment In Neuronal And Circadian Models, Emel Khan
Mechanisms Of Oscillations And Polyglot Entrainment In Neuronal And Circadian Models, Emel Khan
Dissertations
Entrainment is a type of synchronization in which the period of an endogenous oscillator matches the period of an external forcing signal and a stable phase relationship is maintained between them. Entrainment patterns are described in terms of the number of input oscillations (N) that are phase-locked to a number of output oscillations (M), referred to as N:M patterns. Arnold tongue diagrams are used to depict the regions of N:M entrainment patterns in the input period-amplitude parameter space. Although the entrainment of self-sustained oscillators by periodic forcing are well investigated is a well-studied problem, entrainment of damped oscillators has been …
A Component-Wise Approach To Smooth Extension Embedding Methods, Vivian Montiforte
A Component-Wise Approach To Smooth Extension Embedding Methods, Vivian Montiforte
Dissertations
Krylov Subspace Spectral (KSS) Methods have demonstrated to be highly scalable methods for PDEs. However, a current limitation of these methods is the requirement of a rectangular or box-shaped domain. Smooth Extension Embedding Methods (SEEM) use fictitious domain methods to extend a general domain to a simple, rectangular or box-shaped domain. This dissertation describes how these methods can be combined to extend the applicability of KSS methods, while also providing a component-wise approach for solving the systems of equations produced with SEEM.
From Multi-Prime To Subset Labelings Of Graphs, Bethel I. Mcgrew
From Multi-Prime To Subset Labelings Of Graphs, Bethel I. Mcgrew
Dissertations
A graph labeling is an assignment of labels (elements of some set) to the vertices or edges (or both) of a graph G. If only the vertices of G are labeled, then the resulting graph is a vertex-labeled graph. If only the edges are labeled, the resulting graph is an edge-labeled graph. The concept was first introduced in the 19th century when Arthur Cayley established Cayley’s Tree Formula, which proved that there are nn-2 distinct labeled trees of order n. Since then, it has grown into a popular research area.
In this study, we first review several types …
On Problems In Random Structures, Ryan Cushman
On Problems In Random Structures, Ryan Cushman
Dissertations
This work addresses two problems in optimizing substructures within larger random structures. In the first, we study the triangle-packing number v(G), which is the maximum size of a set of edge-disjoint triangles in a graph. In particular we study this parameter for the random graph G(n,m). We analyze a random process called the online triangle packing process in order to bound v(G). The lower bound on v(G(n,m)) that this produces allows for the verification of a conjecture of Tuza for G( …
Construct Linear Quasi-Interpolants On Infinite Intervals, Johara Farah Albaliwi
Construct Linear Quasi-Interpolants On Infinite Intervals, Johara Farah Albaliwi
Dissertations
In solving the data interpolation problem, which is fundamental in data analysis, we typically deal with the data samples spread in a finite interval [a, b], which results in the operations involving finite-dimensional matrices. There are many interesting results developed under this framework. However, when the data samples are given from an infinite interval [a, ∞) (for certain special types of real-world applications), many existing results would not work anymore due to the special properties of the infinite data samples. A new framework should be established to support the infinite data samples.
In this dissertation, we develop a special tool …
Matrix Product Structure Of A Permuted Quasi Cyclic Code And Its Dual, Perian Perdhiku
Matrix Product Structure Of A Permuted Quasi Cyclic Code And Its Dual, Perian Perdhiku
Dissertations
In my Dissertation I will work mostly with Permuted Quasi Cyclic Codes. They are a generalization of Cyclic Codes, one of the most important families of Linear Codes in Coding Theory. Linear Codes are very useful in error detection and correction. Error Detection and Correction is a technique that first detects the corrupted data sent from some transmitter over unreliable communication channels and then corrects the errors and reconstructs the original data. Unlike linear codes, cyclic codes are used to correct errors where the pattern is not clear and the error occurs in a short segment of …
Ready To Engage? Urban Middle School Teachers’ Responsiveness To Targeted Engagement Interventions On Their Virtual Instructional Practices: An Action Research Study, Svetlana Nikic
Dissertations
Teachers’ effectiveness is associated with their instructional practices and is ultimately linked to students’ learning outcomes. In order to impact teachers’ effectiveness, schools focus substantial effort and resources on professional development led by an assumption that teachers’ classroom practices can be improved through targeted interventions. Even if this premise is correct, little information is available about how much a teacher’s practice may change through interventions, or which aspects of instructional practice are more receptive to improving teacher effectiveness (Garret et al., 2019).
This study took place at an urban middle school and examined teachers’ responsiveness to targeted engagement intervention in …
Semantic, Integrated Keyword Search Over Structured And Loosely Structured Databases, Xinge Lu
Semantic, Integrated Keyword Search Over Structured And Loosely Structured Databases, Xinge Lu
Dissertations
Keyword search has been seen in recent years as an attractive way for querying data with some form of structure. Indeed, it allows simple users to extract information from databases without mastering a complex structured query language and without having knowledge of the schema of the data. It also allows for integrated search of heterogeneous data sources. However, as keyword queries are ambiguous and not expressive enough, keyword search cannot scale satisfactorily on big datasets and the answers are, in general, of low accuracy. Therefore, flat keyword search alone cannot efficiently return high quality results on large data with structure. …
Saudi Elementary Mathematics Teachers’ Knowledge For Teaching Fractions, Mona Khalifah A Aladil
Saudi Elementary Mathematics Teachers’ Knowledge For Teaching Fractions, Mona Khalifah A Aladil
Dissertations
Recent reform efforts in Saudi Arabia attend to mathematics instruction with a great deal of emphasis to improve Saudi mathematics education. Studies in different countries have confirmed that teachers’ mathematical knowledge for teaching plays an important role in mathematical quality of instruction and students’ achievement (e.g., Ball, 1990; Baumert et al., 2010; Hill, Rowan, & Ball, 2005). Yet few studies about mathematics teachers’ knowledge for teaching have been conducted in the Saudi context. This study investigates Saudi elementary mathematics teachers’ knowledge for teaching in the content strand of rational numbers with an emphasis on fractions, which is an important step …
On The Local Theory Of Profinite Groups, Mohammad Shatnawi
On The Local Theory Of Profinite Groups, Mohammad Shatnawi
Dissertations
Let G be a finite group, and H be a subgroup of G. The transfer homomorphism emerges from the natural action of G on the cosets of H. The transfer was first introduced by Schur in 1902 [22] as a construction in group theory, which produce a homomorphism from a finite group G into H/H' an abelian group where H is a subgroup of G and H' is the derived group of H. One important first application is Burnside’s normal p-complement theorem [5] in 1911, although he did not use the transfer homomorphism explicitly to prove it. …
Stochastic Delay Differential Equations With Applications In Ecology And Epidemics, Hebatallah Jamil Alsakaji
Stochastic Delay Differential Equations With Applications In Ecology And Epidemics, Hebatallah Jamil Alsakaji
Dissertations
Mathematical modeling with delay differential equations (DDEs) is widely used for analysis and predictions in various areas of life sciences, such as population dynamics, epidemiology, immunology, physiology, and neural networks. The memory or time-delays, in these models, are related to the duration of certain hidden processes like the stages of the life cycle, the time between infection of a cell and the production of new viruses, the duration of the infectious period, the immune period, and so on. In ordinary differential equations (ODEs), the unknown state and its derivatives are evaluated at the same time instant. In DDEs, however, the …
Efficient Time-Stepping Approaches For The Dispersive Shallow Water Equations, Linwan Feng
Efficient Time-Stepping Approaches For The Dispersive Shallow Water Equations, Linwan Feng
Dissertations
This dissertation focuses on developing efficient and stable (high order) time-stepping strategies for the dispersive shallow water equations (DSWE) with variable bathymetry. The DSWE extends the regular shallow water equations to include dispersive effects. Dispersion is physically important and can maintain the shape of a wave that would otherwise form a shock in the shallow water system.
In some cases, the DSWE may be simplified when the bathymetry length scales are small (or large) in relation to other length scales in the shallow water system. These simplified DSWE models, which are related to the full DSWEs, are also considered in …
Hybrid Deep Neural Networks For Mining Heterogeneous Data, Xiurui Hou
Hybrid Deep Neural Networks For Mining Heterogeneous Data, Xiurui Hou
Dissertations
In the era of big data, the rapidly growing flood of data represents an immense opportunity. New computational methods are desired to fully leverage the potential that exists within massive structured and unstructured data. However, decision-makers are often confronted with multiple diverse heterogeneous data sources. The heterogeneity includes different data types, different granularities, and different dimensions, posing a fundamental challenge in many applications. This dissertation focuses on designing hybrid deep neural networks for modeling various kinds of data heterogeneity.
The first part of this dissertation concerns modeling diverse data types, the first kind of data heterogeneity. Specifically, image data and …
Resonant Triad Interactions In One And Two-Layer Systems, Malik Chabane
Resonant Triad Interactions In One And Two-Layer Systems, Malik Chabane
Dissertations
This dissertation is a study of the weakly nonlinear resonant interactions of a triad of gravity-capillary waves in systems of one and two fluid layers of arbitrary depth, in one and two-dimentions. For one-layer systems, resonant triad interactions of gravity-capillary waves are considered and a region where resonant triads can be always found is identified, in the two-dimensional wavevector angles-space. Then a description of the variations of resonant wavenumbers and wave frequencies over the resonance region is given. The amplitude equations correct to second order in wave slope are used to investigate special resonant triads that, providing their initial amplitude …
A 3d Image-Guided System To Improve Myocardial Revascularization Decision-Making For Patients With Coronary Artery Disease, Haipeng Tang
A 3d Image-Guided System To Improve Myocardial Revascularization Decision-Making For Patients With Coronary Artery Disease, Haipeng Tang
Dissertations
OBJECTIVES. Coronary artery disease (CAD) is the most common type of heart disease and kills over 360,000 people a year in the United States. Myocardial revascularization (MR) is a standard interventional treatment for patients with stable CAD. Fluoroscopy angiography is real-time anatomical imaging and routinely used to guide MR by visually estimating the percent stenosis of coronary arteries. However, a lot of patients do not benefit from the anatomical information-guided MR without functional testing. Single-photon emission computed tomography (SPECT) myocardial perfusion imaging (MPI) is a widely used functional testing for CAD evaluation but limits to the absence of anatomical information. …
Universal Constraints Of Kleinian Groups And Hyperbolic Geometry, Hala Alaqad
Universal Constraints Of Kleinian Groups And Hyperbolic Geometry, Hala Alaqad
Dissertations
Recent advances in geometry have shown the wide application of hyperbolic geometry not only in Mathematics but also in real-world applications. As in two dimensions, it is now clear that most three-dimensional objects (configuration spaces and manifolds) are modelled on hyperbolic geometry. This point of view explains a great many things from large-scale cosmological phenomena, such as the shape of the universe, right down to the symmetries of groups and geometric objects, and various physical theories. Kleinian groups are basically discrete groups of isometries associated with tessellations of hyperbolic space. They form the fundamental groups of hyperbolic manifolds. Over the …
On Codes Over Rings: The Macwilliams Extension Theorem And The Macwilliams Identities, Noha Abdelghany
On Codes Over Rings: The Macwilliams Extension Theorem And The Macwilliams Identities, Noha Abdelghany
Dissertations
The MacWilliams extension theorem for code equivalence and the MacWilliams identities for weight enumerators of a code and its dual code are two of the most important results in classical coding theory. In this thesis, we study how much these two results could be extended to codes over more general alphabets, beyond finite fields. In particular, we study the MacWilliams extension theorem and the MacWilliams identities for codes over rings and modules equipped with general weight functions.