A study of waves in the earth's bow shock

The perturbation vectors of waves up and downstream from the region of maximum compression in the bow shock were examined on OGO-5 under particularly steady solar wind conditions. The polarization of the upstream waves was RH, circular and of the downstream waves LH, elliptical in the spacecraft frame. By observing that the polarization of the waves remained unchanged as the shock motion swept the wave structure back and forth across the satellite three times in eight minutes, it was found that the waves were not stationary in the shock frame. A study of the methods of determining the shock normal indicates that the normal estimated from a shock model should be superior to one based upon magnetic coplanarity. The propagation vectors of the waves examined did not coincide with the shock model normal, the average magnetic field, or the plasma flow velocity. However, the major axis of the polarization ellipse of the downstream wave was nearly parallel to the upstream propagation vector

Particles held by springs in a linear shear flow exhibit oscillatory motion

The dynamics of small spheres, which are held by linear springs in a low Reynolds number shear flow at neighboring locations is investigated. The flow elongates the beads and the interplay of the shear gradient with the nonlinear behavior of the hydrodynamic interaction among the spheres causes in a large range of parameters a bifurcation to a surprising oscillatory bead motion. The parameter ranges, wherein this bifurcation is either super- or subcritical, are determined.Comment: 4 pages, 5 figure

Algebraic Methods in the Congested Clique

In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an $O(n^{1-2/\omega})$ round matrix multiplication algorithm, where $\omega < 2.3728639$ is the exponent of matrix multiplication. In conjunction with known techniques from centralised algorithmics, this gives significant improvements over previous best upper bounds in the congested clique model. The highlight results include: -- triangle and 4-cycle counting in $O(n^{0.158})$ rounds, improving upon the $O(n^{1/3})$ triangle detection algorithm of Dolev et al. [DISC 2012], -- a $(1 + o(1))$-approximation of all-pairs shortest paths in $O(n^{0.158})$ rounds, improving upon the $\tilde{O} (n^{1/2})$-round $(2 + o(1))$-approximation algorithm of Nanongkai [STOC 2014], and -- computing the girth in $O(n^{0.158})$ rounds, which is the first non-trivial solution in this model. In addition, we present a novel constant-round combinatorial algorithm for detecting 4-cycles.Comment: This is work is a merger of arxiv:1412.2109 and arxiv:1412.266

The Magic Number Problem for Subregular Language Families

We investigate the magic number problem, that is, the question whether there exists a minimal n-state nondeterministic finite automaton (NFA) whose equivalent minimal deterministic finite automaton (DFA) has alpha states, for all n and alpha satisfying n less or equal to alpha less or equal to exp(2,n). A number alpha not satisfying this condition is called a magic number (for n). It was shown in [11] that no magic numbers exist for general regular languages, while in [5] trivial and non-trivial magic numbers for unary regular languages were identified. We obtain similar results for automata accepting subregular languages like, for example, combinational languages, star-free, prefix-, suffix-, and infix-closed languages, and prefix-, suffix-, and infix-free languages, showing that there are only trivial magic numbers, when they exist. For finite languages we obtain some partial results showing that certain numbers are non-magic.Comment: In Proceedings DCFS 2010, arXiv:1008.127

Learning cover context-free grammars from structural data

We consider the problem of learning an unknown context-free grammar when the only knowledge available and of interest to the learner is about its structural descriptions with depth at most $\ell.$ The goal is to learn a cover context-free grammar (CCFG) with respect to $\ell$, that is, a CFG whose structural descriptions with depth at most $\ell$ agree with those of the unknown CFG. We propose an algorithm, called $LA^\ell$, that efficiently learns a CCFG using two types of queries: structural equivalence and structural membership. We show that $LA^\ell$ runs in time polynomial in the number of states of a minimal deterministic finite cover tree automaton (DCTA) with respect to $\ell$. This number is often much smaller than the number of states of a minimum deterministic finite tree automaton for the structural descriptions of the unknown grammar

On the magnetic structure and wind parameter profiles of Alfven wave driven winds in late-type supergiant stars

Cool stars at giant and supergiant evolutionary phases present low velocity and high density winds, responsible for the observed high mass-loss rates. Although presenting high luminosities, radiation pressure on dust particles is not sufficient to explain the wind acceleration process. Among the possible solutions to this still unsolved problem, Alfven waves are, probably, the most interesting for their high efficiency in transfering energy and momentum to the wind. Typically, models of Alfven wave driven winds result in high velocity winds if they are not highly damped. In this work we determine self-consistently the magnetic field geometry and solve the momentum, energy and mass conservation equations, to demonstrate that even a low damped Alfven wave flux is able to reproduce the low velocity wind. We show that the magnetic fluxtubes expand with a super-radial factor S>30 near the stellar surface, larger than that used in previous semi-empirical models. The rapid expansion results in a strong spatial dilution of the wave flux. We obtained the wind parameter profiles for a typical supergiant star of 16 M_sun. The wind is accelerated in a narrow region, coincident with the region of high divergence of the magnetic field lines, up to 100 km/s. For the temperature, we obtained a slight decrease near the surface for low damped waves, because the wave heating mechanism is less effective than the radiative losses. The peak temperature occurs at 1.5 r_0 reaching 6000 K. Propagating outwards, the wind cools down mainly due to adiabatic expansion.Comment: to appear in the MNRA

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

Decay of scalar turbulence revisited

We demonstrate that at long times the rate of passive scalar decay in a turbulent, or simply chaotic, flow is dominated by regions (in real space or in inverse space) where mixing is less efficient. We examine two situations. The first is of a spatially homogeneous stationary turbulent flow with both viscous and inertial scales present. It is shown that at large times scalar fluctuations decay algebraically in time at all spatial scales (particularly in the viscous range, where the velocity is smooth). The second example explains chaotic stationary flow in a disk/pipe. The boundary region of the flow controls the long-time decay, which is algebraic at some transient times, but becomes exponential, with the decay rate dependent on the scalar diffusion coefficient, at longer times.Comment: 4 pages, no figure