Physical Sciences and Mathematics Commons^™

Constructions And Analyses Of Efficient Symmetric-Key Primitives For Authentication And Encryption., Sebati Ghosh Dr.

Doctoral Theses

In symmetric key cryptography there are two fundamental objectives, viz. 1. confidentiality or secrecy of message from unexpected party and 2. authentication of message which includes authenticating the source of the message as well as integrity of the message against any unwanted modification. Let us first concentrate on confidentiality. In classical symmetric key cryptography two parties, say Alice and Bob, first secretly exchange a key-pair (e, d). Later, if Alice wishes to send a secret message m ∈ M to Bob, she computes c = Ee(m) and transmits c to Bob. Upon receiving c, Bob computes Dd(c) = m and …

Computing Well-Structured Subgraphs In Geometric Intersection Graphs., Satyabrata Jana Dr.

Doctoral Theses

For a set of geometric objects, the associative geometric intersection graph is the graph with a vertex for each object and an edge between two vertices if and only if the corresponding objects intersect. Geometric intersection graphs are very important due to their theoretical properties and applicability. Based on the different geometric objects, several types of geometric intersection graphs are defined. Given a graph G, an induced (either vertex or edge) subgraph H ⊆ G is said to be an well-structured subgraph if H satisfies certain properties among the vertices in H. This thesis studies some well-structured subgraphs finding problems …

Data Ethics: An Investigation Of Data, Algorithms, And Practice, Gabrialla S. Cockerell

Honors Projects

This paper encompasses an examination of defective data collection, algorithms, and practices that continue to be cycled through society under the illusion that all information is processed uniformly, and technological innovation consistently parallels societal betterment. However, vulnerable communities, typically the impoverished and racially discriminated, get ensnared in these harmful cycles due to their disadvantages. Their hindrances are reflected in their information due to the interconnectedness of data, such as race being highly correlated to wealth, education, and location. However, their information continues to be analyzed with the same measures as populations who are not significantly affected by racial bias. Not …

Data And Algorithmic Modeling Approaches To Count Data, Andraya Hack

Honors College Theses

Various techniques are used to create predictions based on count data. This type of data takes the form of a non-negative integers such as the number of claims an insurance policy holder may make. These predictions can allow people to prepare for likely outcomes. Thus, it is important to know how accurate the predictions are. Traditional statistical approaches for predicting count data include Poisson regression as well as negative binomial regression. Both methods also have a zero-inflated version that can be used when the data has an overabundance of zeros. Another procedure is to use computer algorithms, also known as …

Efficient Handover Mechanisms For Heterogeneous Networks., Shankar Kumar Ghosh Dr.

Doctoral Theses

In this thesis, some analytical frameworks have been developed to analyze the effect of different system parameters on handover performances in heterogeneous network (HetNet) and based on such frameworks, some efficient handover algorithms have been proposed. The study starts with an analytical framework to investigate the effect of resource allocation mechanisms, upper layer mobility management protocols (MMPs) and handover decision metrics on user perceived throughput. This analysis reveals that among other factors, handover decision metric plays a crucial role in determining user perceived throughput in HetNet. Subsequently, we develop two handover decision metrics for ultra dense networks (UDN) and unlicensed …

Zero-Knowledge Proof, Deniability And Their Applications In Blockchain, E-Voting And Deniable Secret Handshake Protocols., Somnath Panja Dr.

Doctoral Theses

In this thesis, we propose a cryptographic technique for an authenticated, end-to-end verifiable and secret ballot election. Currently, almost all verifiable e-voting systems require trusted authorities to perform the tallying process except for the DRE-i and DRE-ip systems. We have shown a weaknesses in the DRE-ip system and proposed a solution. We have modified the DRE-ip system so that no adversary can create and post a valid ballot on the public bulletin board without detection. We provide security proofs to prove the security properties of the proposed scheme. We propose two methods to store these ballots using blockchain and cloud …

On Class Imbalanced Learning:Design Of Non-Parametricclassifiers, Performance Indices, And Deep Oversampling Strategies., Sankha Mullick Dr.

Doctoral Theses

The relevance of classification is almost endless in the everyday application of machine learning. However, the performance of a classifier is only limited to the fulfillment of the inherent assumptions it makes about the training examples. For example, to facilitate unbiased learning a classifier is expected to be trained with an equal number of labeled data instances from all of the classes. However, in a large number of practical applications such as anomaly detection, semantic segmentation, disease prediction, etc. it may not be possible to gather an equal number of diverse training points for all the classes. This results in …

Rankings Of Mma Fighters, Michael Schaefer

All Graduate Theses, Dissertations, and Other Capstone Projects

