Browsing Computer Science and Automation (CSA) by Title
Now showing items 289-308 of 377
-
Power Efficient Last Level Cache For Chip Multiprocessors
(2015-09-09)The number of processor cores and on-chip cache size has been increasing on chip multiprocessors (CMPs). As a result, leakage power dissipated in the on-chip cache has become very significant. We explore various techniques ... -
Power Issues in SoCs : Power Aware DFT Architecture and Power Estimation
(2018-01-10)Test power, data volume, and test time have been long-standing problems for sequential scan based testing of system-on-chip (SoC) design. The modern SoCs fabricated at lower technology nodes are complex in nature, the ... -
Practically Efficient Secure Small Party Computation over the Internet
Secure Multi-party Computation (MPC) with small population has drawn focus specifically due to customization in techniques and resulting efficiency that the constructions can offer. Practically efficient constructions ... -
Precise Analysis of Private And Shared Caches for Tight WCET Estimates
(2017-10-31)Worst Case Execution Time (WCET) is an important metric for programs running on real-time systems, and finding precise estimates of a program’s WCET is crucial to avoid over-allocation and wastage of hardware resources and ... -
Privadome: A System for Citizen Privacy in the Delivery Drone Era
E-commerce companies are actively considering the use of delivery drones for customer fulfillment, leading to growing concerns around citizen privacy. Drones are equipped with cameras, and the video feed from these cameras ... -
Problems on bend-number, circular separation dimension and maximum edge 2-colouring
Representation of graphs as the intersection graphs of geometric objects has a long history. The objective is to a nd a collection of \simple" sets S such that a given graph G is its intersection graph. We are interested ... -
Procurement Network Formation : A Cooperative Game Theoretic Approach
(2009-04-16)Complex economic activity often involves inter-relationships at several levels of production, often referred to as supply chains or procurement networks. In this thesis we address the problem of forming procurement networks ... -
Program Analyses to Support Memory-saving Refactorings in Java Programs
Software commonly consumes unexpectedly high amounts of memory, frequently due to programming idioms that are used to make software more reliable, maintainable and understandable. In the case of modern object-oriented ... -
Program Repair by Automated Generation of Hints
Programming has become an important skill in today's technology-driven world. It is a complex activity because of which programmers make mistakes in their software. Student programmers make mistakes in their programs due ... -
Provable Methods for Non-negative Matrix Factorization
(2017-10-31)Nonnegative matrix factorization (NMF) is an important data-analysis problem which concerns factoring a given d n matrix A with nonnegative entries into matrices B and C where B and C are d k and k n with nonnegative ... -
Quantum-Safe Identity-Based Signature Scheme in Multivariate Quadratic Setting
Cryptographic techniques are essential for the security of communication in modern society. Today, nearly all public key cryptographic schemes used in practice are based on the two problems of factoring large integers and ... -
Rainbow Colouring and Some Dimensional Problems in Graph Theory
(2018-04-05)This thesis touches three different topics in graph theory, namely, rainbow colouring, product dimension and boxicity. Rainbow colouring An edge colouring of a graph is called a rainbow colouring, if every pair of vertices ... -
Rainbow Connection Number Of Graph Power And Graph Products
(2014-09-09)The minimum number of colors required to color the edges of a graph so that any two distinct vertices are connected by at least one path in which no two edges are colored the same is called its rainbow connection number. ... -
Ranking from Pairwise Comparisons : The Role of the Pairwise Preference Matrix
(2018-07-05)Ranking a set of candidates or items from pair-wise comparisons is a fundamental problem that arises in many settings such as elections, recommendation systems, sports team rankings, document rankings and so on. Indeed it ... -
Rational Secure Computation: New Definitions and Constructions
Cryptography and Game Theory are two fascinating areas of modern computing, and there have been numerous works since the early 2000s to bridge these. While cryptography provides mechanisms to detect deviations, game theory ... -
Recommendations in Complex Networks: Unifying Structure into Random Walk
Making recommendations or predicting links which are likely to exist in the future is one of the central problems in network science and graph mining. In spite of modern state-of- the-art approaches for link prediction, ... -
Reconstruction of 3D Neuronal Structures
(2018-03-17)Microscopic analysis of biological structures can be significantly enhanced by representing the object of study as a three-dimensional entity. To assist neurobiologists investigate the molecular mechanisms involved in ... -
Recovery Algorithms for planted structures in Semi-random models
For many NP-hard problems, the analysis of best-known approximation algorithms yields “poor” worst-case guarantees. However, using various heuristics, the problems can be solved (to some extent) in real-life instances. ... -
Recovery From DoS Attacks In MIPv6 : Modelling And Validation
(2010-07-26)Denial-of-Service (DoS) attacks form a very important category of security threats that are possible in MIPv6 (Mobile Internet Protocol version 6). This thesis proposes a scheme for participants (Mobile Node, Home Agent, ...