This thesis presents a series of neural network classifiers for object detection in both optical and infrared images. The focus of this work is on efficient and accurate solutions. The thesis discusses the evolution of the highly efficient and tiny network Binary Classification Vision Transformer (BC-ViT) and how through thoughtful modifications and improvements, the BC-ViT can be utilized for tasks of increasing complexity. Chapter 2 discusses the creation of BC-ViT and its initial use case for underwater image classification of optical images. The BC-ViT is able to complete its task with an accuracy of 99.29\% while being comprised of a mere 15,981 total trainable parameters. Chapter 3, Waste Multi-Class Vision Transformer (WMC-ViT), introduces the usefulness of mindful algorithm design for the realm of multi-class classification on a mutually exclusive dataset. WMC-ViT shows that the task oriented design strategy allowed for a network to achieve an accuracy score of 94.27\% on a five class problem while still maintaining a tiny parameter count of 35,492. The final chapter demonstrates that by utilizing functional blocks of BC-ViT, a simple and effective target detection algorithm for infrared images can be created. The Edge Infrared Vision Transformer (EIR-ViT) showed admirable results with a high IoU …

PM2.5 particle sensing has been done using surface acoustic wave based sensor for two different frequencies. Due to mass loading and elasticity loading on the sensor's surface, the center frequency of the sensor shifts. The particle concentration can be tracked based on that frequency shift. The fit factor test has been conducted using higher frequency SAW sensor. The consist results has been achieved for particle sensing and fit factor test with SAW based sensor.

In the era of big data, it is essential to implement practical security and privacy measures to ensure the lawful use of data and provide users with trust and assurance. In the dissertation, I address this issue through several key steps. Firstly, I delve into the problem of conditional secret disclosure, representing it using graphs to determine the most efficient approach for storing and disclosing secrets. Secondly, I extend the conditional disclosure of secrets problem from a single secret to multiple secrets and from a bipartite graph to an arbitrary graph. Thirdly, I remove security constraints to observe how they affect the efficiency of storage and recovery. In our final paper, I explore the secure summation problem, aiming to determine the capacity of total noise. Throughout the dissertation, I leverage information-theoretic tools to address security and privacy concerns.

Secure multiparty computation refers to the problem where a number of users wish to securely compute a function on their inputs without revealing any unnecessary information. This dissertation focuses on the fundamental limits of secure summation under different constraints. We first focus on the minimal model of secure computation, in which two users each hold an input and wish to securely compute a function of their inputs at the server. We propose a novel scheme base on the algebraic structure of finite field and modulo ring of integers. Then we extend the minimal model of secure computation, in which K users wish to securely compute the sum of their inputs at the server. We prove a folklore result on the limits of communication cost and randomness cost. Then we characterized the optimal communication cost with user dropouts constraint, when some users may lose connection to the server and the server wishes to compute the sum of remaining inputs. Next, we characterize the optimal communication and randomness cost for symmetric groupwise keys and find the feasibility condition for arbitrary groupwise keys. Last, we study the secure summation with user selection, such that the server may select any subset of users to …