DeepSmote uses the SMOTE technique in the latent space of an Autoencoder- Decoder model to produce high fidelity images for imbalanced data. But it is be limited by 2 essential artillery: over-fitting the data and a lack of continuity of the latent space thus ...

This thesis analyzes the construction of the sphere fibrations over (n − 1)-connected 2n-manifolds for an even integer n such that the total space is a connected sum of sphere products, in a localized category of spaces. Integral results are obtained for n=2, 4. &#...

Boolean functions are one of the central objects in the study of Computer Science. Any decision problem can be expressed as a Boolean function that takes an $n$-bit string as input and gives a single-bit output. Its versatility in capturing various problems in a&#...

The thesis focuses on the cryptanalysis of private-key ciphers, which are widely used encryption methods due to their fast encryption/decryption computing ability and low memory requirements. The thesis covers two different aspects of cryptanalysis: traditional attack techniques and ...

Abstract

Abstract

Multi-view learning is an emerging machine learning paradigm that focuses on discovering patterns in data represented by multiple distinct views. One of the important issues associated with real-life high-dimensional multi-view data is how to integrate relevant and complementary informati...

Graph coloring is one among the oldest and broadly studied topics in graph theory. A coloring of a graph G is an assignment of colors to the vertices of G such that no two adjacent vertices receive the same color, and the chromatic number of G (denoted&#x...

This thesis proposes and analyses the security of a few symmetric key modes. The first three of them are NAEAD modes, named Oribatida, ISAP+ and OCB+. Oribatida is lightweight, sponge-based, INT-RUP secure and achieves better than the default PRF security of a keyed sponge. IS...

The application of Mathematical Morphology (MM) techniques has proven to be beneficial in the extraction of shapebased and texture-based features during remote sensing image analysis. The characteristics of these techniques, such as nonlinear adaptability and comprehensive lattice struct...

A k-linear coloring of a graph G is an edge coloring of G with k colors so that each color class forms a linear forest—a forest whose each connected component is a path. The linear arboricity χ′ l(G) of G is the minimum integer k such that ther...

Let X be a smooth projective curve over an algebraically closed field k of char- acteristic p > 0, S be a finite subset of closed points in X. Given an embedding problem (β : Γ ↠ G, α : π´et 1 (X \S) ↠ G) for the ´etale fundam...

The journey of the Indian data protection framework started in 2018 with the introduction of the initial draft as ``Personal Data Protection Bill (PDPB-2018)''. Subsequently, a revised draft PDPB-2019 was introduced. This went through revisions as PDPB 2021 and Digital Personal Data&...

A complex network is a useful model for many real-world systems. Recently, much effort has been put into studying the insights of the complex network. This thesis is all about the study of complex networks. Based on the study, this thesis can be broadly divided into...

This thesis contains three chapters on individual decision-making and choice. The first chapter introduces a general model of decision-making where alternatives are sequentially examined by a decision maker. Our main object of study is a decision rule that maps infinite sequence...

In number theory, a problem which arises in a variety of contexts is getting non- trivial cancellation for the general correlation problem, specially when we assume that they are short sums related to Hecke-cusp forms. In my thesis, I have studied the cancellation ...

This thesis consists of three essays on bilateral trading and partnership with loss averse agents. All the three essays consider the same model where two loss averse agents (Tversky and Kahneman (1991), K ̈oszegi and Rabin (2006)) hold some shares of an asset and now want...

Throughout this talk k will denote a field. The talk is primarily divided into two parts. In the first part we will discuss one of the formidable open problems in the area of Affine Algebraic Geometry, called the Epimorphism Problem. Question 1. If k[X1,...,Xn]&#x...

Construction of Mutually Unbiased Bases (MUBs) is a very challenging combinatorial problem in the domain of quantum information theory with several long-standing open questions. The basic definition considers two orthonormal bases in the d-dimensional complex Hilbert space with a fixed specific&#...