Ranking is an essential process that allows sporting authorities to determine the relative performance of athletes. While ranking is straightforward in some sports, it is more complicated in MMA (mixed martial arts), where competition is often fragmented. This paper describes the mathematics behind four existing ranking algorithms: Elo’s System, Massey’s Method, Colley’s Method, and Google’s PageRank, and shows how to adapt them to rank MMA fighters in the UFC (Ultimate Fighting Championship). We also provide a performance analysis for each ranking method.

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 …

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

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 …

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 …

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.

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

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 …

Provable Security Of Symmetric-Key Cryptographic Schemes., Ashwin Jha Dr.

Doctoral Theses

In this thesis, we provide quantitative and/or qualitative improvements in the provable security of several symmetric-key schemes, encompassing major information security goals, viz. data authentication, encryption, and authenticated encryption.AUTHENTICATION AND INTEGRITY: Among authentication schemes, we analyze the CBC-MAC family and counter-based MACs (XMACC, XMACR, PCS, LightMAC etc.), referred as the XMAC family. First, we revisit the security proofs for CBC-MAC and EMAC, and identify a critical flaw in the state-of-the-art results. We revise the security proofs and obtain significantly better bounds in case of EMAC, ECBC and FCBC. Second, we study the security of CBC-MAC family, when the underlying primitive …

Mechanism Design In Sequencing Problems., Parikshit De Dr.

Doctoral Theses

Collective decision making is an important social issue, since it depends on individual preferences that are not publicly observable. Therefore, the question is, whether it is possible to elicit the private information available to individuals and then how to extract the private information in various strategic environment; Mechanism design deals with these questions. The difference between game theory and mechanism design is that, the former tries to predict the outcome of a strategic environment in some “equilibrium” but the latter tries to design or restrict the environment in such a way that the desired objective is attained, that is, the …

Generalized Differential Calculus And Applications To Optimization, R. Blake Rector

Dissertations and Theses

This thesis contains contributions in three areas: the theory of generalized calculus, numerical algorithms for operations research, and applications of optimization to problems in modern electric power systems. A geometric approach is used to advance the theory and tools used for studying generalized notions of derivatives for nonsmooth functions. These advances specifically pertain to methods for calculating subdifferentials and to expanding our understanding of a certain notion of derivative of set-valued maps, called the coderivative, in infinite dimensions. A strong understanding of the subdifferential is essential for numerical optimization algorithms, which are developed and applied to nonsmooth problems in operations …

Computational Algorithms For Improved Representation Of The Model Error Covariance In Weak-Constraint 4d-Var, Jeremy A. Shaw

Dissertations and Theses

Four-dimensional variational data assimilation (4D-Var) provides an estimate to the state of a dynamical system through the minimization of a cost functional that measures the distance to a prior state (background) estimate and observations over a time window. The analysis fit to each information input component is determined by the specification of the error covariance matrices in the data assimilation system (DAS). Weak-constraint 4D-Var (w4D-Var) provides a theoretical framework to account for modeling errors in the analysis scheme. In addition to the specification of the background error covariance matrix, the w4D-Var formulation requires information on the model error statistics and …

Normal Surfaces And 3-Manifold Algorithms, Josh D. Hews

Honors Theses

This survey will develop the theory of normal surfaces as they apply to the S3 recognition algorithm. Sections 2 and 3 provide necessary background on manifold theory. Section 4 presents the theory of normal surfaces in triangulations of 3-manifolds. Section 6 discusses issues related to implementing algorithms based on normal surfaces, as well as an overview of the Regina, a program that implements many 3-manifold algorithms. Finally section 7 presents the proof of the 3-sphere recognition algorithm and discusses how Regina implements the algorithm.

Some Contemporary Issues In Software Reliability., Vignesh Subrahmaniam Dr.

Doctoral Theses

No abstract provided.

Partitions Of Finite Frames, James Michael Rosado

Theses and Dissertations

An open question stated by Marcus, Spielman, and Srivastava [10] asks "whether one can design an efficient algorithm to find the partitions guaranteed by Corollary 1.5." This corollary states that given a set of vectors in C whose outer products sum to the identity there exists a partition of these vectors such that norms of the outer-product sums of each subset satisfy an inequality bound. Here particular types of vector sets called finite frames are analyzed and constructed to satisfy the inequality described in Corollary 1.5. In this thesis, rigorous proofs and formulations of outer-product norms are utilized to find …

Digital Circles And Balls: Characterization, Properties, And Applications To Image Analysis., Sahadev Bera Dr.

Doctoral Theses

