121,031 research outputs found
Revisiting The Original Ghosh Model: Can It Be More Plausible?
No full textWe reconsider in this paper the alleged implausibility of Ghosh’s model and we do so reformulating the model to incorporate an alternative closure rule. Our proposed closure rule is in line with the original allocation rules defined by A. Ghosh. The closure solves, to some extent, the implausibility problem that was pointed out by Oosterhaven for then value–added is correctly computed and responsive to allocation changes resulting from supply shocks. Some numerical examples illustrate the sectoral and aggregate consistency of the allocation equilibrium.Multi-sectoral Input-Output Models, Market Economy, Planned Economy
Understanding Terrorism in the context of Global Security
No full textUnderstanding Terrorism in the context of Global Security
Author / Authors : Shreyasi Ghosh
Page no. 89-106
Discipline : Political Science/Polity/ Democratic studies
Script/language : Roman/English
Category : Research paper
Keywords: Terrorism, Violence, Threat, Global Security, Globalization
Interview with Gourab Ghosh
No full text<< Gaurab Ghosh is a queer rights activist and was an active queer rights advocate during his time as a student at the Jawaharlal Nehru University. This material is exhibited as part of the Memories of Change exhibition
Economic planning & performance in Indian Ocean island states / R. T. Appleyard & R. N. Ghosh, editors
No full text
Letter, [Author unclear] to Paulina T. Merritt
No full textHandwritten letter to Paulina Merritt from an unknown author, October 1, 1876.
New Algorithms and Lower Bounds for Streaming Tournaments
No full textWe study fundamental directed graph (digraph) problems in the streaming model. An initial investigation by Chakrabarti, Ghosh, McGregor, and Vorotnikova [SODA'20] on streaming digraphs showed that while most of these problems are provably hard in general, some of them become tractable when restricted to the well-studied class of tournament graphs where every pair of nodes shares exactly one directed edge. Thus, we focus on tournaments and improve the state of the art for multiple problems in terms of both upper and lower bounds.
Our primary upper bound is a deterministic single-pass semi-streaming algorithm (using Õ(n) space for n-node graphs, where Õ(.) hides polylog(n) factors) for decomposing a tournament into strongly connected components (SCC). It improves upon the previously best-known algorithm by Baweja, Jia, and Woodruff [ITCS'22] in terms of both space and passes: for p ⩾ 1, they used (p+1) passes and Õ(n^{1+1/p}) space. We further extend our algorithm to digraphs that are close to tournaments and establish tight bounds demonstrating that the problem’s complexity grows smoothly with the "distance" from tournaments. Applying our SCC-decomposition framework, we obtain improved - and in some cases, optimal - tournament algorithms for s,t-reachability, strong connectivity, Hamiltonian paths and cycles, and feedback arc set.
On the other hand, we prove lower bounds exhibiting that some well-studied problems - such as (exact) feedback arc set and s,t-distance - remain hard (require Ω(n²) space) on tournaments. Moreover, we generalize the former problem’s lower bound to establish space-approximation tradeoffs: any single-pass (1± ε)-approximation algorithm requires Ω(n/√{ε}) space. Finally, we settle the streaming complexities of two basic digraph problems studied by prior work: acyclicity testing of tournaments and sink finding in DAGs. As a whole, our collection of results contributes significantly to the growing literature on streaming digraphs
Traffic control in a mixed autonomy scenario at urban intersections: an optimal control approach
No full textWe consider an intersection zone where autonomous vehicles (AVs) and human-driven vehicles (HDVs) can be simulteneously present. As a new vehicle arrives, the traffic controller needs to decide and suggest an optimal sequence of the vehicles which will exit the intersection zone. The traffic controller can inform the time at which an AV can cross the intersection; however, the traffic controller can not communicate with the HDVs, rather the HDVs can only be controlled using the traffic lights. We formulate the problem as an integer constrained nonlinear optimization problem. Since the number of possible combinations increases exponentially with the number of vehicles in the traffic system, we relax the original problem and proposes an algorithm which gives the optimal solution of the relaxed problem and yet only scales linearly with the number of vehicles in the system. The numerical validation shows that our algorithm outperforms the First-In-First-Out (FIFO) algorithm
A COMPARISON OF INPUT-OUTPUT MODELS:GHOSH REDUCES TO LEONTIEF (BUT 'CLOSING' GHOSH MAKES IT MORE PLAUSIBLE)
No full textGhosh's model is discussed in this paper under two alternative scenarios. In an open version we compare it with Leontief's model and prove that they reduce to each other under some specific productive conditions. We then move onto reconsidering Ghosh's model alleged implausibility and we do so reformulating the model to incorporate a closure rule. The closure solves, to some extent, the implausibility problem very clearly put out by Oosterhaven for then value-added is correctly computed and responsive to allocation changes resulting from supply shocks.Multi-sectoral Input-Output Models, Market Economy, Planned Economy.
- …
