Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 15 of 15
Full-Text Articles in Physical Sciences and Mathematics
Secret Sharing And Its Variants, Matroids,Combinatorics., Shion Samadder Chaudhury Dr.
Secret Sharing And Its Variants, Matroids,Combinatorics., Shion Samadder Chaudhury Dr.
Doctoral Theses
The main focus of this thesis is secret sharing. Secret Sharing is a very basic and fundamental cryptographic primitive. It is a method to share a secret by a dealer among different parties in such a way that only certain predetermined subsets of parties can together reconstruct the secret while some of the remaining subsets of parties can have no information about the secret. Secret sharing was introduced independently by Shamir [139] and Blakely [20]. What they introduced is called a threshold secret sharing scheme. In such a secret sharing scheme the subsets of parties that can reconstruct a secret …
An Introduction To Calling Bullshit: Learning To Think Outside The Black Box, Jevin D. West, Carl T. Bergstrom
An Introduction To Calling Bullshit: Learning To Think Outside The Black Box, Jevin D. West, Carl T. Bergstrom
Numeracy
Bergstrom, Carl T. and Jevin D. West. 2020. Calling Bullshit: The Art of Skepticism in a Data-Driven World. (New York: Random House) 336 pp. ISBN 978-0525509202.
While statistical methods receive greater attention, the art of critically evaluating information in everyday life more commonly depends on thinking outside the black box of the algorithm. In this piece we introduce readers to our book and associated online teaching materials—for readers who want to more capably call “bullshit” or to teach their students to do the same.
Dealing With Classification Irregularities In Real-World Scenarios., Payel Sadhukhan Dr.
Dealing With Classification Irregularities In Real-World Scenarios., Payel Sadhukhan Dr.
Doctoral Theses
Data processing by the human sensory system comes naturally. This processing, commonly denoted as pattern recognition and analysis are carried out spontaneously by humans. In day to day life, in most cases, decision making by humans come without any conscious effort. From the middle of the past century, humans have shown interest to render their abstraction capabilities (pattern recognition and analysis) to the machine. The abstraction capability of the machine is ’machine intelligence’ or ’machine learning’ [87].The primary goal of machine learning methods is to extract some meaningful information from the ’data’. Data refers to the information or attributes that …
Algorithms Related To Triangle Groups, Bao The Pham
Algorithms Related To Triangle Groups, Bao The Pham
LSU Doctoral Dissertations
Given a finite index subgroup of $\PSL_2(\Z)$, one can talk about the different properties of this subgroup. These properties have been studied extensively in an attempt to classify these subgroups. Tim Hsu created an algorithm to determine whether a subgroup is a congruence subgroup by using permutations \cite{hsu}. Lang, Lim, and Tan also created an algorithm to determine if a subgroup is a congruence subgroup by using Farey Symbols \cite{llt}. Sebbar classified torsion-free congruence subgroups of genus 0 \cite{sebbar}. Pauli and Cummins computed and tabulated all congruence subgroups of genus less than 24 \cite{ps}. However, there are still some problems …
Awegnn: Auto-Parametrized Weighted Element-Specific Graph Neural Networks For Molecules., Timothy Szocinski, Duc Duy Nguyen, Guo-Wei Wei
Awegnn: Auto-Parametrized Weighted Element-Specific Graph Neural Networks For Molecules., Timothy Szocinski, Duc Duy Nguyen, Guo-Wei Wei
Mathematics Faculty Publications
While automated feature extraction has had tremendous success in many deep learning algorithms for image analysis and natural language processing, it does not work well for data involving complex internal structures, such as molecules. Data representations via advanced mathematics, including algebraic topology, differential geometry, and graph theory, have demonstrated superiority in a variety of biomolecular applications, however, their performance is often dependent on manual parametrization. This work introduces the auto-parametrized weighted element-specific graph neural network, dubbed AweGNN, to overcome the obstacle of this tedious parametrization process while also being a suitable technique for automated feature extraction on these internally complex …
The “Knapsack Problem” Workbook: An Exploration Of Topics In Computer Science, Steven Cosares
The “Knapsack Problem” Workbook: An Exploration Of Topics In Computer Science, Steven Cosares
Open Educational Resources
This workbook provides discussions, programming assignments, projects, and class exercises revolving around the “Knapsack Problem” (KP), which is widely a recognized model that is taught within a typical Computer Science curriculum. Throughout these discussions, we use KP to introduce or review topics found in courses covering topics in Discrete Mathematics, Mathematical Programming, Data Structures, Algorithms, Computational Complexity, etc. Because of the broad range of subjects discussed, this workbook and the accompanying spreadsheet files might be used as part of some CS capstone experience. Otherwise, we recommend that individual sections be used, as needed, for exercises relevant to a course in …
Studies On Diagnostic Coverage And X-Sensitivity In Logic Circuits., Manjari Pradhan Dr.
Studies On Diagnostic Coverage And X-Sensitivity In Logic Circuits., Manjari Pradhan Dr.
Doctoral Theses
Today’s integrated circuits comprise billions of interconnected transistors assembled on a tiny silicon chip, and testing them to ensure functional and timing correctness continues to be a major challenge to designers and test engineers with further downscaling of transistors. Although substantial progress has been witnessed during the last five decades in the area of algorithmic test generation and fault diagnosis, applications of combinatorial and machinelearning (ML) techniques to solve these problems remain largely unexplored till date. In this thesis, we study three problems in the context of digital logic test and diagnosis. The first problem is that of fault diagnosis …
New Characterizations Of Reproducing Kernel Hilbert Spaces And Applications To Metric Geometry, Daniel Alpay, Palle E. T. Jorgensen
New Characterizations Of Reproducing Kernel Hilbert Spaces And Applications To Metric Geometry, Daniel Alpay, Palle E. T. Jorgensen
Mathematics, Physics, and Computer Science Faculty Articles and Research
We give two new global and algorithmic constructions of the reproducing kernel Hilbert space associated to a positive definite kernel. We further present a general positive definite kernel setting using bilinear forms, and we provide new examples. Our results cover the case of measurable positive definite kernels, and we give applications to both stochastic analysis and metric geometry and provide a number of examples.
Lecture 14: Randomized Algorithms For Least Squares Problems, Ilse C.F. Ipsen
Lecture 14: Randomized Algorithms For Least Squares Problems, Ilse C.F. Ipsen
Mathematical Sciences Spring Lecture Series
The emergence of massive data sets, over the past twenty or so years, has lead to the development of Randomized Numerical Linear Algebra. Randomized matrix algorithms perform random sketching and sampling of rows or columns, in order to reduce the problem dimension or compute low-rank approximations. We review randomized algorithms for the solution of least squares/regression problems, based on row sketching from the left, or column sketching from the right. These algorithms tend to be efficient and accurate on matrices that have many more rows than columns. We present probabilistic bounds for the amount of sampling required to achieve a …
Lecture 13: A Low-Rank Factorization Framework For Building Scalable Algebraic Solvers And Preconditioners, X. Sherry Li
Lecture 13: A Low-Rank Factorization Framework For Building Scalable Algebraic Solvers And Preconditioners, X. Sherry Li
Mathematical Sciences Spring Lecture Series
Factorization based preconditioning algorithms, most notably incomplete LU (ILU) factorization, have been shown to be robust and applicable to wide ranges of problems. However, traditional ILU algorithms are not amenable to scalable implementation. In recent years, we have seen a lot of investigations using low-rank compression techniques to build approximate factorizations.
A key to achieving lower complexity is the use of hierarchical matrix algebra, stemming from the H-matrix research. In addition, the multilevel algorithm paradigm provides a good vehicle for a scalable implementation. The goal of this lecture is to give an overview of the various hierarchical matrix formats, such …
Lecture 03: Hierarchically Low Rank Methods And Applications, David Keyes
Lecture 03: Hierarchically Low Rank Methods And Applications, David Keyes
Mathematical Sciences Spring Lecture Series
As simulation and analytics enter the exascale era, numerical algorithms, particularly implicit solvers that couple vast numbers of degrees of freedom, must span a widening gap between ambitious applications and austere architectures to support them. We present fifteen universals for researchers in scalable solvers: imperatives from computer architecture that scalable solvers must respect, strategies towards achieving them that are currently well established, and additional strategies currently being developed for an effective and efficient exascale software ecosystem. We consider recent generalizations of what it means to “solve” a computational problem, which suggest that we have often been “oversolving” them at the …
Lecture 02: Tile Low-Rank Methods And Applications (W/Review), David Keyes
Lecture 02: Tile Low-Rank Methods And Applications (W/Review), David Keyes
Mathematical Sciences Spring Lecture Series
As simulation and analytics enter the exascale era, numerical algorithms, particularly implicit solvers that couple vast numbers of degrees of freedom, must span a widening gap between ambitious applications and austere architectures to support them. We present fifteen universals for researchers in scalable solvers: imperatives from computer architecture that scalable solvers must respect, strategies towards achieving them that are currently well established, and additional strategies currently being developed for an effective and efficient exascale software ecosystem. We consider recent generalizations of what it means to “solve” a computational problem, which suggest that we have often been “oversolving” them at the …
Essays In Social Choice Theory., Dipjyoti Majumdar Dr.
Essays In Social Choice Theory., Dipjyoti Majumdar Dr.
Doctoral Theses
The purpose of this thesis is to explore some issues in social choice theory and decision theory. Social choice theory provides the theoretical foundations for the field of public choice and welfare economics. It tries to bring together normative aspects like perspective value judgements and positive aspects, like strategic con- siderations. The second feature which is our focus, is closely related to the problem of providing appropriate incentives to agents, an issue of prime importance in eco- nomics.Consider for example, a set of agents who must elect one among a set of can- didates. These candidates may be physical agents …
In Silicoidentification Of Toxins And Their Effect Onhost Pathways: Feature Extraction, Classificationand Pathway Prediction., Rishika Sen Dr.
In Silicoidentification Of Toxins And Their Effect Onhost Pathways: Feature Extraction, Classificationand Pathway Prediction., Rishika Sen Dr.
Doctoral Theses
Identification of toxins, which are either proteins or small molecules, from pathogens is of paramount importance due to their crucial role as first-line invaders infiltrating a host, often leading to infection of the host. These toxins can affect specific proteins, like enzymes that catalyze metabolic pathways, affect metabolites that form the basis of metabolic reactions, and prevent the progression of those pathways, or more generally they may affect the regular functioning of other proteins in signaling pathways in the host. In this regard, the thesis addresses the problem of identification of toxins, and the effect of perturbations by toxins on …
Predicting Carcass Cut Yields In Cattle From Digitalimages Using Artificial Intelligence, Darragh Matthews
Predicting Carcass Cut Yields In Cattle From Digitalimages Using Artificial Intelligence, Darragh Matthews
Theses
Beef carcass classification in Europe is predicated on the EUROP grid for both fatness and conformation. Although this system performs well for grouping visually similar carcasses, it cannot be used to accurately predict meat yields from these groups, especially when considered on an individual cut level. Deep Learning (DL) has proven to be a successful tool for many image classification problems but has yet to be fully proven in a regression scenario using carcass images. Here we have trained DL models to predict carcass cut yields and compared predictions to more standard machine learning (ML) methods. Three approaches were undertaken …