arXiv subjects

Rahul Singh

Publications and source records attributed to Rahul Singh.

At least 163 records · Page 9Linked to original sources

arXiv2018

Conormal Varieties on the Cominuscule Grassmannian - II

Let $X_w$ be a Schubert subvariety of a cominuscule Grassmannian $X$, and let $μ:T^*X\rightarrow\mathcal N$ be the Springer map from the cotangent bundle of $X$ to the nilpotent cone $\mathcal N$. In this paper, we construct a resolution of singularities for the conormal variety $T^*_XX_w$ of $X_w$ in $X$. Further, for $X$ the usual or symplectic Grassmannian, we compute a system of equations defining $T^*_XX_w$ as a subvariety of the cotangent bundle $T^*X$ set-theoretically. This also yields a system of defining equations for the corresponding orbital varieties $μ(T^*_XX_w)$. Inspired by the system of defining equations, we conjecture a type-independent equality, namely $T^*_XX_w=π^{-1}(X_w)\capμ^{-1}(μ(T^*_XX_w))$. The set-theoretic version of this conjecture follows from this work and previous work for any cominuscule Grassmannian of type A, B, or C.

math.AG↗

arXiv2018

Anomalous and Topological Hall effect in Cu doped Sb2Te3 Topological Insulator

The magneto-transport and magnetization measurements of Sb1.90Cu0.10Te3 were performed at different temperatures and different fields. Magneto-transport measurement at high field indicates the coexistence of both bulk and surface states. The magnetization shows the induced antiferromagnetic ordering with Cu doping and the observed quantum oscillation in it indicates that magnetization in Sb1.90Cu0.10Te3 is the bulk property. The non linearity in Hall data suggests the existence of anomalous and topological Hall effect. The anomalous and topological Hall effect (THE) from measured hall data of Cu doped Sb2Te3 topological insulator have been evaluated.

cond-mat.mes-hall↗

arXiv2018

Enhanced stability of 2D organic-inorganic halide perovskites by doping and heterostructure engineering

Organic-inorganic halide perovskite solar cells have recently attracted much attention due to their low-cost fabrication, flexibility, and high-power conversion efficiency. The reduction from three- to two-dimension (2D) promises an exciting opportunity to tune the electronic properties of organic-inorganic halide perovskites. Here, we propose first-principles density-functional theory based route to study the effect of reduced dimensionality, impurity doping, and heterostructure engineering on energy stability, band-gap and transport properties of 2D hybrid organic-inorganic halide perovskites. We show that the energetic stability of two-dimensional organic-inorganic halide perovskites can be significantly enhanced by chemically depositing MoS2 monolayer as a precursor in the system by heterostructure engineering. While on one hand, the structures have similar and excellent transport properties as their bulk counterparts, on the other, they possess the advantage of a broad range of tunable band gaps. Our predictions will expedite future efforts (both theoretical and experimental) in the synthesis, measurements and applications of high performance perovskites.

cond-mat.mtrl-sci↗

arXiv2018

Conormal Varieties on the Cominuscule Grassmannian

Let $G$ be a simply connected, almost simple group over an algebraically closed field $\mathbf k$, and $P$ a maximal parabolic subgroup corresponding to omitting a cominuscule root. We construct a compactification $ϕ:T^*G/P\rightarrow X(u)$, where $X(u)$ is a Schubert variety corresponding to the loop group $LG$. Let $N^*X(w)\subset T^*G/P$ be the conormal variety of some Schubert variety $X(w)$ in $G/P$; hence we obtain that the closure of $ϕ(N^*X(w))$ in $X(u)$ is a $B$-stable compactification of $N^*X(w)$. We further show that this compactification is a Schubert subvariety of $X(u)$ if and only if $X(w_0w)\subset G/P$ is smooth, where $w_0$ is the longest element in the Weyl group of $G$. This result is applied to compute the conormal fibre at the zero matrix in any determinantal variety.

math.AG↗

arXiv2018

Finite Groups Generated in Low Real Codimension

We study the intersection lattice of the arrangement $\mathcal{A}^G$ of subspaces fixed by subgroups of a finite linear group $G$. When $G$ is a reflection group, this arrangement is precisely the hyperplane reflection arrangement of $G$. We generalize the notion of finite reflection groups. We say that a group $G$ is generated (resp. strictly generated) in codimension $k$ if it is generated by its elements that fix point-wise a subspace of codimension at most $k$ (resp. precisely $k$). If $G$ is generated in codimension two, we show that the intersection lattice of $\mathcal{A}^G$ is atomic. We prove that the alternating subgroup $\mathsf{Alt}(W)$ of a reflection group $W$ is strictly generated in codimension two, moreover, the subspace arrangement of $\mathsf{Alt}(W)$ is the truncation at rank two of the reflection arrangement $\mathcal{A}^W$. Further, we compute the intersection lattice of all finite subgroups of $GL_3(\mathbb{R})$, and moreover, we emphasize the groups that are "minimally generated in real codimension two", i.e, groups that are strictly generated in codimension two but have no real reflection representations. We also provide several examples of groups generated in higher codimension.

