Minimum d-dimensional arrangement with fixed points

In the Minimum $d$-Dimensional Arrangement Problem (d-dimAP) we are given a graph with edge weights, and the goal is to find a 1-1 map of the vertices into $\mathbb{Z}^d$ (for some fixed dimension $d\geq 1$) minimizing the total weighted stretch of the edges. This problem arises in VLSI placement and chip design. Motivated by these applications, we consider a generalization of d-dimAP, where the positions of some of the vertices (pins) is fixed and specified as part of the input. We are asked to extend this partial map to a map of all the vertices, again minimizing the weighted stretch of edges. This generalization, which we refer to as d-dimAP+, arises naturally in these application domains (since it can capture blocked-off parts of the board, or the requirement of power-carrying pins to be in certain locations, etc.). Perhaps surprisingly, very little is known about this problem from an approximation viewpoint. For dimension $d=2$, we obtain an $O(k^{1/2} \cdot \log n)$-approximation algorithm, based on a strengthening of the spreading-metric LP for 2-dimAP. The integrality gap for this LP is shown to be $\Omega(k^{1/4})$. We also show that it is NP-hard to approximate 2-dimAP+ within a factor better than \Omega(k^{1/4-\eps}). We also consider a (conceptually harder, but practically even more interesting) variant of 2-dimAP+, where the target space is the grid $\mathbb{Z}_{\sqrt{n}} \times \mathbb{Z}_{\sqrt{n}}$, instead of the entire integer lattice $\mathbb{Z}^2$. For this problem, we obtain a $O(k \cdot \log^2{n})$-approximation using the same LP relaxation. We complement this upper bound by showing an integrality gap of $\Omega(k^{1/2})$, and an \Omega(k^{1/2-\eps})-inapproximability result. Our results naturally extend to the case of arbitrary fixed target dimension $d\geq 1$

A Lattice Boltzmann study of the effects of viscoelasticity on droplet formation in microfluidic cross-junctions

Based on mesoscale lattice Boltzmann (LB) numerical simulations, we investigate the effects of viscoelasticity on the break-up of liquid threads in microfluidic cross-junctions, where droplets are formed by focusing a liquid thread of a dispersed (d) phase into another co-flowing continuous (c) immiscible phase. Working at small Capillary numbers, we investigate the effects of non-Newtonian phases in the transition from droplet formation at the cross-junction (DCJ) to droplet formation downstream of the cross-junction (DC) (Liu $\&$ Zhang, ${\it Phys. ~Fluids.}$ ${\bf 23}$, 082101 (2011)). We will analyze cases with ${\it Droplet ~Viscoelasticity}$ (DV), where viscoelastic properties are confined in the dispersed phase, as well as cases with ${\it Matrix ~Viscoelasticity}$ (MV), where viscoelastic properties are confined in the continuous phase. Moderate flow-rate ratios $Q \approx {\cal O}(1)$ of the two phases are considered in the present study. Overall, we find that the effects are more pronounced in the case with MV, where viscoelasticity is found to influence the break-up point of the threads, which moves closer to the cross-junction and stabilizes. This is attributed to an increase of the polymer feedback stress forming in the corner flows, where the side channels of the device meet the main channel. Quantitative predictions on the break-up point of the threads are provided as a function of the Deborah number, i.e. the dimensionless number measuring the importance of viscoelasticity with respect to Capillary forces.Comment: 15 pages, 14 figures. This Work applies the Numerical Methodology described in arXiv:1406.2686 to the Problem of Droplet Generation in Microfluidic Cross Junctions. arXiv admin note: substantial text overlap with arXiv:1508.0014

How the Experts Algorithm Can Help Solve LPs Online

