Browsing Computer Science and Automation (CSA) by Title
Now showing items 516-535 of 552
-
Targeted Client Synthesis for Detecting Concurrency Bugs
(2018-01-01)Detecting concurrency bugs can be challenging due to the intricacies associated with their manifestation. These intricacies correspond to identifying the methods that need to be invoked concurrently, the inputs passed to ... -
Techniques in The Markov Chain Monte Carlo Method
Consider the problem of sampling from a set of combinatorial objects according to a certain given distribution. The Markov chain Monte Carlo (MCMC) method is a possible solution for this problem. The method consists of ... -
Temporal Point Processes for Forecasting Events in Higher-Order Networks
Real-world systems consisting of interacting entities can be effectively represented as time-evolving networks or graphs, where the entities are depicted as nodes, and the interactions between them are represented as ... -
A Theoretical Study of the Synergy and Lazy Annotation Algorithms
(2018-04-03)Given a program with assertions, the assertion checking problem is to tell whether there is an execution of the program that violates one of the assertions. One approach to this problem is to explore different paths towards ... -
Tiling Stencil Computations To Maximize Parallelism
(2017-05-21)Stencil computations are iterative kernels often used to simulate the change in a discretized spatial domain overtime (e.g., computational fluid dynamics) or to solve for unknowns in a discretized space by converging to a ... -
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 ... -
Time Management In Partitioned Systems
(2010-02-11)Time management is one of the critical modules of safety-critical systems. Applications need strong assurance from the operating system that their hard real-time requirements are met. Partitioned system has recently evolved ... -
Top-k Spatial Aware Ads
Consider an app on a smartphone which displays local business ads. When a user opens the app, then k local business ads need to displayed (where k would typically be 3 or 5) such that the profit made by the app is ... -
Topological Structures and Operators for Bivariate Data Visualization
Understanding complex phenomena in diverse scientific and engineering disciplines often relies on decoding the interplay among real-valued or scalar fields that are measured or computed over a spatial domain. This thesis ... -
Towards a Charcterization of the Symmetries of the Nisan-Wigderson Polynomial Family
(2018-07-09)Understanding the structure and complexity of a polynomial family is a fundamental problem of arithmetic circuit complexity. There are various approaches like studying the lower bounds, which deals with nding the smallest ... -
Towards complete automatic code generation
A compiler consists of two phases: source program analysis and object program synthesis. The problem of compilation has been tackled in depth, and many tools and techniques exist for building the analysis phase. Similar ... -
Towards Effcient Privacy-Preserving Two-Party k-Means Clustering Protocol
Two-party data mining is a win-win game if played with a guarantee of data privacy from each other. This guarantee is provided by the use of cryptographic techniques in designing the two-party protocol. The need to ... -
Towards Robustness of Neural Legal Judgement System
Legal Judgment Prediction (LJP) implements Natural Language Processing (NLP) techniques to predict judgment results based on fact description. It can play a vital role as a legal assistant and benefit legal practitioners ... -
Towards Secure and Efficient Realization of Pairing-Based Signatures from Static Assumptions.
Bilinear pairing defined over elliptic curve group was first used to design novel cryptosystem in 2000. Since then a large number of cryptosystems has been proposed in pairing-based cryptography (PBC). The main tool for ... -
Transducer-based Algorithmic Verification of Retransmission Protocols over Noisy Channels
(2018-04-05)Unreliable communication channels are a practical reality. They add to the complexity of protocol design and verification. In this work, we consider noisy channels which can corrupt messages. We present an approach to model ... -
Transputer-based parallel implementation of neural nets for a class of pattern recognition problems
Neural networks are systems that are made up of a number of computing elements connected to each other making use of some of the organizational principles that are thought to be used in the human brain. For a large array ... -
Treebeard: A Schedule Guided Retargetable Compiler for Decision Tree Inference
The proliferation of machine learning together with the rapid evolution of the hardware ecosystem has led to a surge in the demand for model inference on a variety of hardware. Decision tree based models are the most popular ... -
TriSL: A Software Architecture Description Language and Environment
(Indian Institute of Science, 2005-03-14)As the size and complexity of a software system increases, the design problem goes beyond the algorithms and data structures of the computation. Designing and specifying the overall system structure -- or software architecture ... -
A Trusted-Hardware Backed Secure Payments Platform for Android
Digital payments using personal electronic devices have been steadily gaining in popularity for the last few years. While digital payments using smartphones are very convenient, they are also more susceptible to security ... -
Two Player Game Variant Of The Erdos Szekeres Problem
(2014-08-01)The following problem has been known for its beauty and elementary character. The Erd˝os Szekeres problem[7]: For any integer k ≥ 3, determine if there exists a smallest positive integer N(k) such that any set of atleast ...