Browsing Department of Computational and Data Sciences (CDS) by Title
Now showing items 32-51 of 117
-
A Divide and Conquer Framework For Graph Processing in Distributed Heterogeneous Systems
In many fields of science and engineering graph data structures are used to represent real-world information. As these graphs scale in size, it becomes very inefficient to process these graphs on a single core CPU using ... -
Dynamic hybrid partitioned non partitioned queue configurations based on workloads in supercomputer systems
Supercomputers rely on batch queues to manage parallel job execution, with commercial schedulers offering configurable parameters that influence job routing, execution order, and queue visitation. However, selecting an ... -
Efficient and Effective Algorithms for Improving the Robustness of Deep Neural Networks
Deep Neural Networks achieve near-human performance on several benchmark datasets, yet they are not as robust as humans. Their success relies on the proximity of test samples to the distribution of training data, resulting ... -
Efficient and Resilient Stream Processing in Distributed Shared Environment
Internet of Things (IoT) deployments comprising of sensors and actuators collect observational data and provide continuous streams of data, often called streaming data or fast data. Smart Cities use such IoT technologies ... -
Efficient betweenness Centrality Computations on Hybrid CPU-GPU Systems
(2017-10-11)Analysis of networks is quite interesting, because they can be interpreted for several purposes. Various features require different metrics to measure and interpret them. Measuring the relative importance of each vertex ... -
Efficient parallel algorithms to compute A sub-complex of the weighted delaunay triangulation for molecular data
In the field of bio-molecules, it is utmost important to study the behaviour of a molecule while interacting with another. This interaction decides the functionality of the molecule. It is widely accepted fact that the ... -
Efficient quantum dynamics simulations for periodic potentials
Quantum algorithms are designed to efficiently solve many problems that are thought to be difficult classically. A specific case is the efficient simulation of time evolution of quantum systems. This work provides a ... -
EMF: System Design and Challenges for Disaggregated GPUs in datacenters for Efficiency, Modularity and Flexibility
With Dennard Scaling phasing out in the mid-2000s, architectural scaling and hardware specialization take centre stage to provide performance bene fits with already stalling Moore's law. An outcome from this hardware ... -
End-to-end Resiliency Analysis Framework for Cloud Storage Services
Cloud storage service brought the idea of a global scale storage system available on-demand and accessible from anywhere. Despite the benefits, resiliency remains one of the key issues that hinder the wide adaptation of ... -
Enhancing Blockchain Implementations
Blockchain technology elegantly provides a spectrum of desirable semantic properties, including immutability, authenticity, verifiability, and data integrity. In recent years, implementing blockchains on relational database ... -
Epistasis Detection and Phenotype Prediction in GWAS Using Machine Learning Methods
Genome-wide association studies (GWAS) are used to find the association between genetic variants, Single Nucleotide Polymorphisms (SNPs), and phenotypic traits or diseases in a population. The number of GWAS has increased ... -
An error correction algorithm for long-read sequencing
Long-read sequencing technologies have transformed genomics by generating longer and suffi- ciently accurate DNA sequences, offering advantages in analysing highly repetitive and complex regions of a genome. A long-read ... -
Exploring the Inherent Saliency in Visual Data through Convolutional Neural Networks
Saliency plays a key role in various computer vision tasks. Extracting salient regions from images and videos has been a well-established problem in computer vision. Determining salient regions in an image or video has ... -
Fast and Scalable Algorithms for Intelligent Routing of Autonomous Marine Agents
Autonomous marine agents play a pivotal role in diverse ocean applications. These agents serve as indispensable instruments for acquiring crucial environmental information. They are used to explore and monitor harsh ... -
Feasible Path Prescription for Engineering Systems in a High-Index Constrained Dynamics Framework
Constrained dynamic performance and control models of complex engineering systems can be represented in the form of a Differential Algebraic Equation (DAE) system. The high-index of this DAE system poses computational ... -
Global control of mechanics on Riemannian manifolds, and applications to under-actuated aerial vehicles
We consider the problem of designing trajectory tracking feedback control laws for La- grangian mechanical systems in a Riemannian geometric framework. Classical nonlinear control techniques that rely on Euclidean ... -
A Hierarchical Control Plane Framework for Integrated SDN-SFC Management in Multi-tenant Cloud Datacenters
Cloud data centers represent one of the most complex and dynamic environments in terms of network management. The multitude of hosted applications in such centers share the same fabric and yet demand easy and fast service ... -
Higher order discrete dipole approximations for solution of light scattering problems
Abstract not available -
Image Representation using Attribute-Graphs
(2017-12-13)In a digital world of Flickr, Picasa and Google Images, developing a semantic image represen-tation has become a vital problem. Image processing and computer vision researchers to date, have used several di erent representations ...