Computer Science and Automation (CSA): Recent submissions
Now showing items 41-60 of 387
-
Comparative Analysis of Topological Structures
Measuring scientific processes result in a set of scalar functions (scalar fields) which may be related temporally, be part of an ensemble, or unrelated. Overall understanding and visualization of scientific processes ... -
Boolean Functional Synthesis using Gated Continuous Logic Networks
Boolean Functional Synthesis (BFS) is a well-known challenging problem in the domain of automated program synthesis from logical specifications. This problem aims to synthesize a Boolean function that is correct-by-construction ... -
Fast Algorithms for Max Cut on Geometric Intersection Graphs
In this work, we design fast algorithms for max cut on geometric intersection graphs. In the maximum cut (a.k.a., max cut) problem, the input is an undirected graph, and the goal is to partition the vertex set into two ... -
A Context-Aware Neural Approach for Explainable Citation Link Prediction
Citations have become an integral part of scientific publications. They play a crucial role in supporting authors’ claims throughout a scientific paper. However, citing related work is a challenging and laborious task, ... -
Achieving practical secure non-volatile memory system with in-Memory Integrity Verification (iMIV)
Recent commercialization of Non-Volatile Memory (NVM) technology in the form of Intel Optane enables programmers to write recoverable programs. However, the data on NVM is susceptible to a plethora of data remanence attacks, ... -
An Evaluation of Basic Protection Mechanisms in Financial Apps on Mobile Devices
This thesis concerns the robustness of security checks in financial mobile applications (or simply financial apps). The best practices recommended by OWASP for developing such apps demand that developers include several ... -
Model-based Safe Deep Reinforcement Learning and Empirical Analysis of Safety via Attribution
During initial iterations of training in most Reinforcement Learning (RL) algorithms, agents perform a significant number of random exploratory steps, which in the real-world limit the practicality of these algorithms ... -
On symmetries of and equivalence tests for two polynomial families and a circuit class
Two polynomials f, g ∈ F[x1, . . . , xn] over a field F are said to be equivalent if there exists an n×n invertible matrix A over F such that g = f(Ax), where x = (x1 · · · xn)T . The equivalence test (in short, ET) for ... -
Neural Approaches for Natural Language Query Answering over Source Code
During software development, developers need to ensure that the developed code is bug-free and the best coding practices are followed during the code development process. To guarantee this, the developers require answers ... -
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. ... -
Improved Algorithms for Variants of Bin Packing and Knapsack
We study variants of two classical optimization problems: Bin Packing and Knapsack. Both bin packing and knapsack fall under the regime of "Packing and Covering Problems". In bin packing, we are given a set of input items, ... -
Performance Characterization and Optimizations of Traditional ML Applications
Even in the era of Deep Learning based methods, traditional machine learning methods with large data sets continue to attract significant attention. However, we find an apparent lack of a detailed performance characterization ... -
Operating System Support for Efficient Virtual Memory
Computers rely on the virtual memory abstraction to simplify programming, portability, physical memory management and ensure isolation among co-running applications. However, it creates a layer of indirection in the ... -
Explainable and Efficient Neural Models for Natural Language to Bash Command Translation
One of the key goals of Natural Language Processing is to make computers understand natural language. Semantic Parsing has been one of the driving tasks for Natural Language Understanding. It is formally defined as the ... -
Algorithms for Fair Clustering
Many decisions today are taken by various machine learning algorithms, hence it is crucial to accommodate fairness in such algorithms to remove/reduce any kind of bias in the decision. We incorporate fairness in the ... -
2-Level Page Tables (2-LPT): A Building Block for Efficient Address Translation in Virtualized Environments
Efficient address translation mechanisms are gaining more and more attention as the virtual address range of the processors keeps expanding and the demand for machine virtualization increases with cloud and data center-based ... -
Novel First-order Algorithms for Non-smooth Optimization Problems in Machine Learning
This thesis is devoted to designing efficient optimization algorithms for machine learning (ML) problems where the underlying objective function to be optimized is convex but not necessarily differentiable. Such non-smooth ... -
Reinforcement Learning Algorithms for Off-Policy, Multi-Agent Learning and Applications to Smart Grids
Reinforcement Learning (RL) algorithms are a popular class of algorithms for training an agent to learn desired behavior through interaction with an environment whose dynamics is unknown to the agent. RL algorithms ... -
Neural Models for Personalized Recommendation Systems with External Information
Personalized recommendation systems use the data generated by user-item interactions (for example, in the form of ratings) to predict different users interests in available items and recommend a set of items or products ... -
Modeling and verification of database-accessing applications
Databases are central to the functioning of most IT-enabled processes and services. In many domains, databases are accessed and updated via applications written in general-purpose lan- guages, as such applications need ...