math.CO↗

arXiv2018

Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks

We consider a wireless broadcast network with a base station sending time-sensitive information to a number of clients through unreliable channels. The Age of Information (AoI), namely the amount of time that elapsed since the most recently delivered packet was generated, captures the freshness of the information. We formulate a discrete-time decision problem to find a transmission scheduling policy that minimizes the expected weighted sum AoI of the clients in the network. We first show that in symmetric networks a Greedy policy, which transmits the packet with highest current age, is optimal. For general networks, we develop three low-complexity scheduling policies: a randomized policy, a Max-Weight policy and a Whittle's Index policy, and derive performance guarantees as a function of the network configuration. To the best of our knowledge, this is the first work to derive performance guarantees for scheduling policies that attempt to minimize AoI in wireless networks with unreliable channels. Numerical results show that both Max-Weight and Whittle's Index policies outperform the other scheduling policies in every configuration simulated, and achieve near optimal performance.

cs.NI↗

arXiv2017

Cotangent Bundles of Partial Flag Varieties and Conormal Varieties of their Schubert Divisors

Let $P$ be a parabolic subgroup in $G=SL_n(\mathbf k)$, for $\mathbf k$ an algebraically closed field. We show that there is a $G$-stable closed subvariety of an affine Schubert variety in an affine partial flag variety which is a natural compactification of the cotangent bundle $T^*G/P$. Restricting this identification to the conormal variety $N^*X(w)$ of a Schubert divisor $X(w)$ in $G/P$, we show that there is a compactification of $N^*X(w)$ as an affine Schubert variety. It follows that $N^*X(w)$ is normal, Cohen-Macaulay, and Frobenius split.

math.AG↗

arXiv2017

Coexistence of surface and bulk state and negative magnetoresistance in Sulfur doped Bi2Se3

The magneto-transport properties in Sulfur doped Bi2Se3 are investigated. The magnetoresistance (MR) decreases with increase of S content and finally for 7% (i.e. y=0.21) S doping the magnetoresistance becomes negative. This negative MR is unusual as it is observed when magnetic field is applied with the perpendicular direction to the plane of the sample. The magneto-transport behavior shows the shubnikov-de hass (SdH) oscillation indicating the coexistence of both surface and bulk states. The negative MR has been attributed to the bulk conduction.

cond-mat.mtrl-sci↗

arXiv2017

Throughput Optimal Decentralized Scheduling of Multi-Hop Networks with End-to-End Deadline Constraints: II Wireless Networks with Interference

Consider a multihop wireless network serving multiple flows in which wireless link interference constraints are described by a link interference graph. For such a network, we design routing-scheduling policies that maximize the end-to-end timely throughput of the network. Timely throughput of a flow $f$ is defined as the average rate at which packets of flow $f$ reach their destination node $d_f$ within their deadline. Our policy has several surprising characteristics. Firstly, we show that the optimal routing-scheduling decision for an individual packet that is present at a wireless node $i\in V$ is solely a function of its location, and "age". Thus, a wireless node $i$ does not require the knowledge of the "global" network state in order to maximize the timely throughput. We notice that in comparison, under the backpressure routing policy, a node $i$ requires only the knowledge of its neighbours queue lengths in order to guarantee maximal stability, and hence is decentralized. The key difference arises due to the fact that in our set-up the packets loose their utility once their "age" has crossed their deadline, thus making the task of optimizing timely throughput much more challenging than that of ensuring network stability. Of course, due to this key difference, the decision process involved in maximizing the timely throughput is also much more complex than that involved in ensuring network-wide queue stabilization. In view of this, our results are somewhat surprising.

cs.NI↗

arXiv2017

Risk-Sensitive Optimal Control of Queues

We consider the problem of designing risk-sensitive optimal control policies for scheduling packet transmissions in a stochastic wireless network. A single client is connected to an access point (AP) through a wireless channel. Packet transmission incurs a cost $C$, while packet delivery yields a reward of $R$ units. The client maintains a finite buffer of size $B$, and a penalty of $L$ units is imposed upon packet loss which occurs due to finite queueing buffer. We show that the risk-sensitive optimal control policy for such a simple set-up is of threshold type, i.e., it is optimal to carry out packet transmissions only when $Q(t)$, i.e., the queue length at time $t$ exceeds a certain threshold $τ$. It is also shown that the value of threshold $τ$ increases upon increasing the cost per unit packet transmission $C$. Furthermore, it is also shown that a threshold policy with threshold equal to $τ$ is optimal for a set of problems in which cost $C$ lies within an interval $[C_l,C_u]$. Equations that need to be solved in order to obtain $C_l,C_u$ are also provided.

eess.SY↗

arXiv2017

Cotangent Bundle to the Flag Variety - II

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.

math.AG↗

arXiv2017

