This study mainly focuses on enhancing the overall efficiency of gas transmission networks. The authors developed a model with detailed characteristics of compressor and pressure reduction stations. Following this, they suggested three different systems with gas turbine including: organic rankine cycle (ORC), air bottoming cycle (ABC), and ABC along with steam injection (SI-ABC). In addition, u...

Bourgain and Yehudayoff recently constructed O(1)-monotone bipartite expanders. By combining this result with a generalisation of the unraveling method of Kannan, we construct 3-monotone bipartite expanders, which is best possible. We then show that the same graphs admit 3-page book embeddings, 2-queue layouts, 4-track layouts, and have simple thickness 2. All these results are best possible.

We introduce two new algorithms, Serial-`0 and Parallel-`0 for solving a large underdetermined linear system of equations y = Ax ∈ R when it is known that x ∈ R has at most k < m nonzero entries and that A is the adjacency matrix of an unbalanced left d-regular expander graph. The matrices in this class are sparse and allow a highly efficient implementation. A number of algorithms have been des...

We started out with a goal to reduce the probability of error in randomized computation. We saw that using independent runs of the randomized algorithm and then taking majority helps us amplify the success probability. However, this method uses a lot more randomness, often a costly resource, and we would like to amplify the success probability using almost the same amount of randomness as the o...

We consider the problem of testing small set expansion for general graphs. A graph G is a (k, φ)expander if every subset of volume at most k has conductance at least φ. Small set expansion has recently received significant attention due to its close connection to the unique games conjecture, the local graph partitioning algorithms and locally testable codes. We give testers with two-sided error...