Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (2)
- Data Science (2)
- Theory and Algorithms (2)
- American Studies (1)
- Analysis (1)
-
- Applied Mathematics (1)
- Artificial Intelligence and Robotics (1)
- Arts and Humanities (1)
- Control Theory (1)
- Criminology (1)
- Numerical Analysis and Computation (1)
- Numerical Analysis and Scientific Computing (1)
- Other American Studies (1)
- Other Applied Mathematics (1)
- Place and Environment (1)
- Programming Languages and Compilers (1)
- Quantitative, Qualitative, Comparative, and Historical Methodologies (1)
- Social Justice (1)
- Social Statistics (1)
- Social and Behavioral Sciences (1)
- Sociology (1)
- Statistical Models (1)
- Statistics and Probability (1)
- Institution
Articles 1 - 8 of 8
Full-Text Articles in Mathematics
Constructions And Analyses Of Efficient Symmetric-Key Primitives For Authentication And Encryption., Sebati Ghosh Dr.
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.
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
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
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.
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.
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.
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
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.