Kiefer Wolfowitz Algorithm is Asymptotically Optimal for a Class of Non-Stationary Bandit Problems

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$. For this non-stationary bandit problem set-up, we consider two variants of the Kiefer Wolfowitz (KW) algorithm i) KW with fixed step-size $β$, and ii) KW with sliding window of length $L$. We show that if the number of times that the function $f_s$ varies during time $T$ is $o(T)$, and if the learning rates of the proposed algorithms are chosen "optimally", then the regret of the proposed algorithms is $o(T)$, and hence the algorithms are asymptotically efficient.

stat.ML↗

arXiv2016

Dynamic Adaptive Streaming using Index-Based Learning Algorithms

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. The video file meant for each client has been fragmented into several packets, and the server maintains multiple copies (each of different quality) of the same video file. Clients maintain individual packet buffers in order to mitigate the effect of uncertainty on video iterruption. Streaming experience, or the Quality of Experience (QoE) of a client depends on several factors: i) starvation/outage probability, i.e., average time duration for which the client does not play video because the buffer is empty, ii) average video quality, iii) average number of starvation periods, iv) temporal variations in video quality etc. We pose the problem of making dynamic streaming decisions in order to maximize the total QoE as a Constrained Markov Decision Process (CMDP). A consideration of the associated dual MDP suggests us that the problem is vastly simplified if the AP is allowed to charge a price per unit bandwidth usage from the clients. More concretely, a "client-by-client" QoE optimization leads to the networkwide QoE maximization, and thus provides us a decentralized streaming algorithm. This enables the clients to themselves decide the optimal streaming choices in each time-slot, and yields us a much desired client-level adaptation algorithm. The optimal policy has an appealing simple threshold structure.

cs.NI↗

arXiv2016

A Distributed Algorithm for Throughput Optimal Routing in Overlay Networks

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. Moreover, the underlay routes are pre-determined and unknown to the overlay network. The overlay network can increase the achievable throughput of the underlay by using multiple routes, which consist of direct routes and indirect routes through other overlay nodes. We develop a throughput optimal dynamic routing algorithm for such overlay networks called the Optimal Overlay Routing Policy (OORP). OORP is derived using the classical dual subgradient descent method, and it can be implemented in a distributed manner. We show that the underlay queue-lengths can be used as a substitute for the dual variables. We also propose various schemes to gather the information about the underlay that is required by OORP and compare their performance via extensive simulations.

cs.NI↗

arXiv2016

Change-over of carrier type and magneto-transport property in Cu doped Bi2Te3 Topological Insulators

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. Thermoelectric power also increaseswith doping of Cu.Moreover linear magnetoresistance (LMR) has been observed at high magnetic field in pure Bi2Te3 which is associated to the gapless topological surface states protected by time reversal symmetry (TRS), whereas doping of Cu breaks TRS and an opening of band gap occurs which quenches the LMR.

cond-mat.mtrl-sci↗

arXiv2016

Statistical Treatment of Beam Position Monitor Data

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. The analysis has been carried out for three approaches: the established signal integration and root-sum-square ap- proaches, and a least-square fit for the models of direct proportion and straight-line. The latter approach has not been reported in the literature so far. The straight-line fit provides the most robust estimator since it does not require baseline restoration, it is immune to signal offsets, and its standard deviation is smallest. Consequently, of the analysed estimators it promises the highest fidelity of results. The fit approach represents a simple, natural way to analyse beam position monitor data which can be easily implemented in hardware and offers potential for new applications.

physics.ins-det↗

arXiv2016

Decentralized Control via Dynamic Stochastic Prices: The Independent System Operator Problem

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. The Independent System Operator has to maximize their sum, the social welfare, without agents revealing their dynamic models or utilities. It has to announce prices after interacting with agents via bids. If agents observe and know the laws of uncertainties affecting other agents, then there is an iterative price and bid interaction that leads to the maximum social welfare attainable if agents pooled their information. In the important case where agents are LQG systems not even knowing of the existence of other agents, the bid and price iteration is dramatically simple, exchanging time vectors of future prices and consumptions or generations at each time step. State dependent bidding is not needed. This solution of the decentralized stochastic control problem may be of economic importance in power systems, and of broader interest in general equilibrium theory of economics for stochastic dynamic agents.

math.OC↗

arXiv2016

Throughput Optimal Decentralized Scheduling of Multi-Hop Networks with End-to-End Deadline Constraints: Unreliable Links

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. It pursues a novel intrinsically stochastic decomposition of the Lagrangian of the constrained network-wide MDP rather than of the fluid model. All decisions regarding a packet's transmission scheduling, transmit power level, and routing, are completely distributed, based solely on the age of the packet, not requiring any knowledge of network state or queue lengths at any of the nodes. Global coordination is achieved through a tractably computable "price" for transmission energy. This price is different from that used to derive the backpressure policy where price corresponds to queue lengths. A quantifiably near-optimal policy is provided if nodes have peak-power constraints.

cs.NI↗