Morel-Voevodsky developed A^1-homotopy theory which is a bridge between algebraic geometry and algebraic topology. In this thesis we study the A^1-connected component of a smooth variety in great detail. We have shown that the A^1-connected component of a smooth variety contains the inf...

Histological image analysis deals with microscopic examination of tissue samples, which are stained with multiple histochemical reagents to highlight different cellular structures. The most important characteristic of histological images is the enormous amount of information, which makes compu...

The indistinguishability security of a cryptographic construction refers to the maximum advantage of an interactive adversary to distinguish between the real and ideal world, where in the real world it interacts with the construction, and in the ideal world it interacts with its id...

Liver tumor segmentation from CT images is of paramount importance in medical image analysis. Accurate segmentation of liver tumor is crucial for effective diagnosis and treatment planning in hepatocellular carcinoma and other liver malignancies. Manual as well as traditional segmentation&...

Abstract

Many countries around the world depends on agriculture, as it helps reduce poverty, increase national income, and improve food security. However, plant diseases often impact food crops, leading to significant annual losses and economic setbacks in agriculture. The best solution ...

In this thesis, we leverage the learning from Essence, a “language and kernel“ of Software Engineering, which has resulted from the efforts of the SEMAT initiative founded to bring together industry, research and education to deal with the problem of immature practice ...

In this thesis, we use the techniques of Boolean functions in di erent applications. More speci cally, our focus is on the properties of Boolean functions that hold cryptographic signi cance. The employed techniques primarily revolve around combinatorial methods, yielding fresh&...

Random oracles are cryptographers’ conceptions of what an ’ideal’ hash function should be.Put succinctly, a random oracle is a perfectly random function that you can evaluate quickly. Random functions are beautiful not just because the output is random-looking (of course) but also becau...

In recent decades, global temperature rises have significantly influenced glacier dynamics [1][2], underscoring the vital need for accurately delineating glacier boundaries to comprehend these shifts and document regional patterns. Despite this urgency, conventional methods struggle to map deb...

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...