total 152took 0.13s
Parameterized Algorithms for Deletion to (r,l)-graphsApr 30 2015For fixed integers $r,\ell \geq 0$, a graph $G$ is called an {\em $(r,\ell)$-graph} if the vertex set $V(G)$ can be partitioned into $r$ independent sets and $\ell$ cliques. This brings us to the following natural parameterized questions: {\sc Vertex ... More
Deterministic Truncation of Linear MatroidsApr 17 2014Let $M=(E,{\cal I})$ be a matroid. A {\em $k$-truncation} of $M$ is a matroid {$M'=(E,{\cal I}')$} such that for any $A\subseteq E$, $A\in {\cal I}'$ if and only if $|A|\leq k$ and $A\in {\cal I}$. Given a linear representation of $M$ we consider the ... More
Fine-grained complexity of integer programming: The case of bounded branch-width and rankJul 18 2016We use the Exponential Time and Strong Exponential Time hypotheses (ETH & SETH) to provide conditional lower bounds on the solvability of the integer programming (IP) problem. We provide evidence that the running times of known pseudo-polynomial time ... More
Lossy KernelizationApr 14 2016In this paper we propose a new framework for analysing the performance of preprocessing algorithms. Our framework builds on the notion of kernelization from parameterized complexity. However, as opposed to the original notion of kernelization, our definitions ... More
On Integer Programming and the Path-width of the Constraint MatrixJul 18 2016Nov 03 2016In the classic Integer Programming (IP) problem, the objective is to decide whether, for a given $m \times n$ matrix $A$ and an $m$-vector $b=(b_1,\dots, b_m)$, there is a non-negative integer $n$-vector $x$ such that $Ax=b$. Solving (IP) is an important ... More
Lossy KernelizationApr 14 2016Nov 04 2016In this paper we propose a new framework for analyzing the performance of preprocessing algorithms. Our framework builds on the notion of kernelization from parameterized complexity. However, as opposed to the original notion of kernelization, our definitions ... More
Representative Sets of Product FamiliesFeb 17 2014A subfamily ${\cal F}'$ of a set family ${\cal F}$ is said to $q$-{\em represent} ${\cal F}$ if for every $A \in {\cal F}$ and $B$ of size $q$ such that $A \cap B = \emptyset$ there exists a set $A' \in {\cal F}'$ such that $A' \cap B = \emptyset$. In ... More
Parameterized Algorithms on Perfect Graphs for deletion to $(r,\ell)$-graphsDec 14 2015For fixed integers $r,\ell \geq 0$, a graph $G$ is called an {\em $(r,\ell)$-graph} if the vertex set $V(G)$ can be partitioned into $r$ independent sets and $\ell$ cliques. The class of $(r, \ell)$ graphs generalizes $r$-colourable graphs (when $\ell ... More Refined Complexity of PCA with OutliersMay 10 2019Principal component analysis (PCA) is one of the most fundamental procedures in exploratory data analysis and is the basic step in applications ranging from quantitative finance and bioinformatics to image analysis and neuroscience. However, it is well-documented ... More Reconfiguration on sparse graphsFeb 17 2015A vertex-subset graph problem Q defines which subsets of the vertices of an input graph are feasible solutions. A reconfiguration variant of a vertex-subset problem asks, given two feasible solutions S and T of size k, whether it is possible to transform ... More Reducing Topological Minor Containment to the Unique Linkage TheoremApr 05 2019In the Topological Minor Containment problem (TMC) problem two undirected graphs,$G$and$H$are given and the objective is to check whether$G$contains$H$as a topological minor. Grohe, Kawarabayashi, Marx, and Wollan~[STOC 2011] resolved the parameterized ... More Complexity of the Steiner Network Problem with Respect to the Number of TerminalsFeb 22 2018In the Directed Steiner Network problem we are given an arc-weighted digraph$G$, a set of terminals$T \subseteq V(G)$, and an (unweighted) directed request graph$R$with$V(R)=T$. Our task is to output a subgraph$G' \subseteq G$of the minimum cost ... More Covering Small Independent Sets and Separators with Applications to Parameterized AlgorithmsMay 03 2017We present two new combinatorial tools for the design of parameterized algorithms. The first is a simple linear time randomized algorithm that given as input a$d$-degenerate graph$G$and an integer$k$, outputs an independent set$Y$, such that for ... More Simultaneous Feedback Edge Set: A Parameterized PerspectiveNov 23 2016In this paper we consider Simultaneous Feedback Edge Set (Sim-FES) problem. In this problem, the input is an$n$-vertex graph$G$, an integer$k$and a coloring function${\sf col}: E(G) \rightarrow 2^{[\alpha]}$and the objective is to check whether ... More Finding Even Subgraphs Even FasterSep 17 2014Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on$n$vertices and a positive integer parameter$k$, find if there exist$k$edges (arcs) whose deletion ... More Rank Vertex Cover as a Natural Problem for Algebraic CompressionMay 08 2017May 10 2017The question of the existence of a polynomial kernelization of the Vertex Cover Above LP problem has been a longstanding, notorious open problem in Parameterized Complexity. Five years ago, the breakthrough work by Kratsch and Wahlstrom on representative ... More Low-rank binary matrix approximation in column-sum normApr 12 2019We consider$\ell_1$-Rank-$r$Approximation over GF(2), where for a binary$m\times n$matrix${\bf A}$and a positive integer$r$, one seeks a binary matrix${\bf B}$of rank at most$r$, minimizing the column-sum norm$||{\bf A} -{\bf B}||_1. We show ... More Parameterized Low-Rank Binary Matrix ApproximationMar 16 2018We provide a number of algorithmic results for the following family of problems: For a given binary m\times n matrix A and integer k, decide whether there is a "simple" binary matrix B which differs from A in at most k entries. For an integer r, the "simplicity" ... More Efficient Computation of Representative Sets with Applications in Parameterized and Exact AlgorithmsApr 16 2013Feb 22 2016We give two algorithms computing representative families of linear and uniform matroids and demonstrate how to use representative families for designing single-exponential parameterized and exact exponential time algorithms. The applications of our approach ... More Going Far From DegeneracyFeb 07 2019Feb 14 2019An undirected graph G is d-degenerate if every subgraph of G has a vertex of degree at most d. By the classical theorem of Erd\H{o}s and Gallai from 1959, every graph of degeneracy d>1 contains a cycle of length at least d+1. The proof of Erd\H{o}s and ... More Pyro-Align: Sample-Align based Multiple Alignment system for Pyrosequencing Reads of Large NumberJan 19 2009Pyro-Align is a multiple alignment program specifically designed for pyrosequencing reads of huge number. Multiple sequence alignment is shown to be NP-hard and heuristics are designed for approximate solutions. Multiple sequence alignment of pyrosequenceing ... More Going Far From DegeneracyFeb 07 2019An undirected graph G is d-degenerate if every subgraph of G has a vertex of degree at most d. By the classical theorem of Erd\H{o}s and Gallai from 1959, every graph of degeneracy d>1 contains a cycle of length at least d+1. The proof of Erd\H{o}s and ... More Lossy Kernels for Connected Dominating Set on Sparse GraphsJun 28 2017Feb 22 2018For\alpha > 1$, an$\alpha$-approximate (bi-)kernel is a polynomial-time algorithm that takes as input an instance$(I, k)$of a problem$\mathcal{Q}$and outputs an instance$(I',k')$(of a problem$\mathcal{Q}'$) of size bounded by a function of$k$... More A 2-Approximation Algorithm for Feedback Vertex Set in TournamentsSep 22 2018A {\em tournament} is a directed graph$T$such that every pair of vertices is connected by an arc. A {\em feedback vertex set} is a set$S$of vertices in$T$such that$T - S$is acyclic. We consider the {\sc Feedback Vertex Set} problem in tournaments. ... More BPCMont: Business Process Change Management OntologyFeb 13 2016Change management for evolving collaborative business process development is crucial when the business logic, transections and workflow change due to changes in business strategies or organizational and technical environment. During the change implementation, ... More Decomposition of Map Graphs with ApplicationsMar 04 2019Bidimensionality is the most common technique to design subexponential-time parameterized algorithms on special classes of graphs, particularly planar graphs. The core engine behind it is a combinatorial lemma of Robertson, Seymour and Thomas that states ... More Approximation Schemes for Low-Rank Binary Matrix Approximation ProblemsJul 18 2018We provide a randomized linear time approximation scheme for a generic problem about clustering of binary vectors subject to additional constrains. The new constrained clustering problem encompasses a number of problems and by solving it, we obtain the ... More DKP-AOM: results for OAEI 2015Oct 06 2015In this paper, we present the results obtained by our DKP-AOM system within the OAEI 2015 campaign. DKP-AOM is an ontology merging tool designed to merge heterogeneous ontologies. In OAEI, we have participated with its ontology mapping component which ... More Geometrical Characterization of RN-operators between Locally Convex Vector SpacesFeb 12 2015For locally convex vector spaces (l.c.v.s.)$E$and$F$and for linear and continuous operator$T: E \rightarrow F$and for an absolutely convex neighborhood$V$of zero in$F$, a bounded subset$B$of$E$is said to be$T$-V-dentable (respectively,$T-V-s-dentable, ... More Sample-Align-D: A High Performance Multiple Sequence Alignment System using Phylogenetic Sampling and Domain DecompositionJan 18 2009Multiple Sequence Alignment (MSA) is one of the most computationally intensive tasks in Computational Biology. Existing best known solutions for multiple sequence alignment take several hours (in some cases days) of computation time to align, for example, ... More A Polynomial Time Graph Isomorphism Algorithm For Graphs That Are Not Locally Triangle-FreeMay 21 2016Jun 01 2016In this paper, we show the existence of a polynomial time graph isomorphism algorithm for all graphs excluding graphs that are locally trianglefree. This particular class of graphs allows to divide the graph into neighbourhood sub-graph where each of ... More Robust Compressive Phase Retrieval via Deep Generative PriorsAug 17 2018This paper proposes a new framework to regularize the highly ill-posed and non-linear phase retrieval problem through deep generative priors using simple gradient descent algorithm. We experimentally show effectiveness of proposed algorithm for random ... More An Overview of Multiple Sequence Alignment SystemsJan 18 2009An overview of current multiple alignment systems to date are described.The useful algorithms, the procedures adopted and their limitations are presented.We also present the quality of the alignments obtained and in which cases(kind of alignments, kind ... More Web-Based Learning and Training for Virtual Metrology LabMar 29 2010The use of World Web Wide for distance education has received increasing attention over the past decades. The real challenge of adapting this technology for engineering education and training is to facilitate the laboratory experiments via Internet. In ... More On dentability in locally convex vector spacesFeb 25 2013For a locally convex vector space (l.c.v.s.)E$and an absolutely convex neighborhood$V$of zero, a bounded subset$A$of$E$is said to be$V$-dentable (respectively,$V$-f-dentable) if for any$\epsilon>0$there exists an$x\in A$so that$$x\notin ... More Leveraging Pretrained Word Embeddings for Part-of-Speech Tagging of Code Switching DataMay 31 2019Linguistic Code Switching (CS) is a phenomenon that occurs when multilingual speakers alternate between two or more languages/dialects within a single conversation. Processing CS data is especially challenging in intra-sentential data given state-of-the-art ... More A Domain Decomposition Strategy for Alignment of Multiple Biological Sequences on Multiprocessor PlatformsMay 12 2009Multiple Sequences Alignment (MSA) of biological sequences is a fundamental problem in computational biology due to its critical significance in wide ranging applications including haplotype reconstruction, sequence homology, phylogenetic analysis, and ... More Transferring Voice using SMS over GSM NetworkDec 24 2011The paper presents a methodology of transmitting voice in SMS (Short Message Service) over GSM network. Usually SMS contents are text based and limited to 140 bytes. It supports national and international roaming, but also supported by other telecommunication ... More Impacts of different cumulus physics over south Asia region with case study tropical cyclone ViyaruJun 04 2015Dec 18 2015Tropical Cyclone Viyaru, formerly known as Cyclonic Storm Mahasen was a rapidly intensifying, category 01B storm that made landfall in Chittagong, Bangladesh on the 16th of May, 2013. In this study, the sensitivity of numerical simulations of tropical ... More Transference & Retrieval of Pulse-code modulation Audio over Short Messaging ServiceMay 19 2012The paper presents the method of transferring PCM (Pulse-Code Modulation) based audio messages through SMS (Short Message Service) over GSM (Global System for Mobile Communications) network. As SMS is text based service, and could not send voice. Our ... More Stereo image Transference & Retrieval over SMSJan 06 2012Paper presents the way of transferring stereo images using SMS over GSM network. Generally, Stereo image is composed of two stereoscopic images in such way that gives three dimensional affect when viewed. GSM have two short messaging services, which can ... More Blind Image Deconvolution using Deep Generative PriorsFeb 12 2018Feb 26 2019This paper proposes a novel approach to regularize the \textit{ill-posed} and \textit{non-linear} blind image deconvolution (blind deblurring) using deep generative networks as priors. We employ two separate generative models --- one trained to produce ... More Confidence Propagation through CNNs for Guided Sparse Depth RegressionNov 05 2018Generally, convolutional neural networks (CNNs) process data on a regular grid, e.g. data generated by ordinary cameras. Designing CNNs for sparse and irregularly spaced input data is still an open research problem with numerous applications in autonomous ... More Deep Ptych: Subsampled Fourier Ptychography using Generative PriorsDec 22 2018This paper proposes a novel framework to regularize the highly ill-posed and non-linear Fourier ptychography problem using generative models. We demonstrate experimentally that our proposed algorithm, Deep Ptych, outperforms the existing Fourier ptychography ... More Steganography between Silence Intervals of Audio in Video Content Using Chaotic MapsOct 14 2016Steganography is the art of hiding data, in such a way that it is undetectable under traffic-pattern analysis and the data hidden is only known to the receiver and the sender. In this paper new method of text steganography over the silence interval of ... More Bi-Text Alignment of Movie Subtitles for Spoken English-Arabic Statistical Machine TranslationSep 05 2016We describe efforts towards getting better resources for English-Arabic machine translation of spoken text. In particular, we look at movie subtitles as a unique, rich resource, as subtitles in one language often get translated into other languages. Movie ... More Text writing in the airApr 27 2016This paper presents a real time video based pointing method which allows sketching and writing of English text over air in front of mobile camera. Proposed method have two main tasks: first it track the colored finger tip in the video frames and then ... More Compress Voice Transference over low Signal Strength in Satellite CommunicationApr 26 2016This paper presents the comparison of compression algorithms for voice transferring method over SMS in satellite communication. Voice transferring method over SMS is useful in situations when signal strength is low and due to poor signal strength voice ... More Controlling Home Appliances Remotely through Voice CommandDec 08 2012Controlling appliances is a main part of automation. The main object of Home automation is to provide a wireless communication link of home appliances to the remote user. The main objective of this work is to make such a system which controls the home ... More Demographical Priors for Health Conditions Diagnosis Using Medicare DataDec 07 2016This paper presents an example of how demographical characteristics of patients influence their susceptibility to certain medical conditions. In this paper, we investigate the association of health conditions to age of patients in a heterogeneous population. ... More An Empirical Investigation of V-I Trajectory based Load Signatures for Non-Intrusive Load MonitoringMay 02 2013Choice of load signature or feature space is one of the most fundamental design choices for non-intrusive load monitoring or energy disaggregation problem. Electrical power quantities, harmonic load characteristics, canonical transient and steady-state ... More Propagating Confidences through CNNs for Sparse Data RegressionMay 30 2018Aug 03 2018In most computer vision applications, convolutional neural networks (CNNs) operate on dense image data generated by ordinary cameras. Designing CNNs for sparse and irregularly spaced input data is still an open problem with numerous applications in autonomous ... More Online, interactive user guidance for high-dimensional, constrained motion planningOct 11 2017Jul 20 2018We consider the problem of planning a collision-free path for a high-dimensional robot. Specifically, we suggest a planning framework where a motion-planning algorithm can obtain guidance from a user. In contrast to existing approaches that try to speed ... More Provable Indefinite-Horizon Real-Time Planning for Repetitive TasksJan 23 2019Apr 11 2019In many robotic manipulation scenarios, robots often have to perform highly-repetitive tasks in structured environments e.g. sorting mail in a mailroom or pick and place objects on a conveyor belt. In this work we are interested in settings where the ... More Demographical Priors for Health Conditions Diagnosis Using Medicare DataDec 07 2016Jan 09 2017This paper presents an example of how demographical characteristics of patients influence their susceptibility to certain medical conditions. In this paper, we investigate the association of health conditions to age of patients in a heterogeneous population. ... More On Casimir Operators of Conformal Galilei AlgebrasSep 18 2018In previous work, we introduced an algorithm that utilises differential operator realisations to find polynomial Casimir operators of Lie algebras. In this article we build on this work by applying the algorithm to several classes of finite dimensional ... More On$Ψ$-Laplace transform method and its applications to$Ψ$-fractional differential equationsJul 10 2019Motivated by some recent developments in$\Psi$-fractional calculus, in this paper some new properties and the uniqueness of$ \Psi $-Laplace transform in the settings of$ \Psi $-fractional calculus are established. The final goal of this research is ... More Generalized substantial fractional operators and well-posedness of Cauchy problemJul 10 2019In this work we focus on substantial fractional integral and differential operators which play an important role in modeling anomalous diffusion. We introduce a new generalized substantial fractional integral. Generalizations of fractional substantial ... More Locating the missing superconducting electrons in overdoped cupratesFeb 06 2018May 04 2019Overdoped high-temperature cuprate superconductors have been widely believed to be described by the physics of d-wave BCS-like superconductivity. However, recent measurements indicate that as the doping is increased, the superfluid density decreases smoothly ... More Urban Attractors: Discovering Patterns in Regions of Attraction in CitiesNov 30 2016Understanding the dynamics by which urban areas attract visitors is significant for urban development in cities. In addition, identifying services that relate to highly attractive districts is useful to make policies regarding the placement of such places. ... More Fixed Rate Statistical QoS Provisioning for Markovian Sources in Machine Type CommunicationJun 26 2019In this paper, we study the trade-off between reliability and latency in machine type communication (MTC), which consists of single transmitter and receiver in the presence of Rayleigh fading channel. We assume that the transmitter does not know the channel ... More DCCO: Towards Deformable Continuous Convolution OperatorsJun 09 2017Discriminative Correlation Filter (DCF) based methods have shown competitive performance on tracking benchmarks in recent years. Generally, DCF based trackers learn a rigid appearance model of the target. However, this reliance on a single rigid appearance ... More Adaptive Decontamination of the Training Set: A Unified Formulation for Discriminative Visual TrackingSep 20 2016Tracking-by-detection methods have demonstrated competitive performance in recent years. In these approaches, the tracking model heavily relies on the quality of the training set. Due to the limited amount of labeled training data, additional samples ... More Design and Control of A Hybrid Sailboat for Enhanced Tacking ManeuverNov 29 2018Sailing robots provide a low-cost solution to conduct the ocean missions such as marine exploration, pollution detection, and border surveillance, etc. However, compared with other propeller-driven surface vessels, sailboat suffers in complex marine wind ... More Multiple Sequence Alignment System for Pyrosequencing ReadsJan 19 2009Pyrosequencing is among the emerging sequencing techniques, capable of generating upto 100,000 overlapping reads in a single run. This technique is much faster and cheaper than the existing state of the art sequencing technique such as Sanger. However, ... More Locating the missing superconducting electrons in overdoped cupratesFeb 06 2018Overdoped high-temperature cuprate superconductors have been widely believed to be described by the physics of d-wave BCS-like superconductivity. However, recent measurements indicate that as the doping is increased, the superfluid density decreases smoothly ... More ECO: Efficient Convolution Operators for TrackingNov 28 2016In recent years, Discriminative Correlation Filter (DCF) based methods have significantly advanced the state-of-the-art in tracking. However, in the pursuit of ever increasing tracking performance, their characteristic speed and real-time capability have ... More Multimodal Subspace Support Vector Data DescriptionApr 16 2019In this paper, we propose a novel method for projecting data from multiple modalities to a new subspace optimized for one-class classification. The proposed method iteratively transforms the data from the original feature space of each modality to a new ... More Deep Robust Framework for Protein Function Prediction using Variable-Length Protein SequencesNov 04 2018Amino acid sequence portrays most intrinsic form of a protein and expresses primary structure of protein. The order of amino acids in a sequence enables a protein to acquire a particular stable conformation that is responsible for the functions of the ... More Deep Motion Features for Visual TrackingDec 20 2016Robust visual tracking is a challenging computer vision problem, with many real-world applications. Most existing approaches employ hand-crafted appearance features, such as HOG or Color Names. Recently, deep RGB features extracted from convolutional ... More ECO: Efficient Convolution Operators for TrackingNov 28 2016Apr 10 2017In recent years, Discriminative Correlation Filter (DCF) based methods have significantly advanced the state-of-the-art in tracking. However, in the pursuit of ever increasing tracking performance, their characteristic speed and real-time capability have ... More Learning Spatially Regularized Correlation Filters for Visual TrackingAug 19 2016Robust and accurate visual tracking is one of the most challenging computer vision problems. Due to the inherent lack of training data, a robust approach for constructing a target appearance model is crucial. Recently, discriminatively learned correlation ... More Beyond Correlation Filters: Learning Continuous Convolution Operators for Visual TrackingAug 12 2016Aug 29 2016Discriminative Correlation Filters (DCF) have demonstrated excellent performance for visual object tracking. The key to their success is the ability to efficiently exploit available negative data by including all shifted versions of a training sample. ... More Energy of Computing on Multicore CPUs: Predictive Models and Energy Conservation LawJul 05 2019Energy is now a first-class design constraint along with performance in all computing settings. Energy predictive modelling based on performance monitoring counts (PMCs) is the leading method used for prediction of energy consumption during an application ... More Revealing reionization with the thermal history of the intergalactic medium: new constraints from the Lyman-$α$flux power spectrumSep 19 2018Jan 31 2019We present a new investigation of the thermal history of the intergalactic medium (IGM) during and after reionization using the Lyman-$\alpha$forest flux power spectrum at$4.0\lesssim z\lesssim5.2$. Using a sample of 15 high-resolution spectra, we measure ... More New$Ψ$-Hadamard type fractional integral and derivativesJul 10 2019This paper develops a generalization of Hadamard type fractional calculus which has been named as the$ \Psi $-Hadamard type fractional calculus. Conditions are given under which the$\Psi$-Hadamard type fractional integral is bounded in a generalized ... More Confinement-Deconfinement Transition as an Indication of Spin-Liquid-Type Behavior in Na$_2$IrO$_3$May 08 2014Feb 23 2015We use ultrafast optical spectroscopy to observe binding of charged single-particle excitations (SE) in the magnetically frustrated Mott insulator Na$_2$IrO$_3$. Above the antiferromagnetic ordering temperature ($T_N\$) the system response is due to both ... More
CASPR: Judiciously Using the Cloud for Wide-Area Packet RecoveryDec 27 2018Jan 01 2019We revisit a classic networking problem -- how to recover from lost packets in the best-effort Internet. We propose CASPR, a system that judiciously leverages the cloud to recover from lost or delayed packets. CASPR supplements and protects best-effort ... More
Deep Reinforcement Learning based Optimal Control of Hot Water SystemsJan 04 2018Energy consumption for hot water production is a major draw in high efficiency buildings. Optimizing this has typically been approached from a thermodynamics perspective, decoupled from occupant influence. Furthermore, optimization usually presupposes ... More
ATOM: Accurate Tracking by Overlap MaximizationNov 19 2018Apr 11 2019While recent years have witnessed astonishing improvements in visual tracking robustness, the advancements in tracking accuracy have been limited. As the focus has been directed towards the development of powerful classifiers, the problem of accurate ... More
ASD-DiagNet: A hybrid learning approach for detection of Autism Spectrum Disorder using fMRI dataApr 16 2019Mental disorders such as Autism Spectrum Disorders (ASD) are heterogeneous disorders that are notoriously difficult to diagnose, especially in children. The current psychiatric diagnostic process is based purely on the behavioural observation of symptomology ... More
Imaging Strain and Electric Fields in NV Ensembles using Stark Shift MeasurementsFeb 23 2018We report measurements of optically detected magnetic resonance spectra of ensembles of negatively charged nitrogen-vacancy (NV) centers in diamonds in the presence of strain and DC external electric fields. The Stark shift of the spectral lines is stronger ... More
Analysis of Coauthorship Network in Political Science using Centrality MeasuresFeb 12 2019In recent era, networks of data are growing massively and forming a shape of complex structure. Data scientists try to analyze different complex networks and utilize these networks to understand the complex structure of a network in a meaningful way. ... More
Locating the missing superconducting electrons in overdoped cupratesFeb 06 2018Feb 27 2018Overdoped high-temperature cuprate superconductors have been widely believed to be described by the physics of d-wave BCS-like superconductivity. However, recent measurements indicate that as the doping is increased, the superfluid density decreases smoothly ... More
Semantic integration of UML class diagram with semantic validation on segments of mappingsJan 13 2018Recently, attention has focused on the software development, specially by differ-ent teams that are geographically distant to support collaborative work. Manage-ment, description and modeling in such collaborative approach are through sever-al tools and ... More
Analysis of Increasing Malwares and Cyber Crimes Using Economic ApproachJan 21 2014The economics of an internet crime has newly developed into a field of controlling black money. This economic approach not only provides estimated technique of analyzing internet crimes but also gives details to analyzers of system dependability and divergence. ... More
ATOM: Accurate Tracking by Overlap MaximizationNov 19 2018While recent years have witnessed astonishing improvements in visual tracking robustness, the advancements in tracking accuracy have been severely limited. As the focus has been directed towards the development of powerful classifiers, the problem of ... More
Object Counting and Instance Segmentation with Image-level SupervisionMar 06 2019Common object counting in a natural scene is a challenging problem in computer vision with numerous real-world applications. Existing image-level supervised common object counting approaches only predict the global object count and rely on additional ... More
Object Counting and Instance Segmentation with Image-level SupervisionMar 06 2019May 13 2019Common object counting in a natural scene is a challenging problem in computer vision with numerous real-world applications. Existing image-level supervised common object counting approaches only predict the global object count and rely on additional ... More
An Efficient Algorithm for Clustering of Large-Scale Mass Spectrometry DataJan 04 2013High-throughput spectrometers are capable of producing data sets containing thousands of spectra for a single biological sample. These data sets contain a substantial amount of redundancy from peptides that may get selected multiple times in a LC-MS/MS ... More
Mining Temporal Patterns from iTRAQ Mass Spectrometry(LC-MS/MS) DataApr 28 2011Large-scale proteomic analysis is emerging as a powerful technique in biology and relies heavily on data acquired by state-of-the-art mass spectrometers. As with any other field in Systems Biology, computational tools are required to deal with this ocean ... More
DNN-HMM based Speaker Adaptive Emotion Recognition using Proposed Epoch and MFCC FeaturesJun 04 2018Speech is produced when time varying vocal tract system is excited with time varying excitation source. Therefore, the information present in a speech such as message, emotion, language, speaker is due to the combined effect of both excitation source ... More
Document Decomposition of Bangla Printed TextJan 27 2017Today all kind of information is getting digitized and along with all this digitization, the huge archive of various kinds of documents is being digitized too. We know that, Optical Character Recognition is the method through which, newspapers and other ... More
Robustness maximization of parallel multichannel systemsApr 29 2010Bit error rate (BER) minimization and SNR-gap maximization, two robustness optimization problems, are solved, under average power and bit-rate constraints, according to the waterfilling policy. Under peak-power constraint the solutions differ and this ... More
Magnetic Resonance Lithography with Nanometer ResolutionMay 18 2015We propose an approach for super-resolution optical lithography which is based on the inverse of magnetic resonance imaging (MRI). The technique uses atomic coherence in an ensemble of spin systems whose final state population can be optically detected. ... More
Optimum Transmission Rate in Fading Channels with Markovian Sources and QoS ConstraintsAug 21 2018This paper evaluates the performance of reliability and latency in machine type communication networks, which composed of single transmitter and receiver in the presence of Rayleigh fading channel. The source's traffic arrivals are modeled as Markovian ... More
Discriminative Scale Space TrackingSep 20 2016Accurate scale estimation of a target is a challenging research problem in visual object tracking. Most state-of-the-art methods employ an exhaustive scale search to estimate the target size. The exhaustive search strategy is computationally expensive ... More
A Single-Planner Approach to Multi-Modal Humanoid MobilityJan 30 2018In this work, we present an approach to planning for humanoid mobility. Humanoid mobility is a challenging problem, as the configuration space for a humanoid robot is intractably large, especially if the robot is capable of performing many types of locomotion. ... More
Judicious QoS using Cloud OverlaysJun 06 2019We revisit the long-standing problem of providing network QoS to applications, and propose the concept of judicious QoS -- combining the cheaper, best effort IP service with the cloud, which offers a highly reliable infrastructure and the ability to add ... More
Binary Patterns Encoded Convolutional Neural Networks for Texture Recognition and Remote Sensing Scene ClassificationJun 05 2017Mar 26 2018Designing discriminative powerful texture features robust to realistic imaging conditions is a challenging computer vision problem with many applications, including material recognition and analysis of satellite or aerial imagery. In the past, most texture ... More