Searching Arxiv, refresh for possibly better results.

total 140took 0.12s

Network Pruning for Low-Rank Binary IndexingMay 14 2019Pruning is an efficient model compression technique to remove redundancy in the connectivity of deep neural networks (DNNs). Computations using sparse matrices obtained by pruning parameters, however, exhibit vastly different parallelism depending on ... More

DeepTwist: Learning Model Compression via Occasional Weight DistortionOct 30 2018Model compression has been introduced to reduce the required hardware resources while maintaining the model accuracy. Lots of techniques for model compression, such as pruning, quantization, and low-rank approximation, have been suggested along with different ... More

Constraints on the gas masses of low-z damped Lyman-$α$ systemsJun 04 2014Jun 06 2014We report a deep search for redshifted HI 21 cm emission from three damped and sub-damped Lyman-$\alpha$ absorbers (DLAs) at $z \approx 0.1$ with the Green Bank Telescope (GBT). No evidence for a redshifted HI 21 cm emission signal was obtained in the ... More

Health risk modelling by transforming a multi-dimensional unknown distribution to a multi-dimensional GaussianApr 22 2015Sep 09 2015The traditional approach of health risk modelling with multiple data sources proceeds via regression-based methods assuming a marginal distribution for the outcome variable. The data is collected for $N$ subjects over a $J$ time-period or from $J$ data ... More

A polynomial time algorithm for finding an approximate shortest path amid weighted regionsJan 02 2015Apr 18 2015We devise a polynomial-time approximation scheme for the classical geometric problem of finding an approximate short path amid weighted regions. In this problem, a triangulated region P comprising of n vertices, a positive weight associated with each ... More

Price of Anarchy with Heterogeneous Latency FunctionsJul 11 2014Aug 29 2015In this paper we consider the price of anarchy (PoA) in multi-commodity flows where the latency or delay function on an edge has a heterogeneous dependency on the flow commodities, i.e. when the delay on each link is dependent on the flow of individual ... More

Radiative Corrections as Origin of Tiny Fermion MassesFeb 23 2015The fermion masses in the standard model are introduced as arbitrary parameters and there is no understanding of their origin. In this letter it is suggested that small non zero neutrino masses may be a reflection of broken stochastic supersymmetry that ... More

