Rahul Singh

Rahul Singh
Are you Rahul Singh?

Claim your profile, edit publications, add additional information:

Contact Details

Rahul Singh

Pubs By Year

Pub Categories

Computer Science - Networking and Internet Architecture (12)
Mathematics - Differential Geometry (3)
Physics - Materials Science (3)
Mathematics - Optimization and Control (2)
Mathematics - Analysis of PDEs (2)
Computer Science - Information Theory (1)
Mathematics - Information Theory (1)
Physics - Strongly Correlated Electrons (1)
Computer Science - Cryptography and Security (1)
Mathematics - Mathematical Physics (1)
Mathematics - Probability (1)
Physics - Instrumentation and Detectors (1)
Mathematics - Algebraic Geometry (1)
Mathematics - Number Theory (1)
Mathematics - Representation Theory (1)
Mathematics - Complex Variables (1)
Computer Science - Learning (1)
Statistics - Machine Learning (1)
Mathematical Physics (1)

Publications Authored By Rahul Singh

We design dynamic routing policies for an overlay network which meet delay requirements of real-time traffic being served on top of an underlying legacy network, where the overlay nodes do not know the underlay characteristics. We pose the problem as a constrained MDP, and show that when the underlay implements static policies such as FIFO with randomized routing, then a decentralized policy, that can be computed efficiently in a distributed fashion, is optimal. When the underlay implements a dynamic policy, we show that the same decentralized policy performs as well as any decentralized policy. Read More

We consider the problem of designing an allocation rule or an "online learning algorithm" for a class of bandit problems in which the set of control actions available at each time $s$ is a convex, compact subset of $\mathbb{R}^d$. Upon choosing an action $x$ at time $s$, the algorithm obtains a noisy value of the unknown and time-varying function $f_s$ evaluated at $x$. The "regret" of an algorithm is the gap between its expected reward, and the reward earned by a strategy which has the knowledge of the function $f_s$ at each time $s$ and hence chooses the action $x_s$ that maximizes $f_s$. Read More

We show that a Born-Infeld soliton can be realised either as a spacelike minimal graph or timelike minimal graph over a timelike plane or a combination of both away from singular points. We also obtain some exact solutions of the Born-Infeld equation from already known solutions to the maximal surface equation. Further we present a method to construct a one-parameter family of complex solitons from a given one parameter family of maximal surfaces. Read More

We give a different formulation for describing maximal surfaces in Lorentz-Minkowski space, $\mathbb{L}^3$, using the identification of $\mathbb L^3$ with $\mathbb C\times \mathbb R$. Further we give a different proof for the singular Bj\"orling problem for the case of closed real analytic null curve. As an application, we show the existence of maximal surface which contains a given curve and has a special singularity. Read More

Let $P$ be a parabolic subgroup in $SL_n(\mathbb C)$. We show that there is a $SL_n(\mathbb C)$-stable closed subvariety of an affine Schubert variety in an infinite dimensional partial Flag variety (associated to the Kac-Moody group ${\widehat{SL_n}(\mathbb C)}$) which is a natural compactification of the cotangent bundle to $SL_n(\mathbb C)/P$. As a consequence, we recover the Springer resolution for any orbit closure inside the variety of nilpotent matrices. Read More

We provide a unified framework using which we design scalable dynamic adaptive video streaming algorithms based on index based policies (dubbed DAS-IP) to maximize the Quality of Experience (QoE) provided to clients using video streaming services. Due to the distributed nature of our algorithm, it is easily implementable. We begin by considering the simplest set-up of a one-hop wireless network in which an Access Point (AP) transmits video packets to multiple clients over a shared unreliable channel. Read More

We address the problem of optimal routing in overlay networks. An overlay network is constructed by adding new overlay nodes on top of a legacy network. The overlay nodes are capable of implementing any dynamic routing policy, however, the legacy underlay has a fixed, single path routing scheme and uses a simple work-conserving forwarding policy. Read More

Structural, resistivity, thermoelectric power and magneto-transport properties of Cu doped Bi2Te3 topological insulators have been investigated. The occurrence of the tuning of charge carriers from n type to p type by Cu doping at Te sites of Bi2Te3 is observed both from Hall effect and thermoelectric power measurements. Carrier mobility decreases with the doping of Cu which provides evidence of the movement of Fermi level from bulk conduction band to the bulk valence band. Read More

We review beam position monitors adopting the perspective of an analogue-to- digital converter in a sampling data acquisition system. From a statistical treatment of independent data samples we derive basic formulae of position uncertainty for beam position monitors. Uncertainty estimates only rely on a few simple model parameters and have been calculated for two "practical" signal shapes, a square pulse and a triangular pulse. Read More

We obtain the Weierstrass-Enneper representation for maximal graphs(whose Gauss map is one-one) in Lorentz-Minkowski space. For this we use the method of Barbishov and Chernikov, which they have used to find the solutions of Born-Infeld equation in hodographic coordinates. We could use their method in our case, because we realized that the maximal surface equation and Born-Infeld equation are related via a wick rotation in the first variable of the parametrising domain. Read More

We consider unreliable multi-hop networks serving multiple flows in which packets not delivered to their destination nodes by their deadlines are dropped. We address the design of policies for routing and scheduling packets that optimize any specified weighted average of the throughputs of the flows. We provide a new approach which directly yields an optimal distributed scheduling policy that attains any desired maximal timely-throughput vector under average-power constraints on the nodes. Read More

