Division of Electrical, Electronics, and Computer Science (EECS)
Collections in this community
Recent Submissions
-
Enhancing Privacy and Efficiency of Distributed Encryption
The primary objective of a distributed system is to eliminate reliance on a central authority. In a distributed encryption scheme, users should be able to generate their key materials independently while securely sharing ... -
On some themes and models in economics (with a case-study in management)
The case study has sought to draw attention to the fact that historical factors have a strong impact on the structure and behaviour of a company. In the case of HMT, some of these factors were the association with the ... -
Symbolic processings of polynomia matrices using finite field transforms (Polynomial matrix-processor system design)
A new representation of the rational polynomials with integral coefficients over a finite field by expressing each of their coefficients in a suitable prime base is outlined. A modified form of this representation using ... -
Some studies in location and scheduling problems
The location and scheduling problems considered in this study are special cases of what are called combinatorial models. A combinatorial optimization problem consists of finding, from among a finite set of alternatives, ... -
Time domain and time series models for human activity in compensatory tracking experiments, Ph.D. Thesis
Analytical understanding of voluntary human behaviour while performing as an element of a closed-loop manual control situation has been sought since the 1940s. However, a total appreciation of human behaviour has been ... -
Contributions to the development of computationally efficient clustering techniques
The concept of multilevel theory is applied in this thesis to reduce the computation and storage requirements of various existing clustering algorithms. At the first level, the data is divided arbitrarily into a number of ... -
New charactrisations and algorithmic studies on chordal graphs and k-trees
A wealth of literature on graph theory has appeared in the last few centuries. This is to a large extent due to the increase in the applications of graph theory to problems of practical interest. Graph theory is also closely ... -
Exploration and Misspecification in Reinforcement Learning
Among the basic challenges that confront reinforcement learning are exploration – the need to search effectively over large and complex state-action spaces – and misspecification, which arises from using function ... -
Zero Knowledge Proofs: Succinct Verification, Distributed Proofs and Lookup Arguments
Zero-Knowledge Proofs (ZKPs) are fundamental cryptographic tools enabling a prover to convince a verifier about the knowledge of a secret witness related to a public statement, without revealing any information beyond the ... -
Secure Vickrey Auctions with Rational Parties
In this work, we construct a second price (Vickrey) auction protocol (SPA), which does not require any auctioneers and ensures total privacy in the presence of rational parties participating in the auction. In particular, ... -
Protecting Deep Learning Models on Cloud Platforms with Trusted Execution Environments
Deep learning is rapidly integrated into different applications, from medical imaging to financial products. Organisations are spending enormous financial resources to train deep learning models. Often, many organisations ... -
Labelled clustering and its applications
Clustering is a process of grouping a collection of objects. Clustering approaches can be broadly categorized into conventional and knowledge-based approaches. In a conventional approach, objects are typically represented ... -
Weak visibility and related problems on simple polygons
Visibility and shortest path problems are two important areas of research in computational geometry. In this thesis we study weak visibility and related problems on simple polygons and propose efficient algorithms. We study ... -
Knowledge-based preanalysis for multilevel clustering
Multilevel clustering offers the cluster analyst flexibility of choosing different algorithms at different levels with the possibility of reducing overall computational effort in comparison with the single-level application ... -
Optimization techniques applied to the design of integrated rural energy centres
A major part of the energy needs of rural India and many other developing countries is met by non-commercial sources of energy. Considerable amounts of human and animal energy are also being spent in an inefficient manner ... -
Petri net-based techniques for modelling analysis,and performance evalution
The primary objective of this Thesis is to develop Petri net-based techniques for the modelling, analysis, and performance evaluation of distributed processing systems. To illustrate these techniques, we focus on two ... -
An integrated relational database for computer-aided design applications
In view of the widespread use of Computer Aided Design (CAD) systems, the problem of storing data efficiently (in terms of memory requirements and the time required to access it) is of considerable importance. This thesis ... -
Fast primality testing algorithm study and implementation
In the previous chapters we discussed the details of some primality testing algorithms and the implementation of a fast deterministic primality testing algorithm. Our implementation consists of programs written in Pascal ... -
Algorithmic studies on graph domination -refinements and extensions
Given a graph G = (V, E), where V is a finite set of vertices and E is the set of edges, a set D ? V of vertices is a dominating set if every vertex in V ? D is adjacent to some vertex in D. The size of a minimum cardinality ... -
Efficient computations with special large sparse matrices
Large sparse matrices find many applications in cryptography. A large sparse matrix is a matrix of huge dimensions but the number of nonzero entries per row of the matrix is very small. Most of the times, it is possible ...
RSS 1.0