Visceral Machines: Risk-Aversion in Reinforcement Learning with Intrinsic Physiological RewardsMay 25 2018Mar 22 2019As people learn to navigate the world, autonomic nervous system (e.g., "fight or flight") responses provide intrinsic feedback about the potential consequence of action choices (e.g., becoming nervous when close to a cliff edge or driving fast around ... More

Coresets of obstacles in approximating Euclidean shortest path amid convex obstaclesJun 05 2015Given a set \cal{P} of non-intersecting convex obstacles, we find a sketch \Omega of \cal{P} that helps in finding an obstacle avoiding approximate Euclidean shortest path between two given points amid \mathcal{P} efficiently. For both \mathbb{R}^2 and ... More

A Quantum Algorithm for finding the MaximumNov 18 1999This paper describes a quantum algorithm for finding the maximum among N items. The classical method for the same problem takes O(N) steps because we need to compare two numbers in one step. This algorithm takes O(sqrt(N)) steps by exploiting the property ... More

ANN queries: covering Voronoi diagram with hyperboxesNov 25 2011Jun 16 2014Given a set $S$ of $n$ points in $d$-dimensional Euclidean metric space $X$ and a small positive real number $\epsilon$, we present an algorithm to preprocess $S$ and answer queries that require finding a set $S' \subseteq S$ of $\epsilon$-approximate ... More

Quantum Mechanics in PseudotimeApr 20 2016Based on some results on reparmetrisation of time in Hamiltonian path integral formalism, a pseudo time formulation of operator formalism of quantum mechanics is presented. Relation of reparametrisation of time in quantum with super symmetric quantum ... More

Floquet analysis of real-time wavefunctions without solving the Floquet equationOct 07 2011Jan 31 2012We propose a method to obtain Floquet states---also known as light-induced states---and their quasi-energies from real-time wavefunctions without solving the Floquet equation. This is useful for the analysis of various phenomena in time-dependent quantum ... More

The Budgeted Transportation ProblemFeb 24 2013Consider a transportation problem with sets of sources and sinks. There are profits and prices on the edges. The goal is to maximize the profit while meeting the following constraints; the total flow going out of a source must not exceed its capacity ... More

Efficient Construction of Spanners in $d$-DimensionsMar 28 2013In this paper we consider the problem of efficiently constructing $k$-vertex fault-tolerant geometric $t$-spanners in $\dspace$ (for $k \ge 0$ and $t >1$). Vertex fault-tolerant spanners were introduced by Levcopoulus et. al in 1998. For $k=0$, we present ... More

Approximating Quadratic 0-1 Programming via SOCPDec 26 2013We consider the problem of approximating Quadratic O-1 Integer Programs with bounded number of constraints and non-negative constraint matrix entries, which we term as PIQP. We describe and analyze a randomized algorithm based on a program with hyperbolic ... More

Stochastic Quantization of Axial Vector Gauge TheoriesOct 31 2018The stochastic quantization scheme proposed by Parisi and Wu in 1981 is known to have differences from conventional quantum field theory in higher orders. It has been suggested that some of these new features might give rise to a mechanism to explain ... More

Approximate Shortest Path through a Weighted Planar SubdivisionNov 30 2010This paper presents an approximation algorithm for finding a shortest path between two points $s$ and $t$ in a weighted planar subdivision $\PS$. Each face $f$ of $\PS$ is associated with a weight $w_f$, and the cost of travel along a line segment on ... More

State of the art parallel approaches for RSA public key based cryptosystemMar 12 2015RSA is one of the most popular Public Key Cryptography based algorithm mainly used for digital signatures, encryption/decryption etc. It is based on the mathematical scheme of factorization of very large integers which is a compute-intensive process and ... More

Safe Control under UncertaintyOct 25 2015Controller synthesis for hybrid systems that satisfy temporal specifications expressing various system properties is a challenging problem that has drawn the attention of many researchers. However, making the assumption that such temporal properties are ... More

Inducement of Spin-pairing and Correlated Semi-metallic State in Mott-Hubbard Quantum Dot ArrayApr 14 2008We model a quantum dot-array (with one electron per dot) comprising of two (or more than two) coupled dots by an extended Hubbard Hamiltonian to investigate the role played by the inter-dot tunneling amplitude td, together with intra-dot (U) and inter-dot(U1) ... More

Price of Anarchy with Heterogeneous Latency FunctionsJul 11 2014Jan 01 2019In this paper we consider the price of anarchy (PoA) in multi-commodity flows where the latency or delay function on an edge has a heterogeneous dependency on the flow commodities, i.e. when the delay on each link is dependent on the flow of individual ... More

Auction Algorithm for Production ModelsApr 16 2013We show an auction-based algorithm to compute market equilibrium prices in a production model, where consumers purchase items under separable nonlinear utility concave functions which satisfy W.G.S(Weak Gross Substitutes); producers produce items with ... More

A Tight Lower Bound for the Weights of Maximum Weight Matching in Bipartite GraphsMay 02 2016Let $\mathcal{G}_{m,\sigma}$ be the collection of all weighted bipartite graphs each having $\sigma$ and $m$, as the size of a vertex partition and the total weight, respectively. We give a tight lower bound $\lceil \frac{m-\sigma}{\sigma} \rceil+1$ for ... More

Non-iterative rigid 2D/3D point-set registration using semidefinite programmingJan 04 2015Apr 06 2016We describe a convex programming framework for pose estimation in 2D/3D point-set registration with unknown point correspondences. We give two mixed-integer nonlinear program (MINP) formulations of the 2D/3D registration problem when there are multiple ... More

On Discarding, Caching, and Recalling Samples in Active LearningJun 20 2012We address challenges of active learning under scarce informational resources in non-stationary environments. In real-world settings, data labeled and integrated into a predictive model may become invalid over time. However, the data can become informative ... More

Chaos in Dynamics of a Family of Transcendental Meromorphic FunctionsSep 07 2014The characterization and properties of Julia sets of one parameter family of transcendental meromorphic functions $\zeta_\lambda(z)=\lambda \frac{z}{z+1} e^{-z}$, $\lambda >0$, $z\in \mathbb{C}$ is investigated in the present paper. It is found that bifurcations ... More

Ins-Robust Primitive WordsJul 04 2017Aug 03 2017Let Q be the set of primitive words over a finite alphabet with at least two symbols. We characterize a class of primitive words, Q_I, referred to as ins-robust primitive words, which remain primitive on insertion of any letter from the alphabet and present ... More

Proposed System for data hiding using Cryptography and Steganography Proposed System for data hiding using Cryptography and SteganographySep 15 2010Steganography and Cryptography are two popular ways of sending vital information in a secret way. One hides the existence of the message and the other distorts the message itself. There are many cryptography techniques available; among them AES is one ... More

Schrodinger Equation for Lagrangian Path Integral with Scaling of Local TimeJul 14 1995A method for deriving the Schrodinger equation for Lagrangian path integral with scaling of local time is given.

HAMILTONIAN PATH INTEGRAL QUANTIZATION IN ARBITRARY CO-ORDINATES AND EXACT PATH INTEGRATIONJan 05 1995We briefly review a hamiltonian path integral formalism developed earlier by one of us. An important feature of this formalism is that the path integral quantization in arbitrary co-ordinates is set up making use of only classical hamiltonian without ... More

Local Scaling of Time in Hamiltonian Path IntegrationJan 04 1995Inspired by the usefulness of local scaling of time in the path integral formalism, we introduce a new kind of hamiltonian path integral in this paper. A special case of this new type of path integral has been earlier found useful in formulating a scheme ... More

Lidstone Fractal Interpolation and Error AnalysisJul 09 2014In the present paper, the notion of Lidstone Fractal Interpolation Function ($Lidstone \ FIF$) is introduced to interpolate and approximate data generating functions that arise from real life objects and outcomes of several scientific experiments. A Lidstone ... More

Newton's Equation on the kappa space-time and the Kepler problemMar 24 2010Aug 06 2010We study the modification of Newton's second law, upto first order in the deformation parameter $a$, in the $\kappa$-space-time. We derive the deformed Hamiltonian, expressed in terms of the commutative phase space variables, describing the particle moving ... More

Hamiltonian path integral quantization in polar coordinatesApr 15 1998Using a scheme proposed earlier we set up Hamiltonian path integral quantization for a particle in two dimensions in plane polar coordinates.This scheme uses the classical Hamiltonian, without any $O(\hbar^2)$ terms, in the polar varivables. We show that ... More

Periodicity of the time-dependent Kohn-Sham equation and the Floquet theoremFeb 25 2013The Floquet theorem allows to reformulate periodic time-dependent problems such as the interaction of a many-body system with a laser field in terms of time-independent, field-dressed states, also known as Floquet states. If this was possible for density ... More

The Band Gap in Silicon NanocrystallitesJul 21 2001The gap in semiconductor nanocrystallites has been extensively studied both theoretically and experimentally over the last two decades. We have compared a recent ``state-of-the-art'' theoretical calculation with a recent ``state-of-the-art'' experimental ... More

Optical absorption and emission of a quantum dot in the Kondo regimeOct 14 2008A variant of the Anderson model, that describes hybridization between localized state (c-state) of a quantum dot and a Fermi sea conduction band, is investigated. We demonstrate that, as a function of the hybridization parameter v, the system undergoes ... More

Stability of Coalescence Hidden variable Fractal Interpolation SurfacesSep 03 2009In the present paper, the stability of Coalescence Hidden variable Fractal Interpolation Surfaces(CHFIS) is established. The estimates on error in approximation of the data generating function by CHFIS are found when there is a perturbation in independent, ... More

Fast Second-order Cone Programming for Safe Mission PlanningSep 16 2016Feb 27 2017This paper considers the problem of safe mission planning of dynamic systems operating under uncertain environments. Much of the prior work on achieving robust and safe control requires solving second-order cone programs (SOCP). Unfortunately, existing ... More

Riffled Independence for Efficient Inference with Partial RankingsJan 23 2014Distributions over rankings are used to model data in a multitude of real world settings such as preference analysis and political elections. Modeling such distributions presents several computational challenges, however, due to the factorial size of ... More

Quantum Algorithms for Nearest-Neighbor Methods for Supervised and Unsupervised LearningJan 09 2014Jul 18 2014We present several quantum algorithms for performing nearest-neighbor learning. At the core of our algorithms are fast and coherent quantum methods for computing distance metrics such as the inner product and Euclidean distance. We prove upper bounds ... More

A new orthogonalization procedure with an extremal propertyMar 26 1998Various methods of constructing an orthonomal set out of a given set of linearly independent vectors are discussed. Particular attention is paid to the Gram-Schmidt and the Schweinler-Wigner orthogonalization procedures. A new orthogonalization procedure ... More

Earthquake and Geothermal EnergySep 30 2013The origin of earthquake has long been recognized as resulting from strike-slip instability of plate tectonics along the fault lines. Several events of earthquake around the globe have happened which cannot be explained by this theory. In this work we ... More

Super Fractal Interpolation FunctionsJan 17 2012In the present work, the notion of Super Fractal Interpolation Function (SFIF) is introduced for finer simulation of the objects of the nature or outcomes of scientific experiments that reveal one or more structures embedded in to another. In the construction ... More

Fast Second-order Cone Programming for Safe Mission PlanningSep 16 2016This paper considers the problem of safe mission planning of dynamic systems operating under uncertain environments. Much of the prior work on achieving robust and safe control requires solving second-order cone programs (SOCP). Unfortunately, existing ... More

Active Learning amidst Logical KnowledgeSep 26 2017Structured prediction is ubiquitous in applications of machine learning such as knowledge extraction and natural language processing. Structure often can be formulated in terms of logical constraints. We consider the question of how to perform efficient ... More

Quantum Perceptron ModelsFeb 15 2016We demonstrate how quantum computation can provide non-trivial improvements in the computational and statistical complexity of the perceptron model. We develop two quantum algorithms for perceptron learning. The first algorithm exploits quantum information ... More

Efficient Probabilistic Inference with Partial Ranking QueriesFeb 14 2012Distributions over rankings are used to model data in various settings such as preference analysis and political elections. The factorial size of the space of rankings, however, typically forces one to make structural assumptions, such as smoothness, ... More

Coefficient Estimates for Inverses of Starlike Functions of Positive OrderNov 03 2005In the present paper, the coefficient estimates are found for the class $\mathcal S^{*-1}(\alpha)$ consisting of inverses of functions in the class of univalent starlike functions of order $\alpha$ in $\mathcal D=\{z\in\mathbb C:|z|<1\}$. These estimates ... More

Multiresolution Analysis Based on Coalescence Hidden-variable FIFJan 17 2012In the present paper, multiresolution analysis arising from Coalescence Hidden-variable Fractal Interpolation Functions (CHFIFs) is accomplished. The availability of a larger set of free variables and constrained variables with CHFIF in multiresolution ... More

Facial Gesture Recognition Using Correlation And Mahalanobis DistanceMar 09 2010Augmenting human computer interaction with automated analysis and synthesis of facial expressions is a goal towards which much research effort has been devoted recently. Facial gesture recognition is one of the important component of natural human-machine ... More

Non-Commutative space-time and Hausdorff dimensionApr 24 2017Oct 26 2017We study the Hausdorff dimension of the path of a quantum particle in non-commutative space-time. We show that the Hausdorff dimension depends on the deformation parameter $a$ and the resolution $\Delta x$ for both non-relativistic and relativistic quantum ... More

Quantum Deep LearningDec 10 2014May 22 2015In recent years, deep learning has had a profound impact on machine learning and artificial intelligence. At the same time, algorithms for quantum computers have been shown to efficiently solve some problems that are intractable on conventional, classical ... More

Fermi pockets and quantum oscillations in specific heat of YBCO in the presence of disorderJul 28 2010We investigate a chiral d-density wave (CDDW) mean field model Hamiltonian in the momentum space suitable for the hole-doped cuprates, such as YBCO, in the pseudo-gap phase to obtain the Fermi surface(FS)topologies, including the anisotropy parameter(\'Epsilon) ... More

Risk-Aware Algorithms for Adversarial Contextual BanditsOct 17 2016In this work we consider adversarial contextual bandits with risk constraints. At each round, nature prepares a context, a cost for each arm, and additionally a risk for each arm. The learner leverages the context to pull an arm and then receives the ... More

Probabilistic Safety ProgramsOct 17 2016Achieving safe control under uncertainty is a key problem that needs to be tackled for enabling real-world autonomous robots and cyber-physical systems. This paper introduces Probabilistic Safety Programs (PSP) that embed both the uncertainty in the environment ... More

Uniformly accelerating observer in $κ$-deformed space-timeJun 27 2012Jul 24 2012In this paper, we study the effect of $\kappa$-deformation of the space-time on the response function of a uniformly accelerating detector coupled to a scalar field. Starting with $\kappa$-deformed Klein-Gordon theory, which is invariant under a $\kappa$-Poincar\'e ... More

Quantum effects in topological and Schwarzschild de Sitter brane: Aspects of torsion on ${\mathbf{(D{\bar D})_4}}$-brane universeJul 29 2014Oct 18 2014We investigate an effective torsion curvature in a second order formalism underlying a two form world-volume dynamics in a $D_5$-brane. In particular, we consider the two form in presence of a background (open string) metric in a $U(1)$ gauge theory. ... More

Fission barrier, damping of shell correction and neutron emission in the fission of A$\sim$200Apr 10 2015Decay of $^{210}$Po compound nucleus formed in light and heavy-ion induced fusion reactions has been analyzed simultaneously using a consistent prescription for fission barrier and nuclear level density incorporating shell correction and its damping with ... More

A near optimal algorithm for finding Euclidean shortest path in polygonal domainNov 30 2010We present an algorithm to find an {\it Euclidean Shortest Path} from a source vertex $s$ to a sink vertex $t$ in the presence of obstacles in $\Re^2$. Our algorithm takes $O(T+m(\lg{m})(\lg{n}))$ time and $O(n)$ space. Here, $O(T)$ is the time to triangulate ... More

Using Contexts and Constraints for Improved Geotagging of Human Trafficking WebpagesApr 19 2017Extracting geographical tags from webpages is a well-motivated application in many domains. In illicit domains with unusual language models, like human trafficking, extracting geotags with both high precision and recall is a challenging problem. In this ... More

Nostalgin: Extracting 3D City Models from Historical Image DataMay 06 2019What did it feel like to walk through a city from the past? In this work, we describe Nostalgin (Nostalgia Engine), a method that can faithfully reconstruct cities from historical images. Unlike existing work in city reconstruction, we focus on the task ... More

Surrogate-assisted parallel tempering for Bayesian neural learningNov 21 2018Parallel tempering addresses some of the drawbacks of canonical Markov Chain Monte-Carlo methods for Bayesian neural learning with the ability to utilize high performance computing. However, certain challenges remain given the large range of network parameters ... More

Construction of 2nd stage shape invariant potentialsDec 18 2017We introduce concept of next generation shape invariance and show that the process of shape invariant extension can be continued indefinitely.

Investigation of confined electron gas in a quantum well structure with photovoltaic applicationJan 13 2009The growth-diection quantization of confined electron gas in a GaAs/AlGaAs based quantum well structure is obtained in the Kohn-Sham iterative computational scheme. The longitudinal conductance at low temperatures, in the presence of magnetic field applied ... More

Identifying Bias in AI using SimulationSep 30 2018Machine learned models exhibit bias, often because the datasets used to train them are biased. This presents a serious problem for the deployment of such technology, as the resulting models might perform poorly on populations that are minorities within ... More

Convergence of Cubic Spline Super Fractal Interpolation FunctionsJan 19 2012In the present work, the notion of Cubic Spline Super Fractal Interpolation Function (SFIF) is introduced to simulate an object that depicts one structure embedded into another and its approximation properties are investigated. It is shown that, for an ... More

A Secure Multi-Party Computation Protocol for Malicious Computation Prevention for preserving privacy during Data MiningAug 07 2009Secure Multi-Party Computation (SMC) allows parties with similar background to compute results upon their private data, minimizing the threat of disclosure. The exponential increase in sensitive data that needs to be passed upon networked computers and ... More

Calculation of Band Edge Eigenfunctions and Eigenvalues of Periodic Potentials through the Quantum Hamilton - Jacobi FormalismDec 04 2003We obtain the band edge eigenfunctions and the eigenvalues of solvable periodic potentials using the quantum Hamilton - Jacobi formalism. The potentials studied here are the Lam{\'e} and the associated Lam{\'e} which belong to the class of elliptic potentials. ... More

Optical vortex array in spatially varying latticeDec 16 2015We present an experimental method based on a modified multiple beam interference approach to generate an optical vortex array arranged in a spatially varying lattice. This method involves two steps which are: numerical synthesis of a consistent phase ... More

An Algorithmic Framework to Control Bias in Bandit-based PersonalizationFeb 23 2018Personalization is pervasive in the online space as it leads to higher efficiency and revenue by allowing the most relevant content to be served to each user. However, recent studies suggest that personalization methods can propagate societal or systemic ... More

Inverse Optimal Planning for Air Traffic ControlMar 25 2019We envision a system that concisely describes the rules of air traffic control, assists human operators and supports dense autonomous air traffic around commercial airports. We develop a method to learn the rules of air traffic control from real data ... More

Scheduling unit processing time arc shutdown jobs to maximize network flow over time: complexity resultsJun 20 2013We study the problem of scheduling maintenance on arcs of a capacitated network so as to maximize the total flow from a source node to a sink node over a set of time periods. Maintenance on an arc shuts down the arc for the duration of the period in which ... More

Distributed Scheduling in Multiple Access with Bursty Arrivals and Delay ConstraintsFeb 02 2016We consider a distributed multiple access system with bursty arrivals. The transmissions are grouped into slots and the users are frame-synchronized. At the start of each time slot, variable sized packets independently arrive at each of the transmitting ... More

Means Moments and Newton's InequalitiesFeb 15 2017It is shown that Newton's inequalities and the related Maclaurin's inequalities provide several refinements of the fundamental Arithmetic mean - Geometric mean - Harmonic mean inequality in terms of the means and variance of positive real numbers. We ... More

AirSim: High-Fidelity Visual and Physical Simulation for Autonomous VehiclesMay 15 2017Jul 18 2017Developing and testing algorithms for autonomous vehicles in real world is an expensive and time consuming process. Also, in order to utilize recent advances in machine intelligence and deep learning we need to collect a large amount of annotated training ... More

Architecture for Automated Tagging and Clustering of Song Files According to MoodJun 12 2012Music is one of the basic human needs for recreation and entertainment. As song files are digitalized now a days, and digital libraries are expanding continuously, which makes it difficult to recall a song. Thus need of a new classification system other ... More

Quantum Hamilton-Jacobi analysis of PT symmetric HamiltoniansMar 06 2004We apply the quantum Hamilton-Jacobi formalism, naturally defined in the complex domain, to a number of complex Hamiltonians, characterized by discrete parity and time reversal (PT) symmetries and obtain their eigenvalues and eigenfunctions. Examples ... More

Verifying Controllers Against Adversarial Examples with Bayesian OptimizationFeb 23 2018Feb 26 2018Recent successes in reinforcement learning have lead to the development of complex controllers for real-world robots. As these robots are deployed in safety-critical applications and interact with humans, it becomes critical to ensure safety in order ... More

Shape Invariant Potentials in Higher DimensionsDec 13 2014In this paper we investigate the shape invariance property of a potential in one dimension. We show that a simple ansatz allows us to reconstruct all the known shape invariant potentials in one dimension. This ansatz can be easily extended to arrive at ... More

Construction of localized atomic wave packetsJun 11 2008It is shown that highly localized solitons can be created in lower dimensional Bose-Einstein condensates (BEC), trapped in a regular harmonic trap, by temporally varying the trap frequency. A BEC trapped in such a trap can be effectively used to construct ... More

Designing bound states in a band as a model for a quantum networkJan 05 2006We provide a model of a one dimensional quantum network, in the framework of a lattice using Von Neumann and Wigner's idea of bound states in a continuum. The localized states acting as qubits are created by a controlled deformation of a periodic potential. ... More

Enhanced Magnetism & Time - Stable Remanence at the Interface of Hematite and Carbon NanotubesOct 16 2018The interface of two dissimilar materials is well known for surprises in condensed matter, and provides avenues for rich physics as well as seeds for future technological advancements. We present some exciting magnetization (M) and remnant magnetization ... More

Quantum Inspired Training for Boltzmann MachinesJul 09 2015We present an efficient classical algorithm for training deep Boltzmann machines (DBMs) that uses rejection sampling in concert with variational approximations to estimate the gradients of the training objective function. Our algorithm is inspired by ... More

Learning to Gather Information via ImitationNov 13 2016The budgeted information gathering problem - where a robot with a fixed fuel budget is required to maximize the amount of information gathered from the world - appears in practice across a wide range of applications in autonomous exploration and inspection ... More

Energy Eigenvalues For Supersymmetric Potentials via Quantum Hamilton-Jacobi FormalismJul 27 1995Using quantum Hamilton-Jacobi formalism of Leacock and Padgett, we show how to obtain the exact eigenvalues for supersymmetric (SUSY) potentials.

Balanced News Using Constrained Bandit-based PersonalizationJun 24 2018We present a prototype for a news search engine that presents balanced viewpoints across liberal and conservative articles with the goal of de-polarizing content and allowing users to escape their filter bubble. The balancing is done according to flexible ... More

Explorations and Lessons Learned in Building an Autonomous Formula SAE Car from SimulationsMay 15 2019This paper describes the exploration and learnings during the process of developing a self-driving algorithm in simulation, followed by deployment on a real car. We specifically concentrate on the Formula Student Driverless competition. In such competitions, ... More

Protection Against Reconstruction and Its Applications in Private Federated LearningDec 03 2018Federated learning has become an exciting direction for both research and practical training of models with user data. Although data remains decentralized in federated learning, it is common to assume that the model updates are sent in the clear from ... More

A reclaimer scheduling problem arising in coal stockyard managementFeb 17 2014Jan 01 2015We study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of each of the variants, providing complexity proofs for some and polynomial ... More

Piecemeal Journey To 'HALCYON' World Of Pervasive Computing : From past progress to future challengesMar 12 2010Although 'Halcyon' means serene environment which pervasive computing aims at, we have tried to present a different interpretation of this word. Through our approach, we look at it in context of achieving future 'calm technology'. The paper gives a general ... More

Bayesian inference via rejection filteringNov 20 2015Dec 03 2015We provide a method for approximating Bayesian inference using rejection sampling. We not only make the process efficient, but also dramatically reduce the memory required relative to conventional methods by combining rejection sampling with particle ... More

Electronic viscosity in a multiple quantum well systemJul 21 2010We calculate the electronic viscosity for a multiple quantum well structure in the presence of disorder potential(V = 4 meV), the electron-electron repulsion(U = 5-17 meV) and a strong magnetic field (B greater than or equal to 16.5 T) in the direction ... More

Bound States and Band Structure - a Unified Treatment through the Quantum Hamilton - Jacobi ApproachJun 24 2005We analyze the Scarf potential, which exhibits both discrete energy bound states and energy bands, through the quantum Hamilton-Jacobi approach. The singularity structure and the boundary conditions in the above approach, naturally isolate the bound and ... More

Adaptive Information Gathering via Imitation LearningMay 22 2017In the adaptive information gathering problem, a policy is required to select an informative sensing location using the history of measurements acquired thus far. While there is an extensive amount of prior work investigating effective practical approximations ... More

QHJ, WKB and exact quantisationSep 18 2009We present a simple derivation of the WKB quantisation condition using the quantum Hamilton-Jacobi formalism and propose an exact quantisation condition within this formalism for integrable models in higher dimensions.

Periodic Quasi - Exactly Solvable ModelsMar 27 2004Various quasi-exact solvability conditions, involving the parameters of the periodic associated Lam{\'e} potential, are shown to emerge naturally in the quantum Hamilton-Jacobi approach. It is found that, the intrinsic nonlinearity of the Riccati type ... More

A Study of Quasi-Exactly Solvable Models within the Quantum Hamilton-Jacobi MethodJul 06 2002Mar 07 2003A few quasi-exactly solvable models are studied within the quantum Hamilton-Jacobi formalism. By assuming a simple singularity structure of the quantum momentum function, we show that the exact quantization condition leads to the condition for quasi-exact ... More

On Exactness Of The Supersymmetric WKB Approximation SchemeDec 14 1995Exactness of the lowest order supersymmetric WKB (SWKB) quantization condition $\int^{x_2}_{x_1} \sqrt{E-\omega^2(x)} dx = n \hbar \pi$, for certain potentials, is examined, using complex integration technique. Comparison of the above scheme with a similar, ... More