A smart grid connects wind or solar or storage farms, fossil fuel plants, industrialor commercial loads, or load serving entities, modeled as stochastic dynamical systems. In each time period, they consume or supply electrical energy, with the constraint that total generation equals consumption. Each agent's utility is either the benefit accrued from consumption, or negative of generation cost. Read More

In this paper, we redefine the Graph Fourier Transform (GFT) under the DSP$_\mathrm{G}$ framework. We consider the Jordan eigenvectors of the directed Laplacian as graph harmonics and the corresponding eigenvalues as the graph frequencies. For this purpose, we propose a shift operator based on the directed Laplacian of a graph. Read More

We consider a smart-grid connecting several agents, modeled as stochastic dynamical systems, who may be electricity consumers/producers. At each discrete time instant, which may represent a 15 minute interval, each agent may consume/generate some quantity of electrical energy. The Independent System Operator (ISO) is given the task of assigning consumptions/generations to the agents so as to maximize the sum of the utilities accrued to the agents, subject to the constraint that energy generation equals consumption at each time. Read More

We consider multi-hop wireless networks serving multiple flows in which only packets that meet hard end-to-end deadline constraints are useful, i.e., if a packet is not delivered to its destination node by its deadline, it is dropped from the network. Read More

We address the problem of video streaming packets from an Access Point (AP) to multiple clients over a shared wireless channel with fading. In such systems, each client maintains a buffer of packets from which to play the video, and an outage occurs in the streaming whenever the buffer is empty. Clients can switch to a lower-quality of video packet, or request packet transmission at a higher energy level in order to minimize the number of outages plus the number of outage periods and the number of low quality video packets streamed, while there is an average power constraint on the AP. Read More

In this paper, we address a key issue of designing architectures and algorithms which generate optimal demand response in a decentralized manner for a smart-grid consisting of several stochastic renewables and dynamic loads. By optimal demand response, we refer to the demand response which maximizes the utility of the agents connected to the smart-grid. By decentralized we refer to the desirable case where neither the independent system operator (ISO) needs to know the dynamics/utilities of the agents, nor do the agents need to have a knowledge of the dynamics/utilities of other agents connected to the grid. Read More

In cyber-physical systems such as automobiles, measurement data from sensor nodes should be delivered to other consumer nodes such as actuators in a regular fashion. But, in practical systems over unreliable media such as wireless, it is a significant challenge to guarantee small enough inter-delivery times for different clients with heterogeneous channel conditions and inter-delivery requirements. In this paper, we design scheduling policies aiming at satisfying the inter-delivery requirements of such clients. Read More

In cyber-physical systems such as in-vehicle wireless sensor networks, a large number of sensor nodes continually generate measurements that should be received by other nodes such as actuators in a regular fashion. Meanwhile, energy-efficiency is also important in wireless sensor networks. Motivated by these, we develop scheduling policies which are energy efficient and simultaneously maintain "regular" deliveries of packets. Read More

The model is a "generalized switch", serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, which determines the probability distribution of the amount of service that will be provided. We are primarily motivated by the following question: in the heavy traffic regime, when the switch load approaches critical level, will the service processes provided to each flow remain "smooth" (i. Read More

A problem of much current practical interest is the replacement of the wiring infrastructure connecting approximately 200 sensor and actuator nodes in automobiles by an access point. This is motivated by the considerable savings in automobile weight, simplification of manufacturability, and future upgradability. A key issue is how to schedule the nodes on the shared access point so as to provide regular packet delivery. Read More

The chemical pressure effect on the structural, transport, magnetic and electronic properties (by measuring X-ray photoemission spectroscopy) of ZnV2O4 has been investigated by doping Mn and Co on the Zinc site of ZnV2O4. With Mn doping the V-V distance increases and with Co doping it decreases. The resistivity and thermoelectric power data indicate that as the V-V distance decreases the system moves towards Quantum Phase Transition. Read More

In our proposed work we mainly focus on data security of tenants so that only the authorized user can access the data. To provide this feature we use encryption and decryption process of data so that the only legal tenant can access their particular data. Hence, for security related to data of tenants we implement AES (advanced encryption standard) using cloud SQL. Read More

Hou et al have introduced a framework to serve clients over wireless channels when there are hard deadline constraints along with a minimum delivery ratio for each client's flow. Policies based on "debt," called maximum debt first policies (MDF) were introduced, and shown to be throughput optimal. By "throughput optimality" it is meant that if there exists a policy that fulfils a set of clients with a given vector of delivery ratios and a vector of channel reliabilities, then the MDF policy will also fulfill them. Read More

This paper studies the problem of serving multiple live video streams to several different clients from a single access point over unreliable wireless links, which is expected to be major a consumer of future wireless capacity. This problem involves two characteristics. On the streaming side, different video streams may generate variable-bit-rate traffic with different traffic patterns. Read More

Stochastic Processing Networks (SPNs) can be used to model communication networks, manufacturing systems, service systems, etc. We consider a real-time SPN where tasks generate jobs with strict deadlines according to their traffic patterns. Each job requires the concurrent usage of some resources to be processed. Read More

We demonstrate here a method to fabricate CdSe photonic crystal from a very cheap fabrication route of templated self-assembly. The hexagonal close-packed photonic crystals are formed by the electrochemical growth of CdSe through the interstitial spaces between polymer nano/micro sphere templates. The confocal voids containing photonic crystals can be made either interconnected or well separated, with high uniformity. Read More