Distributed Exact Shortest Paths in Sublinear Time

The distributed single-source shortest paths problem is one of the most fundamental and central problems in the message-passing distributed computing. Classical Bellman-Ford algorithm solves it in $O(n)$ time, where $n$ is the number of vertices in the input graph $G$. Peleg and Rubinovich (FOCS'99) showed a lower bound of $\tilde{\Omega}(D + \sqrt{n})$ for this problem, where $D$ is the hop-diameter of $G$. Whether or not this problem can be solved in $o(n)$ time when $D$ is relatively small is a major notorious open question. Despite intensive research \cite{LP13,N14,HKN15,EN16,BKKL16} that yielded near-optimal algorithms for the approximate variant of this problem, no progress was reported for the original problem. In this paper we answer this question in the affirmative. We devise an algorithm that requires $O((n \log n)^{5/6})$ time, for $D = O(\sqrt{n \log n})$, and $O(D^{1/3} \cdot (n \log n)^{2/3})$ time, for larger $D$. This running time is sublinear in $n$ in almost the entire range of parameters, specifically, for $D = o(n/\log^2 n)$. For the all-pairs shortest paths problem, our algorithm requires $O(n^{5/3} \log^{2/3} n)$ time, regardless of the value of $D$. We also devise the first algorithm with non-trivial complexity guarantees for computing exact shortest paths in the multipass semi-streaming model of computation. From the technical viewpoint, our algorithm computes a hopset $G"$ of a skeleton graph $G'$ of $G$ without first computing $G'$ itself. We then conduct a Bellman-Ford exploration in $G' \cup G"$, while computing the required edges of $G'$ on the fly. As a result, our algorithm computes exactly those edges of $G'$ that it really needs, rather than computing approximately the entire $G'$

Manifestation of anisotropy persistence in the hierarchies of MHD scaling exponents

The first example of a turbulent system where the failure of the hypothesis of small-scale isotropy restoration is detectable both in the `flattening' of the inertial-range scaling exponent hierarchy, and in the behavior of odd-order dimensionless ratios, e.g., skewness and hyperskewness, is presented. Specifically, within the kinematic approximation in magnetohydrodynamical turbulence, we show that for compressible flows, the isotropic contribution to the scaling of magnetic correlation functions and the first anisotropic ones may become practically indistinguishable. Moreover, skewness factor now diverges as the P\'eclet number goes to infinity, a further indication of small-scale anisotropy.Comment: 4 pages Latex, 1 figur

Afferent signalling from the acid-challenged rat stomach is inhibited and gastric acid elimination is enhanced by lafutidine

<p>Abstract</p> <p>Background</p> <p>Lafutidine is a histamine H₂receptor antagonist, the gastroprotective effect of which is related to its antisecretory activity and its ability to activate a sensory neuron-dependent mechanism of defence. The present study investigated whether intragastric administration of lafutidine (10 and 30 mg/kg) modifies vagal afferent signalling, mucosal injury, intragastric acidity and gastric emptying after gastric acid challenge.</p> <p>Methods</p> <p>Adult rats were treated with vehicle, lafutidine (10 – 30 mg/kg) or cimetidine (10 mg/kg), and 30 min later their stomachs were exposed to exogenous HCl (0.25 M). During the period of 2 h post-HCl, intragastric pH, gastric volume, gastric acidity and extent of macroscopic gastric mucosal injury were determined and the activation of neurons in the brainstem was visualized by c-Fos immunocytochemistry.</p> <p>Results</p> <p>Gastric acid challenge enhanced the expression of c-Fos in the nucleus tractus solitarii but caused only minimal damage to the gastric mucosa. Lafutidine reduced the HCl-evoked expression of c-Fos in the NTS and elevated the intragastric pH following intragastric administration of excess HCl. Further analysis showed that the gastroprotective effect of lafutidine against excess acid was delayed and went in parallel with facilitation of gastric emptying, measured indirectly via gastric volume changes, and a reduction of gastric acidity. The H₂receptor antagonist cimetidine had similar but weaker effects.</p> <p>Conclusion</p> <p>These observations indicate that lafutidine inhibits the vagal afferent signalling of a gastric acid insult, which may reflect an inhibitory action on acid-induced gastric pain. The ability of lafutidine to decrease intragastric acidity following exposure to excess HCl cannot be explained by its antisecretory activity but appears to reflect dilution and/or emptying of the acid load into the duodenum. This profile of actions emphasizes the notion that H₂receptor antagonists can protect the gastric mucosa from acid injury independently of their ability to suppress gastric acid secretion.</p

Dynamics of a trapped Brownian particle in shear flows

The Brownian motion of a particle in a harmonic potential, which is simultaneously exposed either to a linear shear flow or to a plane Poiseuille flow is investigated. In the shear plane of both flows the probability distribution of the particle becomes anisotropic and the dynamics is changed in a characteristic manner compared to a trapped particle in a quiescent fluid. The particle distribution takes either an elliptical or a parachute shape or a superposition of both depending on the mean particle position in the shear plane. Simultaneously, shear-induced cross-correlations between particle fluctuations along orthogonal directions in the shear plane are found. They are asymmetric in time. In Poiseuille flow thermal particle fluctuations perpendicular to the flow direction in the shear plane induce a shift of the particle's mean position away from the potential minimum. Two complementary methods are suggested to measure shear-induced cross-correlations between particle fluctuations along orthogonal directions.Comment: 14 pages, 7 figure

On the Necessary Memory to Compute the Plurality in Multi-Agent Systems

We consider the Relative-Majority Problem (also known as Plurality), in which, given a multi-agent system where each agent is initially provided an input value out of a set of $k$ possible ones, each agent is required to eventually compute the input value with the highest frequency in the initial configuration. We consider the problem in the general Population Protocols model in which, given an underlying undirected connected graph whose nodes represent the agents, edges are selected by a globally fair scheduler. The state complexity that is required for solving the Plurality Problem (i.e., the minimum number of memory states that each agent needs to have in order to solve the problem), has been a long-standing open problem. The best protocol so far for the general multi-valued case requires polynomial memory: Salehkaleybar et al. (2015) devised a protocol that solves the problem by employing $O(k 2^k)$ states per agent, and they conjectured their upper bound to be optimal. On the other hand, under the strong assumption that agents initially agree on a total ordering of the initial input values, Gasieniec et al. (2017), provided an elegant logarithmic-memory plurality protocol. In this work, we refute Salehkaleybar et al.'s conjecture, by providing a plurality protocol which employs $O(k^{11})$ states per agent. Central to our result is an ordering protocol which allows to leverage on the plurality protocol by Gasieniec et al., of independent interest. We also provide a $\Omega(k^2)$-state lower bound on the necessary memory to solve the problem, proving that the Plurality Problem cannot be solved within the mere memory necessary to encode the output.Comment: 14 pages, accepted at CIAC 201

Dynamics of Line-Driven Winds from Disks in Cataclysmic Variables. I. Solution Topology and Wind Geometry

We analyze the dynamics of 2-D stationary, line-driven winds from accretion disks in cataclysmic variable stars. The driving force is that of line radiation pressure, in the formalism developed by Castor, Abbott & Klein for O stars. Our main assumption is that wind helical streamlines lie on straight cones. We find that the Euler equation for the disk wind has two eigenvalues, the mass loss rate and the flow tilt angle with the disk. Both are calculated self-consistently. The wind is characterized by two distinct regions, an outer wind launched beyond four white dwarf radii from the rotation axis, and an inner wind launched within this radius. The inner wind is very steep, up to 80 degrees with the disk plane, while the outer wind has a typical tilt of 60 degrees. In both cases the ray dispersion is small. We, therefore, confirm the bi-conical geometry of disk winds as suggested by observations and kinematical modeling. The wind collimation angle appears to be robust and depends only on the disk temperature stratification. The flow critical points lie high above the disk for the inner wind, but close to the disk photosphere for the outer wind. Comparison with existing kinematical and dynamical models is provided. Mass loss rates from the disk as well as wind velocity laws are discussed in a subsequent paper.Comment: 21 pages, 10 Postscript figures; available also from http://www.pa.uky.edu/~shlosman/publ.html. Astrophysical Journal, submitte