We consider the problem of solving packing/covering LPs online, when the columns of the constraint matrix are presented in random order. This problem has received much attention and the main focus is to figure out how large the right-hand sides of the LPs have to be (compared to the entries on the left-hand side of the constraints) to allow $(1+\epsilon)$-approximations online. It is known that the right-hand sides have to be $\Omega(\epsilon^{-2} \log m)$ times the left-hand sides, where $m$ is the number of constraints. In this paper we give a primal-dual algorithm that achieve this bound for mixed packing/covering LPs. Our algorithms construct dual solutions using a regret-minimizing online learning algorithm in a black-box fashion, and use them to construct primal solutions. The adversarial guarantee that holds for the constructed duals helps us to take care of most of the correlations that arise in the algorithm; the remaining correlations are handled via martingale concentration and maximal inequalities. These ideas lead to conceptually simple and modular algorithms, which we hope will be useful in other contexts.Comment: An extended abstract appears in the 22nd European Symposium on Algorithms (ESA 2014

Some Efficient Solutions to Yao's Millionaire Problem

We present three simple and efficient protocol constructions to solve Yao's Millionaire Problem when the parties involved are non-colluding and semi-honest. The first construction uses a partially homomorphic Encryption Scheme and is a 4-round scheme using 2 encryptions, 2 homomorphic circuit evaluations (subtraction and XOR) and a single decryption. The second construction uses an untrusted third party and achieves a communication overhead linear in input bit-size with the help of an order preserving function.Moreover, the second construction does not require an apriori input bound and can work on inputs of different bit-sizes. The third construction does not use a third party and, even though, it has a quadratic communication overhead, it is a fairly simple construction.Comment: 17 page

Online Steiner Tree with Deletions

In the online Steiner tree problem, the input is a set of vertices that appear one-by-one, and we have to maintain a Steiner tree on the current set of vertices. The cost of the tree is the total length of edges in the tree, and we want this cost to be close to the cost of the optimal Steiner tree at all points in time. If we are allowed to only add edges, a tight bound of $\Theta(\log n)$ on the competitiveness is known. Recently it was shown that if we can add one new edge and make one edge swap upon every vertex arrival, we can maintain a constant-competitive tree online. But what if the set of vertices sees both additions and deletions? Again, we would like to obtain a low-cost Steiner tree with as few edge changes as possible. The original paper of Imase and Waxman had also considered this model, and it gave a greedy algorithm that maintained a constant-competitive tree online, and made at most $O(n^{3/2})$ edge changes for the first $n$ requests. In this paper give the following two results. Our first result is an online algorithm that maintains a Steiner tree only under deletions: we start off with a set of vertices, and at each time one of the vertices is removed from this set: our Steiner tree no longer has to span this vertex. We give an algorithm that changes only a constant number of edges upon each request, and maintains a constant-competitive tree at all times. Our algorithm uses the primal-dual framework and a global charging argument to carefully make these constant number of changes. We then study the natural greedy algorithm proposed by Imase and Waxman that maintains a constant-competitive Steiner tree in the fully-dynamic model (where each request either adds or deletes a vertex). Our second result shows that this algorithm makes only a constant number of changes per request in an amortized sense.Comment: An extended abstract appears in the SODA 2014 conferenc

Melting of a nonequilibrium vortex crystal in a fluid film with polymers : elastic versus fluid turbulence

We perform a direct numerical simulation (DNS) of the forced, incompressible two-dimensional Navier-Stokes equation coupled with the FENE-P equations for the polymer-conformation tensor. The forcing is such that, without polymers and at low Reynolds numbers \mbox{Re}, the film attains a steady state that is a square lattice of vortices and anti-vortices. We find that, as we increase the Weissenberg number \mbox{Wi}, a sequence of nonequilibrium phase transitions transforms this lattice, first to spatially distorted, but temporally steady, crystals and then to a sequence of crystals that oscillate in time, periodically, at low \mbox{Wi}, and quasiperiodically, for slightly larger \mbox{Wi}. Finally, the system becomes disordered and displays spatiotemporal chaos and elastic turbulence. We then obtain the nonequilibrium phase diagram for this system, in the \mbox{Wi} - \Omega plane, where \Omega \propto {\mbox{Re}}, and show that (a) the boundary between the crystalline and turbulent phases has a complicated, fractal-type character and (b) the Okubo-Weiss parameter $\Lambda$ provides us with a natural measure for characterizing the phases and transitions in this diagram.Comment: 16 pages, 17 figure

Sparsest Cut on Bounded Treewidth Graphs: Algorithms and Hardness Results

We give a 2-approximation algorithm for Non-Uniform Sparsest Cut that runs in time $n^{O(k)}$, where $k$ is the treewidth of the graph. This improves on the previous $2^{2^k}$-approximation in time \poly(n) 2^{O(k)} due to Chlamt\'a\v{c} et al. To complement this algorithm, we show the following hardness results: If the Non-Uniform Sparsest Cut problem has a $\rho$-approximation for series-parallel graphs (where $\rho \geq 1$), then the Max Cut problem has an algorithm with approximation factor arbitrarily close to $1/\rho$. Hence, even for such restricted graphs (which have treewidth 2), the Sparsest Cut problem is NP-hard to approximate better than $17/16 - \epsilon$ for $\epsilon > 0$; assuming the Unique Games Conjecture the hardness becomes $1/\alpha_{GW} - \epsilon$. For graphs with large (but constant) treewidth, we show a hardness result of $2 - \epsilon$ assuming the Unique Games Conjecture. Our algorithm rounds a linear program based on (a subset of) the Sherali-Adams lift of the standard Sparsest Cut LP. We show that even for treewidth-2 graphs, the LP has an integrality gap close to 2 even after polynomially many rounds of Sherali-Adams. Hence our approach cannot be improved even on such restricted graphs without using a stronger relaxation