In this thesis, we have reported some new theoretical findings, empirical formulations, useful heuristics, and efficient algorithms related to digital circle, digital disc, and digital sphere, along with their practical applications to the analysis of geometric information embedded in a digital image. Detecting digital circles and circular arcs from a digital image is very important in shape recognition. Several image processing techniques were proposed over the years to extract circles and circular arc from a digital image and to interpret related issues. We have proposed a novel technique for the segmentation of a digital circle, which is based on a …

Some Results On Analysis And Implementation Of Hc-128 Stream Cipher., Shashwat Raizada Dr.

Doctoral Theses

The HC-128 stream cipher is a successful entrant in the eStream candidate list (software profile) and is the lighter variant of HC-256 stream cipher. Apart from the analysis by the designer of the cipher (Hongjun Wu) to conjecture the security of this cipher, there are only a few other observations on this cipher despite being the focus of researchers during the three phases of eStream evaluation and later efforts in the community. Till date none of the security claims in favor of HC-128 by the designer could be broken. One may expect HC-128 stream cipher to be popular in commercial …

On The Analysis Of Some Recursive Equations In Probability., Arunangshu Biswas Dr.

Doctoral Theses

This thesis deals with recursive systems used in theoretical and applied probability. Recursive systems are stochastic processes {Xn}n≥1 where the Xn depends on the earlier Xn−1 and also on some increment process which is uncorrelated with the process Xn. The simplest example of a recursive system is the Random Walk, whose properties have been extensively studied. Mathematically a recursive system takes the form Xn = f(Xn−1, n), is the increment/ innovation procedure and f(·, ·) is a function on the product space of xn and n. We first consider a recursive system called Self-Normalized sums (SNS) corresponding to a sequence …

On Supervised And Unsupervised Methodologies For Mining Of Text Data., Tanmay Basu Dr.

Doctoral Theses

The supervised and unsupervised methodologies of text mining using the plain text data of English language have been discussed. Some new supervised and unsupervised methodologies have been developed for effective mining of the text data after successfully overcoming some limitations of the existing techniques.The problems of unsupervised techniques of text mining, i.e., document clustering methods are addressed. A new similarity measure between documents has been designed to improve the accuracy of measuring the content similarity between documents. Further, a hierarchical document clustering technique is designed using this similarity measure. The main significance of the clustering algorithm is that the number …

Sensitivity Of Mixed Models To Computational Algorithms Of Time Series Data, Gunaime Nevine

Doctoral Dissertations

Statistical analysis is influenced by implementation of the algorithms used to execute the computations associated with various statistical techniques. Over many years; very important criteria for model comparison has been studied and examined, and two algorithms on a single dataset have been performed numerous times. The goal of this research is not comparing two or more models on one dataset, but comparing models with numerical algorithms that have been used to solve them on the same dataset.

In this research, different models have been broadly applied in modeling and their contrasting which are affected by the numerical algorithms in different …

Generic Constructions Of Different Cryptographic Primitives Over Various Public Key Paradigms., Sumit Kumar Pandey Dr.

Doctoral Theses

In this thesis, we study the generic construction of some cryptographic primitives over various public key paradigms like traditional Public Key Cryptosystems and Identity Based Cryptosystems. It can be broadly divided into two categories1. Generic construction of some highly secure cryptographic primitives from less secure cryptographic primitives, and2. Generic construction of some complex cryptographic primitives from basic cryptographic primitives. Mathematical tools provide a way to achieve cryptographic functionality like confidentiality, authentication, data-integrity, non-repudiation etc., but in the case of complex cryptographic functionality like achieving confidentiality and authentication at the same time or confidentiality, authentication and non-repudiation at the same time …

Computing Intersection Multiplicity Via Triangular Decomposition, Paul Vrbik

Electronic Thesis and Dissertation Repository

Fulton’s algorithm is used to calculate the intersection multiplicity of two plane curves about a rational point. This work extends Fulton’s algorithm first to algebraic points (encoded by triangular sets) and then, with some generic assumptions, to l many hypersurfaces.

Out of necessity, we give a standard-basis free method (i.e. practically efficient method) for calculating tangent cones at points on curves.

Fast Monte Carlo Algorithms For Computing A Low-Rank Approximation To A Matrix, Vlad S. Burca

Senior Theses and Projects

Many of today's applications deal with big quantities of data; from DNA analysis algorithms, to image processing and movie recommendation algorithms. Most of these systems store the data in very large matrices. In order to perform analysis on the collected data, these big matrices have to be stored in the RAM (random-access memory) of the computing system. But this is a very expensive process since RAM is a scarce computational resource. Ideally, one would like to be able to store most of the data matrices on the memory disk (hard disk drive) while loading only the necessary parts of the …